Task Scheduling on a Multiprocessor System with Independent Memories
From MaRDI portal
Publication:4120133
DOI10.1137/0206014zbMath0349.68027MaRDI QIDQ4120133
V. Yun-Shen Shen, Dennis Kafura
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
Related Items
Fast approximation algorithms for job scheduling with processing set restrictions, Scheduling unit length jobs on parallel machines with lookahead information, Scheduling parallel machines with inclusive processing set restrictions and job release times, Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities, Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan, Online scheduling of two job types on a set of multipurpose machines with unit processing times, Multipurpose machine scheduling with rejection and identical job processing times, Scheduling jobs with release and delivery times subject to nested eligibility constraints, Parallel batch scheduling with nested processing set restrictions, Parallel machine scheduling with nested processing set restrictions, Scheduling uniform machines with restricted assignment, A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions, PREEMPTIVE SCHEDULING ALGORITHMS WITH NESTED PROCESSING SET RESTRICTION, Analysis of the Q.A.D. algorithm for an homogeneous multiprocessor computing model with independent memories, Approximation scheduling algorithms: a survey
