Scheduling Interval-Ordered Tasks
Copyright policy )Scheduling Interval-Ordered Tasks
We show that unit execution time jobs subject to a precedence constraint whose complement is chordal can be scheduled in linear time on m processors. Generalizations to arbitrary execution times are NP-complete.
interval orders, Analysis of algorithms and problem complexity, arbitrary length tasks, chordal graphs, scheduling unit length tasks, polynomial in time algorithms, incomparability graph, Performance evaluation, queueing, and scheduling in the context of computer systems, NP- completeness
interval orders, Analysis of algorithms and problem complexity, arbitrary length tasks, chordal graphs, scheduling unit length tasks, polynomial in time algorithms, incomparability graph, Performance evaluation, queueing, and scheduling in the context of computer systems, NP- completeness
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).157 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.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 1% 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!