Sciweavers

2927 search results - page 30 / 586
» An OR Parallel Prolog Model for Distributed Memory Systems
Sort
View
HPCN
1994
Springer
13 years 11 months ago
Communication Cost Reduction for Krylov Methods on Parallel Computers
On large distributed memory parallel computers the global communication cost of inner products seriously limits the performance of Krylov subspace methods 3]. We consider improved ...
Eric de Sturler, Henk A. van der Vorst
ICDCN
2012
Springer
12 years 3 months ago
Lifting the Barriers - Reducing Latencies with Transparent Transactional Memory
Synchronization in distributed systems is expensive because, in general, threads must stall to obtain a lock or to operate on volatile data. Transactional memory, on the other hand...
Annette Bieniusa, Thomas Fuhrmann
HPCA
2012
IEEE
12 years 3 months ago
Balancing DRAM locality and parallelism in shared memory CMP systems
Modern memory systems rely on spatial locality to provide high bandwidth while minimizing memory device power and cost. The trend of increasing the number of cores that share memo...
Min Kyu Jeong, Doe Hyun Yoon, Dam Sunwoo, Mike Sul...
CLUSTER
2007
IEEE
14 years 1 months ago
Non-collective parallel I/O for global address space programming models
— Achieving high performance for out-of-core applications typically involves explicit management of the movement of data between the disk and the physical memory. We are developi...
Sriram Krishnamoorthy, Juan Piernas, Vinod Tippara...
MICRO
2010
IEEE
153views Hardware» more  MICRO 2010»
13 years 5 months ago
Scalable Speculative Parallelization on Commodity Clusters
While clusters of commodity servers and switches are the most popular form of large-scale parallel computers, many programs are not easily parallelized for execution upon them. In...
Hanjun Kim, Arun Raman, Feng Liu, Jae W. Lee, Davi...