DocumentCode :
3696949
Title :
Critical Node Detection Problem Solving on GPU and in the Cloud
Author :
Cholpon Degenbaeva;Matthias Klusch
Author_Institution :
Saarland Univ., Saarbrucken, Germany
fYear :
2015
Firstpage :
52
Lastpage :
57
Abstract :
The Critical Node Detection Problem (CNDP) is a well-known NP-complete, graph-theoretical problem with many real-world applications in various fields such as social network analysis, supply-chain network analysis, transport engineering, network immunization, and military strategic planning. Wepresent the first parallel algorithms for CNDP solving in general, and for fast, approximated CND on GPU and in the cloudin particular. Finally, we discuss results of our experimental performance analysis of these solutions.
Keywords :
"Graphics processing units","Approximation algorithms","Runtime","Parallel algorithms","Data structures","Electronic mail"
Publisher :
ieee
Conference_Titel :
High Performance Computing and Communications (HPCC), 2015 IEEE 7th International Symposium on Cyberspace Safety and Security (CSS), 2015 IEEE 12th International Conferen on Embedded Software and Systems (ICESS), 2015 IEEE 17th International Conference on
Type :
conf
DOI :
10.1109/HPCC-CSS-ICESS.2015.8
Filename :
7336143
Link To Document :
بازگشت