Complexity of scheduling multiprocessor tasks with prespecified processor allocations
Discrete Applied Mathematics
Business data communications and networking (5th ed.)
Business data communications and networking (5th ed.)
Online computation and competitive analysis
Online computation and competitive analysis
New methods to color the vertices of a graph
Communications of the ACM
Optical WDM Networks: Principles and Practice
Optical WDM Networks: Principles and Practice
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Scheduling of Independent Dedicated Multiprocessor Tasks
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Scheduling Independent Multiprocessor Tasks
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
Models for Replica Synchronisation and Consistency in a Data Grid
HPDC '01 Proceedings of the 10th IEEE International Symposium on High Performance Distributed Computing
Semi on-line algorithms for the partition problem
Operations Research Letters
Ordinal algorithms for parallel machine scheduling
Operations Research Letters
An exact algorithm for the maximum clique problem
Operations Research Letters
| Hi-index | 0.01 |
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.