Over the past several decades, the compiler research community has developed a number of sophisticated and powerful algorithms for a varierty of code improvements. While there are...
Bruce R. Childers, Jack W. Davidson, Mary Lou Soff...
Classical mesh partitioning algorithms were designed for rather static situations, and their straightforward application in a dynamical framework may lead to unsatisfactory result...
This paper presents an extension of a performance evaluation library called Fast to handle parallel routines. Fast is a dynamic performance forecasting tool in a grid environment. ...
Tree contraction algorithms, whose idea was first proposed by Miller and Reif, are important parallel algorithms to implement efficient parallel programs manipulating trees. Desp...
A scalable parallel algorithm has been designed to perform multimillion-atom molecular dynamics (MD) simulations, in which first principlesbased reactive force fields (ReaxFF) des...
Ken-ichi Nomura, Rajiv K. Kalia, Aiichiro Nakano, ...