Online Scheduling of Parallel Jobs on Hypercubes: Maximizing the Throughput

Zajíček, Ondřej; Sgall, Jiří; Ebenlendr, Tomáš

doi:10.1007/978-3-642-14403-5_6

Online Scheduling of Parallel Jobs on Hypercubes: Maximizing the Throughput

Ondřej Zajíček²⁰,
Jiří Sgall²¹ &
Tomáš Ebenlendr²⁰

Conference paper

1004 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6068))

Abstract

We study the online problem of scheduling unit-time parallel jobs on hypercubes. A parallel job has to be scheduled between its release time and deadline on a subcube of processors. The objective is to maximize the number of early jobs. We provide a 1.6-competitive algorithm for the problem and prove that no deterministic algorithm is better than 1.4-competitive.

This is a preview of subscription content, log in via an institution.

Chapter: USD 29.95; Price excludes VAT (USA)

eBook: USD 84.99; Price excludes VAT (USA)

Softcover Book: USD 109.99; Price excludes VAT (USA)

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

References

Baptiste, P., Schieber, B.: A note on scheduling tall/small multiprocessor tasks with unit processing time to minimize maximum tardiness. J. Sched. 6, 395–404 (2003)
Article MATH MathSciNet Google Scholar
Dürr, C., Hurand, M.: Finding total unimodularity in optimization problems solved by linear programs. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 315–326. Springer, Heidelberg (2006)
Chapter Google Scholar
Ye, D., Zhang, G.: Maximizing the throughput of parallel jobs on hypercubes. Inform. Process. Lett. 102, 259–263 (2007)
Article MATH MathSciNet Google Scholar
Zajíček, O.: A note on scheduling parallel unit jobs on hypercubes. Int. J. on Found. Comput. Sci. 20(2), 341–349 (2009)
Article MATH Google Scholar

Download references

Author information

Authors and Affiliations

Institute of Mathematics, AS CR, Žitná 25, CZ-11567, Praha 1, Czech Republic
Ondřej Zajíček & Tomáš Ebenlendr
Dept. of Applied Mathematics, Faculty of Mathematics and Physics, Charles University, Malostranské náměstí 25, CZ-11800, Praha 1, Czech Republic
Jiří Sgall

Authors

Ondřej Zajíček
View author publications
You can also search for this author in PubMed Google Scholar
Jiří Sgall
View author publications
You can also search for this author in PubMed Google Scholar
Tomáš Ebenlendr
View author publications
You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

Institute of Computational and Information Sciences,, Czestochowa University of Technology,
Roman Wyrzykowski
Department of Electrical Engineering and Computer Science, University of Tennessee, 37996-3450, Knoxville, TN, USA
Jack Dongarra
Institute of Computer and Information Science, Czestochowa University of Technology, Dabrowskiego 73, PL-42-200, Czestochowa, Poland
Konrad Karczewski
Department of Informatics and Mathematical Modeling, Technical University of Denmark, Richard Petersens Plads, Building 321, 2800, Kongens Lyngby, Denmark
Jerzy Wasniewski

Rights and permissions

Reprints and permissions

Copyright information

About this paper

Cite this paper

Zajíček, O., Sgall, J., Ebenlendr, T. (2010). Online Scheduling of Parallel Jobs on Hypercubes: Maximizing the Throughput. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Wasniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2009. Lecture Notes in Computer Science, vol 6068. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14403-5_6

Download citation

DOI: https://doi.org/10.1007/978-3-642-14403-5_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14402-8
Online ISBN: 978-3-642-14403-5
eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics