1536 search results - page 193 / 308 » DPS - Dynamic Parallel Schedules |
136
click to vote
IPPS
2003
IEEE
15 years 9 months ago
2003
IEEE
In systems consisting of multiple clusters of processors which employ space sharing for scheduling jobs, such as our Distributed ASCI1 Supercomputer (DAS), coallocation, i.e., the...
118
click to vote
IPPS
2003
IEEE
15 years 9 months ago
2003
IEEE
In this paper, we consider the problem of scheduling independent identical tasks on heterogeneous processors where communication times and processing times are different. We assum...
138
Voted
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
This paper presents efficient all-to-all broadcast algorithms for arbitrary irregular networks with switch-based wormhole interconnection and unicast message passing. First, all-t...
130
Voted
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
In a real-time system, tasks are constrained by global endto-end (E-T-E) deadlines. In order to cater for high task schedulability, these deadlines must be distributed over compon...
112
Voted
SPAA
1993
ACM
15 years 7 months ago
1993
ACM
We consider several natural broadcasting problems for the LogP model of distributed memory machines recently proposed by Culler et al. For each of these problems, we present algor...