3202 search results - page 312 / 641 » Memory access scheduling |
137
click to vote
SAMOS
2007
Springer
16 years 23 days ago
2007
Springer
In this paper we describe an efficient data fetch circuitry for retrieving several operands from a n-bank interleaved memory system in a single machine cycle. The proposed address ...
205
click to vote
ISCAS
2005
IEEE
16 years 7 days ago
2005
IEEE
—This paper presents a memory-conscious mapping methodology of computational intensive applications on coarse-grain reconfigurable arrays. By exploiting the inherent abundant amo...
141
click to vote
SOFTVIS
2005
ACM
16 years 6 days ago
2005
ACM
Programming in parallel is an error-prone and complex task compounded by the lack of tool support for both programming and debugging. Recent advances in compiler-directed shared m...
193
click to vote
ESA
2004
Springer
16 years 1 days ago
2004
Springer
Sample sort, a generalization of quicksort that partitions the input into many pieces, is known as the best practical comparison based sorting algorithm for distributed memory para...
163
click to vote
POPL
1998
ACM
15 years 11 months ago
1998
ACM
Memory expansions are classical means to extract parallelism from imperative programs. However, for dynamic control programs with general memory accesses, such transformations eit...