Abstract
A process migration mechanism offers a means to exploit the performance reserves present in networks of workstations used as personal computers by allowing the processors to migrate processes from overload ones to underused ones. Several distributed operating systems provide such a facility, the benefits of its use depending on the specification of a proper process migration policy. This work proposes an analytical model, the Markov Team Model, to assist the design of such a policy. Besides deriving this model from results of classical Team Theory and Markov Decision Processes, we study the special case of homogeneous distributed computing systems and present methods for parameter estimation. Numerical examples are used to demonstrate the benefits of using this model.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Anderson TW, Goodman LA (1957) Statistical Inference About Markov Chains. Ann Math Stat 28:90–110
Artsy Y, Finkel R (1989) Designing a Process Migration Facility — The Charlotte Experience. IEEE Computer, September 1989, pp 47–56
Barak A, Shiloh A (1985) A Distributed Load-balancing Policy for a Multicomputer, Software — Practice and Experience 15(9):901–913
Cheriton DR (1988) TheV Distributed System, Communications of the Association for the Computing Machinery 31(3):314–333
Dikshit P, Satih KT, Jalote P (1989) SAHAYOG: A Test Bed for Evaluating Dynamic Load-sharing Policies. Software — Practice and Experience 18(5):411–435
Douglis F, Ousterhout J (1991) Transparent Process Migration: Design Alternatives and the Sprite Implementation. Software — Practice and Experience 21(8):757–785
Eager DL, Lazowska ED, Zahorjan J (1986) Adaptive Load Sharing in Homogeneous Distributed Systems. IEEE Transactions on Software Engineering 12(5):662–675
Finkel RA, Scott ML, Artsy Y, Chang H (1989) Experience with Charlotte: Simplicity and Function in a Distributed Operating System. IEEE Transactions on Software Engineering 15(6):676–685
Heyman DP, Sobel MJ (1984) Stochastic Models in Operations Research, Vol II, Stochastic Optimization. McGraw Hill, New York
Isaacson DL, Madsen RW (1976) Markov Chains —Theory and Applications. Wiley, New York
Lovejoy WS (1986) Policy Bounds for Markov Decision Processes. Operat Res 34(4):630–637
Lovejoy WS (1987) Ordered Solutions for Dynamic Programs. Math Oper Res 12(2):269–276
Marschak J, Radner R (1972) Economic Theory of Teams. Yale University Press, New Haven, Conn
Matulka J (1989) TCP/UDP Performance as Experienced by User-Level Processes, Proceedings of the European UNIX Users' Conference, Vienna, pp 179–188
Sandell NR, Varaiya P, Athans M, Safonov MG (1978) Survey of Decentralized Control Methods for Large Scale Systems. IEEE Transactions on Automation Control 23(2):108–120
Stankovich JA (1984) A Perspective on Distributed Computer Systems. IEEE Transactions on Computers, pp 1102–1115
Tanenbaum AS, van Renesse R (1985) Distributed Operating Systems. Computing Surveys 17(4):419–470
Taudes A (1991) Ressourcenmanagement in verteilten Rechnersystemen. ADV-Verlag, Vienna
Tenney RR, Sandell NR (1981) Structures for Distributed Decisionmaking. IEEE Transactions on Systems, Man and Cybernetics 11(8):517–526
Theimer MM, Lantz KA (1989) Finding Idle Machines in a Workstation-Based Distributed System. IEEE Transactions on Software Engineering 15(11):1444–1458
White CC III, Schlussel K (1981) Suboptimal Design for Large Scale, Multimodule Systems. Operat Res 29(5):865–875
Whitt W (1978) Approximations of Dynamic Programs, I. Math Operat Res 3(3):231–243
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Taudes, A. Markov Teams — An analytical approach to process migration in distributed computing systems. ZOR Zeitschrift für Operations Research Methods and Models of Operations Research 36, 379–403 (1992). https://doi.org/10.1007/BF01416237
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01416237