Summary
Stochastic scheduling of parallel systems is a recent research area in computer science as well as in operations research. The problem under consideration in this chapter is the scheduling of parallel computations which are modeled by task graphs in multiprocessor systems. The particularity of this study is that task running times are assumed to be random variables, instead of known constants as in the literature of deterministic scheduling. Our goal here is to illustrate one of the most successful approaches, based on sample path analysis and stochastic comparison techniques, for solving such scheduling problems. Both monoprogrammed and multiprogrammed parallel systems are analyzed. New results are presented for these models.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
F. Baccelli, Z. Liu and D. Towsley, “Extremal Scheduling of Parallel Processing Systems with and without Real-Time Constraints.” Journal of the ACM, 40, pp. 1209–1237, 1993.
J. Bruno, “On Scheduling Tasks with Exponential Service Times and In-Tree Precedence Constraints”, Ada Informatica, 22, pp. 139–148, 1985.
K.M. Chandy and P.F. Reynolds, “Scheduling Partially Ordered Tasks with Probabilistic Execution Times”, Operating System Review, 9, pp. 169–177, 1975.
C.S. Chang and D.D. Yao, “Rearrangement, Majorization and Stochastic Scheduling”, Mathematics of Operations Research, to appear.
E.G. Coffman and Z. Liu, “On the Optimal Stochastic Scheduling of Out-Forests”, Operations Research, 40, pp. S67–S75, 1992.
D. Dolev and M.K. Waramth, “Scheduling Precedence Graphs of Bounded Height”, J. of Algorithms, 5, pp. 48–59, 1984.
D. Dolev and M.K. Warmuth, “Scheduling Flat Graphs”, SIAM J. on Comput., 14, pp. 638–657, 1985.
D. Dolev and M.K. Warmuth, “Profile Scheduling of Opposing Forests and Level Orders”, SIAM J. Alg. Disc. Meth., 6, pp. 665–687, 1985.
L. Finta and Z. Liu, “Makespan Minimization of Task Graphs with Random Task Running Times”, In Interconnection Networks and Mapping and Scheduling Parallel Computations, D.F. Hsu et al. (Eds.), AMS, DIMACS series, to appear, 1995.
E. Frostig, “A Stochastic Scheduling Problem with Intree Precedence Constraints”, Operations Research, 36, pp. 937–943, 1988.
M.R. Garey, D.S. Johnson, R.E. Tarjan and M. Yanakakis, “Scheduling Opposite Forests”, SIAM J. Alg. Disc. Meth., 4, pp. 72–93, 1983.
S. Leutenegger and M. Ver non, “The performance of multiprogrammed multiprocessor scheduling algorithms”, Proc. SIGMETRICS 1990., pp. 226-236, May 1990.
Z. Liu and E. Sanlaville, “Stochastic Scheduling with Variable Profile and Precedence Constraints”, To appear in SIAM J. on Computing.
Z. Liu and E. Sanlaville, “Profile Scheduling by List Algorithms”, In Scheduling Theory and Its Applications, P. Chretienne et al. (Eds.), J. Wiley, 1995.
Z. Liu and D. Towsley, “Stochastic Scheduling in In-Forest Networks”. Advances in Applied Probabilities, 26, pp. 222–241, 1994.
Z. Liu and D. Towsley, “Scheduling a Sequence of Parallel Programs Containing Loops within a Centralized Parallel Processing System”. COINS Technical Report, TR 92-34, 1992.
S. Majumdar, D.L. Eager and R.B. Bunt, “Scheduling in multiprogrammed parallel systems”, Proc. SIGMETRICS 1988, pp. 104-113, May 1988.
A.W. Marshall and I. Olkin, Inequalities: Theory of Majorization and Its Applications, Academic Press, 1979.
R. Nelson, D. Towsley and A.N. Tantawi, “Performance Analysis of Parallel Processing Systems”, IEEE Trans. on Software Engineering, 14(4), pp. 532–540, April 1988.
R. Nelson, “A Performance Evaluation of a General Parallel Processing Model,” Performance Evaluation Review, 18(1), pp. 13–26, 1990.
R. Nelson and D. Towsley, “A Performance Evaluation of Several Priority Policies for Parallel Processing Systems,” J, ACM, 40, pp. 714–740, 1993.
C.H. Papadimitriou and J.N. Tsitsiklis, “On Stochastic Scheduling with In-Tree Precedence Constraints”, SIAM J. Comput., 16, pp. 1–6, 1987.
M. Pinedo and G. Weiss, “Scheduling Jobs with Exponentially Distributed Processing Times and Intree Precedence Constraints on Two Parallel Machines”, Operations Research, 33, pp. 1381–1388, 1985.
V. Strassen, “The Existence of Probability Measures with Given Marginals”, Ann. Math. Sta., 36, pp. 423–439, 1965.
D. Towsley, G. Rommel and J.A. Stankovic, “Analysis of Fork-Join Program Response Times on Multiprocessors,” IEEE Transactions on Parallel and Distributed Systems, 1(3), pp. 286–303, July 1990.
J.D. Ullman, “NP-Complete Scheduling Problems”, J. Comput. System Sci., 10, pp. 384–393, 1975.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 ECSC-EC-EAEC, Brussels-Luxembourg
About this chapter
Cite this chapter
Liu, Z. (1995). Majorization and Stochastic Comparison Techniques for Scheduling of Parallel Systems. In: Baccelli, F., Jean-Marie, A., Mitrani, I. (eds) Quantitative Methods in Parallel Systems. Esprit Basic Research Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-79917-4_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-79917-4_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-79919-8
Online ISBN: 978-3-642-79917-4
eBook Packages: Springer Book Archive