Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors

Journal of the ACM (JACM)

Volumn 24, Issue 2, 1977, Pages 280-289

  Ibarra, Oscar H ^a   Kim, Chul E ^b  

^a UNIVERSITY OF MINNESOTA   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000769475     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/322003.322011     Document Type: Article

References (9)

1. 1 BRUNO, J, COFFMAN, E G. JR, AND SETHI, R. Scheduhng independent tasks to reduce mean finishing time. Cumin ACM 17, 7 (July 1974), 382-387]
2. 2 BRUNO, J, COFFMAN, E G. JR, AND SETHI, R Algorithm for mmlmizang mean flow time information Processing 74, North-Holland, Amsterdam, pp 504-510]
3. 3 COFFMAN, E.G. JR, SETHI, R A generalized bound on LPT sequencing Proc Int. Syrup. Comptr{ Performance Modehng, Measurement and Evaluation, March 1976, pp 306-317. (available from ACM
4. 4 CONWAY, R W., MAXWELL, W L, AND MILLER, L W Theory of Scheduhng, Addison-Wesley Pubhshmg Co, Reading, Mass, 1967]
5. 5 GONZALEZ, T, IBARRA, O H, AND SAHNI, S Bounds for LPT schedules on uniform processors. Comptr Scl Tech Pep No 75-1, U of Minnesota, Mmneapohs, Minn, 1974]
6. 6 GRAHAM, R L Bounds on multlprocessmg timing anomalies. SIAM J Apphed Math 17, 2 (March 1969), 416-429]
7. 7 HOROWlTZ, E, and SAHNt, S Exact and approximate algorithms for scheduhng nomdentlcal processors I ACM 23, 2 (Apnl 1976), 317-327]
8. 8 KARP, R M Reducibility among combinatorial problems In Complexity of Computer Computatlons, R E Miller and J W. Thatcher, Eds, Plenum Press, New York, 1972, pp, 85-103]
9. 9 SAHNI. S Computatlonally related problems SIAM J Comptg 3, 4 (Dec 1974), 262-279]