1536 search results - page 93 / 308 » DPS - Dynamic Parallel Schedules |
125
click to vote
JSA
2000
15 years 3 months ago
2000
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...
172
click to vote
CONCUR
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. The technique of partial order reduction (POR) for probabilistic model checking prunes the state space of the model so that a maximizing scheduler and a minimizing one pe...
111
click to vote
IPPS
2006
IEEE
15 years 9 months ago
2006
IEEE
The recurring real-time task model was recently proposed as a model for real-time processes that contain code with conditional branches. In this paper, we present a necessary and ...
117
click to vote
ICPP
2003
IEEE
15 years 8 months ago
2003
IEEE
The bus that connects processors to memory is known to be a major architectural bottleneck in SMPs. However, both software and scheduling policies for these systems generally focu...
125
click to vote
HOTI
2002
IEEE
15 years 8 months ago
2002
IEEE
We present an architecture and hardware for scheduling gigabit packet streams in server clusters that combines a Network Processor datapath and an FPGA for use in server NICs and ...