论文信息 - A Distributed Load Balancing Scheme for Data Parallel Applications

A Distributed Load Balancing Scheme for Data Parallel Applications

In data parallel applications, a major source of load trnbalance is in the uneven didribtitton of data between the nodes. The majar contribution of this paper is the analysis o j a new distributed Ioad balancing scheme based on random probing. Sequential probing was shown to create hot spot problems. Random probing, on the other hand, avoids these hot spots problems. We hove modeled this load balancing scheme bath anaiytically and experimentally. Distributed Hash Joan was used as an example application. The experimenls were done on a BEN TC2OOO rnulttprocessov- system.

Sakti Pramanik | Walid R. Tout | S. Pramanik

[1] Hongjun Lu,et al. Hash-based join algorithms for multiprocessor computers with shared memory , 1990, VLDB 1990.

[2] R. Sarnath,et al. Proceedings of the International Conference on Parallel Processing , 1992 .

[3] S. B. Yao,et al. Approximating block accesses in database organizations , 1977, CACM.

[4] Christopher B. Walton. Four Types of Data Skew and Their Effect on Parallel Join Performance , 1990 .

[5] Evangelos P. Markatos,et al. Shared memory vs. message passing in shared-memory multiprocessors , 1992, [1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing.