Scheduling task graphs on arbitrary processor architectures considering contention

DOI10.1007/3-540-48228-8_38MaRDI QIDQ4535977zbMATH OpenFDO

Authors Oliver Sinnen, Leonel Sousa

Publication date 5 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48228-8_38

zbMATH Keywords

simple contention scheduling

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computing methodologies and applications (68U99)

Recommendations

• scientific article; zbMATH DE number 1743973
• Scheduling Graphs on Two Processors
• Schedulability Analysis of Conditional Parallel Task Graphs in Multicore Systems
• scientific article; zbMATH DE number 4072695
• scientific article; zbMATH DE number 4053016
• On the complexity of multiprocessor task scheduling

Cited in

(8)

• Reducing the solution space of optimal task scheduling
• Efficient communication contention aware scheduling in heterogeneous system
• Mapping pipeline skeletons onto heterogeneous platforms
• scientific article; zbMATH DE number 1743973 (Why is no real title available?)
• Exploiting unused time slots in list scheduling considering communication contention
• A graph based approach for co-scheduling jobs on multi-core computers
• On task scheduling accuracy: Evaluation methodology and results
• Efficient job scheduling algorithms with multi-type contentions

This page was built for publication: Scheduling task graphs on arbitrary processor architectures considering contention

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