Skip to main content
SpringerLink
Log in
Book cover

European Parallel Virtual Machine / Message Passing Interface Users’ Group Meeting

EuroPVM/MPI 1997: Recent Advances in Parallel Virtual Machine and Message Passing Interface pp 383–389Cite as

Parallel graph-partitioning using the mob heuristic

  • 5 Algorithms
  • Conference paper
  • First Online:

  • 106 Accesses

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

Abstract

In this paper we study graph partitioning which is an important NP-complete problem. We have implemented two mob heuristics and analysed their performance. Our main result is that for randomly generated graphs the mob heuristics with an exponential schedule is more efficient than that with the linear schedule, proposed earlier. With the other parameters of the heuristic being identical the exponential schedule doubles the speedup.

This work was supported by CTU under Grant 3097477/336.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

  2. D. S. Johnson, C. H. Papadimitriou, and H. Yannakakis. How easy is local search? J. Comput. System Sci., 37:79–100, 1988.

    Article  Google Scholar 

  3. B. W. Kernighan and S. Lin. An effecient heuristic procedure for partitioning graphs. AT & T Bell Labs. Tech. J., 49:291–307, 1970.

    Google Scholar 

  4. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi. Optimization by simulated annealing. Science, 220:671–680, 1983.

    Google Scholar 

  5. J. E. Savage and M. G. Wloka. Parallelism in graph-partitioning. Journal of Parallel and Distributed Computing, 13:257–272, 1991.

    Article  Google Scholar 

  6. M. Šoch, J. Trdlička, and P. Tvrdć. PVM, computational geometry, and parallel computing course. In A. Bode, J. Dongarra, T. Ludwig, and V. Sunderam, editors, Parallel Virtual Machine — EuroPVM'96, number 1156 in Lecture Notes of Computer Science, pages 38–44. Springer Verlag, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Czech Technical University, Karlovo nám. 13, 121 35, Prague, Czech Republic

    Michal Šoch, Pavel Tvrdík & Martin Volf

Authors
  1. Michal Šoch
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pavel Tvrdík
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Martin Volf
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Pavel Tvrdík .

Editor information

Marian Bubak Jack Dongarra Jerzy Waśniewski

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Šoch, M., Tvrdík, P., Volf, M. (1997). Parallel graph-partitioning using the mob heuristic. In: Bubak, M., Dongarra, J., Waśniewski, J. (eds) Recent Advances in Parallel Virtual Machine and Message Passing Interface. EuroPVM/MPI 1997. Lecture Notes in Computer Science, vol 1332. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63697-8_108

Download citation

  • DOI: https://doi.org/10.1007/3-540-63697-8_108

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63697-7

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation