Scheduling Graphs on Two Processors
From MaRDI portal
Publication:4094404
DOI10.1137/0205005zbMath0328.68057WikidataQ56865895 ScholiaQ56865895MaRDI QIDQ4094404
Publication date: 1976
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0205005
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68N01: General topics in the theory of software
68W99: Algorithms in computer science
Related Items
Scheduling Opposing Forests, ON CONSIDERING COMMUNICATION IN SCHEDULING TASK GRAPHS ON PARALLEL PROCESSORS, ON OPTIMAL LOOP UNROLLING IN TWO-PROCESSOR SCHEDULING, A linear-time algorithm for a special case of disjoint set union, A linear-time recognition algorithm for interval dags, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, On two-processor scheduling and maximum matching in permutation graphs, Planar stage graphs: Characterizations and applications, Scheduling tasks with communication delays on parallel processors