Schedulling Malleable Task with Convex Processing Speed Functions (2006)
Denis Tristram, Jacek Blazewicz, Maciej Machowiak, Jan Weglarz, Gragory Mounie
Schedulling Malleable Task with Convex Processing Speed Functions
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...
A note on the complexity of scheduling coupled tasks on a single processor (2001)
Blazewicz,Jacek, Ecker,Klaus, Kis,Tamás, Tanas,Michal
This paper considers a problem of coupled task scheduling on one processor, where all processing times are equal to 1, the gap has exact length h, precedence constraints are strict and the criterion...
Scheduling Complete Intrees on Two Uniform Processors With Communication Delays (1996)
Jacek Blazewicz, Pascal Bouvry, Denis Trystram
In this paper we present an optimal algorithm for scheduling complete k-ary tree on two uniform processors of different speeds in order to minimize schedule length. We consider the basic case of unit...
The two-machine flow-shop problem with weighted late work criterion and common due date
Blazewicz, Jacek, Pesch, Erwin, Sterna, Malgorzata, Werner, Frank
Scheduling multiprocessor tasks on parallel processors with limited availability
Blazewicz, Jacek, Dell'Olmo, Paolo, Drozdowski, Maciej, Maczka, Przemyslaw
Two-machine flow shops with limited machine availability
Kubiak, Wieslaw, Blazewicz, Jacek, Formanowicz, Piotr, Breit, Joachim, Schmidt, Gunter