Scheduling divisible loads in a three-dimensional mesh of processors.

DOI10.1016/S0167-8191(99)00004-6MaRDI QIDQ1606861zbMATH OpenFDO

Authors M. Drozdowski, Włodzimierz Głazek

Publication date 25 July 2002

Published in Parallel Computing (Search for Journal in Brave)

zbMATH Keywords

communicating processors

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2096759
• Distributed processing of divisible jobs with communication startup costs
• scientific article; zbMATH DE number 962287
• Scheduling divisible loads in bus networks with arbitrary processor release times
• Scheduling a divisible task in a two-dimensional toroidal mesh

Cited in

(9)

• Communication scheduling in data gathering networks with limited memory
• A product form solution for tree networks with divisible loads
• scientific article; zbMATH DE number 2096759 (Why is no real title available?)
• Distributing and scheduling divisible task on parallel communicating processors.
• A new load distribution strategy for linear network with communication delays
• Scheduling a divisible task in a two-dimensional toroidal mesh
• Computing BLAS level-2 operations on workstation clusters using the divisible load paradigm
• Scheduling multilayer divisible computations
• An equivalent network for divisible load scheduling in nonblocking mode of communication

This page was built for publication: Scheduling divisible loads in a three-dimensional mesh of processors.

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