Online Version - Last Updated - 20 Jan 2012 |
 |
| Home |
| |
| Procedures and Resources for Authors |
|
| Information and Resources for Volume Editors |
| |
| Orders and Subscriptions |
| |
| Published Articles |
|
| Upcoming Volumes |
| |
| Contact Us |
| |
| Useful External Links |
| |
| CRPIT Site Search |
Parallel Vertex Cover: A Case Study in Dynamic Load Balancing
Weerapurage, D. P., Eblen, J. D., Rogers, G., Langston, M. A.
The significance of dynamic parallel load balancing is considered in the context of fixed parameter tractability. The well known vertex cover problem is used as a case study. Several algorithms are developed and tested on graphs derived from real biological data. Implementations are carried out on the Kraken supercomputer, currently the world’s fastest computational platform for open science. We show that for certain difficult instances of biological data graphs our approach scales well up to 2400 processors.
Cite as: Weerapurage, D. P., Eblen, J. D., Rogers, G., Langston, M. A. (2011). Parallel Vertex Cover: A Case Study in Dynamic Load Balancing. In Proc. Australasian Symposium on Parallel and Distributed Computing (AusPDC 2011) Perth, Australia. CRPIT, 118. Jinjun Chen and Rajiv Ranjan Eds., ACS. 25-32
(from crpit.com)
(local if available)
