Skip to main content
SpringerLink
Log in

Scheduling independent jobs on hypercubes

  • Contributed Papers
  • Conference paper
  • First Online:
Book cover STACS 88 (STACS 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 294))

Included in the following conference series:

Abstract

We consider the problem of scheduling k independent jobs on an n-dimensional hypercube system to minimize finishing time, where each job J i is associated with a dimension d i and a processing time t i , meaning that J i requires a d i -dimensional subcube for t i units of time. This problem is NP-complete if no preemption is allowed. We propose a simple heuristic called LDLPT (largest dimension largest processing time) for this problem and analyze its worst-case performance: the ratio of the heuristic finishing time to the optimal does not exceed 2 — 1/2n-1.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. I. Chen and T. H. Lai, “Preemptive Scheduling of Independent Jobs on a Hypercube System,” in preparation.

    Google Scholar 

  2. M. S. Chen and K. G. Shin, “Determination of a Minimal Subcube for Interacting Task Modules,” to appear in Hypercube Multiprocessors 1987, M. Heath editor, SIAM, Philadelphia, 1987.

    Google Scholar 

  3. Y. Cho and S. Sahni, “Bounds for List Schedules on Uniform Processors,” SIAM J. Comput., Vol. 9, No. 1, Feb. 1980, pp. 91–103.

    Google Scholar 

  4. M. R. Garey and D. S. Johnson, Computers and Intractability, a Guide to the Theory of NP-completeness. W. H. Freeman, San Francisco, 1979.

    Google Scholar 

  5. T. Gonzalez, O. H. Ibarra and S. Sahni, “Bounds for LPT schedules on Uniform Processors,” SIAM J. Comput., Vol. 6, No. 1, Mar. 1977, pp. 155–166.

    Google Scholar 

  6. R. L. Graham, “Bounds on Multiprocessing Timing Anomalies,” SIAM J. Appl. Math., Vol. 17, No. 2, Mar. 1969, pp. 416–429.

    Google Scholar 

  7. J. P. Hayes, T. N. Mudge, Q. F. Stout, S. Colley and J. Palmer, “Architecture of a Hypercube Supercomputer,” Proc. Int'l Conf. on Parallel Processing, 1986, pp.653–660.

    Google Scholar 

  8. J. C. Peterson, J. O. Tuazon, D. Lieberman and M. Pniel “The Mark III Hypercube-Ensemble Concurrent Computer,” Proc. Int'l Conf. on Parallel Processing, 1985, pp.71–75.

    Google Scholar 

  9. C. L. Seitz, “The Cosmic Cube,” CACM, Vol. 28, No. 1, Jan. 1985, pp.22–23.

    Google Scholar 

  10. J. D. Ullman, “NP-Complete Scheduling Problems,” J. Computer and System Sciences, 1975 pp.384–393.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Information Science, The Ohio State University, 43210, Columbus, Ohio

    Guan-Ing Chen & Ten-Hwang Lai

Authors
  1. Guan-Ing Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ten-Hwang Lai
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Robert Cori Martin Wirsing

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, GI., Lai, TH. (1988). Scheduling independent jobs on hypercubes. In: Cori, R., Wirsing, M. (eds) STACS 88. STACS 1988. Lecture Notes in Computer Science, vol 294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035851

Download citation

  • DOI: https://doi.org/10.1007/BFb0035851

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18834-6

  • Online ISBN: 978-3-540-48190-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation