Distributing an Exact Algorithm for Maximum Clique: Maximising the Costup

McCreesh, C. and Prosser, P. (2012) Distributing an Exact Algorithm for Maximum Clique: Maximising the Costup. Technical Report. School of Computing Science, University of Glasgow.

Full text not currently available from Enlighten.

Publisher's URL: http://www.dcs.gla.ac.uk/publications/paperdetails.cfm?id=9395

Abstract

We take an existing implementation of an algorithm for the maximum clique problem and modify it so that we can distribute it over an ad- hoc cluster of machines. Our goal was to achieve a significant speedup in performance with minimal development effort, i.e. a maximum costup. We present a simple modification to a state-of-the-art exact algorithm for maximum clique that allows us to distribute it across many machines. An empirical study over large hard benchmarks shows that speedups of an order of magnitude are routine for 25 or more machines.

Item Type:Research Reports or Papers (Technical Report)
Additional Information:DCS Tech Report Number: TR-2012-334 Paper ID: 9395 Appeared in: SoCS Technical Report Series
Status:Published
Glasgow Author(s) Enlighten ID:Prosser, Dr Patrick and Mccreesh, Dr Ciaran
Authors: McCreesh, C., and Prosser, P.
College/School:College of Science and Engineering > School of Computing Science
Publisher:School of Computing Science, University of Glasgow

University Staff: Request a correction | Enlighten Editors: Update this record