Distributing and scheduling divisible task on parallel communicating processors.

DOI10.1007/BF02960769MaRDI QIDQ1433958zbMATH OpenFDO

Authors Guodong Li, Defu Zhang

Publication date 1 July 2004

Published in Journal of Computer Science and Technology (Search for Journal in Brave)

zbMATH Keywords

network topologyNetwork Spanning Tree

Mathematics Subject Classification ID

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

Recommendations

• Divisible task scheduling -- concept and verification: Special issue on task scheduling problems for parallel and distributed systems
• Scheduling a divisible task in a two-dimensional toroidal mesh
• Optimum divisible load scheduling on heterogeneous stars with limited memory
• Distributed processing of divisible jobs with communication startup costs
• scientific article; zbMATH DE number 1222838

Cites work

• scientific article; zbMATH DE number 962287 (Why is no real title available?)
• Closed form solutions for bus and tree networks of processors load sharing a divisible job
• Divisible task scheduling -- concept and verification: Special issue on task scheduling problems for parallel and distributed systems
• Scheduling a divisible task in a two-dimensional toroidal mesh
• Scheduling divisible loads in a three-dimensional mesh of processors.

Cited in

(1)

• Scheduling a divisible task in a two-dimensional toroidal mesh

This page was built for publication: Distributing and scheduling divisible task on parallel communicating processors.

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