Scheduling algorithm for nonpreemptive multiprocessor tasks
نویسندگان
چکیده
منابع مشابه
Deadline Scheduling of Multiprocessor Tasks
In the classical scheduling theory it is widely assumed that any task requires for its processing only one processor at a time. Nowadays with the technological progress this assumption has become not so obvious. In the paper, two algorithms for solving the problem of scheduling tasks requiring more than one processor at a time in the real-time environment, will be given. The first is based on a...
متن کاملScheduling of multiprocessor tasks for numerical applications
Many applications in the area of scientiic computing use algorithms with a two-level parallelism based on potential method parallelism and potential system parallelism. In this paper, we investigate the eecient implementation of such algorithms on distributed memory machines. We consider parallel speciications consisting of an upper level of multi-processor tasks each of which having an interna...
متن کاملScheduling of Independent Dedicated Multiprocessor Tasks
We study the offline and online versions of the well known problem of scheduling a set of n independent multiprocessor tasks with prespecified processor allocations on a set of identical processors in order to minimize the makespan. Recently, in [13], it has been proven that in the case when all tasks have unit processing time the problem cannot be approximated within a factor of m 1 2 ε, neith...
متن کاملScheduling multiprocessor tasks on two parallel processors
In this work scheduling multiprocessor tasks on two parallel identical processors is considered. Multiprocessor tasks can be executed by more than one processor at the same moment of time. We analyze scheduling unit execution time and preemptable tasks to minimize schedule length and maximum lateness. Cases with ready times, due-dates and precedence constraints are discussed.
متن کاملScheduling Multiprocessor Tasks with Genetic Algorithms
In this paper, an efficient method based on genetic algorithms is developed to solve the multiprocessor scheduling problem. To efficiently execute programs in parallel on multiprocessor scheduling problem must be solved to determine the assignment of tasks to the processors and the execution order of the tasks so that the execution time is minimized. Even when the target processors is fully con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1994
ISSN: 0898-1221
DOI: 10.1016/0898-1221(94)00129-4