Sciweavers

50 search results - page 9 / 10
» Speeding Up Distributed MapReduce Applications Using Hardwar...
Sort
View
110
Voted
ICC
2011
IEEE
237views Communications» more  ICC 2011»
13 years 9 months ago
Reorganized and Compact DFA for Efficient Regular Expression Matching
—Regular expression matching has become a critical yet challenging technique in content-aware network processing, such as application identification and deep inspection. To meet ...
Kai Wang, Yaxuan Qi, Yibo Xue, Jun Li
CLUSTER
2000
IEEE
15 years 1 months ago
Madeleine II: a Portable and Efficient Communication Library for High-Performance Cluster Computing
This paper introduces MadeleineII, a new adaptive and portable multi-protocol implementation of the Madeleine communication library. MadeleineII has the ability to control multipl...
Olivier Aumage, Luc Bougé, Alexandre Denis,...
IPPS
2010
IEEE
14 years 7 months ago
Large neighborhood local search optimization on graphics processing units
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
Thé Van Luong, Nouredine Melab, El-Ghazali ...
CODES
2005
IEEE
15 years 3 months ago
Aggregating processor free time for energy reduction
Even after carefully tuning the memory characteristics to the application properties and the processor speed, during the execution of real applications there are times when the pr...
Aviral Shrivastava, Eugene Earlie, Nikil D. Dutt, ...
VISUALIZATION
2003
IEEE
15 years 2 months ago
Hierarchical Splatting of Scattered Data
Numerical particle simulations and astronomical observations create huge data sets containing uncorrelated 3D points of varying size. These data sets cannot be visualized interact...
Matthias Hopf, Thomas Ertl