Skip to main content
SpringerLink
Log in

Solving fundamental problems on sparse-meshes

  • Conference paper
  • First Online:
Algorithm Theory — SWAT'98 (SWAT 1998)

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

Included in the following conference series:

Abstract

A sparse-mesh, which has PUs on the diagonal of a two-dimensional grid only, is a cost effective distributed memory machine. Variants of this machine have been considered before, but none of them is so simple and pure as a sparse-mesh. Various fundamental problems (routing, sorting, list ranking) are analyzed, proving that sparse-meshes have a great potential. The results are extended for higher dimensional sparse-meshes.

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. Baumslag, M., F. Annexstein, ‘A Unified Framework for Off-Line Permutation Routing in Parallel Networks,’ Mathematical Systems Theory, 24(4), pp. 233–251, 1991.

    Article  MathSciNet  Google Scholar 

  2. Chlebus, B.S., A. Czumaj, L. Gasieniec, M. Kowaluk, W. Plandowski, ‘Parallel Alternating-Direction Access Machine,’ Proc. 21st Mathematical Foundations of Computer Science, LNCS. 1113, pp. 267–278, Springer-Verlag, 1996.

    Google Scholar 

  3. Chlebus, B.S., A. Czumaj, J.F. Sibeyn, ‘Routing on the PADAM: Degrees of Optimality,’ Proc. 3rd Euro-Par Conference, LNCS. 1300, pp. 272–279, Springer-Verlag, 1997.

    Google Scholar 

  4. Cole, R., J. Hopcroft, ‘On Edge Coloring Bipartite Graphs,’ SIAM Journal on Computing, 11, p. 540–546, 1982.

    Article  MathSciNet  Google Scholar 

  5. JáJá, J., An Introduction to Parallel Algorithms, Addison-Wesley Publishing Company, Inc., 992.

    Google Scholar 

  6. Juurlink, B., P.S. Rao, J.F. Sibeyn, ‘Worm-Hole Gossiping on Meshes and Tori,’ Proc. 2nd uro-Par Conference, LNCS 1123, pp. 361–69, Springer-Verlag, 1996.

    Google Scholar 

  7. Kaufmann, M., J.F. Sibeyn, ‘Randomized Multipacket Routing and Sorting on Meshes,’ Algorithmica, 17, pp. 224–244, 1997.

    MathSciNet  Google Scholar 

  8. Kaufmann, M., J.F. Sibeyn, T. Suel, ‘Derandomizing Algorithms for Routing and Sorting on eshes,’ Proc. 5th Symposium on Discrete Algorithms, pp. 669–79, ACM-SIAM, 1994.

    Google Scholar 

  9. Kunde, M., ‘Block Gossiping on Grids and Tori: Deterministic Sorting and Routing Match he Bisection Bound,’ Proc. European Symposium on Algorithms, LNCS 726, pp. 272–83, pringer-Verlag, 1993.

    Google Scholar 

  10. LeppÄnen V., M. Penttonen, ‘Work-Optimal Simulation of PRAM Models on Meshes,’ Nordic ournal of Computing, 2, pp. 51–69, 1995.

    Google Scholar 

  11. Lev, G., N. Pippenger, L.G. Valiant, ‘A Fast Parallel Algorithm for Routing in Permutation Networks,’ IEEE Transactions on Computers, 30(2) pp. 93–100, 1981.

    MathSciNet  Google Scholar 

  12. Rajasekaran, S., ‘k-k Routing, k-k Sorting, and Cut-Through Routing on the Mesh,’ Journal of Algorithms, 19(3), pp. 361–382, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  13. Sibeyn, J.F., ‘List Ranking on Interconnection Networks,’ Proc. 2nd Euro-Par Conference, LNCS 1123, pp. 799–808, Springer-Verlag, 1996.

    Google Scholar 

  14. Sibeyn, J.F., ‘Better Trade-offs for Parallel List Ranking,’ Proc. 9th Symposium on Parallel Algorithms and Architectures, pp. 221–230, ACM, 1997.

    Google Scholar 

  15. Sibeyn, J.F., 'sample Sort on Meshes,’ Proc. 3rd Euro-Par Conference, LNCS 1300, pp. 389–398, Springer-Verlag, 1997.

    Google Scholar 

  16. Sibeyn, J.F., ‘From Parallel to External List Ranking,’ Techn. Rep. MPI-I-97-1021, Max-Planck Institut für Informatik, Saarbrücken, Germany, 1997.

    Google Scholar 

  17. Sibeyn, J.F., F. Guillaume, T. Seidel, ‘Practical Parallel List Ranking,’ Proc. 4th Symposium on Solving Irregularly Structured Problems in Parallel, LNCS 1253, pp. 25–36, Springer-Verlag, 1997.

    Google Scholar 

  18. T. Suel, Permutation Routing and Sorting on Meshes with Row and Column Buses, Parallel Processing Letters, 5, pp. 63–80, 1995.

    Article  Google Scholar 

  19. Thompson, CD., ‘Area-Time Complexity for VLSI,’ Proc. 11th Symposium on Theory of Computing, pp. 81–88, ACM, 1979.

    Google Scholar 

  20. Valiant, L.G., G.J. Brebner, ‘Universal Schemes for Parallel Communication,’ Proc. 13th Symposium on Theory of Computing, pp. 263–277, ACM, 1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Max-Planck-Institut für Informatik, Im Stadtwald, Saarbrücken, Germany

    Jop F. Sibeyn

Authors
  1. Jop F. Sibeyn
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Stefan Arnborg Lars Ivansson

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sibeyn, J.F. (1998). Solving fundamental problems on sparse-meshes. In: Arnborg, S., Ivansson, L. (eds) Algorithm Theory — SWAT'98. SWAT 1998. Lecture Notes in Computer Science, vol 1432. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054376

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64682-2

  • Online ISBN: 978-3-540-69106-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation