๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Javelin++: scalability issues in global computing

โœ Scribed by Neary, Michael O. ;Brydon, Sean P. ;Kmiec, Paul ;Rollins, Sami ;Cappello, Peter


Publisher
John Wiley and Sons
Year
2000
Tongue
English
Weight
235 KB
Volume
12
Category
Article
ISSN
1040-3108

No coin nor oath required. For personal study only.

โœฆ Synopsis


Javelin is a Java-based infrastructure for global computing. This paper presents Javelin++, an extension of Javelin, intended to support a much larger set of computational hosts. Contributions to scalability and fault tolerance are presented. This is the focus of the paper. Two scheduling schemes are presented: probabilistic work stealing and deterministic work stealing. The distributed deterministic work stealing is integrated with a distributed deterministic eager scheduler, which is one of the paper's primary original contributions. An additional fault tolerance mechanism is implemented for replacing hosts that have failed or retreated. A Javelin++ API is sketched, then illustrated on a raytracing application. Performance results for the two schedulers are reported, indicating that Javelin++, with its broker network, scales better than the original Javelin.


๐Ÿ“œ SIMILAR VOLUMES


SuperWeb: research issues in Java-based
โœ Alexandrov, Albert D.; Ibel, Maximilian; Schauser, Klaus E.; Scheiman, Chris J. ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 135 KB ๐Ÿ‘ 2 views

The Internet, in particular the World Wide Web, continues to expand at an amazing pace. We propose a new infrastructure, SuperWeb, to harness global resources, such as CPU cycles or disk storage, and make them available to every user on the Internet. SuperWeb has the potential for solving parallel s

Issues in computational frameworks
โœ Aad J. van der Steen ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 125 KB
Global-basis two-level method for indefi
โœ Yong Qu; Jacob Fish ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 208 KB

Algorithmic aspects and computational e$ciency of the global-basis two-level method are investigated in the context of symmetric inde"nite system of equations. The algorithm includes e$cient construction of the global-basis prolongator using Lanczos vectors, predictor}corrector smoothing procedures,