Authors: eresa S. Bailey, W. Daryl Hawkins, Marvin L. Adams, Peter N. Brown, Adam J. Kunen, Michael P. Adams, Timmie Smith, Nancy M. Amato, and Lawrence Rauchwerger

Venue: Transactions of the American Nuclear Society
DOI:
Link to Publication

Abstract:
The scalability of sweep algorithms has been a somewhat disputed topic recently. Some papers have predicted that these algorithms will scale if applied appropriately, while others have claimed that sweep algorithms have limited scalability. We compare the parallel performance models for sweep algorithms to actual computational performance using two distinctly different discrete ordinates transport codes. We have run both codes beyond 1Million MPI ranks on Lawrence Livermore National Laboratory’s (LLNL) BGQ machines (SEQUOIA and VULCAN). 

@article{Bailey-vofmp-2014, 
 author = {Teresa S. Bailey and W. Daryl Hawkins and Marvin L. Adams and Peter N. Brown and Adam J. Kunen and Michael P. Adams and Timmie Smith and Nancy M. Amato and Lawrence Rauchwerger}, 
 journal = {Trans. American Nuclear Society}, 
 month = {November}, 
 note = {2014 ANS Annual Winter Meeting; Nov 9-13, 2014, Anaheim, CA, USA}, 
 pages = {699-702}, 
 title = {Validation of Full-Domain Massively Parallel Transport Sweep Algorithms}, 
 volume = {111}, 
 year = {2014} 
}