Abstract
In this paper we experimentally evaluate the performances of some natural online algorithms for the bicriteria version of the classical Graham’s scheduling problem. In such a setting, jobs are characterized by a processing time and a memory size. Every job must be scheduled on one of the m processors so as to minimize the time makespan and the maximum memory occupation per processor simultaneously. We consider four fundamental classes of algorithms obtained by combining known single-criterion algorithms according to different strategies. The performances of such algorithms have been evaluated according to real world sequences of jobs and to sequences generated by fundamental probability distributions. As a conclusion of our investigation, three particular algorithms have been identified that seem to perform significantly better than the others. One has been presented in [4] and is the direct bicriteria extension of the basic Graham’s greedy algorithm, while the other ones are given by two different combinations of the Graham’s algorithm and the Albers’ algorithm proposed in [1].
Work supported by the IST Programme of the EU under contract number IST-1999-14186 (ALCOM-FT), by the EU RTN project ARACNE, by the Italian project REAL-WINE, partially funded by the Italilan Ministry of Education, University and Research, and by the Italian CNR project CNR003EF8 (AL-WINE).
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
Susanne Albers. Better bounds for online scheduling. SIAM Journal on Computing, 29(2):459–473, 1999.
Susanne Albers and Bianca Schröder. An experimental study of online scheduling algorithms. In 4th International Workshop on Algorithm Engineering (WAE), volume 1982 of Lecture Notes in Computer Science, pages 11–22. Springer-Verlag, 2000.
Yair Bartal, Amos Fiat, Howard Karloff, and Rakesh Vohra. New algorithms for an ancient scheduling problem. In 24th ACM Symposium on Theory of Computing (STOC), pages 51–58, 1992.
Vittorio Bilò and Michele Flammini. Time versus memory tradeoffs for multiprocessor scheduling. Manuscript.
S. Chakrabarti, C. Phillips, A. S. Schulz, D. B. Shmoys, C. Stein, and J. Wein. Improved approximation algorithms for minsum criteria. In 23rd International Colloquium on Automata, Languages and Programming (ICALP), volume 1099 of Lecture Notes in Computer Science, pages 646–657. Springer-Verlag, 1996.
D. G. Feitelson and editors L. Rudolph. Job scheduling stategies for parallel processing. In 9th IEEE International Parallel Processing Symposium (IPPS), volume 949 of Lecture Notes in Computer Science. Springer-Verlag, 1995.
D. G. Feitelson and editors L. Rudolph. Job scheduling stategies for parallel processing. In 10th IEEE International Parallel Processing Symposium (IPPS), volume 1162 of Lecture Notes in Computer Science. Springer-Verlag, 1996.
Dror Feitelson. Parallel workloads archive, http://www.cs.huji.ac.il/labs/parallel/workload.
M. R. Garey, R. E. Tarjan, and G. T. Wilfong. One-processor scheduling with symmetric earliness and tardiness penalties. Mathematics of Operations Research, 13:330–348, 1988.
R. L. Graham. Bounds for certain multiprocessing anomalies. Bell System Technical Journal, 45:1563–1581, 1966.
Victor Hazlewood. Npaci joblog repository, http://joblog.npaci.edu.
J. A. Hoogeveen. Minimizing maximum promptness and maximum lateness on a single machine. Mathematics of Operations Research, 21:100–114, 1996.
J. A. Hoogeveen. Single machine scheduling to minimize a function of two or three maximum cost criteria. Journal of Algorithms, 21(2):415–433, 1996.
J. A. Hoogeveen and S. L. Van de Velde. Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time. Operations Research Letters, 17:205–208, 1995.
R. Jain. The Art of Computer Systems Performance Analysis. Wiley, 1991.
David R. Karger, Steven J. Phillips, and Eric Torng. A better algorithm for an ancient scheduling problem. In 5th ACM-SIAM Symposium on Discrete Algorithms (SODA), 1994.
Madhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, and Harry B. Hunt III. Bicriteria network design problems. In 22nd International Colloquium on Automata, Languages and Programming (ICALP), volume 944 of Lecture Notes in Computer Science, pages 487–498. Springer-Verlag, 1995.
S. T. McCormick and M. L. Pinedo. Scheduling n indipendent jobs on m uniform machines with both flow time and makespan objectives: A parametric approach. ORSA Journal of Computing, 7:63–77, 1992.
A. Nagar, J. Haddock, and S. Heragu. Multiple and bicriteria scheduling: a literature survey. European Journal of Operations Research, 81:88–104, 1995.
R. T. Nelson, R. K. Sarin, and R. L. Daniels. Scheduling with multiple performance measures: the one-machine case. Management Science, 32:464–479, 1986.
A. Rasala, C. Stein, E. Torng, and P. Uthaisombut. Existence theorems, lower bounds and algorithms for scheduling to meet two objectives. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 723–731. ACM Press, 2002.
R. Ravi and Michel X. Goemans. The constrained minimum spanning tree problem. In 5th Scandinavian Workshop on Algorithm Theory (SWAT), volume 1097 of Lecture Notes in Computer Science, pages 66–75. Springer-Verlag, 1996.
B. D. Shmoys and E. Tardos. An approximation algorithm for the generalized assignment problem. Mathematical Programming A, 62:461–474, 1993.
W. E. Smith. Various optimizers for single-stage production. Naval Research Logistics Quarterly, 3:59–66, 1956.
C. Stein and J. Wein. On the existence of scheduling that are near-optimal for both makespan and total weighted completion time. Operations Research Letters, 21:115–122, 1997.
D. von Seggen. CRC Standard Curves and Surfaces. CRC Press, 1993.
L. N. Van Wassenhove and F. Gelders. Solving a bicriterion scheduling problem. European Journal of Operations Research, 4:42–48, 1980.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bilò, V., Flammini, M., Giovannelli, R. (2003). Experimental Analysis of Online Algorithms for the Bicriteria Scheduling Problem. In: Jansen, K., Margraf, M., Mastrolilli, M., Rolim, J.D.P. (eds) Experimental and Efficient Algorithms. WEA 2003. Lecture Notes in Computer Science, vol 2647. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44867-5_3
Download citation
DOI: https://doi.org/10.1007/3-540-44867-5_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40205-3
Online ISBN: 978-3-540-44867-9
eBook Packages: Springer Book Archive