2609 search results - page 19 / 522 » Optimizing for parallelism and data locality |
120
click to vote
ASPLOS
1994
ACM
15 years 2 months ago
1994
ACM
In the past decade, processor speed has become significantly faster than memory speed. Small, fast cache memories are designed to overcome this discrepancy, but they are only effe...
115
click to vote
ICPP
1991
IEEE
15 years 1 months ago
1991
IEEE
Data decomposition is probably the most successful method for generating parallel programs. In this paper a general framework is described for the automatic generation of parallel...
TJS
2002
14 years 9 months ago
2002
A significant source for enhancing application performance and for reducing power consumption in embedded processor applications is to improve the usage of the memory hierarchy. In...
IPPS
1998
IEEE
15 years 2 months ago
1998
IEEE
This paper presents reduction recognition and parallel code generationstrategies for distributed-memorymultiprocessors. We describe techniques to recognize a broad range of implic...
LCPC
1994
Springer
15 years 2 months ago
1994
Springer
Data parallel programs are sensitive to the distribution of data across processor nodes. We formulate the reduction of inter-node communication as an optimization on a colored gra...