DocumentCode
3021492
Title
Possibilities to solve the clique problem by thread parallelism using task pools
Author
Blaar, Holger ; Lange, Thomas ; Winter, Renate ; Karnstedt, Marcel
Author_Institution
Inst. fur Informatik, Martin-Luther-Univ., Halle-Wittenberg, Germany
fYear
2005
fDate
4-8 April 2005
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.
Keywords
Java; computational complexity; multi-threading; optimisation; parallel algorithms; scheduling; Java; NP-complete; clique problem solving; computational complexity; optimisation; parallel algorithm; task pools; task scheduling; thread parallelism; Concurrent computing; Java; NP-complete problem; Parallel algorithms; Parallel processing; Phase change random access memory; Polynomials; Processor scheduling; Turing machines; Yarn;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Processing Symposium, 2005. Proceedings. 19th IEEE International
Print_ISBN
0-7695-2312-9
Type
conf
DOI
10.1109/IPDPS.2005.345
Filename
1420069
Link To Document