822 search results - page 91 / 165 » Contention in shared memory algorithms |
127
Voted
KDD
2003
ACM
16 years 2 months ago
2003
ACM
A commercial Web page typically contains many information blocks. Apart from the main content blocks, it usually has such blocks as navigation panels, copyright and privacy notice...
121
click to vote
SPAA
1997
ACM
15 years 6 months ago
1997
ACM
Consider a set of shared objects in a distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as e ...
105
click to vote
IPPS
2006
IEEE
15 years 8 months ago
2006
IEEE
Phylospaces is a novel framework for reconstructing evolutionary trees in tuple space, a distributed shared memory that permits processes to communicate and coordinate with each o...
114
click to vote
FSTTCS
2005
Springer
15 years 8 months ago
2005
Springer
We introduce asynchronous dynamic pushdown networks (ADPN), a new model for multithreaded programs in which pushdown systems communicate via shared memory. ADPN generalizes both CP...
156
click to vote
PARA
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...