An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems
From MaRDI portal
Publication:1607020
DOI10.1016/S0020-0190(99)00151-9zbMath0999.68022MaRDI QIDQ1607020
Ramesh Krishnamurti, Daya Ram Gaur
Publication date: 25 July 2002
Published in: Information Processing Letters (Search for Journal in Brave)
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Related Items (1)
Cites Work
- Preemptive scheduling of independent jobs on a hypercube
- Scheduling multiprocessor tasks on three dedicated processors
- Complexity of scheduling multiprocessor tasks with prespecified processors allocations
- An approximation scheme for scheduling independent jobs into subcubes of a hypercube of fixed dimension
- An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems
- Scheduling with Deadlines and Loss Functions
- Scheduling Multiprocessor Tasks to Minimize Schedule Length
- Complexity of Scheduling Parallel Task Systems
- Open Shop Scheduling to Minimize Finish Time
- A Level Algorithm for Preemptive Scheduling
- Preemptive Scheduling of Uniform Processor Systems
- Complexity Results for Multiprocessor Scheduling under Resource Constraints
- An Approximation Algorithm for Preemptive Scheduling on Parallel-Task Systems
- Scheduling Jobs on Several Machines with the Job Splitting Property
This page was built for publication: An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems
