1536 search results - page 187 / 308 » DPS - Dynamic Parallel Schedules |
124
Voted
PODC
2005
ACM
15 years 9 months ago
2005
ACM
Deadlock detection scheduling is an important, yet oft-overlooked problem that can significantly affect the overall performance of deadlock handling. An excessive initiation of ...
164
Voted
SPAA
1999
ACM
15 years 8 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
114
Voted
IPPS
1998
IEEE
15 years 8 months ago
1998
IEEE
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
140
click to vote
CJ
1999
15 years 3 months ago
1999
We present a compiler optimization approach that uses the simulated evolution (SE) paradigm to enhance the finish time of heuristically scheduled computations with communication t...
159
Voted
IPPS
2010
IEEE
15 years 1 months ago
2010
IEEE
We study three scheduling problems (file redistribution, independent tasks scheduling and broadcasting) on large scale heterogeneous platforms under the Bounded Multi-port Model. I...