Using Graph Partitioning for Scalable Distributed Quantum Molecular Dynamics
暂无分享,去创建一个
Georg Hahn | Susan M. Mniszewski | Christian F. A. Negre | Anders M. N. Niklasson | Hristo N. Djidjev | H. Djidjev | A. Niklasson | S. Mniszewski | Georg Hahn | C. Negre
[1] David A. Bader,et al. Graph Partitioning and Graph Clustering, 10th DIMACS Implementation Challenge Workshop, Georgia Institute of Technology, Atlanta, GA, USA, February 13-14, 2012. Proceedings , 2013, Graph Partitioning and Graph Clustering.
[2] Emanuel H. Rubensson,et al. Graph-based linear scaling electronic structure theory. , 2016, The Journal of chemical physics.
[3] Vipin,et al. Multilevel kway Hypergraph Partitioning * , 1999 .
[4] Brian W. Kernighan,et al. An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..
[5] Henning Meyerhenke,et al. Better Partitions of Protein Graphs for Subsystem Quantum Chemistry , 2016, SEA.
[6] R. M. Mattheyses,et al. A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.
[7] Bruce Hendrickson,et al. A Multi-Level Algorithm For Partitioning Graphs , 1995, Proceedings of the IEEE/ACM SC95 Conference.
[8] C. Bunn,et al. The crystal structure of long-chain normal paraffin hydrocarbons. The “shape” of the , 1939 .
[9] Gary L. Miller,et al. Separators for sphere-packings and nearest neighbor graphs , 1997, JACM.
[10] Sándor Suhai,et al. Self-consistent-charge density-functional tight-binding method for simulations of complex materials properties , 1998 .
[11] Vivek Sardeshmukh,et al. Graph Partitioning Methods for Fast Parallel Quantum Molecular Dynamics , 2016, CSC.
[12] Peter Sanders,et al. Think Locally, Act Globally: Highly Balanced Graph Partitioning , 2013, SEA.
[13] R. Tarjan,et al. A Separator Theorem for Planar Graphs , 1977 .
[14] D. R. Fulkerson,et al. Maximal Flow Through a Network , 1956 .
[15] Peter Sanders,et al. k-way Hypergraph Partitioning via n-Level Recursive Bisection , 2015, ALENEX.
[16] Christian Wulff-Nilsen,et al. Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[17] Michael Methfessel,et al. Crystal structures of zirconia from first principles and self-consistent tight binding , 1998 .
[18] Joost VandeVondele,et al. Sparse matrix multiplication: The distributed block-compressed sparse row library , 2014, Parallel Comput..
[19] Vipin Kumar,et al. A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..
[20] Hristo Djidjev,et al. Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus , 1996, SIAM J. Discret. Math..
[21] Matt Challacombe,et al. An Optimized Sparse Approximate Matrix Multiply for Matrices with Decay , 2012, SIAM J. Sci. Comput..
[22] Sándor Suhai,et al. A Self‐Consistent Charge Density‐Functional Based Tight‐Binding Method for Predictive Materials Simulations in Physics, Chemistry and Biology , 2000 .
[23] Joost VandeVondele,et al. Linear Scaling Self-Consistent Field Calculations with Millions of Atoms in the Condensed Phase. , 2012, Journal of chemical theory and computation.
[24] A M N Niklasson,et al. Efficient parallel linear scaling construction of the density matrix for Born-Oppenheimer molecular dynamics. , 2015, Journal of chemical theory and computation.
[25] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[26] Chris Walshaw,et al. Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm , 2000, SIAM J. Sci. Comput..
[27] Peter Sanders,et al. Engineering Multilevel Graph Partitioning Algorithms , 2010, ESA.
[28] Vipin Kumar,et al. Multilevel k-way hypergraph partitioning , 1999, DAC '99.
[29] Bruce Hendrickson,et al. Partitioning for complex objectives , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.
[30] Anders M.N. Niklasson. Expansion algorithm for the density matrix , 2002 .