Abstract
Consider the execution of a parallel application that dynamically generates parallel jobs with specified resource requirements during its execution. We assume that there is not sufficient nowledge about the running times and the number of jobs generated in order to precompute a schedule for such applications. Rather, the scheduling decisions have to be made on-line during runtime based on incomplete information. We present several on-line scheduling algorithms for various interconnection topologies that use some a priori information about the job running times or guarantee a good competitive ratio that depends on the runtime ratio of all generated jobs. All algorithms presented in this paper have optimal competitive ratio up to small additive constants.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Stefan Bischof and Ernst W. Mayr. On-Line Scheduling of Parallel Jobs with Runtime Restrictions. SFB-Bericht 342/04/98 A, SFB 342, Institut für Informatik, Technische Universität München, April 1998. http://www.mayr.in.tum.de/berichte/1998/TUM-I9810.ps.gz.
J. Błażewicz, K.H. Ecker, E. Pesch, G. Schmidt, and J. Weglarz. Scheduling Com-puter and Manufacturing Processes Springer Verlag, Berlin, 1996.
E.G. Coffman, Jr., M.R. Garey, and D.S. Johnson. Approximation Algorithms for Bin Packing: A Survey. In Dorit S. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems chapter 2, pages 46–93. PWS Publishing Company, Boston, 1996.
Dror G. Feitelson and Larry Rudolph. Parallel Job Scheduling: Issues and Approaches. In Dror G. Feitelson and Larry Rudolph, editors, Job Scheduling Strategies for Parallel Processing (IPPS’ 95 Workshop) LNCS 949, pages 1–18, Berlin, 1995. Springer-Verlag.
Dro G. Feitelson, Larry Rudolph, Uwe Schwiegelshohn, Kenneth C. Sevcik, and Parkson Wong. Theory and Practice in Parallel Job Scheduling. In Dror G. Feitelson and Larry Rudolph, editors, Job Scheduling Strategies for Parallel Processing (IPPS’ 97 Workshop)LNCS 1291, pages 1–34, Berlin, 1997. Springer-Verlag.
Anja Feldmann, Ming-Yang Kao, Jiří Sgall, and Shang-Hua Teng. Optimal Online Scheduling of Parallel Jobs with Dependencies. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing pages 642–651, New York, 1993.
Anja Feldmann, Jiří Sgall, and Shang-Hua Teng. Dynamic scheduling on parallel machines. Theoretical Computer Science, Special Issue on Dynamic and On-line Algorithms 130(1):49–72, 1994.
M.R. Garey, R.L. Graham, D.S. Johnson, and A.C.-C. Yao. Resource Constrained Scheduling as Generalized Bin Packing. J. Comb. Theory Series A 21:257–298, 1976.
Jiří Sgall. On-Line Scheduling on Parallel Machines. PhD thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bischof, S., Mayr, E.W. (1998). On-Line Scheduling of Parallel Jobs with Runtime Restrictions. In: Chwa, KY., Ibarra, O.H. (eds) Algorithms and Computation. ISAAC 1998. Lecture Notes in Computer Science, vol 1533. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49381-6_14
Download citation
DOI: https://doi.org/10.1007/3-540-49381-6_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65385-1
Online ISBN: 978-3-540-49381-5
eBook Packages: Springer Book Archive