Sciweavers

148 search results - page 14 / 30
» Exploiting Parallelism for Hard Problems in Abstract Argumen...
Sort
View
PARLE
1994
13 years 11 months ago
Using Reference Counters in Update-Based Coherent Memory
Abstract. As the disparity between processor and memory speed continues to widen, the exploitation of locality of reference in shared-memory multiprocessors becomes an increasingly...
Evangelos P. Markatos, Catherine E. Chronaki
LCPC
2004
Springer
14 years 25 days ago
A Geometric Approach for Partitioning N-Dimensional Non-rectangular Iteration Spaces
Abstract. Parallel loops account for the greatest percentage of program parallelism. The degree to which parallelism can be exploited and the amount of overhead involved during par...
Arun Kejariwal, Paolo D'Alberto, Alexandru Nicolau...
CAV
2000
Springer
89views Hardware» more  CAV 2000»
13 years 12 months ago
Tuning SAT Checkers for Bounded Model Checking
Abstract. Bounded Model Checking based on SAT methods has recently been introduced as a complementary technique to BDD-based Symbolic Model Checking. The basic idea is to search fo...
Ofer Strichman
IPPS
2010
IEEE
13 years 5 months ago
Hybrid MPI/Pthreads parallelization of the RAxML phylogenetics code
Abstract--A hybrid MPI/Pthreads parallelization was implemented in the RAxML phylogenetics code. New MPI code was added to the existing Pthreads production code to exploit parallel...
Wayne Pfeiffer, Alexandros Stamatakis
EUROPAR
2010
Springer
13 years 6 months ago
A Language-Based Tuning Mechanism for Task and Pipeline Parallelism
Abstract. Current multicore computers differ in many hardware aspects. Tuning parallel applications is indispensable to achieve best performance on a particular hardware platform....
Frank Otto, Christoph A. Schaefer, Matthias Dempe,...