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
Distributed processing of divisible jobs with communication startup costs
GO-II Meeting Proceedings of the second international colloquium on Graphs and optimization
Journal of Parallel and Distributed Computing
Scheduling Divisible Loads in Parallel and Distributed Systems
Scheduling Divisible Loads in Parallel and Distributed Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Performance Metrics: Keeping the Focus on Runtime
IEEE Parallel & Distributed Technology: Systems & Technology
On the Granularity and Clustering of Directed Acyclic Task Graphs
IEEE Transactions on Parallel and Distributed Systems
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
Transmission Rates and Performance of a Network of Computers
HPCN Europe 1994 Proceedings of the nternational Conference and Exhibition on High-Performance Computing and Networking Volume II: Networking and Tools
Static Global Scheduling for Optimal Computer Vision and Image Processing Operations on Distributed-Memory Multiprocessor
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
IEEE Transactions on Parallel and Distributed Systems
Comment on "A Novel Data Distribution Technique for Host-Client Type Parallel Applications'
IEEE Transactions on Parallel and Distributed Systems
Multiround Algorithms for Scheduling Divisible Loads
IEEE Transactions on Parallel and Distributed Systems
HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
Journal of Parallel and Distributed Computing
Journal of Parallel and Distributed Computing
Improved Methods for Divisible Load Distribution on k-Dimensional Meshes Using Multi-Installment
IEEE Transactions on Parallel and Distributed Systems
An equivalent network for divisible load scheduling in nonblocking mode of communication
Computers & Mathematics with Applications
Dynamic resource allocation of computer clusters with probabilistic workloads
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Inter-round scheduling for divisible workload applications
ICA3PP'05 Proceedings of the 6th international conference on Algorithms and Architectures for Parallel Processing
ACSAC'05 Proceedings of the 10th Asia-Pacific conference on Advances in Computer Systems Architecture
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
Computing BLAS level-2 operations on workstation clusters using the divisible load paradigm
Mathematical and Computer Modelling: An International Journal
Hi-index | 0.00 |
Optimal distribution of divisible loads in bus 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. These overheads are considered to be constant additive factors to the respective communication and computation components. Closed-form solution for the processing time is derived and the influence of overheads on the optimal processing time is analyzed. We derive a necessary and sufficient condition for the existence of the optimal processing time. We then study the effect of changing the load distribution sequence on the time performance. Through rigorous analysis, an optimal sequence to distribute the load among the processors is identified, whenever it exists. In case such an optimal sequence fails to exist, we present a greedy algorithm to obtain a suboptimal sequence based on some important properties of the overhead factors. Then, the effect of granularity of the data that is divisible is considered in the analysis for the case of homogeneous networks. An integer approximation algorithm capable of generating integer values of the load fractions in time $O(m)$, where $m$ is the number of processors in the network, is proposed. We then show that the upper bound on the suboptimal solution generated by our algorithm lies within a radius given by the sum of the computation and communication delays. Several numerical examples are presented to illustrate the concepts.