Skip to main content
SpringerLink
Log in

The module allocation problem: An average case analysis

  • Conference paper
  • First Online:
Parallel Algorithms for Irregularly Structured Problems (IRREGULAR 1996)

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

Abstract

In the module allocation problem we are given n tasks to be executed by m processors, subject to both execution and communication costs. The problem is to find an assignment of the tasks to the processors which minimizes the overall cost. We consider various random versions of this problem In particular:

  • When the communication graph GC has an edge probability independent of n we obtain asymptotically optimal (as n→∞) allocation algorithms.

  • When GC is regular with a fixed degree r, we give a simple algorithm with an uniformly bounded approximation ratio.

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. B. Bollobás, Random Graphs, Academic Press, London 1985.

    Google Scholar 

  2. A. Lubotzky, Discrete Groups, Expanding Graphs and Invariant Measures, Birkhäuser, 1994.

    Google Scholar 

  3. Billonnet A., Costa M.C., Sutter A., An Efficient Algorithm for the Task Allocation Problem, Journal of the Association for Computing Machinary, Vol. 39, No. 3, pp. 502–518, 1992.

    Google Scholar 

  4. Bokhari S.H., A Shortest Tree Algorithm for Optimal Assignments Across Space and Time in a Distributed Processor System, IEEE Trans. Softw. Eng., Vol. SE-7, No. 6, 1981.

    Google Scholar 

  5. Fernandez-Baca D., Allocating Modules to Processors in a Distributed System, IEEE Trans. Softw. Eng., Vol. 15, No. 11, 1989.

    Google Scholar 

  6. Magirou V.F., Milis J.Z., An Algorithm for the Multiprocessor Assignment Problem, Operation Research Letters 8, 1989, 351–356.

    Article  Google Scholar 

  7. Dalhaus E., Johnson D. S., Papadimitriou C. H., Seymour P., and Yannakakis M., The Complexity of Multiway Cut, In Proc. 24th ACM STOC 1992, 241–251.

    Google Scholar 

  8. Stone H. S., Multiprocessor Scheduling with the Aid of Network Flow Algorithms, IEEE Trans. Softw. Eng., Vol. SE-3, No. 1, 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. L.R.I, CNRS, UA 410, Centre d'Orsay, Université de Paris Sud, 91405, Orsay, France

    M. Lamari & W. Fernandez De La Vega

Authors
  1. M. Lamari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. W. Fernandez De La Vega
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Alfonso Ferreira José Rolim Yousef Saad Tao Yang

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lamari, M., De La Vega, W.F. (1996). The module allocation problem: An average case analysis. In: Ferreira, A., Rolim, J., Saad, Y., Yang, T. (eds) Parallel Algorithms for Irregularly Structured Problems. IRREGULAR 1996. Lecture Notes in Computer Science, vol 1117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030121

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-68808-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation