A graph model for scheduling processes in systems with parallel computations

DOI10.1007/BF02575939MaRDI QIDQ1238748zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• scientific article; zbMATH DE number 3466531 (Why is no real title available?)
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• Analysis of Graphs by Connectivity Considerations
• Optimal scheduling for two-processor systems
• Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems
• Prevention of system deadlocks
• Scheduling independent tasks to reduce mean finishing time

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

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