Performance and Reliability of Non-Markovian Heterogeneous Distributed Computing Systems

• Published in: IEEE transactions on parallel and distributed systems Vol. 23; no. 7; pp. 1288 - 1301
• Main Authors: Pezoa, J. E., Hayat, M. M.
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.07.2012; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Analytical models; Computer networks; distributed computing; Distributed processing; distributed queuing theory; Dynamical systems; Dynamics; load balancing; Load modeling; Mathematical analysis; Mathematical models; Measurement; non-Markovian processes; Optimization; Reliability; Renewal theory; Servers; Stochastic processes; Vectors
• ISSN: 1045-9219; 1558-2183
• DOI: 10.1109/TPDS.2011.285

Average service time, quality-of-service (QoS), and service reliability associated with heterogeneous parallel and distributed computing systems (DCSs) are analytically characterized in a realistic setting for which tangible, stochastic communication delays are present with nonexponential distributions. The departure from the traditionally assumed exponential distributions for event times, such as task-execution times, communication arrival times and load-transfer delays, gives rise to a non-Markovian dynamical problem for which a novel age dependent, renewal-based distributed queuing model is developed. Numerical examples offered by the model shed light on the operational and system settings for which the Markovian setting, resulting from employing an exponential-distribution assumption on the event times, yields inaccurate predictions. A key benefit of the model is that it offers a rigorous framework for devising optimal dynamic task reallocation (DTR) policies systematically in heterogeneous DCSs by optimally selecting the fraction of the excess loads that need to be exchanged among the servers, thereby controlling the degree of cooperative processing in a DCSs. Key results on performance prediction and optimization of DCSs are validated using Monte-Carlo (MC) simulation as well as experiments on a distributed computing testbed. The scalability, in the number of servers, of the age-dependent model is studied and a linearly scalable analytical approximation is derived.