Notify me of new papers
via Email or RSS

ABSTRACT:
This paper presents Javelin 2.0. It presents architectural enhancements that facilitate aggregating larger sets of host processors. It then presents: a branch-and-bound computational model, the supporting architecture, a scalable task scheduler using distributed work stealing, a distributed eager scheduler implementing fault tolerance, and the results of performance experiments. Javelin 2.0 frees application developers from concerns about complex interprocessor communication and fault tolerance among Internetworked hosts. When all or part of their application can be cast as a piecework or a branch-and-bound computation, Javelin 2.0 allows developers to focus on the underlying application.

SUGGESTED CITATION:
M O. Neary, A Phipps, S Richman, and Peter Cappello, "Javelin 2.0: Java-based parallel computing on the Internet" (2000). Euro-Par 2000 Parallel Processing, Proceedings. 1900, pp. 1231-1238. Postprint available free at: http://repositories.cdlib.org/postprints/40

REQUIRED PUBLISHER STATEMENT:
The original publication is available at www.springerlink.com.