Sciweavers

914 search results - page 165 / 183
» Assessing the performance limits of parallelized near-thresh...
Sort
View
147
Voted
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 4 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
JCPHY
2011
192views more  JCPHY 2011»
14 years 3 months ago
Fast analysis of molecular dynamics trajectories with graphics processing units - Radial distribution function histogramming
The calculation of radial distribution functions (RDFs) from molecular dynamics trajectory data is a common and computationally expensive analysis task. The rate limiting step in ...
Benjamin G. Levine, John E. Stone, Axel Kohlmeyer
112
Voted
INFOCOM
2005
IEEE
15 years 6 months ago
Reduction of quality (RoQ) attacks on Internet end-systems
— Current computing systems depend on adaptation mechanisms to ensure that they remain in quiescent operating regions. These regions are often defined using efficiency, fairnes...
Mina Guirguis, Azer Bestavros, Ibrahim Matta, Yuti...
SPAA
2006
ACM
15 years 6 months ago
Astronomical real-time streaming signal processing on a Blue Gene/L supercomputer
LOFAR is the first of a new generation of radio telescopes, that combines the signals from many thousands of simple, fixed antennas, rather than from expensive dishes. Its revol...
John W. Romein, P. Chris Broekema, Ellen van Meije...
CODES
2006
IEEE
15 years 6 months ago
Integrated analysis of communicating tasks in MPSoCs
Predicting timing behavior is key to efficient embedded real-time system design and verification. Especially memory accesses and co-processor calls over shared communication net...
Simon Schliecker, Matthias Ivers, Rolf Ernst