Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates

In this paper a semi-online algorithm for scheduling multiprocessor tasks with partial information is proposed. We consider the case in which it is possible to exploit probabilistic information and use this information to obtain better solutions in comparison with standard non clairvoyant on-line algorithms. A wide computational analysis shows the effectiveness of our algorithm. Moreover, we also consider a test framework with a continuous generation of tasks in order to study the behavior of the proposed approach in real applications, which confirms the efficiency of our approach.

[1]  Evripidis Bampis,et al.  Scheduling of Independent Dedicated Multiprocessor Tasks , 2002, ISAAC.

[2]  Peter Brucker,et al.  Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems , 1996 .

[3]  Evripidis Bampis,et al.  On the approximability of scheduling multiprocessor tasks with time-dependent processor and time requirements , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[4]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[5]  Guochuan Zhang,et al.  Semi On-Line Scheduling on Two Identical Machines , 1999, Computing.

[6]  Daniel Brélaz,et al.  New methods to color the vertices of a graph , 1979, CACM.

[7]  Han Hoogeveen,et al.  Complexity of Scheduling Multiprocessor Tasks with Prespecified Processor Allocations , 1994, Discret. Appl. Math..

[8]  Jeffrey B. Sidney,et al.  Ordinal algorithms for parallel machine scheduling , 1996, Oper. Res. Lett..

[9]  Alan R. Dennis,et al.  Business Data Communications and Networking , 1995 .

[10]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[11]  Jianer Chen,et al.  Semi-normal Schedulings: Improvement on Goemans' Algorithm , 2001, ISAAC.

[12]  P. Pardalos,et al.  An exact algorithm for the maximum clique problem , 1990 .

[13]  Evripidis Bampis,et al.  Scheduling Independent Multiprocessor Tasks , 1997, ESA.

[14]  Klaus Jansen,et al.  On Minimizing Average Weighted Completion Time of Multiprocessor Tasks with Release Dates , 2001, ICALP.

[15]  Javier Jaén Martínez,et al.  Models for replica synchronisation and consistency in a data grid , 2001, Proceedings 10th IEEE International Symposium on High Performance Distributed Computing.

[16]  Antonio Iovanella,et al.  Lower bound algorithms for multiprocessor task scheduling with ready times , 2005, Int. Trans. Oper. Res..

[17]  Guochuan Zhang,et al.  A note on on-line scheduling with partial information , 2002 .

[19]  Zsolt Tuza,et al.  Semi on-line algorithms for the partition problem , 1997, Oper. Res. Lett..

[20]  Maciej Drozdowski,et al.  Scheduling multiprocessor tasks -- An overview , 1996 .

[21]  Alan R. Dennis,et al.  Business data communications and networking (5th ed.) , 1996 .

[22]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[23]  Antonio Iovanella,et al.  On-line algorithms for multiprocessor task scheduling with ready times , 2001 .

[24]  Krishna M. Sivalingam,et al.  Optical WDM Networks: Principles and Practice , 2010 .