Communications of the ACM - Special issue: computing in the frontiers of science and engineering
Analysis of Performability for Stochastic Models of Fault-Tolerant Systems
IEEE Transactions on Computers
Using idle workstations in a shared computing environment
SOSP '87 Proceedings of the eleventh ACM Symposium on Operating systems principles
Queueing systems with vacations—a survey
Queueing Systems: Theory and Applications
Queueing systems with service interruptions
Operations Research
Performability Analysis: Measures, an Algorithm, and a Case Study
IEEE Transactions on Computers - Fault-Tolerant Computing
Journal of the ACM (JACM)
On the Computational Aspects of Performability Models of Fault-Tolerant Computer Systems
IEEE Transactions on Computers
The “worm” programs—early experience with a distributed computation
Communications of the ACM
Distributed systems and transient processors
Distributed systems and transient processors
Queueing performance analysis of co-scheduling in a pool of processors environment
ICS '94 Proceedings of the 8th international conference on Supercomputing
A structured approach to instrumentation system development and evaluation
Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
Performance Modeling and Prediction of Nondedicated Network Computing
IEEE Transactions on Computers
Journal of Parallel and Distributed Computing
Grid harvest service: a performance system of grid computing
Journal of Parallel and Distributed Computing
Journal of Parallel and Distributed Computing
Fault-aware grid scheduling using performance prediction by workload modeling
The Journal of Supercomputing
A parallel solution for scheduling of real time applications on grid environments
Future Generation Computer Systems
Research: Effective queueing strategies for co-scheduling in a pool of processors
Computer Communications
Enhancing performance of failure-prone clusters by adaptive provisioning of cloud resources
The Journal of Supercomputing
| Hi-index | 0.00 |
It is suggested that if the large numbers of idle computers and workstations in distributedsystems could be used then considerable computing power could be harnessed at lowcost. Such systems are analyzed using Brownian motion with drift to model the executionof a program distributed over the idle computers in a network of idle and busy processors.The ways in which the use of these transient processors affects a program's executiontime is determined. The probability density of a program's finishing time on both single and multiple transient processors is found. These results are explored for qualitative insight. Some approximations for the finishing time probability density are suggested.