Bounds on the Scheduling of Typed Task Systems

DOI10.1137/0209040MaRDI QIDQ3900978zbMATH OpenOpenAlexFDO

Authors Jeffrey M. Jaffe

Publication date 1980

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

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

zbMATH Keywords

list schedulingmultiprocessingworst case performance bounds

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Cited in

(6)

• Efficient scheduling of tasks without full use of processor resources
• A new approximation algorithm for UET-scheduling with chain-type precedence constraints.
• Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan
• Performance of Garey-Johnson algorithm for pipelined typed tasks systems
• Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times
• Response time analysis of typed DAG tasks for G-FP scheduling

This page was built for publication: Bounds on the Scheduling of Typed Task Systems

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