An experimental study of algorithms for weighted completion time scheduling

Algorithmica (New York)

Volumn 33, Issue 1, 2002, Pages 34-51

  Baev, I D ^a   Meleis, W M ^b   Eichenberger, A ^b  

^a NORTHEASTERN UNIVERSITY   (United States)

^b North Carolina State University   (United States)

Author keywords

Compilers; Experimental evaluation; Parallel machines; Precedence constraints; Weighted completion time scheduling

Indexed keywords

APPROXIMATION THEORY; LINEAR PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING;

TIME SCHEDULING;

ALGORITHMS;

EID: 0141957114     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-001-0103-x     Document Type: Article

References (28)

1. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan. Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5:287-326, 1979.
2. J. Bruno, E. G. Coffman, Jr., and R. Sethi. Scheduling independent tasks to reduce mean finishing time. Communications of the ACM, 17:382-387, 1974.
3. W. Smith. Various optimizers for single-stage production. Naval Research Logistics Quarterly, 3:59-66, 1956.
4. W. A. Horn. Single-machine job sequencing with treelike precedence ordering and linear delay penalties. SI AM Journal on Applied Mathematics, 23:189-202, 1972.
5. J. B. Sidney. Decomposition algorithms for single-machine sequencing with precedence relations and deferral costs. Operations Research, 23:283-298, 1975.
6. D. L. Adolphson. Single machine job sequencing with precedence constraints. SIAM Journal on Computing, 6:40-54, 1977.
7. E. L. Lawler. Sequencing jobs to minimize total weighted completion time subject to precedence constraints. Annals of Discrete Mathematics, 2:75-90, 1978.
8. H. Belouadah and C. N. Potts. Scheduling identical parallel machines to minimize total weighted completion time. Discrete Applied Mathematics, 48:201-218, 1994.
9. R. Bixby, K. Kennedy, and U. Kremer. Automatic data layout using 0-1 integer programming. In Proceedings of the International Conference on Parallel Architectures and Compilation Techniques, pages 111-122, 1994.
10. A. E. Eichenberger, E. S. Davidson, and S. G. Abraham. Minimizing register requirements of a modulo schedule via optimum stage scheduling. International Journal of Parallel Programming, 2(2): 103-132, 1996.
11. J. Ruttenberg, G. Gao, A. Stoutchinin, and W. Lichtenstein. Software pipelining showdown: optimal vs. heuristic methods in a production compiler. In Proceedings of the SIGPLAN '96 Conference on Programming Language Design and Implementation, pages 1-11, 1996.
12. D.W. Goodwin and K. D. Wilken. Optimal and near-optimal global register allocation using 0-1 integer programming. Software-Practice and Experience, 26(8):929-965, 1996.
13. V. Liberalere, M. Farach-Colton, and U. Kremer. Evaluation of algorithms for local register allocation. In Proceedings of the 8th International Conference on Compiler Construction (CC' 99), pages 137-152, 1999.
14. S. Arya. An optimal instruction-scheduling model for a class of vector processors. IEEE Transactions on Computers, 34(11):981-995, 1985.
15. R. Leupers and P. Marwedel. Time-constrained code compaction for dsp's. IEEE Transactions on VLSI Systems, 5(1):112-122, 1997.
16. U. Kremer. Optimal and near-optimal solutions for hard compilation problems. Parallel Processing Letters, 7(4):371-378, 1997.
17. K. Wilken, J. Liu, and M. Heffeman. Optimal instruction scheduling using integer programming. In Proceedings of the SIGPLAN '00 Conference on Programming Language Design and Implementation, pages 121-133, 2000.
18. T. Kawaguchi and S. Kyan. Worst case bound of an LRF schedule for the mean weighted flow-time problem. SIAM Journal on Computing, 15:1119-1129, 1986.
19. L. A. Hall, D. B. Shmoys, and J. Wein. Scheduling to minimize average completion time: off-line and on-line algorithms. In Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 142-151, 1996.
20. L. A. Hall, A. S. Schulz, D. B. Shmoys, and J. Wein. Scheduling to minimize average completion time: off-line and on-line approximation algorithms. Mathematics of Operations Research, 22:513-549, 1997.
21. C. Chekuri, R. Motwani, B. Natarajan, and C. Stein. Approximation techniques for average completion time scheduling. In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 609-618, 1997.
22. M. W. P. Savelsbergh, R. N. Uma, and J. Wein. An experimental study of LP-based approximation algorithms for scheduling problems. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 453-462, 1998.
23. A. Nijenhuis and H. Wilf. Combinatorial Algorithms. Academic Press, New York, 1975.
24. M. D. Atkinson and J. R. Sack. Generating binary trees at random. Information Processing Letters, 41:21-23, 1992.
25. J. F. Korsh. Counting and randomly generating binary trees. Information Processing Letters, 45:291-294, 1993.
26. W. Hwu, S. Mahlke, W. Chen, P. Chang, N. Warter, R. Bringmann, R. Ouellette, R. Hank, T. Kiyohara, G. Haab, J. Holm, and D. Lavery. The superblock: an effective technique for vliw and superscalar compilation. The Journal of Supercompuling, 7(1-2):229-248, 1993.
27. C. Chekuri, R. Johnson, B. K. Natarajan, B. R. Rau, and M. Schlansker. An analysis of profile-driven instruction level parallel scheduling with application to super blocks. In Proceedings of the 29th Annual International Symposium on Microarchitecture (MICRO-29), pages 58-67, 1996.
28. B. L. Deitrich and W. W. Hwu. Speculative hedge: regulating compile-time speculation against profile variations. In Proceedings of the 29th International Symposium on Microarchitecture, pages 70-79, 1996.