On-line algorithms for multiprocessor task scheduling with ready times

• Autorzy: Caramia M. , Dell'Olmo P. , Iovanella A.
• Języki publikacji: EN

Abstrakty

EN

In this paper we deal with multiprocessor task scheduling with ready times and prespecified processor allocation. In the studied problem tasks are not initially all available in the scheduler and can be executed only by a given ready time. Moreover, a task can be examined in order to be processed only when it enters the scheduler. For this class of problems we developed some algorithms which schedule tasks in the attempt to minimize the makespan. We provide experiments on various scenarios, computing also the mean flow time spent by each task in the system.

Słowa kluczowe

EN

task scheduling; multiprocessor; ready time

• Wydawca: Wydawnictwo Politechniki Poznańskiej
• Czasopismo: Foundations of Computing and Decision Sciences
• Rocznik: 2001
• Tom: Vol. 26, No. 3
• Strony: 197--214
• Opis fizyczny: Bibliogr. 22 poz.

Twórcy

autor

Caramia M.

autor

Dell'Olmo P.

autor

Iovanella A.

• Department of Computer Science, Systems and Production - Faculty of Engineering - University of Rome "Tor Vergata" - Via di Tor Vergata, 110 - 00133 Rome, Italy,