GUIDELINES FOR DATA-PARALLEL CYCLE-STEALING IN NETWORKS OF WORKSTATIONS II: ON MAXIMIZING GUARANTEED OUTPUT

DOI10.1142/S0129054100000107zbMath1319.68045OpenAlexW2085280855MaRDI QIDQ5249035

Arnold L. Rosenberg

Publication date: 29 April 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054100000107

zbMATH Keywords

networks of workstationscluster computingparallel schedulingcycle-stealingquality of service guarantees

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

General scheduling non-approximability results in presence of hierarchical communications ⋮ Static strategies for worksharing with unrecoverable interruptions

Cites Work

• Models and algorithms for coscheduling compute-intensive tasks on a network of workstations
• Towards an Architecture-Independent Analysis of Parallel Algorithms

This page was built for publication: GUIDELINES FOR DATA-PARALLEL CYCLE-STEALING IN NETWORKS OF WORKSTATIONS II: ON MAXIMIZING GUARANTEED OUTPUT