Spawn: A Distributed Computational Economy
IEEE Transactions on Software Engineering
Cilk: an efficient multithreaded runtime system
PPOPP '95 Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming
A worldwide flock of Condors: load sharing among workstation clusters
Future Generation Computer Systems - Special issue: resource management in distributed systems
The Legion vision of a worldwide virtual computer
Communications of the ACM
Inside Java 2 platform security architecture, API design, and implementation
Inside Java 2 platform security architecture, API design, and implementation
Javelin: parallel computing on the internet
Future Generation Computer Systems - Special issue on metacomputing
CoG kits: a bridge between commodity distributed computing and high-performance grids
Proceedings of the ACM 2000 conference on Java Grande
JavaSpaces Principles, Patterns, and Practice
JavaSpaces Principles, Patterns, and Practice
Market-based Massively Parallel Internet Computing
MPPM '97 Proceedings of the Conference on Massively Parallel Programming Models
The globe distribution network
ATEC '00 Proceedings of the annual conference on USENIX Annual Technical Conference
Jalapeno: secentralized grid computing using peer-to-peer technology
Proceedings of the 2nd conference on Computing frontiers
Browser-based distributed evolutionary computation: performance and scaling behavior
Proceedings of the 9th annual conference companion on Genetic and evolutionary computation
| Hi-index | 0.00 |
CX, a network-based computational exchange, is presented. The system's design integrates variations of ideas from other researchers, such as work stealing, non-blocking tasks, eager scheduling, and space-based coordination. The object-oriented API is simple, compact, and cleanly separates application logic from the logic that supports interprocess communication and fault tolerance. Computations, of course, run to completion in the presence of computational hosts that join and leave the ongoing computation. Such hosts, or producers, use task caching and prefetching to overlap computation with interprocessor communication. To break a potential task server bottleneck, a network of task servers is presented. Even though task servers are envisioned as reliable, the self-organizing, scalable network of n servers, described as a sibling-connected fat tree, tolerates a sequence of n — 1 server failures. Tasks are distributed throughout the server network via a simple “diffusion” process.CX is intended as a test bed for research on automated silent auctions, reputation services, authentication services, and bonding services. CX also provides a test bed for algorithm research into network-based parallel computation.