5171 search results - page 297 / 1035 » Deterministic Parallel Processing |
109
click to vote
IPPS
2003
IEEE
15 years 8 months ago
2003
IEEE
One of the most important issues to deal with in peerto-peer networks is how to disseminate information. In this paper, we use a completely new approach to solving the information...
162
click to vote
SPAA
2010
ACM
15 years 7 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
140
click to vote
IPPS
2000
IEEE
15 years 7 months ago
2000
IEEE
Dynamic, distributed, real-time systems control an environment that varies widely without any time-invariant statistical or deterministic characteristic, are spread across multiple...
121
click to vote
IPPS
2000
IEEE
15 years 7 months ago
2000
IEEE
Only a handful of fundamental mechanisms for synchronizing the access of concurrent threads to shared memory are widely implemented and used. These include locks, condition variab...
110
click to vote
IPPS
1998
IEEE
15 years 7 months ago
1998
IEEE
Counting networks were introduced as a new class of concurrent, distributed, low contention data structures suitable for implementing shared counters. Their structure is similar t...