Combinatorial parallel and scientific computing.
Journal Article
·
· Proposed for publication as a book chapter in "Parallel Scientific Computing".
OSTI ID:989387
- National Laboratory, Berkeley, CA
Combinatorial algorithms have long played a pivotal enabling role in many applications of parallel computing. Graph algorithms in particular arise in load balancing, scheduling, mapping and many other aspects of the parallelization of irregular applications. These are still active research areas, mostly due to evolving computational techniques and rapidly changing computational platforms. But the relationship between parallel computing and discrete algorithms is much richer than the mere use of graph algorithms to support the parallelization of traditional scientific computations. Important, emerging areas of science are fundamentally discrete, and they are increasingly reliant on the power of parallel computing. Examples include computational biology, scientific data mining, and network analysis. These applications are changing the relationship between discrete algorithms and parallel computing. In addition to their traditional role as enablers of high performance, combinatorial algorithms are now customers for parallel computing. New parallelization techniques for combinatorial algorithms need to be developed to support these nontraditional scientific approaches. This chapter will describe some of the many areas of intersection between discrete algorithms and parallel scientific computing. Due to space limitations, this chapter is not a comprehensive survey, but rather an introduction to a diverse set of techniques and applications with a particular emphasis on work presented at the Eleventh SIAM Conference on Parallel Processing for Scientific Computing. Some topics highly relevant to this chapter (e.g. load balancing) are addressed elsewhere in this book, and so we will not discuss them here.
- Research Organization:
- Sandia National Laboratories
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC04-94AL85000
- OSTI ID:
- 989387
- Report Number(s):
- SAND2005-2347J
- Journal Information:
- Proposed for publication as a book chapter in "Parallel Scientific Computing"., Journal Name: Proposed for publication as a book chapter in "Parallel Scientific Computing".
- Country of Publication:
- United States
- Language:
- English
Similar Records
EXAGRAPH: Graph and combinatorial methods for enabling exascale applications
Combinatorial Algorithms to Enable Computational Science and Engineering: Work from the CSCAPES Institute
Journal Article
·
Wed Sep 29 20:00:00 EDT 2021
· International Journal of High Performance Computing Applications
·
OSTI ID:1823505
Combinatorial Algorithms to Enable Computational Science and Engineering: Work from the CSCAPES Institute
Technical Report
·
Thu Jan 15 23:00:00 EST 2015
·
OSTI ID:1167393