Sciweavers

1720 search results - page 8 / 344
» Unranking Combinations in Parallel
Sort
View
SPAA
2010
ACM
14 years 9 days ago
Flat combining and the synchronization-parallelism tradeoff
Traditional data structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. We introduce a new synchronization paradi...
Danny Hendler, Itai Incze, Nir Shavit, Moran Tzafr...
PPOPP
2012
ACM
12 years 3 months ago
PARRAY: a unifying array representation for heterogeneous parallelism
This paper introduces a programming interface called PARRAY (or Parallelizing ARRAYs) that supports system-level succinct programming for heterogeneous parallel systems like GPU c...
Yifeng Chen, Xiang Cui, Hong Mei
ICS
2009
Tsinghua U.
14 years 2 months ago
Combining thread level speculation helper threads and runahead execution
With the current trend toward multicore architectures, improved execution performance can no longer be obtained via traditional single-thread instruction level parallelism (ILP), ...
Polychronis Xekalakis, Nikolas Ioannou, Marcelo Ci...
WDAG
2010
Springer
182views Algorithms» more  WDAG 2010»
13 years 5 months ago
Scalable Flat-Combining Based Synchronous Queues
In a synchronous queue, producers and consumers handshake to exchange data. Recently, new scalable unfair synchronous queues were added to the Java JDK 6.0 to support high performa...
Danny Hendler, Itai Incze, Nir Shavit, Moran Tzafr...
IPPS
2009
IEEE
14 years 2 months ago
Combining multiple heuristics on discrete resources
—In this work we study the portfolio problem which is to find a good combination of multiple heuristics to solve given instances on parallel resources in minimum time. The resou...
Marin Bougeret, Pierre-François Dutot, Alfr...