On the Complexity of Multi-Round Divisible Load Scheduling (2007)
Yang, Yang, Casanova, Henri, Drozdowski, Maciej, Lawenda, Marcin, Legrand, Arnaud
In this paper we study master-worker scheduling of divisible loads in heterogeneous distributed systems. Divisible loads are computations that can be arbitrarily divided into independent ``chunks'',...
On the Complexity of Multi-Round Divisible Load Scheduling (2007)
Yang, Yang, Casanova, Henri, Drozdowski, Maciej, Lawenda, Marcin, Legrand, Arnaud
In this paper we study master-worker scheduling of divisible loads in heterogeneous distributed systems. Divisible loads are computations that can be arbitrarily divided into independent ``chunks'',...
On the Complexity of Multi-Round Divisible Load Scheduling (2007)
Yang, Yang, Casanova, Henri, Drozdowski, Maciej, Lawenda, Marcin, Legrand, Arnaud
In this paper we study master-worker scheduling of divisible loads in heterogeneous distributed systems. Divisible loads are computations that can be arbitrarily divided into independent ``chunks'',...
On the Complexity of Multi-Round Divisible Load Scheduling (2007)
Yang, Yang, Casanova, Henri, Drozdowski, Maciej, Lawenda, Marcin, Legrand, Arnaud
In this paper we study master-worker scheduling of divisible loads in heterogeneous distributed systems. Divisible loads are computations that can be arbitrarily divided into independent ``chunks'',...
Scheduling a Divisible Task in a 2-Dimensional Toroidal Mesh (2003)
Maciej Drozdowski, Denis Trystram
In this paper, a problem of scheduling an arbitrarily divisible task is considered. Taking into account both communication delays and computation time we propose a scheduling method which minimizes...
The Performance Limits Of Two-Dimensional Network of load-sharing processors (2003)
Jacek Blazewicz, Maciej Drozdowski, Presented J. Wqglarz
A process of computation in a two-dimensional mesh of processors is analysed in this work. A computational task is assumed to be arbitrarily divisible between processors. The load of the job is...
Maciej Drozdowski, Jacek B La_zewicz, Piotr Formanowicz, Wies Law Kubiak
In this work the problem of scheduling n preemptable tasks with ready times and due-dates on m uniform processors available in q time windows for maximum lateness criterion is studied. The problem is...
Scheduling Multiprocessor Tasks - an Overview (1999)
Multiprocessor tasks require more than one processor at the same moment of time. This relatively new concept in scheduling theory emerged with the advent of parallel computing systems. In this work...