Sciweavers

1156 search results - page 115 / 232
» Efficient Barriers for Distributed Shared Memory Computers
Sort
View
ICPP
1987
IEEE
14 years 1 months ago
Parallel Algorithm for Maximum Weight Matching in Trees
We present an efficient coarse grained parallel algorithm for computing a maximum weight matching in trees. A divide and conquer approach based on centroid decomposition of trees ...
Shaunak Pawagi
PPOPP
1997
ACM
14 years 2 months ago
Effective Fine-Grain Synchronization for Automatically Parallelized Programs Using Optimistic Synchronization Primitives
As shared-memory multiprocessors become the dominant commodity source of computation, parallelizing compilers must support mainstream computations that manipulate irregular, point...
Martin C. Rinard
IPPS
1998
IEEE
14 years 2 months ago
Efficient Fine-Grain Thread Migration with Active Threads
Thread migration is established as a mechanism for achieving dynamic load sharing. However, fine-grained migration has not been used due to the high thread and messaging overheads...
Boris Weissman, Benedict Gomes, Jürgen Quitte...
CSCW
2008
ACM
14 years 1 days ago
Transactive memory in trauma resuscitation
This paper describes an ethnographic study conducted to explore the possibilities for future design and development of technological support for trauma teams. We videotaped 10 tra...
Aleksandra Sarcevic, Ivan Marsic, Michael E. Lesk,...
IJHPCA
2010
88views more  IJHPCA 2010»
13 years 8 months ago
Madre: the Memory-Aware Data Redistribution Engine
We report on the development of a new computational framework for efficiently carrying out parallel data redistribution in a limited memory environment. This new library, MADRE (T...
Stephen F. Siegel, Andrew R. Siegel