4045 search results - page 491 / 809 » Special Section on Parallel Distributed Computing and Networ... |
211
click to vote
SPAA
2009
ACM
16 years 4 months ago
2009
ACM
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
156
click to vote
CONEXT
2007
ACM
15 years 11 months ago
2007
ACM
Ad-hoc wireless peer-to-peer methods are an important and viable alternative to the more traditional infrastructure based ones for distributing contents among a population of user...
174
click to vote
DEBS
2003
ACM
16 years 16 days ago
2003
ACM
In this paper, we describe a case study of the design and development of a group-conferencing tool suite, built on top of an overlay network based event dissemination framework, w...
302
click to vote
PC
2011
15 years 2 months ago
2011
In the last decade, cluster computing has become the most popular high-performance computing architecture. Although numerous technological innovations have been proposed to improv...
184
click to vote
ICPPW
2002
IEEE
16 years 6 days ago
2002
IEEE
We present a specification for a new, localized group membership service that maintains the membership status of adjacent nodes – called neighbors – in a mobile distributed s...