Back to Results
First PageMeta Content
Computer science / Analysis of algorithms / Digital signal processing / Computational chemistry / Molecular dynamics / Molecular modelling / Algorithm / N-body simulation / Asymptotically optimal algorithm / Parallel computing / Computing / Applied mathematics


A Communication-Optimal N-Body Algorithm for Direct Interactions Michael Driscoll∗ 1 , Evangelos Georganas∗ 1 , Penporn Koanantakool∗ 1 , Edgar Solomonik∗ , and Katherine Yelick∗† ∗ Computer Science Divisio
Add to Reading List

Document Date: 2013-02-08 21:20:36

Open Document

File Size: 786,39 KB

Share Result on Facebook

City

New York / A. Tiskin / Toledo / Bordeaux / /

Company

IBM / NAMD / SIAM Journal / Lawrence Berkeley National Laboratory / /

Country

France / United States / /

/

Facility

E. Villa / Argonne Leadership Computing Facility / University of California / /

IndustryTerm

factorization algorithms / generalized force decomposition algorithm / parallel algorithms / nearby processors / communication-avoiding algorithms / spatial decomposition algorithm / bidirectional network / neutral territory algorithm / collective communications / graph algorithms / neutral territory interaction algorithm / 3D algorithms / non-replicating algorithm / 1D interaction algorithm / allpairs interaction algorithm / all-pairs algorithm / molecular dynamics applications / i.e. processors / communication avoiding algorithm / all-pairs interaction algorithm / interaction algorithm / communication-optimal algorithm / force decomposition algorithms / computing / communication-avoiding algorithm / row processor / torus networks / /

Organization

U.S. Department of Energy / U.S. Government / Krell Department of Energy Computation Science Graduate Fellowship / University of California / Berkeley / office of Science / Computer Science Division / National Energy Research Scientific Computing Center / /

Person

Evangelos Georganas / D. E. Shaw / M. Theobald / J. K. Salmon / S. C. Wang / B. Towles / Y. Shan / M. A. Moraes / Katherine Yelick / Edgar Solomonik / C. R. Ho / I. Kolossvary / Michael Driscoll / E. C. Priest / F. D. Sacerdoti / J. Spengler / /

Position

1D pM / author / team member / D. J. / Priest / /

ProgrammingLanguage

C++ / /

ProvinceOrState

California / /

PublishedMedium

The Journal of Chemical Physics / SIAM Journal on Computing / Journal of Computational Chemistry / Theoretical Computer Science / Lecture Notes in Computer Science / /

Technology

Object-oriented programming / generalized algorithm / neutral territory interaction algorithm / neutral territory algorithm / communication-avoiding algorithm / spatial decomposition algorithm / generalized force decomposition algorithm / 3D algorithms / LU factorization algorithms / communication avoiding algorithm / Computational Chemistry / N-body algorithm / communicationavoiding algorithm / interaction algorithm / i.e. processors / graph algorithms / Keywords-parallel algorithms / non-replicating algorithm / existing Nbody algorithms / 2 P/c processor / one processor / An algorithm / A. The 1D interaction algorithm The algorithm / row processor / 1D interaction algorithm / force decomposition algorithms / 100 processors / 850 MHz PowerPC processor / optimized algorithms / all-pairs interaction algorithm / allpairs interaction algorithm / MagnyCours processors / simulation / 2.5D algorithms / all-pairs algorithm / communication-avoiding N-body algorithm / heavily-loaded processors / communication-avoiding algorithms / /

URL

http /

SocialTag