Sciweavers

720 search results - page 55 / 144
» Uniform Memory Hierarchies
Sort
View
TIT
2008
111views more  TIT 2008»
15 years 4 months ago
The Bounded-Storage Model in the Presence of a Quantum Adversary
An extractor is a function that is used to extract randomness. Given an imperfect random source X and a uniform seed Y , the output (X; Y ) is close to uniform. We study properties...
Robert T. König, Barbara M. Terhal
ETT
2000
106views Education» more  ETT 2000»
15 years 4 months ago
On Union Bounds for Random Serially Concatenated Turbo Codes with Maximum Likelihood Decoding
The input-output weight enumeration (distribution) function of the ensemble of serially concatenated turbo codes is derived, where the ensemble is generated by a uniform choice ov...
Igal Sason, Shlomo Shamai
IPPS
2005
IEEE
15 years 10 months ago
A Cost-Effective Main Memory Organization for Future Servers
Today, the amount of main memory in mid-range servers is pushing practical limits with as much as 192 GB memory in a 24 processor system [21]. Further, with the onset of multi-thr...
Magnus Ekman, Per Stenström
PVM
2009
Springer
15 years 11 months ago
Hierarchical Collectives in MPICH2
Abstract. Most parallel systems on which MPI is used are now hierarchical: some processors are much closer to others in terms of interconnect performance. One of the most common su...
Hao Zhu, David Goodell, William Gropp, Rajeev Thak...
TJS
2008
95views more  TJS 2008»
15 years 4 months ago
Combating I-O bottleneck using prefetching: model, algorithms, and ramifications
Multiple memory models have been proposed to capture the effects of memory hierarchy culminating in the I-O model of Aggarwal and Vitter [?]. More than a decade of architectural a...
Akshat Verma, Sandeep Sen