Skip to main content
SpringerLink
Log in

A General Data Layout for Distributed Consistency in Data Parallel Applications

  • Conference paper
  • First Online:
High Performance Computing — HiPC 2002 (HiPC 2002)

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

Included in the following conference series:

Abstract

This paper presents a general layout for partitioning and mapping data across processors in data parallel applications. Our scheme generalizes the existing schemes (block, cyclic) and enables nontraditional ones (e.g. graph partitioning [7],[17]). A distributed algorithm uses the data layout and the read/write access patterns to ensure consistency for data parallel applications. We show examples of the applicability of our data layout and consistency schemes for different classes of scientific applications. We present experimental results on the effectiveness of our approach for loosely synchronous, data parallel applications.

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. J.G. amd Stephane Lanteri. On overlaping partitions. In Proceedings of the 2000 International Conference on Parallel Processing, pages 461,468. IEEE, 2000. 23

    Google Scholar 

  2. C. Amza, A. L. Cox, S. Dwarkadas, P. Keleher, H. Lu, R. Rajamony, W. Yu, and W. Zwaenepoel. Treadmarks: Shared Memory Computing on Networks of Workstations. IEEE Computer, 29(2):18–28, 1996. 31

    Google Scholar 

  3. G.R. Andrews. Paradigms for process interaction in distributed programs. ACM Computing Surveys, 23(1):49,90, March 1991. 22

    Google Scholar 

  4. G.R. Andrews and F.B. Schneider. Concepts and notations for concurrent programming. ACM Computing Surveys, 15(1):3,43, March 1983. 22

    Article  MATH  Google Scholar 

  5. H.E. Bal, M. F. Kaashoek, A. S. Tanenbaum, and J. Jansen. Replication Techniques for Speeding up Parallel Applications on Distributed Systems. Concurrency Practice and Experience, 4(5):337,355, August 1992. 31, 32

    Article  Google Scholar 

  6. V. Balasundaram, G. Fox, K. Kennedy, and U. Kremer. A static performance estimator to guide data partitioning decisions. In Proceedings of the third ACM SIGPLAN symposium on Principles & practice of parallel programming, pages 213–223. ACM Press, 1991. 31

    Google Scholar 

  7. J. Chen and V. E. Taylor. Mesh partitioning for efficient use of distributed systems. IEEE Transactions on Parallel and Distributed Systems, 13(1):67–79, January 2002. 22

    Article  Google Scholar 

  8. N. Chrisochoides, I. Kodukula, and K. Pingali. Compiler and run-time support for semi-structured applications. In Proceedings of the 11th international conference on Supercomputing, pages 229–236. ACM Press, 1997. 31

    Google Scholar 

  9. M. Gupta and P. Banerjee. Paradigm: a compiler for automatic data distribution on multicomputers. In Proceedings of the 7th international conference on Supercomputing, pages 87–96. ACM Press, 1993. 31

    Google Scholar 

  10. S.B. Hassen, I. Athanasiu, and H.E. Bal. A fiexible operation execution model for shared distributed objects. In Proceedings of the OOPSLA’96 Conference on Object-oriented Programming Systems, Languages, and Applications, pages 30–50. ACM, October 1996. 31, 32

    Google Scholar 

  11. S. Hiranandani, K. Kennedy, and C.-W. Tseng. Compiling Fortran D for MIMD distributed-memory machines. Communications of the ACM, 35(8):66–80, 1992. 31

    Article  Google Scholar 

  12. D.E. Hudak and S.G. Abraham. Compiler techniques for data partitioning of sequentially iterated parallel loops. In Proceedings of the 4th international conference on Supercomputing, pages 187–200. ACM Press, 1990. 31

    Google Scholar 

  13. L. Iftode and J. P. Singh. Shared virtual memory: Progress and challenges. Proc. of the IEEE, Special Issue on Distributed Shared Memory, 87(3):498–507, 1999. 32

    Google Scholar 

  14. K. Kennedy and U. Kremer. Automatic data layout for high performance fortran. In Proceedings of the 1995 conference on Supercomputing (CD-ROM), page 76. ACM Press, 1995. 31

    Google Scholar 

  15. D. Lenoski, J. Laudon, K. Gharachorloo, W.-D. Weber, A. Gupta, J. Hennessy, M. Horowitz, and M. S. Lam. The stanford dash multiprocessor. Computer, pages 63–79, March 1992. 31

    Google Scholar 

  16. D. J. Scales and M. S. Lam. The design and evaluation of a shared object system for distributed memory machines. In OSDI94, pages 101–114, Monterey, CA, November 1994. USENIX Association. 31

    Google Scholar 

  17. K. Schloegel, G. Karypis, and V. Kumar. Graph partitioning for high performance scientific simulations. In J. Dongarra et al., editors, CRPC Parallel Computing Handbook. Morgan Kaufmann, 2000 (in press), 2000. 22

    Google Scholar 

  18. A. Sussman. Model-driven mapping onto distributed memory parallel computers. In Proceedings of the 1992 conference on Supercomputing’ 92, pages 818–829. IEEE Computer Society Press, 1992. 31

    Google Scholar 

  19. S. Wholey. Automatic data mapping for distributed-memory parallel computers. In Proceedings of the 6th international conference on Supercomputing, pages 25–34. ACM Press, 1992. 31

    Google Scholar 

  20. A. Zaafrani and M.R. Ito. Partitioning the global space for distributed memory systems. In Proceedings of the 1993 conference on Supercomputing, pages 327–336. ACM Press, 1993. 31

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Information Science, Norwegian University of Science and Technology, 7491, Trondheim, Norway

    Roxana Diaconescu

Authors
  1. Roxana Diaconescu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. CISE Department, University of Florida, 32611, FL, Gainesville, USA

    Sartaj Sahni

  2. Department of Electrical Engineering, EEB 200C, University of Southern California, 3740 McClintok Ave., 90089-2562, CA, Los Angeles, USA

    Viktor K. Prasanna

  3. India Software Lab, IBM Global Services India Exports, Golden Enclave, TISL Tower, Airport Road, 560 017, Bangalore, India

    Uday Shukla

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Diaconescu, R. (2002). A General Data Layout for Distributed Consistency in Data Parallel Applications. In: Sahni, S., Prasanna, V.K., Shukla, U. (eds) High Performance Computing — HiPC 2002. HiPC 2002. Lecture Notes in Computer Science, vol 2552. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36265-7_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-36265-7_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00303-8

  • Online ISBN: 978-3-540-36265-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation