Performance limits of divisible load processing in systems with limited communication buffers

DOI10.1016/J.JPDC.2004.04.003MaRDI QIDQ1886605zbMATH OpenOpenAlexFDO

Authors M. Drozdowski, Paweł Wolniewicz

Publication date 18 November 2004

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

Full work available at URL https://doi.org/10.1016/j.jpdc.2004.04.003

zbMATH Keywords

Parallel processingPerformance evaluationCommunication bufferCommunication delaysDivisible loadInformation storage and retrievalScheduling and load balancing

Mathematics Subject Classification ID

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

Recommendations

• Optimum divisible load scheduling on heterogeneous stars with limited memory
• Heuristics for multi-round divisible loads scheduling with limited memory
• Distributed processing of divisible jobs with communication startup costs
• Divisible load scheduling in distributed system with buffer constraints: genetic algorithm and linear programming approach
• Parallel Processing and Applied Mathematics

Cited in

(6)

• scientific article; zbMATH DE number 962287 (Why is no real title available?)
• Integrating Amdahl-like Laws and Divisible Load Theory
• scientific article; zbMATH DE number 2096759 (Why is no real title available?)
• Load partitioning and trade-off study for large matrix-vector computations in multicast bus networks with communictaion delays
• Parallel Processing and Applied Mathematics
• Optimizing Data Intensive Flows for Networks on Chips

This page was built for publication: Performance limits of divisible load processing in systems with limited communication buffers

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