Scheduling multiprocessor tasks with chain constraints

DOI10.1016/0377-2217(96)00126-9MaRDI QIDQ1278298zbMATHOpenAlexWikidataFDO

Authors Zhen Liu, Jacek Blazewicz

Publication date 22 February 1999

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(96)00126-9

zbMATH Keywords

parallel computationschedulingprecedence constraintmultiprocessor task

Mathematics Subject Classification ID

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

Recommendations

• Scheduling Multiprocessor Tasks to Minimize Schedule Length
• On the complexity of multiprocessor task scheduling
• Linear and quadratic algorithms for scheduling chains and opposite chains
• Scheduling three chains on two parallel machines

Cites work

• scientific article; zbMATH DE number 3754389 (Why is no real title available?)
• scientific article; zbMATH DE number 108110 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3561065 (Why is no real title available?)
• scientific article; zbMATH DE number 3633982 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Complexity of Scheduling Parallel Task Systems
• Concurrent Task Systems
• Multiprocessor scheduling with communication delays
• On general routing problems
• Optimal scheduling for two-processor systems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Preemptive scheduling with variable profile, precedence constraints and due dates
• Scheduling Multiprocessor Tasks to Minimize Schedule Length
• Scheduling independent 2-processor tasks to minimize schedule length
• Scheduling independent multiprocessor tasks on a uniform \(k\)-processor system
• Scheduling independent two processor tasks on a uniform duo-processor system
• Scheduling subject to resource constraints: Classification and complexity
• Scheduling with deadlines and loss functions

Cited in

(15)

• Packing-based branch-and-bound for discrete malleable task scheduling
• Scheduling Multiprocessor Tasks to Minimize Schedule Length
• Chains and trees: `Strong' -- `weak' order in job scheduling
• CHAIN STRUCTURES IN SCHEDULES TASKS
• Approximation schemes for scheduling jobs with chain precedence constraints
• Scheduling multiprocessor tasks on parallel processors with limited availability.
• A note on scheduling multiprocessor tasks with precedence constraints on parallel processors
• Scheduling groups of tasks with precedence constraints on three dedicated processors.
• A Simplified Anomaly and Reduction for Precedence Constrained Multiprocessor Scheduling
• Linear and quadratic algorithms for scheduling chains and opposite chains
• Scheduling multiprocessor tasks on two parallel processors
• Scheduling with semaphore constraints
• Scheduling three chains on two parallel machines
• Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width
• Scheduling chained multiprocessor tasks onto large multiprocessor system

This page was built for publication: Scheduling multiprocessor tasks with chain constraints

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