15 search results - page 1 / 3 » Eliminating graphs by means of parallel knock-out schemes |
DAM
2007
13 years 5 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
TCS
2008
13 years 5 months ago
2008
We consider computational complexity questions related to parallel knock-out schemes for graphs. In such schemes, in each round, each remaining vertex of a given graph eliminates ...
IPPS
2006
IEEE
13 years 11 months ago
2006
IEEE
This paper presents an efficient modeling scheme and a partitioning heuristic for parallelizing VLSI post-placement timing optimization. Encoding the paths with timing violations...
IPPS
1996
IEEE
13 years 9 months ago
1996
IEEE
Many irregular scientific computing problems can be modeled by directed acyclic task graphs (DAGs). In this paper, we present an efficient run-time system for executing general as...
HPDC
2007
IEEE
13 years 11 months ago
2007
IEEE
This paper describes a novel approach to generate an optimized schedule to run threads on distributed shared memory (DSM) systems. The approach relies upon a binary instrumentatio...