Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Online Scheduling of Parallel Jobs on Hypercubes: Maximizing the Throughput

  • Conference paper
Parallel Processing and Applied Mathematics (PPAM 2009)

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

  • 1049 Accesses

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 to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. 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 

  2. 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 

  3. Ye, D., Zhang, G.: Maximizing the throughput of parallel jobs on hypercubes. Inform. Process. Lett. 102, 259–263 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  4. 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

  1. Institute of Mathematics, AS CR, Žitná 25, CZ-11567, Praha 1, Czech Republic

    Ondřej Zajíček & Tomáš Ebenlendr

  2. 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
  1. Ondřej Zajíček
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jiří Sgall
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tomáš Ebenlendr
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computational and Information Sciences,, Czestochowa University of Technology,  

    Roman Wyrzykowski

  2. Department of Electrical Engineering and Computer Science, University of Tennessee, 37996-3450, Knoxville, TN, USA

    Jack Dongarra

  3. Institute of Computer and Information Science, Czestochowa University of Technology, Dabrowskiego 73, PL-42-200, Czestochowa, Poland

    Konrad Karczewski

  4. 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

© 2010 Springer-Verlag Berlin Heidelberg

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

Search

Navigation