## Publication - A Parallel Algorithm for Computing Borders |

Publications |

Auteurs : Hanusse Nicolas, Maabout Sofian Conf : 20th Conference on Information and Knowledge Management (CIKM?11) 24-28 octobre,Glasgow, Ecosse (2011) Web : http://dl.acm.org/citation.cfm?doid=2063576.2063814 The In this paper we propose a general parallel algorithm for computing borders whatever the application is. We prove the efficiency of our algorithm by showing that: (i) it generates exactly the same number of candidates as the standard sequential algorithm and, (ii) if the interestingness test time of a candidate is bounded by Δ then for a multi-processor shared memory machine with p cores, we prove that the total interestingness time T |