Scheduling Interval Ordered Tasks in Parallel

DOI10.1006/JAGM.1997.0895MaRDI QIDQ4377120zbMATH OpenOpenAlexFDO

Authors S. Sunder, Xin He

Publication date 19 July 1998

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1997.0895

zbMATH Keywords

NC algorithmscheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 512819
• An efficient parallel algorithm for scheduling interval ordered tasks
• scientific article; zbMATH DE number 1759465
• Scheduling interval orders with communication delays in parallel
• Scheduling interval ordered tasks with non-uniform deadlines
• Scheduling for parallel processing
• scientific article; zbMATH DE number 838793
• Scheduling with constrained processor allocation for interval orders
• Scheduling parallel tasks with individual deadlines
• Scheduling parallel tasks with individual deadlines

Cited in

(8)

• Optimal scheduling on parallel machines for a new order class
• Scheduling interval orders with communication delays in parallel
• Scheduling with constrained processor allocation for interval orders
• Scheduling Sequential Loops on Parallel Processors
• scientific article; zbMATH DE number 512819 (Why is no real title available?)
• scientific article; zbMATH DE number 512916 (Why is no real title available?)
• scientific article; zbMATH DE number 1759465 (Why is no real title available?)
• An efficient parallel algorithm for scheduling interval ordered tasks

This page was built for publication: Scheduling Interval Ordered Tasks in Parallel

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