We propose a tunable scheduling strategy that lies between FIFO and shortest- rst, based on the value of a coe cient Alpha. If Alpha is set to zero then this strategy is just FIFO....
Abstract. The usual context of service oriented computing is characterized by several services offering the same functionalities, new services that are continuosly deployed and oth...
The problem of scheduling independent tasks on heterogeneous trees is considered. The nodes of the tree may have different processing times, and links different communication time...
In this paper we investigate protocols for scheduling applications that consist of large numbers of identical, independent tasks on large-scale computing platforms. By imposing a ...
Barbara Kreaseck, Larry Carter, Henri Casanova, Je...
With the offer from cloud computing providers, scientists have the opportunity to utilize pay-as-you-go resources together with their own and shared resources. However, scientist...