A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf
.
Stochastic Allocation and Scheduling for Conditional Task Graphs in MPSoCs
[chapter]
2006
Lecture Notes in Computer Science
This paper describes a complete and efficient solution to the stochastic allocation and scheduling for Multi-Processor System-on-Chip (MPSoC). Given a conditional task graph characterizing a target application and a target architecture with alternative memory and computation resources, we compute an allocation and schedule minimizing the expected value of communication cost, being the communication resources one of the major bottlenecks in modern MPSoCs. Our approach is based on the Logic Based
doi:10.1007/11889205_23
fatcat:ih2mnmff5jgu7n3morrofk5hxq