Pages that link to "Item:Q4863982"
From MaRDI portal
The following pages link to An Approximation Algorithm for Preemptive Scheduling on Parallel-Task Systems (Q4863982):
Displaying 16 items.
- Preemptive scheduling on a small number of hierarchical machines (Q924724) (← links)
- On the two-phase method for preemptive scheduling (Q1107434) (← links)
- Analysis of the list scheduling algorithm for precedence constrained parallel tasks (Q1304383) (← links)
- Nearly on line scheduling of preemptive independent tasks (Q1346697) (← links)
- Computing optimal preemptive schedules for parallel tasks: linear programming approaches (Q1396837) (← links)
- An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems (Q1607020) (← links)
- On preemptive scheduling: A general setting for the two-phase method (Q1917267) (← links)
- Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing (Q2168774) (← links)
- Preemptive Scheduling of a Multiprocessor System with Memories to Minimize Maximum Lateness (Q3340134) (← links)
- (Q3680271) (← links)
- Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time (Q3777447) (← links)
- Bounding the Power of Preemption in Randomized Scheduling (Q4210081) (← links)
- (Q4473911) (← links)
- (Q4536380) (← links)
- (Q4737537) (← links)
- Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness (Q5961604) (← links)