Models and algorithms for coscheduling compute-intensive tasks on a network of workstations

DOI10.1016/0743-7315(92)90015-FzbMath0786.68010MaRDI QIDQ1208582

Howard Jay Siegel, Christina Lock Black, Thomas L. Casavant, Mikhail J. Atallah, Dan Cristian Marinescu

Publication date: 16 May 1993

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

zbMATH Keywords

network of workstationscoscheduling

Mathematics Subject Classification ID

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

Related Items (4)

Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors ⋮ Speedup and efficiency of large-size applications on heterogeneous networks ⋮ Scheduling multiprocessor tasks -- An overview ⋮ GUIDELINES FOR DATA-PARALLEL CYCLE-STEALING IN NETWORKS OF WORKSTATIONS II: ON MAXIMIZING GUARANTEED OUTPUT

This page was built for publication: Models and algorithms for coscheduling compute-intensive tasks on a network of workstations