Possibilities to Solve the Clique Problem by Thread Parallelism using Task Pools

Authors:
Holger Blaar;Thomas Lange;Renate Winter;Marcel Karnstedt
Affiliations:
Martin-Luther-Universität Halle-Wittenberg, Germany;Martin-Luther-Universität Halle-Wittenberg, Germany;Martin-Luther-Universität Halle-Wittenberg, Germany;Technische Universität Ilmenau, Germany
Venue:
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 5 - Volume 06
Year:
2005

Citing 9
Cited 1

Java Threads

Java Threads
Programming with POSIX threads

Programming with POSIX threads
Graph classes: a survey

Graph classes: a survey
Solaris internals: core kernel architecture

Solaris internals: core kernel architecture
Algorithm 457: finding all cliques of an undirected graph

Communications of the ACM
Scalable Shared-Memory Multiprocessing

Scalable Shared-Memory Multiprocessing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Efficiency of Thread-Parallel Java Programs from Scientific Computing

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Combinatorial Algorithms: Theory and Practice

Combinatorial Algorithms: Theory and Practice

Parallelization strategies to deal with non-localities in the calculation of regional land-surface parameters

Computers & Geosciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We construct parallel algorithms with implementations to solve the clique problem in practice and research their computing time compared with sequential algorithms. The parallel algorithms are implemented in Java using threads. Best efficiency is achieved by solving the problem of task scheduling by using task pools.