DocumentCode
1999577
Title
Revisiting a Pattern for Processing Combinatorial Objects in Parallel
Author
Trefftz, Christian ; Scripps, Jerry
Author_Institution
Sch. of Comput., Grand Valley State Univ., Allendale, MI, USA
fYear
2013
fDate
20-24 May 2013
Firstpage
1889
Lastpage
1893
Abstract
The unrank pattern to process combinatorial objects in parallel is revisited. The pattern is applied to find, in parallel, solutions to a restricted version of the community finding problem on small graphs. Performance results obtained on a shared memory machine, a cluster of workstations and a Graphical Processing Unit (GPU) are included.
Keywords
graphics processing units; object-oriented methods; parallel programming; shared memory systems; GPU; combinatorial objects; community finding problem; graphical processing unit; parallel programming; shared memory machine; unrank pattern; Communities; Graphics processing units; Measurement; Parallel algorithms; Partitioning algorithms; Community Finding; Parallel Processing; Partitions;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Processing Symposium Workshops & PhD Forum (IPDPSW), 2013 IEEE 27th International
Conference_Location
Cambridge, MA
Print_ISBN
978-0-7695-4979-8
Type
conf
DOI
10.1109/IPDPSW.2013.123
Filename
6651090
Link To Document