Sciweavers

6105 search results - page 53 / 1221
» A Parallel Algorithm for Bound-Smoothing
Sort
View
HIPC
2009
Springer
14 years 7 months ago
Highly scalable algorithm for distributed real-time text indexing
Stream computing research is moving from terascale to petascale levels. It aims to rapidly analyze data as it streams in from many sources and make decisions with high speed and a...
Ankur Narang, Vikas Agarwal, Monu Kedia, Vijay K. ...
PPOPP
2012
ACM
13 years 5 months ago
Massively parallel breadth first search using a tree-structured memory model
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
Tom St. John, Jack B. Dennis, Guang R. Gao
ARC
2010
Springer
126views Hardware» more  ARC 2010»
14 years 7 months ago
Reconfigurable Communication Networks in a Parametric SIMD Parallel System on Chip
The SIMD parallel systems play a crucial role in the field of intensive signal processing. For most the parallel systems, communication networks are considered as one of the challe...
Mouna Baklouti, Philippe Marquet, Jean-Luc Dekeyse...
TPDS
1998
95views more  TPDS 1998»
14 years 9 months ago
Bound Performance Models of Heterogeneous Parallel Processing Systems
- Systems of heterogeneous parallel processing are studied such as arising in parallel programs executed on distributed systems. A lower and an upper bound model are suggested to o...
Simonetta Balsamo, Lorenzo Donatiello, Nico M. van...
HPCA
2012
IEEE
13 years 5 months ago
Balancing DRAM locality and parallelism in shared memory CMP systems
Modern memory systems rely on spatial locality to provide high bandwidth while minimizing memory device power and cost. The trend of increasing the number of cores that share memo...
Min Kyu Jeong, Doe Hyun Yoon, Dam Sunwoo, Mike Sul...