Scheduling Graphs on Two Processors
DOI10.1137/0205005zbMATH Open0328.68057OpenAlexW2067945058WikidataQ56865895 ScholiaQ56865895MaRDI QIDQ4094404FDOQ4094404
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
Recommendations
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)
Cited In (23)
- Scheduling Flat Graphs
- Planar stage graphs: Characterizations and applications
- Title not available (Why is that?)
- A linear-time recognition algorithm for interval dags
- Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler
- Scheduling tasks with communication delays on parallel processors
- Title not available (Why is that?)
- ON OPTIMAL LOOP UNROLLING IN TWO-PROCESSOR SCHEDULING
- Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length
- Scheduling Opposing Forests
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- A linear-time algorithm for a special case of disjoint set union
- Title not available (Why is that?)
- Optimal shooting: Characterizations and applications
- Title not available (Why is that?)
- Graph searches and their end vertices
- 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
- Title not available (Why is that?)
- Multiprocessor scheduling and combinatorial configurations
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)
