Sciweavers

405 search results - page 32 / 81
» A Parallel Priority Data Structure with Applications
Sort
View
IPPS
1999
IEEE
15 years 7 months ago
Parallel Algorithms for 3D Reconstruction of Asymmetric Objects from Electron Micrographs
We present new parallel algorithms for 3D reconstruction of objects from 2D projections and their application for the determination of the structure of macromolecules from electro...
Robert E. Lynch, Dan C. Marinescu, Hong Lin, Timot...
PPOPP
2010
ACM
15 years 12 months ago
Scalable communication protocols for dynamic sparse data exchange
Many large-scale parallel programs follow a bulk synchronous parallel (BSP) structure with distinct computation and communication phases. Although the communication phase in such ...
Torsten Hoefler, Christian Siebert, Andrew Lumsdai...
125
Voted
CCGRID
2007
IEEE
15 years 9 months ago
Dynamic Malleability in Iterative MPI Applications
Malleability enables a parallel application’s execution system to split or merge processes modifying granularity. While process migration is widely used to adapt applications to...
Kaoutar El Maghraoui, Travis J. Desell, Boleslaw K...
113
Voted
IPPS
2006
IEEE
15 years 8 months ago
An experimental study of optimizing bioinformatics applications
As bioinformatics is an emerging application of high performance computing, this paper first evaluates the memory performance of several representative bioinformatics application...
Guangming Tan, Lin Xu, Shengzhong Feng, Ninghui Su...
143
Voted
PDPTA
2000
15 years 4 months ago
Evaluation of Neural and Genetic Algorithms for Synthesizing Parallel Storage Schemes
Exploiting compile time knowledge to improve memory bandwidth can produce noticeable improvements at run-time [13, 1]. Allocating the data structure [13] to separate memories when...
Mayez A. Al-Mouhamed, Husam Abu-Haimed