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.
Javelin 2.0 REF provides a set of Java classes that allow programmers to express branch-and-bound computations, such as the traveling salesperson problem.
Javelin 2.0: Java-Based Parallel Computing on the Internet
Internet, Proceedings of European Parallel Computing Conference (Euro-Par 2000
Computer Science