Khaled A.S. Abdel-Ghaffar
IEEE Trans. Inf. Theory
We consider the problem of mining association rules on a shared-nothing multiprocessor. We present three algorithms that explore a spectrum of trade-offs between computation, communication, memory usage, synchronization, and the use of problem-specific information. The best algorithm exhibits near perfect scaleup behavior, yet requires only minimal overhead compared to the current best serial algorithm. ©1996 IEEE.
Khaled A.S. Abdel-Ghaffar
IEEE Trans. Inf. Theory
Thomas M. Cover
IEEE Trans. Inf. Theory
Arun Viswanathan, Nancy Feldman, et al.
IEEE Communications Magazine
Alessandro Morari, Roberto Gioiosa, et al.
IPDPS 2011