Combinatorial Scientific Computing explores the latest research on creating algorithms and software tools to solve key combinatorial problems on large-scale high-performance computing architectures. It includes contributions from international researchers who are pioneers in designing software and applications for high-performance computing systems. The book offers a state-of-the-art overview of the latest research, tool development, and applications. It focuses on load balancing and parallelization on high-performance computers, large-scale optimization, algorithmic differentiation of numerical simulation code, sparse matrix software tools, and combinatorial challenges and applications in large-scale social networks. The authors unify these seemingly disparate areas through a common set of abstractions and algorithms based on combinatorics, graphs, and hypergraphs. Combinatorial algorithms have long played a crucial enabling role in scientific and engineering computations and their importance continues to grow with the demands of new applications and advanced architectures. By addressing current challenges in the field, this volume sets the stage for the accelerated development and deployment of fundamental enabling technologies in high-performance scientific computing.There, the slightly more complicated revolve template lets revolve place checkpoints during the taping sweep and lets it produce a tape for the last time step, i.e. when the action indicates rvFirstUTurn and then leaves the loop to finish the taping sweep. ... The overall split mode generally implies larger memory requirements for the tape but yields the savings of the first 3650 ...  Utke, J. and Naumann, U., aOpenAD/F: User Manual, a Tech. rep., Argonne National Laboratory, 2009, latestanbsp;...
|Title||:||Combinatorial Scientific Computing|
|Author||:||Uwe Naumann, Olaf Schenk|
|Publisher||:||CRC Press - 2012-01-25|