ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Modulo schedule buffers
Full text Publisher SitePublisher Site PdfPdf (1.38 MB)
Source International Symposium on Microarchitecture archive
Proceedings of the 34th annual ACM/IEEE international symposium on Microarchitecture table of contents
Austin, Texas
SESSION: Modulo scheduling table of contents
Pages: 138 - 149  
Year of Publication: 2001
ISBN ~ ISSN:1072-4451 , 0-7695-1369-7
Authors
Matthew C. Merten  University of Illinois, Urbana, IL
Wen-mei W. Hwu  University of Illinois, Urbana, IL
Sponsors
: IEEE TC-MARCH
SIGMICRO: ACM Special Interest Group on Microarchitectural Research and Processing
Publisher
IEEE Computer Society  Washington, DC, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 18,   Citation Count: 3
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  

ABSTRACT

As VLIW/EPIC processors are increasingly used in real-time, signal-processing, and embedded applications, the importance of minimizing code size and reducing power is growing. This paper describes a new architectural mechanism, called the Modulo Schedule Buffers, that provides an elegant interface for the execution of modulo scheduled loops. While the performance is similar to that of kernel-only modulo scheduling, this mechanism has a number of advantages, including minimal code expansion. Rather than generating fully-scheduled kernels, the compiler generates a sequential form of the modulo scheduled loop body. Using the sequential form, the hardware internally synthesizes the prologue, kernel, and epilogue. In addition, while loops can be scheduled with fewer constraints and fewer explicit prologues/epilogues than with existing mechanisms. Because the hardware controls loop execution, the burden of modulo schedule loop control is lifted from the predicate register file, allowing for a less rigorous predication implementation. Finally; hardware control limits the interrupt latency when using the EQ explicit latency model to the execution latency of one iteration, rather than the whole loop invocation.


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
A. Aiken and A. Nicolau, "A realistic resource-constrained software pipelining algorithm," in Advances in Languages and Compilers for Parallel Processing (A. Nicolau, D. Galernter, T. Gross, and D. Padua, eds.), pp. 274-290, London: Pitman/The MIT Press, 1991.
 
4
5
 
6
B. R. Rau, "Iterative modulo scheduling," International Journal of Parallel Processing, vol. 24, pp. 3-64, February 1996.
7
 
8
Intel Corporation, Intel IA-64 Architecture Software Developer's Manual Volume 1: Application Architecture. Jan 2000.
9
 
10
W. W. Hwu and M. C. Merten, Method and Apparatus for Modulo Scheduled Loop Execution in a Processor Architecture. United States Patent Application, IMPACT Technologies, Inc., December 1999.
11
 
12
Texas Instruments, "TMS320C6000 CPU and instruction set reference guide," Tech. Rep. SPRU169D, Texas, March 1999.
 
13
 
14
 
15
 
16
 
17
W. W. Hwu, R. E. Hank, D. M. Gallagher, S. A. Mahlke, D. M. Lavery, G. E. Haab, J. C. Gyllenhaal, and D. I. August, "Compiler technology for future microprocessors," Proc. of the IEEE, vol. 83, pp. 1625-1995, December 1995.
 
18
 
19
ETSI TC-SMG, "Digital cellular communications system; enhanced full rate (EFR) speech transcoding (GSM 06.60)," Tech. Rep. ETS 300 726, European Telecomm. Standards Institute, Mar. 1997.
20

Collaborative Colleagues:
Matthew C. Merten: colleagues
Wen-mei W. Hwu: colleagues