Dynamic on-line task scheduling on parallel processors
From MaRDI portal
Publication:4538465
Recommendations
- Scheduling parallel processors: Structural properties and optimal policies
- Extremal scheduling of parallel processing with and without real-time constraints
- On-line scheduling of parallel jobs on two machines
- Optimal dynamic scheduling of a general class of parallel-processing queueing systems
- Structural Information and Communication Complexity
Cited in
(18)- Extremal scheduling of parallel processing with and without real-time constraints
- A performance evaluation of several priority policies for parallel processing systems
- Online parallel scheduling of non-uniform tasks: trading failures for energy
- Online Scheduling on a CPU-GPU Cluster
- On-line scheduling to maximize task completions.
- Scheduling multi-stage parallel-processor services to minimize average response time
- On-line multi-threaded scheduling
- Algorithm Theory - SWAT 2004
- Queueing and scheduling in random environments
- Online parallel scheduling of non-uniform tasks: trading failures for energy
- Dynamic routing of real-time jobs among parallel EDF queues: a performance study
- Dynamic scheduling of parallel computations
- Bandwidth-Aware On-Line Scheduling in SMT Multicores
- On Scheduling Policies for Streams of Structured Jobs
- Dynamic load balancing in parallel queueing systems: stability and optimal control
- Parallel Processing and Applied Mathematics
- On-line scheduling policies for a class of IRIS (increasing reward with increasing service) real-time tasks
- Generalized parallel-server fork-join queues with dynamic task scheduling
This page was built for publication: Dynamic on-line task scheduling on parallel processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4538465)
