Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Languages, Compilers, and Run-Time Systems for Scalable Computers

LCR 1998: Languages, Compilers, and Run-Time Systems for Scalable Computers pp 181–194Cite as

Supporting Self-Adaptivity for SPMD Message-Passing Applications

  • Conference paper
  • First Online:

  • 235 Accesses

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

Abstract

Real parallel applications find little benefits from code portability that does not guarantee acceptable efficiency. In this paper, we describe the new features of a framework that allows the development of Single Program Multiple Data (SPMD) applications adaptable to different distributed-memory machines, varying from traditional parallel computers to networks of workstations. Special programming primitives providing indirect accesses to the platform and data domain guarantee code portability and open the way to runtime optimizations carried out by a scheduler and a runtime support.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Agrawal, A. Sussman, J. Saltz, “An integrated runtime and compile-time approach for parallelizing structured and block structured applications”, IEEE Trans. on Parallel and Distributed Systems, v. 6, n. 7, pp. 747–754, July 1995.

    Article  Google Scholar 

  2. J.N.C. árabe, A. Beguelin, B. Lowekamp, E. Seligman, M. Starkey, P. Stephan, “Dome: Parallel programming in a distributed computing environment”, Proc. 10th Int. Parallel Processing Symposium (IPPS’96), Honolulu, April 1996.

    Google Scholar 

  3. N. Carriero, D. Kaminsky, “Adaptive parallelism and Piranha”, IEEE Computer, v. 28, n. 1, Jan. 1995.

    Google Scholar 

  4. J. Casas, R. Konuru, S.W. Otto, R. Prouty, J. Walpole, “Adaptive load migration systems for PVM”, Proceedings of Supercomputing’ 94, Washington, DC, pp. 390–399, Nov. 1994.

    Google Scholar 

  5. M. Cermele, M. Colajanni, “Nonuniform and dynamic domain decomposition for hypercomputing”, Parallel Computing, v. 23, n. 6, pp. 697–718, June 1997.

    Article  Google Scholar 

  6. M. Cermele, M. Colajanni, and S. Tucci, “Check-load interval analysis for balancing distributed SPMD applications”, Proc. of Int. Conf. on Parallel and Distributed Techniques and Applications, Las Vegas, v. 1, pp 432–442, June 1997

    Google Scholar 

  7. B. Chapman, M. Haines, P. Mehrotra, H. Zima, J. Van Rosendale, “Opus: A coordination language for multidisciplinary applications”, Tech. Rep. TR-97-30, ICASE, June 1997.

    Google Scholar 

  8. A.L. Cheung, A.P. Reeves, “High performance computing on a cluster of workstations”, Proc. 1st Int. Symp. on High-Performance Distributed Computing, Syracuse, NY, pp. 152–160, Sept. 1992.

    Google Scholar 

  9. M. Colajanni, M. Cermele, “Dame: An environment for preserving efficiency of data parallel computations on distributed systems”, IEEE Concurrency, v. 5, n. 1, pp. 41–55, Jan.–Mar. 1997.

    Article  Google Scholar 

  10. D. Cronk, M. Haines, P. Mehrotra, “Thread migration in the presence of pointers”, Tech. Rep. TR-96-73, ICASE, Dec. 1996.

    Google Scholar 

  11. P. Dinda, D. O’Hallaron, J. Subhlok, J. Webb, B. Yang, “Language and run-time support for network parallel computing”, Proc 8th Int. Work. on Languages and Compilers for Parallel Computing (LCPC’95), Columbus, OH, Aug. 1995.

    Google Scholar 

  12. G. Edjlali, G. Agrawal, A. Sussman, J. Humphries, J. Saltz, “Runtime and compiler support for programming in adaptive parallel environments”, Scientific Programming, v. 6, Jan. 1997.

    Google Scholar 

  13. A.S. Grimshaw, J.B. Weissman, W.T. Strayer, “Portable run-time support for dynamic object-oriented parallel processing”, ACM Trans. on Comp. Systems, v. 14, n. 2, pp. 139–170, May 1996.

    Article  Google Scholar 

  14. C. Koelbel, D. Loveman, R. Schreiber, G. Steele, M. Zosel, The High Performance Fortran Handbook, MIT Press, Cambridge, MA, 1993.

    Google Scholar 

  15. T. Kunz, “The influence of different workload descriptions on a heuristic load balancing scheme”, IEEE Trans. on Software Engineering, vol. 17, no. 7, pp. 725–730, July 1991.

    Article  Google Scholar 

  16. M. Litzkow, M. Livny, M.W. Mutka, “Condor-A Hunter of Idle Workstations”, Proc. of the 8th International Conference of Distributed Computing Systems, pp. 104–111, June 1988.

    Google Scholar 

  17. J.E. Moreira, K. Eswar, R.B. Konuru, V.K. Naik, “Supporting dynamic data and processor repartitioning for irregular applications”, Proc. IRREGULAR’96, Santa Barbara, pp. 237–248, Aug. 1996.

    Google Scholar 

  18. N. Nedeljkovic, M.J. Quinn, “Data-parallel programming on a network of heterogeneous workstations”, Concurrency: Practice and Experience, v. 5, n. 4, pp. 257–268, June 1993.

    Article  Google Scholar 

  19. R. Ponnusamy, J. Saltz, A. Choudhary, Y.-S. Hwang, G. Fox, “Runtime support and compilation methods for user-specified irregular data distributions”, IEEE Trans. on Parallel and Distributed Systems, v. 6, n. 8, pp. 815–829, Aug. 1995.

    Article  Google Scholar 

  20. B.S. Siegell, “Automatic generation of parallel programs with dynamic load balancing for a network of workstations”, Tech. Report CMU-CS-95-168, Carnegie Mellon University, May 1995.

    Google Scholar 

  21. M.H. Willebeek-LeMair, and A.P. Reeves, “Strategies for dynamic load balancing on highly parallel computers”, IEEE Trans. on Parallel and Distributed Systems, vol. 4, no. 9, pp. 979–993, Sept. 1993.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Sistemi e Produzione, Universitá di Roma “Tor Vergata”, Italy, 00133

    M. Cermele, M. Colajanni & S. Tucci

Authors
  1. M. Cermele
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Colajanni
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. Tucci
    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

Cermele, M., Colajanni, M., Tucci, S. (1998). Supporting Self-Adaptivity for SPMD Message-Passing Applications. 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_13

Download citation

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

  • 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