loading...
Possibilities to Solve the Clique Problem by Thread Parallelism using Task Pools
Denver, Colorado April 04-April 08
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IPDPS.2005.34519th IEEE International Parallel and ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Holger Blaar, Thomas Lange, Renate Winter, Marcel Karnstedt, "Possibilities to Solve the Clique Problem by Thread Parallelism using Task Pools," Parallel and Distributed Processing Symposium, International, vol. 6, pp. 185a, 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 5, 2005.
 
 
BibTex
x
 
@article{ 10.1109/IPDPS.2005.345,
author = {Holger Blaar and Thomas Lange and Renate Winter and Marcel Karnstedt},
title = {Possibilities to Solve the Clique Problem by Thread Parallelism using Task Pools},
journal ={Parallel and Distributed Processing Symposium, International},
volume = {6},
year = {2005},
issn = {1530-2075},
pages = {185a},
doi = {http://doi.ieeecomputersociety.org/10.1109/IPDPS.2005.345},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel and Distributed Processing Symposium, International
TI - Possibilities to Solve the Clique Problem by Thread Parallelism using Task Pools
SN - 1530-2075
SP
EP
A1 - Holger Blaar,
A1 - Thomas Lange,
A1 - Renate Winter,
A1 - Marcel Karnstedt,
PY - 2005
KW - null
VL - 6
JA - Parallel and Distributed Processing Symposium, International
ER -
 
Holger Blaar, Martin-Luther-Universit?t Halle-Wittenberg, Germany
Thomas Lange, Martin-Luther-Universit?t Halle-Wittenberg, Germany
Renate Winter, Martin-Luther-Universit?t Halle-Wittenberg, Germany
Marcel Karnstedt, Technische Universit?t Ilmenau, Germany
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.
Citation:
Holger Blaar, Thomas Lange, Renate Winter, Marcel Karnstedt, "Possibilities to Solve the Clique Problem by Thread Parallelism using Task Pools," ipdps, vol. 6, pp.185a, 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 5, 2005
Usage of this product signifies your acceptance of the Terms of Use.