DocumentCode
1612145
Title
Memory bandwidth optimizations for wide-bus machines
Author
Alexander, Michael A. ; Bailey, Mark W. ; Childers, Bruce R. ; Davidson, Jack W. ; Jinturkar, Sanjay
Author_Institution
Dept. of Comput. Sci., Virginia Univ., Charlottesville, VA, USA
fYear
1993
Firstpage
466
Abstract
The authors describe and evaluate the effectiveness of some code improvement techniques that are designed to take advantage of wide-bus machines (WBMs): that is, a microprocessor with a memory bus width at least twice the size of the integer data type handled by the processor and assumed by the programmer. They discuss some compiler optimizations that take advantage of the increased bandwidth available from a wide bus. The investigations show that WBMs can expect reduction in memory bus cycles on the order of 5 to 15%. Using new code improvement algorithms designed to exploit the availability of a wide bus, the studies show that, for many memory-insensitive algorithms, it is possible to reduce the number of memory loads and stores by 30 to 40%.
Keywords
computer architecture; microcomputers; WBMs; code improvement; code improvement algorithms; memory bandwidth optimisation; memory bus cycles; memory bus width; memory-insensitive algorithms; microprocessor; wide-bus machines; Algorithm design and analysis; Bandwidth; Computer science; Hardware; Lifting equipment; Microprocessors; Optimizing compilers; Performance gain; Process design; Programming profession; Random access memory; Technological innovation;
fLanguage
English
Publisher
ieee
Conference_Titel
System Sciences, 1993, Proceeding of the Twenty-Sixth Hawaii International Conference on
Print_ISBN
0-8186-3230-5
Type
conf
DOI
10.1109/HICSS.1993.270618
Filename
270618
Link To Document