A new load distribution strategy for linear network with communication delays

In this paper, we propose a new load distribution strategy called 'send-and-receive' for scheduling divisible loads, in a linear network of processors with communication delay. This strategy is designed to optimally utilize the network resources and thereby minimizes the processing time of entire processing load. A closed-form expression for optimal size of load fractions and processing time are derived when the processing load originates at processor located in boundary and interior of the network. A condition on processor and link speed is also derived to ensure that the processors are continuously engaged in load distributions. This paper also presents a parallel implementation of 'digital watermarking problem' on a personal computer-based Pentium Linear Network (PLN) topology. Experiments are carried out to study the performance of the proposed strategy and results are compared with other strategies found in literature.

[1]  Debasish Ghose,et al.  Foreword (Special Issue of Cluster Computing on Divisible Load Scheduling) , 2004, Cluster Computing.

[2]  Gerassimos D. Barlas.  Collection-Aware Optimum Sequencing of Operations and Closed-Form Solutions for the Distribution of a Divisible Load on Arbitrary Processor Trees , 1998, IEEE Trans. Parallel Distributed Syst..

[3]  Yves Robert,et al.  The master-slave paradigm with heterogeneous processors , 2001, Proceedings 42nd IEEE Symposium on Foundations of Computer Science.

[4]  W. J. Dowling,et al.  Watermarking digital images for copyright protection , 1996 .

[5]  Debasish Ghose,et al.  Optimal Sequencing and Arrangement in Distributed Single-Level Tree Networks with Communication Delays , 1994, IEEE Trans. Parallel Distributed Syst..

[6]  Thomas G. Robertazzi,et al.  Distributed computation for a tree network with communication delays , 1990 .

[7]  Debasish Ghose,et al.  Distributed Computation with Communication Delays: Asymptotic Performance Analysis , 1994, J. Parallel Distributed Comput..

[8]  Thomas G. Robertazzi.  Processor equivalence for daisy chain load sharing processors , 1993 .

[9]  Debasish Ghose,et al.  An efficient load distribution strategy for a distributed linear network of processors with communication delays , 1995 .

[10]  Wlodzimierz Glazek.  A Multistage Load Distribution Strategy for Three-Dimensional Meshes , 2004, Cluster Computing.

[11]  T.G. Robertazzi,et al.  Optimal divisible job load sharing for bus networks , 1996, IEEE Transactions on Aerospace and Electronic Systems.

[12]  Markus G. Kuhn,et al.  Information hiding-A survey : Identification and protection of multimedia information , 1999 .

[13]  Yves Robert,et al.  Divisible Load Scheduling , 2009, Introduction to Scheduling.

[14]  Anthony Skjellum,et al.  Using MPI - portable parallel programming with the message-parsing interface , 1994 .

[15]  Markus G. Kuhn,et al.  Information hiding-a survey , 1999, Proc. IEEE.

[16]  Sundaram Suresh,et al.  Parallel implementation of back-propagation algorithm in networks of workstations , 2005, IEEE Transactions on Parallel and Distributed Systems.

[17]  V. Mani.  An Equivalent Tree Network Methodology for Efficient Utilization of Front-Ends in Linear Network , 2004, Cluster Computing.

[18]  Thomas G. Robertazzi,et al.  Bus-oriented load sharing for a network of sensor driven processors , 1991, IEEE Trans. Syst. Man Cybern..

[19]  Maciej Drozdowski,et al.  Scheduling divisible loads in a three-dimensional mesh of processors , 1999, Parallel Comput..

[20]  Hyoung Joong Kim,et al.  Security Evaluation of Generalized Patchwork Algorithm from Cryptanalytic Viewpoint , 2005, KES.

[21]  Sartaj Sahni,et al.  Reconfigurable Mesh Algorithms for the Hough Transform , 1994, J. Parallel Distributed Comput..

[22]  Yuan-Fang Wang,et al.  Image analysis for automated tracking in robot-assisted endoscopic surgery , 1994, Proceedings of 12th International Conference on Pattern Recognition.

[23]  Thomas G. Robertazzi,et al.  Distributed computation with communication delay (distributed intelligent sensor networks) , 1988 .

[24]  Keqin Li.  Parallel Processing of Divisible Loads on Partitionable Static Interconnection Networks , 2004, Cluster Computing.

[25]  Maciej Drozdowski,et al.  Selected problems of scheduling tasks in multiprocessor computer systems , 1997 .

[26]  Debasish Ghose,et al.  Scheduling Divisible Loads in Parallel and Distributed Systems , 1996 .

[27]  Hyoung Joong Kim,et al.  Generalized patchwork algorithm for image watermarking , 2003, Multimedia Systems.

[28]  Jacek Blazewicz,et al.  Scheduling Divisible Jobs on Hypercubes , 1995, Parallel Comput..

[29]  Jacek Blazewicz,et al.  Scheduling a Divisible Task in a Two-dimensional Toroidal Mesh , 1999, Discret. Appl. Math..

[30]  Larry Carter,et al.  Scheduling strategies for master-slave tasking on heterogeneous processor platforms , 2004, IEEE Transactions on Parallel and Distributed Systems.

[31]  Yuan-Fang Wang,et al.  Static Global Scheduling for Optimal Computer Vision and Image Processing Operations on Distributed-Memory Multiprocessors , 1995, CAIP.

[32]  William Gropp,et al.  Skjellum using mpi: portable parallel programming with the message-passing interface , 1994 .