[PDF][PDF] An analysis of dag-consistent distributed shared-memory algorithms
RD Blumofe, M Frigo, CF Joerg, CE Leiserson… - Proceedings of the …, 1996 - dl.acm.org
In this paper, we analyze the performance of parallel mttltithreaded algorithms that use dag-
consistent distributed shared memory. Specifically, we analyze execution time, page faults,
and space requirements for multithreaded algorithms executed by a workstealing thread
scheduler and the BACKER coherence algorithm for maintaining dag consistency. We prove
that if the accesses to the backing store are random and independent (the BACKER
algorithm actually uses hashing), then the expected execution time of a “fully strict” …
consistent distributed shared memory. Specifically, we analyze execution time, page faults,
and space requirements for multithreaded algorithms executed by a workstealing thread
scheduler and the BACKER coherence algorithm for maintaining dag consistency. We prove
that if the accesses to the backing store are random and independent (the BACKER
algorithm actually uses hashing), then the expected execution time of a “fully strict” …
[PDF][PDF] An Analysis of Dag-Consistent Distributed Shared-Memory Algorithms
RDBM Frigo, CF Joerg, CE Leiserson, KH Randall - Citeseer
In this paper, we analyze the performance of parallel multithreaded algorithms that use dag-
consistent distributed shared memory. Specifically, we analyze execution time, page faults,
and space requirements for multithreaded algorithms executed by a workstealing thread
scheduler and the BACKER coherence algorithm for maintaining dag consistency. We prove
that if the accesses to the backing store are random and independent (the BACKER
algorithm actually uses hashing), then the expected execution time of a “fully strict” …
consistent distributed shared memory. Specifically, we analyze execution time, page faults,
and space requirements for multithreaded algorithms executed by a workstealing thread
scheduler and the BACKER coherence algorithm for maintaining dag consistency. We prove
that if the accesses to the backing store are random and independent (the BACKER
algorithm actually uses hashing), then the expected execution time of a “fully strict” …
Showing the best results for this search. See all results