1617 search results - page 140 / 324 » Parallel Cost Analysis of Distributed Systems |
136
Voted
SPAA
2010
ACM
15 years 5 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...
147
Voted
PODC
2010
ACM
15 years 4 months ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
102
click to vote
VLSID
2004
IEEE
16 years 1 months ago
2004
IEEE
With increasing demands for high performance by embedded systems, especially by digital signal processing applications, embedded processors must increase available instruction lev...
120
click to vote
IPPS
2005
IEEE
15 years 6 months ago
2005
IEEE
1 Electronic fair-exchange protocols have received significant attention from the research community in the recent past. In loose terms, the fair exchange problem is defined as at...
115
click to vote
ICPP
1998
IEEE
15 years 5 months ago
1998
IEEE
To execute a shared memory program efficiently, we have to manage memory consistency with low overheads, and have to utilize communication bandwidth of the platform as much as pos...