An Approximation Algorithm for Preemptive Scheduling on Parallel-Task Systems
From MaRDI portal
Publication:4863982
DOI10.1137/S0895480191221829zbMATH Open0845.68009MaRDI QIDQ4863982FDOQ4863982
Authors: Ramesh Krishnamurti, Bhagirath Narahari 
Publication date: 15 September 1996
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Recommendations
- Approximation algorithms for general parallel task scheduling
- General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time
- An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems
- scientific article; zbMATH DE number 2080263
- Scheduling independent multiprocessor tasks
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Number-theoretic algorithms; complexity (11Y16)
Cited In (16)
- Preemptive Scheduling of a Multiprocessor System with Memories to Minimize Maximum Lateness
- Analysis of the list scheduling algorithm for precedence constrained parallel tasks
- An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems
- On preemptive scheduling: A general setting for the two-phase method
- Nearly on line scheduling of preemptive independent tasks
- Title not available (Why is that?)
- On the two-phase method for preemptive scheduling
- Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness
- Computing optimal preemptive schedules for parallel tasks: linear programming approaches
- Preemptive scheduling on a small number of hierarchical machines
- Title not available (Why is that?)
- Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bounding the Power of Preemption in Randomized Scheduling
- Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
This page was built for publication: An Approximation Algorithm for Preemptive Scheduling on Parallel-Task Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4863982)
