Multi-processor scheduling and expanders

DOI10.1016/0020-0190(94)00101-4MaRDI QIDQ1336770zbMATH OpenOpenAlexFDO

Authors N. N. Kuzyurin

Publication date 8 December 1994

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(94)00101-4

zbMATH Keywords

schedulingdirected acyclic graphsexpander

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network design and communication in computer systems (68M10)

Recommendations

• Multiprocessor scheduling and combinatorial configurations
• Scheduling independent multiprocessor tasks
• On multiprocessor system scheduling
• Constructing disjoint paths on expander graphs
• Scheduling Graphs on Two Processors

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3437452 (Why is no real title available?)
• Asymptotically optimal switching circuits
• Better expanders and superconcentrators
• Graph-theoretic properties in computational complexity
• Optimal scheduling for two-processor systems
• Ramanujan graphs
• Sorting in \(c \log n\) parallel steps
• Superconcentrators
• The complexity of testing whether a graph is a superconcentrator

Cited in

(1)

• Multiprocessor scheduling and combinatorial configurations

This page was built for publication: Multi-processor scheduling and expanders

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