Sciweavers

291 search results - page 47 / 59
» Profiling over Adaptive Ranges
Sort
View
PPOPP
2010
ACM
14 years 7 months ago
A practical concurrent binary search tree
We propose a concurrent relaxed balance AVL tree algorithm that is fast, scales well, and tolerates contention. It is based on optimistic techniques adapted from software transact...
Nathan Grasso Bronson, Jared Casper, Hassan Chafi,...
GECCO
2009
Springer
141views Optimization» more  GECCO 2009»
14 years 4 months ago
Distributed hyper-heuristics for real parameter optimization
Hyper-heuristics (HHs) are heuristics that work with an arbitrary set of search operators or algorithms and combine these algorithms adaptively to achieve a better performance tha...
Marco Biazzini, Balázs Bánhelyi, Alb...
CLUSTER
2008
IEEE
14 years 4 months ago
Redistribution aware two-step scheduling for mixed-parallel applications
— Applications raising in many scientific fields exhibit both data and task parallelism that have to be exploited efficiently. A classic approach is to structure those applica...
Sascha Hunold, Thomas Rauber, Frédér...
IPPS
2008
IEEE
14 years 4 months ago
Outlier detection in performance data of parallel applications
— When an adaptive software component is employed to select the best-performing implementation for a communication operation at runtime, the correctness of the decision taken str...
Katharina Benkert, Edgar Gabriel, Michael M. Resch
IPPS
2007
IEEE
14 years 4 months ago
A Minimal Access Cost-Based Multimedia Object Replacement Algorithm
Multimedia object caching, by which the same multimedia object can be adapted to diverse mobile appliances through the technique of transcoding, is an important technology for imp...
Keqiu Li, Takashi Nanya, Wenyu Qu