Abstract
In this chapter we discuss the problems of scheduling inhomogeneous multiprocessor systems. This case is more realistic than that of homogeneous multiprocessor systems, in which all processors are identical, but there are significantly fewer results about inhomogeneous multiprocessor systems. The multiprocessor system (MS) is represented here by the set {P l, ..., P m }. The processors in it can differ from each other only in speed, or, more generally, they can also differ in function.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aho, A. V., Hopcrofr, J. E. and Üllman, J. D.: The Design and Analysis of Computer Algorithms. Adison Wesley, Reading, Mass., 1974.
Bruno, J., Coffman, E. G., JR. and Sethi, R.: Scheduling independent tasks to reduce mean finishing time. Comm. ACM, 17, 1974, 7. 382–387.
Coddman, E. G., JR. (Editor): Computer and Job/Shop Scheduling Theory. John Wiley Sons, New York, 1976.
Edmonds, J. and Karp, R.: Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM, 19, 1972, 2, 248–264.
Ford, R. L. and Fulkerson, D. R.: Flows in Networks. Princeton Univ. Press, Princeton, N. J., 1962.
Graham, R. L.: Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math., 17, 1969, 2, 416–429.
Gass, S. I.: Linear Programming Methods and Applications. McGraw-Hill, New York—Toronto—London, 1958.
Gonzales, T., Ibarra, O. H. and Sahni, S.: Bounds for LPT schedules uniform processors. SIAM J. on Computers, 6, 1977, 1, 155–166.
Garey, M. R., Jorlxson, D. S. and Sathi, R.: The complexity of flowshop and job shop scheduling. Tech. report, Comp. Sci. Dep., The Pennsylvania State Univ., 1975.
Horowitz, E. and Sahni, S.: Exact and approximate algorithms for scheduling nonidentical processors. J. ACM, 23, 1976, 2, 317–327.
Johnson, S. M.: Optimal two-and three-stage production schedules. Naval Res. and Logistic Quart., 1, 1954, 1.
Karp, R. M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations. R. E. Miller and J. W. Thatcher (Editors). Plenum Press, New York, 1972, pp. 85–104.
Liu, J. W. S. and Liu, C. L.: Bounds on scheduling algorithms for heterogeneous computing systems. Information Processing, Vol. 74. North-Holland Publ. Co., Amsterdam, 1974.
Muntz, R. R. and Coffman, E. G., JR.: Preemptive scheduling for real time tasks on multiprocessor systems. J. ACM, 17, 1970, 2, 324–338.
Onda, J.: Algoritmy rozderovania úloh na nehomogénne multiprocesorové systémy. Dissertation. Faculty of Natural Sciences, Komenskÿ University, Bratislava, 1977. (In Slovak.)
Ullman, J. D.: Polynomial complete scheduling problems. Tech. report No. 9, Comp. Sci. Dep., Univ. of California, Berkeley, 1973.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Mikloško, J., Kotov, V.E. (1984). Algorithms for Scheduling Inhomogeneous Multiprocessor Computers. In: Mikloško, J., Kotov, V.E. (eds) Algorithms, Software and Hardware of Parallel Computers. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-11106-2_9
Download citation
DOI: https://doi.org/10.1007/978-3-662-11106-2_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-11108-6
Online ISBN: 978-3-662-11106-2
eBook Packages: Springer Book Archive