ACM Home Page
Please provide us with feedback. Feedback
Variation-aware task allocation and scheduling for MPSoC
Full text PdfPdf (190 KB)
Source International Conference on Computer Aided Design archive
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design table of contents
San Jose, California
SESSION: System-level synthesis and interconnect design table of contents
Pages 598-603  
Year of Publication: 2007
ISBN ~ ISSN:1092-3152 , 1-4244-1382-6
Authors
Feng Wang  Pennsylvania State University, University Park, PA
C. Nicopoulos  Pennsylvania State University, University Park, PA
Xiaoxia Wu  Pennsylvania State University, University Park, PA
Yuan Xie  Pennsylvania State University, University Park, PA
N. Vijaykrishnan  Pennsylvania State University, University Park, PA
Sponsors
: IEEE CASS/CANDE
SIGDA: ACM Special Interest Group on Design Automation
IEEE-CS\DATC : IEEE Computer Society
CEDA : Council on Electronic Design Automation
Publisher
IEEE Press  Piscataway, NJ, USA
Bibliometrics
Downloads (6 Weeks): 22,   Downloads (12 Months): 120,   Citation Count: 0
Additional Information:

abstract   references   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   

ABSTRACT

As technology scales, the delay uncertainty caused by process variations has become increasingly pronounced in deep submicron designs. As a result, a paradigm shift from deterministic to statistical design methodology at all levels of the design hierarchy is inevitable [1]. In this paper, we propose a variation-aware task allocation and scheduling algorithm for Multiprocessor System-on-Chip (MPSoC) architectures to mitigate the impact of parameter variations. A new design metric, called performance yield and defined as the probability of the assigned schedule meeting the predefined performance constraints, is used to guide the task allocation and scheduling procedure. An efficient yield computation method for task scheduling complements and significantly improves the effectiveness of the proposed variation-aware scheduling algorithm. Experimental results show that our variation-aware scheduler achieves significant yield improvements. On average, 45% and 34% yield improvements over worst-case and nominal-case deterministic schedulers, respectively, can be obtained across the benchmarks by using the proposed variation-aware scheduler.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
A. Jerraya and W. Wolf. Multiprocessor systems-on-chips. Morgan Kaufmann Publishers, 2005.
 
3
 
4
5
 
6
 
7
 
8
 
9
 
10
 
11
 
12
K. A. Bowman, S. G. Duvall, and J. D. Meindl. Impact of Die-to-Die and Within Die Parameter Fluctuations on the Maximum Clock Frequency Distribution for Gigascale Integration. Journal of Solid-State Circuits, pages 183--190, February 2002.
 
13
 
14
15
 
16
C. Clark. The greatest of a finite set of random variables. Operations Research, pages 145--162, 1961.
17
 
18
R. Dick. Embedded systems synthesis benchmarks suite (e3s). http://www.ece.northwestern.edu/dickrp/e3s/.
 
19
Collaborative Colleagues:
Feng Wang: colleagues
C. Nicopoulos: colleagues
Xiaoxia Wu: colleagues
Yuan Xie: colleagues
N. Vijaykrishnan: colleagues