Task Scheduling on a Multiprocessor System with Independent Memories

DOI10.1137/0206014MaRDI QIDQ4120133zbMATH OpenOpenAlexFDO

Authors Dennis Kafura, V. Yun-Shen Shen

Publication date 1977

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0206014

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Formal languages and automata (68Q45)

Cited in

(15)

• Online scheduling of two job types on a set of multipurpose machines with unit processing times
• Approximation scheduling algorithms: a survey
• Fast approximation algorithms for job scheduling with processing set restrictions
• Scheduling parallel machines with inclusive processing set restrictions and job release times
• Scheduling jobs with release and delivery times subject to nested eligibility constraints
• Scheduling uniform machines with restricted assignment
• Parallel machine scheduling with nested processing set restrictions
• Analysis of the Q.A.D. algorithm for an homogeneous multiprocessor computing model with independent memories
• Scheduling unit length jobs on parallel machines with lookahead information
• Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities
• Parallel batch scheduling with nested processing set restrictions
• Multipurpose machine scheduling with rejection and identical job processing times
• Preemptive scheduling algorithms with nested processing set restriction
• Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan
• A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions

This page was built for publication: Task Scheduling on a Multiprocessor System with Independent Memories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4120133)