1761 search results - page 109 / 353 » Parallel timing simulation on a distributed memory multiproc... |
124
click to vote
IPPS
1998
IEEE
15 years 5 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
123
click to vote
IPPS
2010
IEEE
14 years 11 months ago
2010
IEEE
We develop a widely applicable algorithm to solve the fault diagnosis problem in certain distributed-memory multiprocessor systems in which there are a limited number of faulty pr...
115
Voted
EUROPAR
2008
Springer
15 years 2 months ago
2008
Springer
Cache affinity between a process and a processor is observed when the processor cache has accumulated some amount of the process state, i.e., data or instructions. Cache affinity i...
104
Voted
PVM
2004
Springer
15 years 6 months ago
2004
Springer
On recent PC graphics cards, fully programmable parallel geometry and pixel units are available providing powerful instruction sets to perform arithmetic and logical operations. In...
95
Voted
IPPS
1996
IEEE
15 years 5 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...