ACM Home Page
Please provide us with feedback. Feedback
A task-level hierarchical memory model for system synthesis of multiprocessors
Full text PdfPdf (121 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 34th annual Design Automation Conference table of contents
Anaheim, California, United States
Pages: 153 - 156  
Year of Publication: 1997
ISBN:0-89791-920-3
Authors
Yanbing Li  Dept. of EE, Princeton University, Princeton, NJ
Wayne Wolf  Dept. of EE, Princeton University, Princeton, NJ
Sponsors
EDAC : Electronic Design Automation Consortium
IEEE-CAS : Circuits & Systems
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 17,   Citation Count: 7
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/266021.266053
What is a DOI?

ABSTRACT

This paper introduces the first high-level (task-level)model of hierarchical memories and describes a scheduling andallocation algorithm for system-level synthesis of heterogeneousmultiprocessors. Caches are essential for modern RISC embeddedcores to obtain sustained high performance. However, caches havereceived limited use in priority-driven preemptive real-time systemsdue to the unpredictability of caches-average-case improvementsare of no use in systems with hard deadlines. Program-levelcache models do not take into account preemptions between multipletasks running at multiple rates on embedded cores. Our task-levelmodel of performance in the presence of memory hierarchiesprovides an efficient means to bound the guaranteed memory performanceof tasks running in a multi-rate, multi-tasking environment.Our system synthesis algorithm uses software-based cachepartitioning and reservation techniques to guarantee cache hitsfor some tasks and therefore improve task schedulability. Experimentalresults show that our model significantly improves schedulabilityof real-time tasks and can be evaluated efficiently duringsystem-level synthesis.


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
 
3
D. Kirk and J. Strosnider, "SMART cache design using the MIPS R3000," in Proc., RTSS'90, IEEE, 1990.
 
4
J. Torrellas, "Multiprocessor cache memory performance: characterization and optimization," Stanford Univ., CSL-TR-92-545,1992.
 
5
A. Burchard, Y. Oh, J. Liebeherr, S. H. Son, "A linear-time online task assignment scheme for multiprocessor systems," in Proceedings, 11 th IEEE Workshop Real-Time Operating Systems and Software, pp. 28-31, May 1994.
 
6
D.-T. Peng and K. G. Shin. "Static allocation of periodic tasks with precedence constraints in distributed real-time systems," In Proc., International Conference on Distributed Computing Systems, 1989.
7

CITED BY  7