Scheduling Graphs on Two Processors

DOI10.1137/0205005MaRDI QIDQ4094404zbMATH OpenOpenAlexWikidataFDO

Authors Ravi Sethi

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

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Algorithms in computer science (68W99)

Recommendations

• Scheduling Flat Graphs
• Task scheduling with and without communication delays: A unified approach
• Scheduling UET-UCT series-parallel graphs on two processors
• A New Insight into the Coffman–Graham Algorithm
• scientific article; zbMATH DE number 176752

Cited in

(24)

• Multiprocessor scheduling and combinatorial configurations
• Scheduling Flat Graphs
• Planar stage graphs: Characterizations and applications
• A linear-time recognition algorithm for interval dags
• scientific article; zbMATH DE number 5263424 (Why is no real title available?)
• Scheduling tasks with communication delays on parallel processors
• Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler
• Modules and PQ-trees in Robinson spaces
• scientific article; zbMATH DE number 1264424 (Why is no real title available?)
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length
• ON OPTIMAL LOOP UNROLLING IN TWO-PROCESSOR SCHEDULING
• Scheduling Opposing Forests
• A linear-time algorithm for a special case of disjoint set union
• scientific article; zbMATH DE number 1743973 (Why is no real title available?)
• Optimal shooting: Characterizations and applications
• Graph searches and their end vertices
• scientific article; zbMATH DE number 1756650 (Why is no real title available?)
• Multi-processor scheduling and expanders
• Application of digraph theory to process scheduling
• ON CONSIDERING COMMUNICATION IN SCHEDULING TASK GRAPHS ON PARALLEL PROCESSORS
• On two-processor scheduling and maximum matching in permutation graphs
• Scheduling of pipelined operator graphs
• scientific article; zbMATH DE number 4113979 (Why is no real title available?)

This page was built for publication: Scheduling Graphs on Two Processors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4094404)