Sciweavers

4747 search results - page 3 / 950
» Shuffle Memory System
Sort
View
JDA
2008
100views more  JDA 2008»
13 years 7 months ago
Efficient sampling of random permutations
We show how to uniformly distribute data at random (not to be confounded with permutation routing) in two settings that are able to deal with massive data: coarse grained parallel...
Jens Gustedt
DATE
2006
IEEE
134views Hardware» more  DATE 2006»
14 years 1 months ago
ASIP-based multiprocessor SoC design for simple and double binary turbo decoding
This paper presents a new multiprocessor platform for high throughput turbo decoding. The proposed platform is based on a new configurable ASIP combined with an efficient memory a...
Olivier Muller, Amer Baghdadi, Michel Jéz&e...
ISCA
2012
IEEE
274views Hardware» more  ISCA 2012»
11 years 9 months ago
The dynamic granularity memory system
Chip multiprocessors enable continued performance scaling with increasingly many cores per chip. As the throughput of computation outpaces available memory bandwidth, however, the...
Doe Hyun Yoon, Min Kyu Jeong, Michael Sullivan, Ma...
IPPS
2009
IEEE
14 years 2 months ago
High-order stencil computations on multicore clusters
Stencil computation (SC) is of critical importance for broad scientific and engineering applications. However, it is a challenge to optimize complex, highorder SC on emerging clus...
Liu Peng, Richard Seymour, Ken-ichi Nomura, Rajiv ...
ACMDIS
2006
ACM
13 years 11 months ago
Randomness as a resource for design
Randomness is being harnessed in the design of some interactive systems. This is observed in random blogs, random web searching, and in particular Apple's iPod Shuffle. Yet t...
Tuck Wah Leong, Frank Vetere, Steve Howard