Design of the Force Field Task Assignment Method and Associated Performance Evaluation for Desktop Grids

In the case of desktop grids, a single hardware-determined latency and constant bandwidth between processors cannot be assumed without incurring in unnecessary error. The actual network topology is determined not only by the physical hardware, but also by the instantaneous bandwidth availability for parallel processes to communicate. In this paper we present a novel task assignment scheme which takes the dynamic network topology into consideration along with the traditionally evaluated variables such as processor availability and potential. The method performs increasingly better as the grid size increases.

[1]  Michael T. Goodrich,et al.  Communication-efficient parallel sorting (preliminary version) , 1996, STOC '96.

[2]  Y. Charlie Hu,et al.  A Self-Organizing Flock of Condors , 2003, ACM/IEEE SC 2003 Conference (SC'03).

[3]  Leslie G. Valiant,et al.  A bridging model for parallel computation , 1990, CACM.

[4]  Mihalis Yannakakis,et al.  Towards an Architecture-Independent Analysis of Parallel Algorithms , 1990, SIAM J. Comput..

[5]  Richard M. Karp,et al.  Scheduling Parallel Communication: The h-relation Problem , 1995, MFCS.

[6]  Peter Druschel,et al.  Exploiting network proximity in peer-to-peer overlay networks , 2002 .

[7]  Andrew A. Chien,et al.  Henri Casanova , 2022 .

[8]  Ronald Sujithan.  Towards a Scalable Parallel Object Database { the Bulk Synchronous Parallel Approach , 1996 .

[9]  Ian Foster,et al.  The Grid 2 - Blueprint for a New Computing Infrastructure, Second Edition , 1998, The Grid 2, 2nd Edition.

[10]  Friedhelm Meyer auf der Heide,et al.  Truly Efficient Parallel Algorithms: 1-optimal Multisearch for an Extension of the BSP Model , 1998, Theor. Comput. Sci..

[11]  Ami Marowka,et al.  The GRID: Blueprint for a New Computing Infrastructure , 2000, Parallel Distributed Comput. Pract..

[12]  Stanford R. Amstutz,et al.  Distributed Instelligence in Data Communications Networks , 1971, Computer.

[13]  Hai Zhuge.  The Future Interconnection Environment , 2005, Computer.

[14]  Ian T. Foster,et al.  Globus: a Metacomputing Infrastructure Toolkit , 1997, Int. J. High Perform. Comput. Appl..

[15]  Michael T. Goodrich,et al.  Communication-Efficient Parallel Sorting , 1999, SIAM J. Comput..

[16]  Paolo Calafiura,et al.  General-Purpose Parallel Computing in a High-Energy Physics Experiment at CERN , 1996, HPCN Europe.

[17]  William A. Briggs.  Algorithm 248: netflow [H] , 1965, Commun. ACM.

[18]  Hai Zhuge.  The Future Interconnection , 2005 .

[19]  Ramesh Subramonian,et al.  LogP: towards a realistic model of parallel computation , 1993, PPOPP '93.

[20]  William F. McColl,et al.  Scalable Computing , 1995, Computer Science Today.

[21]  Miron Livny,et al.  Condor-a hunter of idle workstations , 1988, [1988] Proceedings. The 8th International Conference on Distributed.

[22]  Jonathan Schaeffer,et al.  Parallel Sorting by Regular Sampling , 1992, J. Parallel Distributed Comput..

[23]  Alexander Tiskin,et al.  A New Way to Divide and Conquer , 2001, Parallel Process. Lett..

[24]  Samuel T. Chanson,et al.  Hydrodynamic Load Balancing , 1999, IEEE Trans. Parallel Distributed Syst..