Skip to main content

JavaParty

  • Reference work entry
Encyclopedia of Parallel Computing
  • 100 Accesses

Definition

While Java offers both a means for programming threads on a shared-memory parallel machine and a means for programming remote method invocations in a wide-area distributed memory environment, it lacks support for NUMA-architectures or clusters, that is, architectures where locality matters because of nonuniform access times. Java also lacks support for a more data-parallel programming style.

JavaParty fills this gap by providing language extensions that add both remote objects and collectively replicated objects. The former allow the programmer to express knowledge about the locality of both the application’s objects and threads in an abstract way, that is, without requiring code for low-level object placement, for explicit replication and (cache) coherency, or for low-level details of explicit message passing. The latter provide a means for working elegantly on all objects of an irregular data structure in parallel.

The beauty of JavaParty is twofold. First, the flavor of...

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 1,600.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,799.99
Price excludes VAT (USA)
  • Durable hardcover 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

Bibliography

  1. Bal H, Haines M (1998) Approaches for integrating task and data parallelism. IEEE Concurrency 6(3):74–84 (July-September)

    Article  Google Scholar 

  2. Haumacher B, Philippsen M (2000) Locality optimization in JavaParty by means of static type analysis. Concurrency: Practice Experience 12(8):613–628 (July)

    Article  MATH  Google Scholar 

  3. Haumacher B, Philippsen M, Tichy WF (2010) Irregular data-parallelism in a parallel object-oriented language by means of collective replication. Tech. Rep. CS-2010–04, University of Erlangen-Nuremberg, Dept. of Computer Science (February)

    Google Scholar 

  4. Philippsen M (2000) Cooperating distributed garbage collectors for cluster and beyond. Concurrency: Practice Experience 12(7):595–610 (May)

    Article  MATH  Google Scholar 

  5. Philippsen M (2000) A survey of concurrent object-oriented languages. Concurrency: Practice Experience 12(10):917–980 (August)

    Article  MATH  Google Scholar 

  6. Philippsen M, Haumacher B, Nester C (2000) More efficient serialization and RMI for Java. Concurrency: Practice Experience 12(7):495–518 (May)

    Article  MATH  Google Scholar 

  7. Philippsen M, Zenger M (1997) JavaParty - transparent remote objects in Java. Concurrency: Practice Experience 9(11):1225–1242 (November)

    Article  Google Scholar 

  8. Valiant LG (1990) A bridging model for parallel computation. Commun ACM 33(8):103–111 (August)

    Article  Google Scholar 

  9. Veldema R, Philippsen M (2008) Supporting huge address spaces in a virtual machine for Java on a cluster. In: Proc LCPC’07, the 20th Intl. Workshop on Languages and Compilers for Parallel Computing (Urbana, IL, October 11–13, 2007). Lecture Notes in Computer Science, vol 5234, pp 187–201. Springer, Berlin

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this entry

Cite this entry

Philippsen, M. (2011). JavaParty. In: Padua, D. (eds) Encyclopedia of Parallel Computing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-09766-4_49

Download citation

Publish with us

Policies and ethics