论文信息 - Possibilities to solve the clique problem by thread parallelism using task pools

Possibilities to solve the clique problem by thread parallelism using task pools

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.

[1] A. Brandstädt,et al. Graph Classes: A Survey , 1987 .

[2] Hans Jürgen Prömel,et al. Lectures on Proof Verification and Approximation Algorithms , 1998, Lecture Notes in Computer Science.

[3] Richard McDougall,et al. Solaris internals : core kernel components , 2001 .

[4] E. Reingold,et al. Combinatorial Algorithms: Theory and Practice , 1977 .

[5] Richard McDougall,et al. Solaris Internals: Core Kernel Architecture , 2000 .

[6] Daniel E. Lenoski,et al. Scalable Shared-Memory Multiprocessing , 1995 .

[7] Roland Vollmar,et al. Modelle der Parallelverarbeitung , 1995 .

[8] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9] Thomas Rauber,et al. Efficiency of thread-parallel Java programs from scientific computing , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[10] Scott Oaks,et al. Java Threads , 1997 .

[11] Klaus Simon. Effiziente Algorithmen für perfekte Graphen , 1992, Leitfäden und Monographien der Informatik.

[12] C. Bron,et al. Algorithm 457: finding all cliques of an undirected graph , 1973 .

[13] Thomas Rauber,et al. Parallele und verteilte Programmierung , 2000 .

[14] A. Nijenhuis. Combinatorial algorithms , 1975 .

[15] David R. Butenhof. Programming with POSIX threads , 1993 .