Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007
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.
Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007
Ehud Altman, Kenneth R. Brown, et al.
PRX Quantum
Minkyong Kim, Zhen Liu, et al.
INFOCOM 2008
Kaoutar El Maghraoui, Gokul Kandiraju, et al.
WOSP/SIPEW 2010