Skip to main content
SpringerLink
Log in

How Helpers Hasten h-Relations

  • Conference paper
  • First Online:
Algorithms - ESA 2000 (ESA 2000)

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

Included in the following conference series:

Abstract

We study the problem of exchanging a set of messages among a group of processors, using the model of simplex communication. Messages may consist of different numbers of packets. Let h denote the maximum number of packets that a processor must send and receive. If all the packets need to be delivered directly, at least 3/2h communication steps are needed to solve the problem in the worst case. We show that by allowing forwarding, only 6/5h + O(1) time steps are needed to exchange all the messages, and this is optimal. Our work was motivated by the importance of irregular message exchanges in distributed-memory parallel computers, but it can also be viewed as an answer to an open problem on scheduling file transfers posed by Coffmann, Garey, Johnsson, and LaPaugh in 1985.

Partially supported by the IST Programme of the EU under contract number IST-1999-14186 (ALCOM-FT).

Partially supported by Natural Sciences and Engineering Research Council of Canada grant R3050A01.

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. G. E. Blelloch, C. E. Leiserson, B. M. Maggs, C. G. Plaxton, S. J. Smith, and M. Zagha. A comparison of sorting algorithms for the connection machine CM-2. In ACM Symposium on Parallel Architectures and Algorithms, pages 3–16, 1991.

    Google Scholar 

  2. E. G. Coffman, M. R. Garey, D. S. Johnson, and A. S. LaPaugh. Scheduling file transfers. SIAM Journal on Computing, 14(3):744–780, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  3. R. Cole, K. Ost, and S. Schirra. Edge-coloring bipartite multigraphs in O(E log D) time. submitted for publication, 2000.

    Google Scholar 

  4. H. N. Gabow and O. Kariv. Algorithms for edge coloring bipartite graphs and multigraphs. SIAM Journal on Computing, 11(1):117–129, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  5. L. A. Goldberg, M. Jerrum, T. Leighton, and S. Rao. Doubly logarithmic communication algorithms for optical-communication parallel computers. SIAM Journal on Computing, 26(4):1100–1119, August 1997.

    Google Scholar 

  6. M. D. Grammatikakis, D. F. Hsu, M. Kraetzl, and J. Sibeyn. Packet routing in fixed-connection networks: A survey. Journal of Parallel and Distributed Processing, 54:77–132, 1998.

    Article  MATH  Google Scholar 

  7. F. Harary. Graph Theory. Addison Wesley, 1969.

    Google Scholar 

  8. D. S. Hochbaum, T. Nishizeki, and D. B. Shmoys. A better than “best possible” algorithm to edge color multigraphs. Journal of Algorithms, 7:79–104, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  9. Ian Holyer. The NP-completeness of edge-coloring. SIAM Journal on Computing, 10(4):718–720, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  10. A. Kapoor and R. Rizzi. Edge-coloring bipartite graphs. Journal of Algorithms, 34(2):390–396, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  11. D. König. Theorie der endlichen und unendlichen Graphen. Akademische Verlags-gesellschaft, 1936.

    Google Scholar 

  12. M. Kubale. Preemptive versus nonpreemptive scheduling of biprocessor tasks on dedicated processors. European Journal of Operational Research, 94:242–251, 1996.

    Article  MATH  Google Scholar 

  13. V. Kumar, A. Grama, A. Gupta, and G. Karypis. Introduction to Parallel Computing. Design and Analysis of Algorithms. Benjamin/Cummings, 1994.

    Google Scholar 

  14. G. Lev, N. Pippenger, and L. Valiant. A fast parallel algorithm for routing in permutation networks. IEEE Trans. on Comp., C-30,2:93–100, 1981.

    MathSciNet  Google Scholar 

  15. W. Liu, C. Wang, and K. Prasanna. Portable and scalable algorithms for irregular all-to-all communication. In 16th ICDCS, pages 428–435. IEEE, 1996.

    Google Scholar 

  16. S. Nakano, X. Zhou, and T. Nishizeki. Edge-coloring algorithms. In Computer Science Today, number 1000 in LNCS, pages 172–183. Springer, 1996.

    Chapter  Google Scholar 

  17. T. Nishizeki and M. Sato. An algorithm for edge-coloring multigraphs. Trans. Inst. Electronics and Communication Eng., J67-D(4):466–471, 1984. (in Japanese).

    MathSciNet  Google Scholar 

  18. Takao Nishizeki and Kenichi Kashiwagi. On the 1.1 edge-coloring of multigraphs. SIAM Journal on Discrete Mathematics, 3(3):391–410, August 1990.

    Google Scholar 

  19. M. Snir, S. W. Otto, S. Huss-Lederman, D. W. Walker, and J. Dongarra. MPI-the Complete Reference. MIT Press, 1996.

    Google Scholar 

  20. L. G. Valiant and G. J. Brebner. Universal schemes for parallel communication. In Conference Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computation, pages 263–277, Milwaukee, Wisconsin, 11–13 May 1981.

    Google Scholar 

  21. V. G. Vizing. On an estimate of the chromatic class of a p-graph (in russian). Diskret. Analiz, 3:23–30, 1964.

    MathSciNet  Google Scholar 

  22. J. Whitehead. The complexity of file transfer scheduling with forwarding. SIAM Journal on Computing, 19(2):222–245, April 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Max Planck Insitut für Informatik, Saarbrücken, Germany

    Peter Sanders

  2. Department of Computer Science, The University of Western Ontario, London, ON, Canada

    Roberto Solis-Oba

Authors
  1. Peter Sanders
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Roberto Solis-Oba
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Warwick, Coventry, CV4 7AL, UK

    Mike S. Paterson

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sanders, P., Solis-Oba, R. (2000). How Helpers Hasten h-Relations. In: Paterson, M.S. (eds) Algorithms - ESA 2000. ESA 2000. Lecture Notes in Computer Science, vol 1879. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45253-2_36

Download citation

  • DOI: https://doi.org/10.1007/3-540-45253-2_36

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45253-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation