Learn More
1. Abstract This paper discusses preliminary work on standardizing and implementing a remote procedure call (RPC) mechanism for grid computing. The GridRPC API is designed to address one of the factors that has hindered widespread acceptance of grid computing – the lack of a standardized, portable, and simple programming interface. In this paper, we examine(More)
Desktop grids are popular platforms for high throughput applications, but due their inherent resource volatility it is difficult to exploit them for applications that require rapid turnaround. Efficient desktop grid execution of short-lived applications is an attractive proposition and we claim that it is achievable via intelligent resource selection. We(More)
Systems already in use, even if not fully understood Researchers need to assess and compare solutions Analytical Work difficult without unrealistic assumptions Real-world Experiments Systems already in use, even if not fully understood Researchers need to assess and compare solutions Analytical Work difficult without unrealistic assumptions Real-world(More)
—Ensembles of distributed, heterogeneous resources, also known as Computational Grids, have emerged as critical platforms for high-performance and resource-intensive applications. Such platforms provide the potential for applications to aggregate enormous bandwidth, computational power, memory, secondary storage, and other resources during a single(More)
This paper presents a new system, called NetSolve, that allows users to access computational resources, such as hardware and software, distributed across the network. The development of NetSolve was motivated by the need for an easy-to-use, efficient mechanism for using computational resources remotely. Ease of use is obtained as a result of different(More)
— Since the advent of distributed computer systems an active field of research has been the investigation of scheduling strategies for parallel applications. The common approach is to employ scheduling heuris-tics that approximate an optimal schedule. Unfortunately , it is not possible to obtain analytical results to compare and select appropriate(More)
In this paper we present an algorithm for scheduling parallel applications that consist of a divisible workload. Our algorithm uses multiple rounds to overlap communication and computation between a master and several workers. Multi-round scheduling has been used for divisible work-loads in previous work and our contribution is as follows. We use " uniform(More)