d Abstract) Richard J. Anderson Paul Beame Walter L. Ruzzo Department of Computer Science and Engineering University of Washingtoni We introduce a task scheduling model which is u...
Advances in network technologies and the emergence of Grid computing have both increased the need and provided the infrastructure for computation and data intensive applications to...
Anastasios Gounaris, Rizos Sakellariou, Norman W. ...
We consider the unrelated parallel machines scheduling problem where jobs have earliness and tardiness penalties and a common due date. We formulate this problem and some of its v...
This paper addresses the problem of scheduling parallel tasks, represented by a direct acyclic graph (DAG) on heterogeneous clusters. Parallel tasks, also called malleable tasks, ...
Jorge G. Barbosa, C. N. Morais, R. Nobrega, A. P. ...
Mixed-parallel applications can take advantage of largescale computing platforms but scheduling them efficiently on such platforms is challenging. In this paper we compare the tw...