Sciweavers

87 search results - page 12 / 18
» Exploiting Postdominance for Speculative Parallelization
Sort
View
HPCA
2011
IEEE
13 years 1 months ago
Calvin: Deterministic or not? Free will to choose
Most shared memory systems maximize performance by unpredictably resolving memory races. Unpredictable memory races can lead to nondeterminism in parallel programs, which can suff...
Derek Hower, Polina Dudnik, Mark D. Hill, David A....
IPPS
2007
IEEE
14 years 4 months ago
Scheduling Issues in Optimistic Parallelization
Irregular applications, which rely on pointer-based data structures, are often difficult to parallelize. The inputdependent nature of their execution means that traditional paral...
Milind Kulkarni, Keshav Pingali
ICPADS
2005
IEEE
14 years 3 months ago
A Parallel Implementation of 2-D/3-D Image Registration for Computer-Assisted Surgery
: Image registration is a technique usually used for aligning two different images taken at different times and/or from different viewing points. A key challenge for medical image ...
Fumihiko Ino, Yasuhiro Kawasaki, Takahito Tashiro,...
VLDB
2005
ACM
113views Database» more  VLDB 2005»
14 years 3 months ago
Optimistic Intra-Transaction Parallelism on Chip Multiprocessors
With the advent of chip multiprocessors, exploiting intra-transaction parallelism is an attractive way of improving transaction performance. However, exploiting intra-transaction ...
Christopher B. Colohan, Anastassia Ailamaki, J. Gr...
CF
2006
ACM
14 years 4 months ago
Kilo-instruction processors, runahead and prefetching
There is a continuous research effort devoted to overcome the memory wall problem. Prefetching is one of the most frequently used techniques. A prefetch mechanism anticipates the ...
Tanausú Ramírez, Alex Pajuelo, Olive...