SCHEDULING INTERVAL ORDERS IN PARALLEL

DOI10.1080/10637199608915542zbMath1049.68535OpenAlexW2149204009MaRDI QIDQ4820141

Ernst W. Mayr

Publication date: 6 October 2004

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10637199608915542

Mathematics Subject Classification ID

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

Related Items (1)

An efficient parallel algorithm for scheduling interval ordered tasks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• NP-complete scheduling problems
• Incidence matrices and interval graphs
• Optimal scheduling for two-processor systems
• Binary Trees and Parallel Scheduling Algorithms
• Two Processor Scheduling is in $\mathcal{NC}$
• Parallel Merge Sort
• Fast Parallel Algorithms for Chordal Graphs
• Scheduling Interval-Ordered Tasks
• Computer-Aided complexity classification of combinational problems
• Parallelism in random access machines
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph

This page was built for publication: SCHEDULING INTERVAL ORDERS IN PARALLEL