ACM Home Page
Please provide us with feedback. Feedback
Dynamic vectorization: a mechanism for exploiting far-flung ILP in ordinary programs
Full text PdfPdf (103 KB)
Source International Symposium on Computer Architecture archive
Proceedings of the 26th annual international symposium on Computer architecture table of contents
Atlanta, Georgia, United States
Pages: 16 - 27  
Year of Publication: 1999
ISBN:0-7695-0170-2
Also published in ...
Authors
Sriram Vajapeyam  Supercomputer Education and Research Centre and Dept. of Computer Science & Automation, Indian Institute of Science, Bangalore, India 560012
P. J. Joseph  Dept. of Computer Science & Automation, Indian Institute of Science, Bangalore, India 560012
Tulika Mitra  SUNY, Stony Brook and Dept. of Computer Science & Automation, Indian Institute of Science, Bangalore, India 560012
Sponsors
IEEE-CS\TCCA : TC on Computer Arhitecture
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
IEEE Computer Society  Washington, DC, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 29,   Citation Count: 4
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

Several ILP limit studies indicate the presence of considerable ILP across dynamically far-apart instructions in program execution. This paper proposes a hardware mechanism, dynamic vectorization (DV), as a tool for quickly building up a large logical instruction window. Dynamic vectorization converts repetitive dynamic instruction sequences into vector form, enabling the processing of instructions from beyond the corresponding program loop to be overlapped with the loop. This enables vector-like execution of programs with relatively complex static control flow that may not be amenable to static, compile time vectorization. Experimental evaluation shows that a large fraction of the dynamic instructions of four of the six SPECInt92 programs can be captured in vector form. Three of these programs exhibit significant potential for ILP improvements from dynamic vectorization, with speedups of more than a factor of 2 in a scenario of realistic branch prediction and perfect memory disambiguation. Under perfect branch prediction conditions, a fourth program also shows well over a factor of 2 speedup from DV. The speedups are due to the overlap of post-loop processing with loop processing.


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
 
4
Tulika Mitra, "Performance Evaluation of Improved Superscalar Issue Mechanisms," M.E. Project Report, January 1997.
5
6
 
7
Matthew A. Postiff, David Greene, Gary Tyson, and Trevor Mudge, "The Limits of Instruction Level Parallelism in SPEC95 Applications," in INTERACT.3: The Third Workshop on Interaction Between Compilers and Computer Architectures, San Jose, CA, October 1998.
 
8
9
10
11
 
12
13
 
14
H.C. Young and J. R. Goodman, "The Design of a Queue-Based Vector Supercomputer," Int'i Conf. on Parallel Processing, 1986.


Collaborative Colleagues:
Sriram Vajapeyam: colleagues
P. J. Joseph: colleagues
Tulika Mitra: colleagues