Joel L. Wolf, Mark S. Squillante, et al.
IEEE Transactions on Knowledge and Data Engineering
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.
Joel L. Wolf, Mark S. Squillante, et al.
IEEE Transactions on Knowledge and Data Engineering
Alessandro Morari, Roberto Gioiosa, et al.
IPDPS 2011
Matthias Kaiserswerth
IEEE/ACM Transactions on Networking
Fan Jing Meng, Ying Huang, et al.
ICEBE 2007