Multi-processor scheduling and expanders

DOI10.1016/0020-0190(94)00101-4zbMATH Open0820.68020OpenAlexW2061781795MaRDI QIDQ1336770FDOQ1336770

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

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

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)

Cites Work

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

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)