Sciweavers

1710 search results - page 54 / 342
» Parallelism in Structured Newton Computations
Sort
View
ICS
2010
Tsinghua U.
14 years 1 months ago
Cache oblivious parallelograms in iterative stencil computations
We present a new cache oblivious scheme for iterative stencil computations that performs beyond system bandwidth limitations as though gigabytes of data could reside in an enormou...
Robert Strzodka, Mohammed Shaheen, Dawid Pajak, Ha...
JCC
2010
113views more  JCC 2010»
13 years 7 months ago
MDLab: A molecular dynamics simulation prototyping environment
Molecular dynamics (MD) simulation involves solving Newton’s equations of motion for a system of atoms, by calculating forces and updating atomic positions and velocities over a...
Trevor M. Cickovski, Santanu Chatterjee, Jacob Wen...
CDES
2006
99views Hardware» more  CDES 2006»
13 years 10 months ago
Teraflop Computing for Nanoscience
: Over the last three decades there has been significant progress in the first principles methods for calculating the properties of materials at the quantum level. They have largel...
Yang Wang 0008, G. M. Stocks, Aurelian Rusanu, D. ...
IPPS
2009
IEEE
14 years 3 months ago
Scalability challenges for massively parallel AMR applications
PDE solvers using Adaptive Mesh Refinement on block structured grids are some of the most challenging applications to adapt to massively parallel computing environments. We descr...
Brian van Straalen, John Shalf, Terry J. Ligocki, ...
SPAA
2010
ACM
13 years 9 months ago
A universal construction for wait-free transaction friendly data structures
Given the sequential implementation of any data structure, we show how to obtain an efficient, wait-free implementation of that data structure shared by any fixed number of proces...
Phong Chuong, Faith Ellen, Vijaya Ramachandran