Sciweavers

286 search results - page 19 / 58
» Reducing Overheads of Local Communications in Fine-grain Par...
Sort
View
24
Voted
IPPS
2005
IEEE
14 years 1 months ago
Fault-Tolerant Parallel Applications with Dynamic Parallel Schedules
Commodity computer clusters are often composed of hundreds of computing nodes. These generally off-the-shelf systems are not designed for high reliability. Node failures therefore...
Sebastian Gerlach, Roger D. Hersch
POPL
2009
ACM
14 years 2 months ago
Low-pain, high-gain multicore programming in Haskell: coordinating irregular symbolic computations on multicore architectures
With the emergence of commodity multicore architectures, exploiting tightly-coupled parallelism has become increasingly important. Functional programming languages, such as Haskel...
Abdallah Al Zain, Kevin Hammond, Jost Berthold, Ph...
IPPS
2007
IEEE
14 years 1 months ago
Task-pushing: a Scalable Parallel GC Marking Algorithm without Synchronization Operations
This paper describes a scalable parallel marking technique for garbage collection that does not employ any synchronization operation. To achieve good scalability, two major design...
Ming Wu, Xiao-Feng Li
CASCON
1996
139views Education» more  CASCON 1996»
13 years 8 months ago
Data locality sensitivity of multithreaded computations on a distributed-memory multiprocessor
The locality of the data in parallel programs is known to have a strong impact on the performance of distributed-memory multiprocessor systems. The worse the locality in access pa...
Xinmin Tian, Shashank S. Nemawarkar, Guang R. Gao,...
PDP
2006
IEEE
14 years 1 months ago
A Distributed Approach to Construction of Topology Mismatching Aware P2P Overlays in Wireless Ad Hoc Networks
Peer-to-Peer computing is mainly based on the virtual overlay network constructed in the application layer. Often, there is topology mismatching between the overlay network and th...
Yu Huang 0002, Beihong Jin, Jiannong Cao