Scientific Computation with JavaSpaces

Authors:
Michael S. Noble;Stoyanka Zlateva
Affiliations:
-;-
Venue:
HPCN Europe 2001 Proceedings of the 9th International Conference on High-Performance Computing and Networking
Year:
2001

Citing 6
Cited 5

How to write parallel programs: a guide to the perplexed

ACM Computing Surveys (CSUR)
Wire-area parallel computing in Java

JAVA '99 Proceedings of the ACM 1999 conference on Java Grande
Efficient support for complex numbers in Java

JAVA '99 Proceedings of the ACM 1999 conference on Java Grande
Distributed data structures in Linda

POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
JavaSpaces Principles, Patterns, and Practice

JavaSpaces Principles, Patterns, and Practice
T Spaces: The Next Wave

HICSS '99 Proceedings of the Thirty-second Annual Hawaii International Conference on System Sciences-Volume 8 - Volume 8

A lightweight Java taskspaces framework for scientific computing on computational grids

Proceedings of the 2003 ACM symposium on Applied computing
A dynamic, decentralised search algorithm for efficient data retrieval in a distributed tuple space

AusPDC '10 Proceedings of the Eighth Australasian Symposium on Parallel and Distributed Computing - Volume 107
RLinda: a petri net based implementation of the linda coordination paradigm for web services interactions

EC-Web'06 Proceedings of the 7th international conference on E-Commerce and Web Technologies
A communication framework for fault-tolerant parallel execution

LCPC'09 Proceedings of the 22nd international conference on Languages and Compilers for Parallel Computing
Multiagent Social Computing

International Journal of Web Portals

Quantified Score

Hi-index	0.00

Visualization

Abstract

JavaSpaces provides a simple yet expressive mechanism for distributed computing with commodity technology. We discuss the suitability of JavaSpaces for implementing different classes of concurrent computations based on low-level metrics (null messaging and array I/O), and present performance results for several parametric algorithms. We found that although inefficient for communication intensive problems, JavaSpaces yields good speedups for parametric experiments, relative to both sequential Java and C. We also outline a dynamic native compilation technique, which for short, compute-intensive codes further boosts performance without compromising Java portability or extensive algorithm recoding. Discussion and empirical results are presented in the context of our public benchmark suite.