Sciweavers

27 search results - page 1 / 6
» Possibilities to Solve the Clique Problem by Thread Parallel...
Sort
View
IPPS
2005
IEEE
13 years 10 months ago
Possibilities to Solve the Clique Problem by Thread Parallelism using Task Pools
We construct parallel algorithms with implementations to solve the clique problem in practice and research their computing time compared with sequential algorithms. The parallel a...
Holger Blaar, Thomas Lange, Renate Winter, Marcel ...
ISCA
2009
IEEE
318views Hardware» more  ISCA 2009»
13 years 11 months ago
Thread criticality predictors for dynamic performance, power, and resource management in chip multiprocessors
With the shift towards chip multiprocessors (CMPs), exploiting and managing parallelism has become a central problem in computer systems. Many issues of parallelism management boi...
Abhishek Bhattacharjee, Margaret Martonosi
JAVA
2000
Springer
13 years 8 months ago
A Java fork/join framework
This paper describes the design, implementation, and performance of a Java framework for supporting a style of parallel programming in which problems are solved by (recursively) s...
Doug Lea
TACAS
2012
Springer
316views Algorithms» more  TACAS 2012»
11 years 12 months ago
Compositional Termination Proofs for Multi-threaded Programs
Abstract. Automated verification of multi-threaded programs is difficult. Direct treatment of all possible thread interleavings by reasoning about the program globally is a prohib...
Corneliu Popeea, Andrey Rybalchenko
MICRO
2002
IEEE
164views Hardware» more  MICRO 2002»
13 years 9 months ago
A quantitative framework for automated pre-execution thread selection
Pre-execution attacks cache misses for which conventional address-prediction driven prefetching is ineffective. In pre-execution, copies of cache miss computations are isolated fr...
Amir Roth, Gurindar S. Sohi