The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - April (1991 vol.2)
pp: 138-148
ABSTRACT
<p>Compile-time techniques for storage allocation of scalar values into memory modules that limit run-time memory-access conflicts are presented. The allocation approach is applicable to those operands in instructions that can be predicted at compile-time, where an instruction is composed of the multiple operations and corresponding operands that execute in parallel. Algorithms to schedule data transfers among memory modules to avoid conflicts that cannot be eliminated by the distribution of values alone are developed. The techniques have been implemented as part of a compiler for a reconfigurable long instruction word architecture. Results of experiments are presented demonstrating that a very high percentage of memory access conflicts can be avoided by scheduling a very low number of data transfers.</p>
INDEX TERMS
Index Termsstorage allocation; scalar values; data transfers; compiler; reconfigurable long instructionword architecture; memory access conflicts; parallel processing; program compilers;storage allocation
CITATION
R. Gupta, M.L. Soffa, "Compile-Time Techniques for Improving Scalar Access Performance in Parallel Memories", IEEE Transactions on Parallel & Distributed Systems, vol.2, no. 2, pp. 138-148, April 1991, doi:10.1109/71.89060
25 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool