3202 search results - page 372 / 641 » Memory access scheduling |
160
click to vote
IPPS
2006
IEEE
16 years 20 days ago
2006
IEEE
High-performance computing clusters running longlived tasks currently cannot have kernel software updates applied to them without causing system downtime. These clusters miss oppo...
155
click to vote
SPAA
2006
ACM
16 years 18 days ago
2006
ACM
We present a technique for analyzing the number of cache misses incurred by multithreaded cache oblivious algorithms on an idealized parallel machine in which each processor has a...
176
click to vote
SPAA
2006
ACM
16 years 18 days ago
2006
ACM
Suppose we have a parallel or distributed system whose nodes have limited capacities, such as processing speed, bandwidth, memory, or disk space. How does the performance of the s...
176
click to vote
DSD
2002
IEEE
15 years 11 months ago
2002
IEEE
Modern microprocessors schedule instructions dynamically in order to exploit instruction-level parallelism. It is necessary to increase instruction window size for improving instr...
140
click to vote
EPIA
1999
Springer
15 years 11 months ago
1999
Springer
YapOr is an or-parallel system that extends the Yap Prolog system to exploit implicit or-parallelism in Prolog programs. It is based on the environment copying model, as first imp...