Assignment problems in parallel and distributed computing
Assignment problems in parallel and distributed computing
Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
Reconfigurable mesh algorithms for the Hough transform
Journal of Parallel and Distributed Computing
Distributed computation with communication delays: asymptotic performance analysis
Journal of Parallel and Distributed Computing
Performance and Scalability of Preconditioned Conjugate Gradient Methods on Parallel Computers
IEEE Transactions on Parallel and Distributed Systems
Optimal Task Assignment in Homogeneous Networks
IEEE Transactions on Parallel and Distributed Systems
Scheduling Divisible Loads in Parallel and Distributed Systems
Scheduling Divisible Loads in Parallel and Distributed Systems
Performance Metrics: Keeping the Focus on Runtime
IEEE Parallel & Distributed Technology: Systems & Technology
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
IEEE Transactions on Software Engineering
A generalized linear programming based approach to optimal divisible load scheduling
ICDCIT'06 Proceedings of the Third international conference on Distributed Computing and Internet Technology
Hi-index | 0.98 |
Optimal distribution of divisible loads in bus and linear networks is considered in this paper. The problem of minimizing the processing time is investigated by including all the overhead components that could penalize the performance of the system, in addition to the inherent communication and computation delays. In the case of bus networks, closed-form solutions for the processing time are derived and the influence of overheads on the optimal processing time is analyzed. For the first time in this domain of research, the concept of sequencing is realized for the case of bus networks. Through rigorous analysis, an optimal sequence to distribute the load among the processors is identified, whenever it exists. In the case when such an optimal sequence fails to exist, we present an O(m) greedy algorithm to obtain a suboptimal sequence based on some important properties of the overhead factors. In the case of linear networks, we consider two different scenarios, namely, when the processors are equipped with front-end and when they are not equipped with front-end. As in the case of bus networks, here too, necessary and sufficient conditions for the existence of optimal processing time are derived and performance study is carried out. Numerical examples are presented to illustrate the concepts.