Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
Distributed computation with communication delays: asymptotic performance analysis
Journal of Parallel and Distributed Computing
Applied cryptography (2nd ed.): protocols, algorithms, and source code in C
Applied cryptography (2nd ed.): protocols, algorithms, and source code in C
Journal of Parallel and Distributed Computing
Parallel Processor Configuration Design with Processing/Transmission Costs
IEEE Transactions on Computers
Scheduling Divisible Loads in Parallel and Distributed Systems
Scheduling Divisible Loads in Parallel and Distributed Systems
Image Processing: The Fundamentals
Image Processing: The Fundamentals
Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing a Divisible Job
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
Optimizing Computing Costs Using Divisible Load Analysis
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
Resource-Aware Distributed Scheduling Strategies for Large-Scale Computational Cluster/Grid Systems
IEEE Transactions on Parallel and Distributed Systems
An equivalent network for divisible load scheduling in nonblocking mode of communication
Computers & Mathematics with Applications
A new algorithm for divisible load scheduling with different processor available times
ACIIDS'10 Proceedings of the Second international conference on Intelligent information and database systems: Part I
New method for scheduling heterogeneous multi-installment systems
Future Generation Computer Systems
Computing BLAS level-2 operations on workstation clusters using the divisible load paradigm
Mathematical and Computer Modelling: An International Journal
Hi-index | 0.00 |
A new model for divisible load problem is introduced. Its characteristics are analyzed. Optimal load distribution algorithms on the new model are presented for the tree-network and linear network. Applications that fit our model are briefly described. We show that our model outperforms the existing model such as Cheng–Robertazzi model. We show that the linear model is equivalent to a single-level tree network if the intermediate processors do not follow the store-and-forward communication model, but they follow the store-and-bypass model. This paper introduces the concept of store-and-bypass for divisible load theory.