Sciweavers

3660 search results - page 438 / 732
» Parallel Program Archetypes
Sort
View
PPOPP
2009
ACM
16 years 7 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
SAC
2009
ACM
16 years 1 months ago
GTfold: a scalable multicore code for RNA secondary structure prediction
The prediction of the correct secondary structures of large RNAs is one of the unsolved challenges of computational molecular biology. Among the major obstacles is the fact that a...
Amrita Mathuriya, David A. Bader, Christine E. Hei...
CCGRID
2001
IEEE
15 years 10 months ago
Cluster Computing in the Classroom: Topics, Guidelines, and Experiences
- With the progress of research on cluster computing, more and more universities have begun to offer various courses covering cluster computing. A wide variety of content can be ta...
Amy W. Apon, Rajkumar Buyya, Hai Jin, Jens Mache
193
Voted
PPOPP
2010
ACM
16 years 4 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...
ISSAC
2007
Springer
128views Mathematics» more  ISSAC 2007»
16 years 25 days ago
Productivity and performance using partitioned global address space languages
Partitioned Global Address Space (PGAS) languages combine the programming convenience of shared memory with the locality and performance control of message passing. One such langu...
Katherine A. Yelick, Dan Bonachea, Wei-Yu Chen, Ph...