Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length

DOI10.1137/0402016MaRDI QIDQ3826356zbMATH OpenOpenAlexFDO

Authors Jian-Zhong Du, Joseph Y.-T. Leung

Publication date 1989

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

minimum length schedulemultiprocessor schedulingn tasksnonpreemptive schedulingtree- structured precedence relationtwo identical processors

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)

Recommendations

• Scheduling independent 2-processor tasks to minimize schedule length
• Scheduling Multiprocessor Tasks to Minimize Schedule Length
• Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints
• Scheduling trees with large communication delays on two identical processors
• Scheduling tree-structured tasks with restricted execution times
• scientific article; zbMATH DE number 1185302
• Scheduling Graphs on Two Processors
• Optimal scheduling for two-processor systems
• Scheduling complete intrees on two uniform processors with communication delays
• Scheduling multiprocessor tasks on two parallel processors

Cited in

(13)

• Scheduling lots of dependent unit-time operations on identical machines to minimize schedule length
• Scheduling tree-structured tasks with restricted execution times
• Using an eraser or a pencil for two-processor scheduling
• Minimizing the overhead for some tree-scheduling problems
• Scheduling complete intrees on two uniform processors with communication delays
• Scheduling of resource tasks
• scientific article; zbMATH DE number 4016581 (Why is no real title available?)
• Hu's precedence tree scheduling algorithm: A simple proof
• Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints
• scientific article; zbMATH DE number 3900151 (Why is no real title available?)
• b9000A 1/4 approximate algorithm for P2/tree/Cmax
• Scheduling task-tree with additive scales on parallel/distributed machines
• An efficient algorithm for finding ideal schedules

This page was built for publication: Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length

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