TY - GEN
T1 - A novel parallel algorithm for enumerating combinations
AU - Zhou, B. B.
AU - Brent, R. P.
AU - Qu, X.
AU - Liang, W. F.
N1 - Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].
PY - 1996
Y1 - 1996
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/84944727085
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-84944727085&origin=recordpage
U2 - 10.1109/ICPP.1996.539062
DO - 10.1109/ICPP.1996.539062
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 081867623
VL - 2
T3 - Proceedings of the International Conference on Parallel Processing
SP - II70-II73
BT - Algorithms and Applications
PB - IEEE
T2 - 25th International Conference on Parallel Processing, ICPP 1996
Y2 - 12 August 1996 through 16 August 1996
ER -