3321 search results - page 260 / 665 » Performance of parallel computations with dynamic processor ... |
175
click to vote
ISCC
2005
IEEE
16 years 5 days ago
2005
IEEE
—A framework for designing a family of novel fast CRC generation algorithms is presented. Our algorithms can ideally read arbitrarily large amounts of data at a time, while optim...
181
click to vote
HPCA
2004
IEEE
16 years 7 months ago
2004
IEEE
Data communications between producer instructions and consumer instructions through memory incur extra delays that degrade processor performance. In this paper, we introduce a new...
207
click to vote
HPDC
2012
IEEE
13 years 9 months ago
2012
IEEE
Many storage systems are shared by multiple clients with different types of workloads and performance targets. To achieve performance targets without over-provisioning, a system ...
213
click to vote
SPAA
1996
ACM
15 years 10 months ago
1996
ACM
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
162
click to vote
IPL
1998
15 years 6 months ago
1998
We propose, and justify, an economic theory to guide memory system design, operation, and analysis. Our theory treats memory random-access latency, and its cost per installed mega...