Multiprocessor scheduling and combinatorial configurations

DOI10.1515/DMA.1995.5.1.63MaRDI QIDQ4857747zbMATH OpenOpenAlexFDO

Authors N. N. Kuzyurin

Publication date 15 January 1996

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/dma.1995.5.1.63

zbMATH Keywords

directed acyclic graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Multi-processor scheduling and expanders
• Scheduling Graphs on Two Processors
• Scheduling Flat Graphs
• scientific article; zbMATH DE number 850294
• On multiprocessor system scheduling

Cited in

(8)

• Processors selection and traffic splitting in a parallel processors system
• Multi-processor scheduling and expanders
• Guest editorial: Multiprocessor scheduling
• Mixed Integer Programming Approach to Multiprocessor Job Scheduling with Setup Times
• scientific article; zbMATH DE number 67289 (Why is no real title available?)
• Scheduling master-slave multiprocessor systems
• Optimal Combinatorial Functions Comparing Multiprocess Allocation Performance in Multiprocessor Systems
• A composite algorithm for multiprocessor scheduling

This page was built for publication: Multiprocessor scheduling and combinatorial configurations

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