Sciweavers

2703 search results - page 124 / 541
» Optimizing memory transactions
Sort
View
ISSS
1999
IEEE
89views Hardware» more  ISSS 1999»
14 years 1 months ago
Loop Scheduling and Partitions for Hiding Memory Latencies
Partition Scheduling with Prefetching (PSP) is a memory latency hiding technique which combines the loop pipelining technique with data prefetching. In PSP, the iteration space is...
Fei Chen, Edwin Hsing-Mean Sha
ISSS
1996
IEEE
134views Hardware» more  ISSS 1996»
14 years 1 months ago
ADOPT: Efficient Hardware Address Generation in Distributed Memory Architectures
An address generation and optimization environment (ADOPT) for distributed memory architectures, is presented. ADOPT is oriented to minimize the area overhead introduced by the us...
Miguel Miranda, Francky Catthoor, Martin Janssen, ...
FOCS
1990
IEEE
14 years 28 days ago
Uniform Memory Hierarchies
We present several e cient algorithms for sorting on the uniform memory hierarchy UMH, introduced by Alpern, Carter, and Feig, and its parallelization P-UMH. We give optimal and ne...
Bowen Alpern, Larry Carter, Ephraim Feig
BC
2000
69views more  BC 2000»
13 years 8 months ago
Stochastic resonance in the speed of memory retrieval
The stochastic resonance (SR) phenomenon in human cognition (memory retrieval speed for arithmetical multiplication rules) is addressed in a behavioral and neurocomputational study...
Marius Usher, Mario Feingold
ICPP
1995
IEEE
14 years 13 days ago
Sorting and Selection on Distributed Memory Bus Computers
In this paper we study the problems of sorting and selection on the Distributed Memory Bus Computer (DMBC) recently introduced by Sahni. In particular we present: 1) An efficient a...
Sanguthevar Rajasekaran, Sartaj Sahni