Skip to main content
SpringerLink
Log in

More on Scheduling Block-Cyclic Array Redistribution

  • Conference paper
  • First Online:
Languages, Compilers, and Run-Time Systems for Scalable Computers (LCR 1998)

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

Abstract

This article is devoted to the run-time redistribution of one-dimensional arrays that are distributed in a block-cyclic fashion over a processor grid. In a previous paper, we have reported how to derive optimal schedules made up of successive communication-steps. In this paper we assume that successive steps may overlap. We show how to obtain an optimal scheduling for the most general case, namely, moving from a CYCLIC(r) distribution on a P-processor grid to a CYCLIC(s) distribution on a Q-processor grid, for arbitrary values of the redistribution parameters P, Q, r, and s. We use graph-theoretic algorithms, and modular algebra techniques to derive these optimal schedulings.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Claude Berge. Graphes et hypergraphes. Dunod, 1970. English translation by Elsevier, Amsterdam (1985).

    MATH  Google Scholar 

  2. Frédéric Desprez, Jack Dongarra, Antoine Petitet, Cyril Randriamaro, and Yves Robert. Scheduling block-cyclic array redistribution. IEEE Trans. Parallel Distributed Systems, 9(2):192–205, 1998.

    Article  Google Scholar 

  3. R.L. Graham, M. Grötschel, and L. Lovász. Handbook of combinatorics. Elsevier, 1995.

    Google Scholar 

  4. David W. Walker and Steve W. Otto. Redistribution of block-cyclic data distributions using MPI. Concurrency: Practice and Experience, 8(9):707–728, 1996.

    Article  Google Scholar 

  5. Lei Wang, James M. Stichnoth, and Siddhartha Chatterjee. Runtime performance of parallel array assignment: an empirical study. In 1996 ACM/IEEE Supercomputing Conference. http://www.supercomp.org/sc96/proceedings, 1996.

Download references

Author information

Authors and Affiliations

  1. LIP, Ecole Normale Supérieure de Lyon, 69364, Lyon Cedex 07, France

    Frédéric Desprez, Stéphane Domas, Cyril Randriamaro & Yves Robert

  2. Department of Computer Science, University of Tennessee, Knoxville, TN, 37996-1301, USA

    Jack Dongarra & Antoine Petitet

  3. Mathematical Sciences Section, Oak Ridge National Laboratory, Oak Ridge, TN, 37831, USA

    Jack Dongarra

Authors
  1. Frédéric Desprez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stéphane Domas
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jack Dongarra
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Antoine Petitet
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Cyril Randriamaro
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Yves Robert
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science and Electrical and Computer Engineering School of Computer Science, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, PA, 15213-3891, USA

    David R. O’Hallaron

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Desprez, F., Domas, S., Dongarra, J., Petitet, A., Randriamaro, C., Robert, Y. (1998). More on Scheduling Block-Cyclic Array Redistribution. In: O’Hallaron, D.R. (eds) Languages, Compilers, and Run-Time Systems for Scalable Computers. LCR 1998. Lecture Notes in Computer Science, vol 1511. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49530-4_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-49530-4_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-49530-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation