Scheduling parallel processors: Structural properties and optimal policies

DOI10.1016/0895-7177(96)00066-0zbMath0856.90058OpenAlexW1986874545MaRDI QIDQ1922196

D. D. Yao, Cheng-Shang Chang, Randolph Nelson

Publication date: 15 September 1996

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0895-7177(96)00066-0

zbMATH Keywords

convexitysubmodularitysubadditivityparallel processorsmax-plusfully parallel or fully sequentialthreshold structure

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Subadditive ergodic theory
• Rearrangement, Majorization and Stochastic Scheduling
• Subadditivity, Generalized Products of Random Matrices and Operations Research
• Acyclic fork-join queuing networks
• A new ordering for stochastic majorization: theory and applications
• Minimizing a Submodular Function on a Lattice
• Bounds on the speedup and efficiency of partial synchronization in parallel processing systems
• The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds
• On the exponentiality of stochastic linear systems under the max-plus algebra
• Inequalities: theory of majorization and its applications

This page was built for publication: Scheduling parallel processors: Structural properties and optimal policies