Advanced list scheduling heuristic for task scheduling with communication contention for parallel embedded systems

DOI10.1007/s11432-010-4097-3zbMath1214.90058OpenAlexW2043299503MaRDI QIDQ543079

Jean-Gabriel Cousin, Mickaël Raulet, Jean-François Nezan, Pengcheng Mu

Publication date: 17 June 2011

Published in: Science China. Information Sciences (Search for Journal in Brave)

Full work available at URL: http://engine.scichina.com/doi/10.1007/s11432-010-4097-3

zbMATH Keywords

list schedulingcommunication delaycommunication contentioncritical childnode level

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Uses Software

• Hypertool

Cites Work

• Unnamed Item
• Unnamed Item
• Communication contention in APN list scheduling algorithm
• Scheduling Precedence Graphs in Systems with Interprocessor Communication Times
• A comparison of list schedules for parallel processing systems
• Throughput-Buffering Trade-Off Exploration for Cyclo-Static and Synchronous Dataflow Graphs

This page was built for publication: Advanced list scheduling heuristic for task scheduling with communication contention for parallel embedded systems