DocumentCode
301793
Title
A novel parallel algorithm for enumerating combinations
Author
Zhou, Bing Bing ; Brent, R.P. ; Qu, Xiaohui ; Liang, W.F.
Author_Institution
Comput. Sci. Lab., Australian Nat. Univ., Canberra, ACT
Volume
2
fYear
1996
fDate
12-16 Aug 1996
Firstpage
70
Abstract
We propose a new algorithm for parallel enumeration of combinations. This algorithm uses N processing elements (or PEs). We prove that, if N and M are relatively prime, each PE will do the same operations and generate the same number of distinct combinations so that the computational load is well balanced. The algorithm has an important application in solving the problem of fault tolerance in replicated file systems
Keywords
fault tolerant computing; parallel algorithms; replicated databases; combinations enumeration; computational load; fault tolerance; parallel algorithm; processing elements; replicated file systems; Australia; Computer science; Concurrent computing; Fault tolerant systems; File systems; Parallel algorithms; Parallel processing;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel Processing, 1996. Vol.3. Software., Proceedings of the 1996 International Conference on
Conference_Location
Ithaca, NY
ISSN
0190-3918
Print_ISBN
0-8186-7623-X
Type
conf
DOI
10.1109/ICPP.1996.539062
Filename
539062
Link To Document