SCHEDULING INTERVAL ORDERS IN PARALLEL

DOI10.1080/10637199608915542MaRDI QIDQ4820141zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3877239 (Why is no real title available?)
• scientific article; zbMATH DE number 3900151 (Why is no real title available?)
• scientific article; zbMATH DE number 3965452 (Why is no real title available?)
• scientific article; zbMATH DE number 4049080 (Why is no real title available?)
• scientific article; zbMATH DE number 512819 (Why is no real title available?)
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
• Binary Trees and Parallel Scheduling Algorithms
• Computer-Aided complexity classification of combinational problems
• Fast Parallel Algorithms for Chordal Graphs
• Incidence matrices and interval graphs
• NP-complete scheduling problems
• Optimal scheduling for two-processor systems
• Parallel Merge Sort
• Parallelism in random access machines
• Scheduling Interval-Ordered Tasks
• Two Processor Scheduling is in $\mathcal{NC}$

Cited in

(1)

• An efficient parallel algorithm for scheduling interval ordered tasks

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

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