Skip to main content
SpringerLink
Log in

An Approximation Algorithm for the Precedence Constrained Scheduling Problem with Hierarchical Communications

  • Conference paper
  • First Online:
STACS 2000 (STACS 2000)

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

Included in the following conference series:

Abstract

We study the problem of minimizing the makespan for the precedence multiprocessor constrained scheduling problem with hierarchical communications [1]. We propose an 8/5-approximation algorithm for the UET-UCT (Unit Execution Time Unit Communication Time) hierarchical problem with an unbounded number of biprocessor machines. Moreover, we extend this result in the case where each cluster has m processors (where m is a fixed constant) by presenting an ρ-approximation algorithm where ρ = (2−2/2m+1).

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

Access this chapter

Log in via an institution
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.

References

  1. E. Bampis, R. Giroudeau, and J.-C. König. Using duplication for the precedence constrained multiprocessor scheduling problem with hierarchical communications. In P. Amestoy, P. Berger, M. Daydé, I. Duff, V. Frayssé, L. Giraud, and D. Ruiz, editors, EuroPar’99 Parallel Processing, Lecture Notes in Computer Science, No. 1685, pages 369–372. Springer-Verlag, 1999.

    Google Scholar 

  2. E. Bampis, R. Giroudeau, and J.C. König. On the hardness of approximating the precedence constrained multiprocessor scheduling problem with hierarchical communications. Technical Report 34, Université d’Evry Val d’Essonne, submitted, 1999.

    Google Scholar 

  3. B. Chen, C.N. Potts, and G.J. Woeginger. A review of machine scheduling: complexity, algorithms and approximability. Technical Report Woe-29, TU Graz, 1998.

    Google Scholar 

  4. P. Chrétienne, E.J. Coffman Jr, J.K. Lenstra, and Z. Liu. Scheduling Theory and its Applications. Wiley, 1995.

    Google Scholar 

  5. M.R. Garey and D.S. Johnson. Computers and Intractability, a Guide to the Theory of NP-Completeness. Freeman, 1979.

    Google Scholar 

  6. R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan. Optimization and approximation in deterministics sequencing and scheduling theory: a survey. Ann. Discrete Math., 5:287–326, 1979.

    Article  MATH  MathSciNet  Google Scholar 

  7. J.A. Hoogeveen, J.K. Lenstra, and B. Veltman. Three, four, five, six, or the complexity of scheduling with communication delays. O. R. Lett., 16(3), 1994.

    Google Scholar 

  8. A. Munier and J.C. König. A heuristic for a scheduling problem with communication delays. Operations Research, 45(1):145–148, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  9. C. Picouleau. Etude des problèmes d’optimisation dans les systèmes distribués. PhD thesis, Université de Paris VI, 1992.

    Google Scholar 

  10. B. Veltman. Multiprocessor scheduling with communications delays. PhD thesis, CWI-Amsterdam, Holland, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. La.M.I., C.N.R.S. EP 738, Université d’Evry Val d’Essonne, Boulevard Mitterrand, 91025, Evry Cedex, France

    Evripidis Bampis & Rodolphe Giroudeau

  2. LIRMM, 161 rue Ada, 34392, Montpellier Cedex 5, France

    Jean-Claude König

Authors
  1. Evripidis Bampis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rodolphe Giroudeau
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jean-Claude König
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Computer Science, Dept. of Theoretical Computer Science, Universität Dresden, 01062, Dresden, Germany

    Horst Reichel

  2. Université de Lille, LIFL - UPRESA 8022, CNRS, Bât. M3 - UFR IEEA, 59655, Villeneuve d’ASCQ Cedex, France

    Sophie Tison

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bampis, E., Giroudeau, R., König, JC. (2000). An Approximation Algorithm for the Precedence Constrained Scheduling Problem with Hierarchical Communications. In: Reichel, H., Tison, S. (eds) STACS 2000. STACS 2000. Lecture Notes in Computer Science, vol 1770. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46541-3_37

Download citation

  • DOI: https://doi.org/10.1007/3-540-46541-3_37

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67141-1

  • Online ISBN: 978-3-540-46541-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation