This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
Michael Isard, Vijayan Prabhakaran, Jon Currey, Ud...
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
In recent years, several frameworks have been developed for processing very large quantities of data on large clusters of commodity PCs. These frameworks have focused on fault-tole...
This paper analyzes the performability of client-server applications that use a separate fault management architecture for monitoring and controlling of the status of the applicat...
Abstract. The Stanford Event Heap has been shown to provide appropriate support for constructing interactive workspace applications. Given this success it is natural to consider th...