Scheduling UET Multiprocessor Tasks
Scheduling UET Multiprocessor Tasks
Summary: Classical scheduling theory assumed that a task for its processing may require only one processor at a time. This assumption is not so obvious in the context of new parallel computer systems and parallel algorithms. In this work we consider deterministic scheduling of unit execution time (UET) tasks, each of which requires more than one processor at a time, i.e. requiring sets of processors simultaneously. Low order polynomial time algorithms are given for the case of two, three and four processors for the schedule length criterion. Maximum lateness is also considered.
parallel algorithms, multiprocessor scheduling; mathematical programming, Performance evaluation, queueing, and scheduling in the context of computer systems, scheduling theory
parallel algorithms, multiprocessor scheduling; mathematical programming, Performance evaluation, queueing, and scheduling in the context of computer systems, scheduling theory
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!