Graph models for scheduling systems with machine saturation property

DOI10.1007/S00186-005-0016-6MaRDI QIDQ883067zbMATH OpenOpenAlexFDO

Authors Paolo Dell'Olmo, Monica Gentili

Publication date 31 May 2007

Published in Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00186-005-0016-6

zbMATH Keywords

Intersection graphsMakespanMultiprocessor task schedulingPolynomial algorithms

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Nonpreemptive scheduling of independent tasks with prespecified processor allocations
• scientific article; zbMATH DE number 3978803
• Parallel execution of schedules with random dependency graph
• An approach to parallel algorithm design
• scientific article; zbMATH DE number 3941253

Cites work

• A characterization of perfect graphs
• An approximation result for a duo-processor task scheduling problem
• Applications of edge coverings by cliques
• Efficiency and effectiveness of normal schedules on three dedicated processors
• scientific article; zbMATH DE number 1634827 (Why is no real title available?)
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3737705 (Why is no real title available?)
• scientific article; zbMATH DE number 54774 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• scientific article; zbMATH DE number 3400923 (Why is no real title available?)
• On the fractional intersection number of a graph

Cited in

(3)

• Satisfiability modulo theory (SMT) formulation for optimal scheduling of task graphs with communication delay
• scientific article; zbMATH DE number 1264424 (Why is no real title available?)
• scientific article; zbMATH DE number 7273957 (Why is no real title available?)

This page was built for publication: Graph models for scheduling systems with machine saturation property

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