Sciweavers

420 search results - page 64 / 84
» Scalable Parallel Programming with CUDA
Sort
View
SPAA
2010
ACM
14 years 1 months ago
Simplifying concurrent algorithms by exploiting hardware transactional memory
We explore the potential of hardware transactional memory (HTM) to improve concurrent algorithms. We illustrate a number of use cases in which HTM enables significantly simpler c...
Dave Dice, Yossi Lev, Virendra J. Marathe, Mark Mo...
DAC
2009
ACM
14 years 10 days ago
NUDA: a non-uniform debugging architecture and non-intrusive race detection for many-core
Traditional debug methodologies are limited in their ability to provide debugging support for many-core parallel programming. Synchronization problems or bugs due to race conditio...
Chi-Neng Wen, Shu-Hsuan Chou, Tien-Fu Chen, Alan P...
HPDC
1997
IEEE
14 years 5 hour ago
A Directory Service for Configuring High-Performance Distributed Computations
High-performance execution in distributed computing environments often requires careful selection and configuration not only of computers, networks, and other resources but also o...
Steven Fitzgerald, Ian T. Foster, Carl Kesselman, ...
CCGRID
2010
IEEE
13 years 9 months ago
A Map-Reduce System with an Alternate API for Multi-core Environments
Map-reduce framework has received a significant attention and is being used for programming both large-scale clusters and multi-core systems. While the high productivity aspect of ...
Wei Jiang, Vignesh T. Ravi, Gagan Agrawal
HIPC
2007
Springer
14 years 9 days ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri