A graph model for scheduling processes in systems with parallel computations

DOI10.1007/BF02575939zbMath0358.90029OpenAlexW2072573536MaRDI QIDQ1238748

K. Appert

Publication date: 1976

Published in: Calcolo (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02575939

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal scheduling for two-processor systems
• Scheduling independent tasks to reduce mean finishing time
• Analysis of Graphs by Connectivity Considerations
• Prevention of system deadlocks
• Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems

This page was built for publication: A graph model for scheduling processes in systems with parallel computations