Process-variation aware mapping of real-time streaming applications to MPSoCs for improved yield
Authors:
- 1 March 2012
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 19483287,p. 41-48
Abstract
As technology scales, the impact of process variation on the maximum supported frequency (FMAX) of individual cores in a MPSoC becomes more pronounced. Task allocation without variation-aware performance analysis can result in a significant loss in yield, defined as the number of manufactured chips satisfying the application timing requirement. We propose variation-aware task allocation for real-time streaming applications modeled as task graphs. Our solutions are primarily based on the throughput requirement, which is the most important timing requirement in many real-time streaming applications. The three main contributions of this paper are: 1) Using data flow graphs that are well-suited for modeling and analysis of real-time streaming applications, we explicitly model task execution both in terms of clock cycles (which is independent of variation) and seconds (which does depend on the variation of the resource), which we connect by an explicit binding. 2) We present two approaches for optimizing the yield. The approaches give different results at different costs. 3) We present exhaustive and heuristic algorithms that implement the optimization approaches. Our variation-aware mapping algorithms are tested on models of real applications, and are compared to the mapping methods that are unaware of hardware variation. Our results demonstrate yield improvements of up to 50% with an average of 31%, showing the effectiveness of our approaches.Keywords
This publication has 14 references indexed in Scilit:
- CA-MPSoC: An automated design flow for predictable multi-processor architectures for multiple applicationsJournal of Systems Architecture, 2010
- An efficient and complete approach for throughput-maximal SDF allocation and scheduling on multi-core platforms2010
- Resource Sharing Problem of Timing Variation-Aware Task Scheduling and Binding in MPSoCThe Computer Journal, 2009
- CoMPSoCACM Transactions on Design Automation of Electronic Systems, 2009
- Self-Timed Scheduling Analysis for Real-Time ApplicationsEURASIP Journal on Advances in Signal Processing, 2007
- Impact of Parameter Variations on Circuits and MicroarchitectureIEEE Micro, 2006
- Throughput Analysis of Synchronous Data Flow Graphs2006
- Exploring trade-offs in buffer requirements and throughput constraints for synchronous dataflow graphs2006
- Impact of die-to-die and within-die parameter fluctuations on the maximum clock frequency distribution for gigascale integrationIEEE Journal of Solid-State Circuits, 2002
- A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing SystemsJournal of Parallel and Distributed Computing, 2001