Multi-processor scheduling and expanders

DOI10.1016/0020-0190(94)00101-4zbMath0820.68020OpenAlexW2061781795MaRDI QIDQ1336770

Nikolaj Nikolaevich 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

schedulingexpanderdirected acyclic graphs

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Sorting in \(c \log n\) parallel steps
• Ramanujan graphs
• The complexity of testing whether a graph is a superconcentrator
• Asymptotically optimal switching circuits
• Graph-theoretic properties in computational complexity
• Optimal scheduling for two-processor systems
• Better expanders and superconcentrators
• Superconcentrators

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