Mining Molecular Datasets on Symmetric Multiprocessor Systems

Meinl T, Wörlein M, Fischer I, Philippsen M (2006)

Publication Language: English

Publication Type: Conference contribution, Original article

Publication year: 2006

Publisher: IEEE

City/Town: New York

Pages Range: 1269-1274

Conference Proceedings Title: Proceedings of the 2006 IEEE International Converence on Systems, Man and Cybernetics

Event location: Taipei, Taiwan TW

ISBN: 1-4244-0099-6

URI: http://www2.informatik.uni-erlangen.de/publication/download/SMC2006.pdf

DOI: 10.1109/ICSMC.2006.384889

Abstract

Although in the last few years about a dozen sophisticated algorithms for mining frequent fragments in molecular databases have been proposed, searching big databases with 100,000 compounds and more is still a time-consuming process. Even the currently fastest algorithms like gSpan, FFSM, Gaston, or MoFa require hours to complete their tasks. This paper presents thread-based parallel versions of MoFa [5] and gSpan [26] that achieve speedups up to 11 on a shared-memory SMP system using 12 processors. We discuss the design space of the parallelization, the results, and the obstacles that are caused by the irregular search space and by the current state of Java technology.

Authors with CRIS profile

Marc Wörlein Lehrstuhl für Informatik 2 (Programmiersysteme) Michael Philippsen Lehrstuhl für Informatik 2 (Programmiersysteme)

How to cite

APA:

Meinl, T., Wörlein, M., Fischer, I., & Philippsen, M. (2006). Mining Molecular Datasets on Symmetric Multiprocessor Systems. In Proceedings of the 2006 IEEE International Converence on Systems, Man and Cybernetics (pp. 1269-1274). Taipei, Taiwan, TW: New York: IEEE.

MLA:

Meinl, Thorsten, et al. "Mining Molecular Datasets on Symmetric Multiprocessor Systems." Proceedings of the 2006 IEEE International Conference on Systems, Man and Cybernetics, Taipei, Taiwan New York: IEEE, 2006. 1269-1274.

BibTeX: Download