Optimal Management Policy for a Distributed Processing System  
Author Mitsuhiro Imaizumi


Co-Author(s) Mitsutaka Kimura


Abstract As the Internet and the cloud computing have developed, huge amounts of data have been generated and have been stored in the server. To execute the processing of huge amounts of data effectively, a distributed processing system has been widely used. This paper formulates stochastic models for a distributed processing system. A data is replicated and is divided into n small data respectively. Replicated n small data are executed with consistency. The mean time until the processing of a data is successful and an optimal policy which minimizes it is discussed. Finally, numerical examples are given.


Keywords Distributed Processing, Markov Renewal Process, Mean Time, Optimal Policy
    Article #:  1932
Proceedings of the 19th ISSAT International Conference on Reliability and Quality in Design
August 5-7, 2013 - Honolulu, Hawaii, U.S.A.