|
ABSTRACT
The paper suggests an algorithm for token-based adaptive load balancing for dynamically parallel computations on multicomputer platforms. The proposed algorithm for load balance is initiated and performed by the idle or under-loaded processes and requires token message circulating among the parallel processes and bearing information about the load distribution throughout the system. The efficiency of the algorithm is estimated for the case study of Sam Loyd's puzzle utilizing parallel version of branch-and-bound search algorithm with depth-first search strategy. The experimental study is based on flat parallel program implementations. Speedup and efficiency of the parallel system are estimated as well as scalability of the application workload and the multicomputer size.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Koip P., Parallel Algorithms for Combinatorial Search Problems, University of Massachusetts, 2005
|
| |
2
|
Grama A., A. Gupta, G. Kapyris, V. Kumar, Introduction to Parallel Computing, Addison Wesley, 2003.
|
| |
3
|
Raghavan P., Parallel Combinatorial Search, California, 2005.
|
| |
4
|
|
| |
5
|
Borovska P., Parallel Combinatorial Search on Computer Cluster: Sam Loyd's Puzzle, International Conference on Computer Systems and Technologies -- CompSysTech'06, 2006.
|
 |
6
|
|
| |
7
|
|
| |
8
|
|
| |
9
|
Borovska P., Efficiency of Load Balancing Methods on Multicomputer Platforms, Forth International Scientific Conference "Challenges in Higher Education and Research", June 2006, Sozopol, Bulgaria, Heron Press, Sofia, ISBN 954-580-206-5, pp.42--46.
|
|