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

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

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

(25)

• 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
• Using an eraser or a pencil for two-processor scheduling
• Multi-processor scheduling and expanders
• On two-processor scheduling and maximum matching in permutation graphs
• Planar stage graphs: Characterizations and applications
• Scheduling tasks with communication delays on parallel processors
• Graph searches and their end vertices
• Scheduling of pipelined operator graphs
• Application of digraph theory to process scheduling
• Scheduling Flat Graphs
• Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length
• scientific article; zbMATH DE number 1264424 (Why is no real title available?)
• Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler
• scientific article; zbMATH DE number 1743973 (Why is no real title available?)
• scientific article; zbMATH DE number 1756650 (Why is no real title available?)
• Optimal shooting: Characterizations and applications
• scientific article; zbMATH DE number 4113979 (Why is no real title available?)
• Scheduling Opposing Forests
• ON CONSIDERING COMMUNICATION IN SCHEDULING TASK GRAPHS ON PARALLEL PROCESSORS
• ON OPTIMAL LOOP UNROLLING IN TWO-PROCESSOR SCHEDULING
• Multiprocessor scheduling and combinatorial configurations
• scientific article; zbMATH DE number 5263424 (Why is no real title available?)
• Modules and PQ-trees in Robinson spaces

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)