Parallel computing (2nd ed.): theory and practice
Parallel computing (2nd ed.): theory and practice
Parallel and distributed computing handbook
Parallel and distributed computing handbook
Interfacing Condor and PVM to harness the cycles of workstation clusters
Future Generation Computer Systems - Special issue: resource management in distributed systems
Adaptive Parallelism and Piranha
Computer
Computing Twin Primes and Brun's Constant: A Distributed Approach
HPDC '98 Proceedings of the 7th IEEE International Symposium on High Performance Distributed Computing
The DOGMA Approach to High-Utilization Supercomputing
HPDC '98 Proceedings of the 7th IEEE International Symposium on High Performance Distributed Computing
A Synopsis of the Legion Project
A Synopsis of the Legion Project
Campus-Wide Computing: Early Results Using Legion at The University of Virginia
Campus-Wide Computing: Early Results Using Legion at The University of Virginia
| Hi-index | 0.00 |
This paper outlines experiences with development of a distributed framework designed for parallel processing of an application using idle processor time on large numbers of heterogeneous computers. The system places no requirements on the performance or availabihty of the network interconnections. As such, it is most suitable to parallel applications with modest synchronization requirements and a high ratio of computation time to amount of data needed to define the problem domain subspace. We also provide details on our first application using this framework: a parallel computation which counts the distribution of twin primes, calculates Brun's Constant and the maximal distance between pairs of twin primes. Two primes are twins if they differ by two. We have gathered these results for an order of magnitude larger interval than previously computed. We present an overview of our implementation and provide preliminary results and future directions for the system.