Skip to main content
SpringerLink
Log in

A Scheme for Partitioning Regular Graphs

  • Conference paper
  • First Online:
Parallel Processing and Applied Mathematics (PPAM 2001)

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

Abstract

In this paper we investigate partitioning algorithms for one class of regular graphs. An example of such problem is given for a system of PDE equations, which describe the nonlinear interaction of laser waves in nonlinear media. Parallelization of the algorithm is done using data parallelism paradigm. First we present optimal static mesh decomposition and investigate its effectivity. Then we propose one heuristic for dynamic load balancing. Results of numerical experiments are presented.

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. Biswas, R., Srawn, R.C.: A new procedure for dynamic adaptation of three-dimensional unstructured grids. Applied Numerical Mathematics, 13 (1994) 437–452

    Article  MATH  Google Scholar 

  2. Čiegis, R., Starikovičius, V., Wasniewski, J.: On the efficiency of scheduling algorithms for parallel Gaussian elimination with communication delays. Lecture notes in computer science, volume 1947, PARA2000, The fifth workshop on Applied Parallel Computing, Editors T Surevik, F. Manne, R. Moe, A.H. Gebremedhin, Springer, 75–82 (2000).

    Google Scholar 

  3. Girdauskas, V., Dementjev, A., Kairytė, G., Čiegis, R.: Influence of the beam aberrations and Kerr nonlinearity of medium on the effectiveness and pulse quality of SBS-compressor. Lithuanian Journal of Physics, 37(1997) 319–326

    Google Scholar 

  4. Hu, Y., Blake, R.: An improved diffusion algorithm for dynamic load balancing. Parallel Computing, 25 (1999) 417–444

    Article  MathSciNet  MATH  Google Scholar 

  5. Y. Hu, R. Blake, and D. Emerson. An optimal migration algorithm for dynamic load balancing. Concurrency: Practice and Experience, 10, 467–483, 1999.

    Article  Google Scholar 

  6. C.C. Hui and S.T. Chanson. Hydrodynamic load balancing. IEEE Trans. on Parallel and Distributed Systems, 10(11), 1118–1137, 1999.

    Article  Google Scholar 

  7. K. Schloegel, G. Karypis, and V. Kumar. Multilevel diffusion schemes for repartition-ing of adaptive meshes. Journal of Parallel and Distributed Computing, 47, 109–124, 1997.

    Article  Google Scholar 

  8. C. Walshaw and M. Cross. Mesh partitioning: a multilevel balancing and refinement algorithm. SIAM J. Sci. Comput., 22(1), 63–80, 2000.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Vilnius Gediminas Technical University, Saulėtekio al. 11, 2040, Vilnius, Lithuania

    R. Čiegis & G. Šilko

Authors
  1. R. Čiegis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Šilko
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Mathematics and Computer Science, Technical University of Czestochowa, Dabrowskiego 73, 42-200, Czestochowa, Poland

    Roman Wyrzykowski

  2. Computer Science Department, University of Tennessee, 122 Volunteer Blvd, Knoxville, TN, 37996-3450, USA

    Jack Dongarra

  3. Computer Science Department, Oklahoma State University, 700 N. Greenwood Ave., Tulsa, OK, 74106, USA

    Marcin Paprzycki

  4. DTU, UNI-C, Danish Computing Centre for Research and Education, Bldg. 304, 2800, Lyngby, Denmark

    Jerzy Waśniewski

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Čiegis, R., Šilko, G. (2002). A Scheme for Partitioning Regular Graphs. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2001. Lecture Notes in Computer Science, vol 2328. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48086-2_45

Download citation

  • DOI: https://doi.org/10.1007/3-540-48086-2_45

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43792-5

  • Online ISBN: 978-3-540-48086-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation