Sciweavers

142 search results - page 24 / 29
» A Constant Propagation Algorithm for Explicitly Parallel Pro...
Sort
View
SPAA
2010
ACM
14 years 2 months ago
Lightweight, robust adaptivity for software transactional memory
When a program uses Software Transactional Memory (STM) to synchronize accesses to shared memory, the performance often depends on which STM implementation is used. Implementation...
Michael F. Spear
WWW
2011
ACM
13 years 4 months ago
Counting triangles and the curse of the last reducer
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...
Siddharth Suri, Sergei Vassilvitskii
ICALP
2009
Springer
14 years 9 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
ESTIMEDIA
2007
Springer
14 years 3 months ago
Leveraging Predicated Execution for Multimedia Processing
—Modern compression standards such as H.264, DivX, or VC-1 provide astonishing quality at the costs of steadily increasing processing requirements. Therefore, efficient solution...
Dietmar Ebner, Florian Brandner, Andreas Krall
IWMM
1992
Springer
100views Hardware» more  IWMM 1992»
14 years 1 months ago
Scalable Distributed Garbage Collection for Systems of Active Objects
Abstract. Automatic storage management is important in highly parallel programming environments where large numbers of objects and processes are being constantly created and discar...
Nalini Venkatasubramanian, Gul Agha, Carolyn L. Ta...