Efficient scheduling of tasks without full use of processor resources

DOI10.1016/0304-3975(80)90002-XzbMath0446.68027MaRDI QIDQ1145998

Jeffrey M. Jaffe

Publication date: 1980

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

efficient scheduling of taskspreemptive schedules

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (7)

An improved monotone algorithm for scheduling related machines with precedence constraints ⋮ Efficient scheduling of tasks without full use of processor resources ⋮ Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations ⋮ A monotone approximation algorithm for scheduling with precedence constraints ⋮ Polynomial time approximation algorithms for machine scheduling: Ten open problems ⋮ On-line scheduling with precedence constraints ⋮ A note on on-line scheduling with precedence constraints on identical machines

Cites Work

• Unnamed Item
• Efficient scheduling of tasks without full use of processor resources
• Performance analysis of multiprocessor systems containing functionally dedicated processors
• An Analysis of Preemptive Multiprocessor Job Scheduling
• Bounds for List Schedules on Uniform Processors
• Bounds on the Scheduling of Typed Task Systems
• Algorithms for Scheduling Tasks on Unrelated Processors
• Exact and Approximate Algorithms for Scheduling Nonidentical Processors
• Bounds for LPT Schedules on Uniform Processors
• A Level Algorithm for Preemptive Scheduling
• Optimal Preemptive Scheduling on Two-Processor Systems
• Bounds on Multiprocessing Timing Anomalies
• On a multiplexing scheme for threshold logical elements
• Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems

This page was built for publication: Efficient scheduling of tasks without full use of processor resources