82 search results - page 4 / 17 » Parallel static and dynamic multi-constraint graph partition... |
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
- Processor scheduling in distributed-memory systems has received considerable attention in recent years. Several commercial distributed-memory systems use spacesharing processor s...
ICPP
1997
IEEE
13 years 11 months ago
1997
IEEE
Abstract—This paper describes an algorithm for deriving data and computation partitions on scalable shared memory multiprocessors. The algorithm establishes affinity relationshi...
ICPP
1993
IEEE
13 years 11 months ago
1993
IEEE
Task graphs are used for scheduling tasks on parallel processors when the tasks have dependencies. If the execution of the program is known ahead of time, then the tasks can be st...
IPPS
2006
IEEE
14 years 1 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
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract--NABBIT is a work-stealing library for execution of task graphs with arbitrary dependencies which is implemented as a library for the multithreaded programming language Ci...