606 search results - page 86 / 122 » Complexity Results for Checking Distributed Implementability |
CONEXT
2009
ACM
15 years 2 months ago
2009
ACM
Peer-to-Peer file-sharing applications suffer from a fundamental problem of unfairness. Free-riders cause slower download times for others by contributing little or no upload band...
110
click to vote
IPTPS
2005
Springer
15 years 7 months ago
2005
Springer
Arpeggio is a peer-to-peer file-sharing network based on the Chord lookup primitive. Queries for data whose metadata matches a certain criterion are performed efficiently by using...
121
click to vote
IPPS
2010
IEEE
14 years 11 months ago
2010
IEEE
Abstract-- Recent studies have shown that cache partitioning is an efficient technique to improve throughput, fairness and Quality of Service (QoS) in CMP processors. The cache par...
134
click to vote
UML
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Current trends in software development show a move towards supporting autonomous components (agents). The accurate timing of interactions between such components is growi...
SPAA
2009
ACM
16 years 2 months ago
2009
ACM
We analyze the correctness and complexity of two well-known routing algorithms, introduced by Gafni and Bertsekas (1981): By reversing the directions of some edges, these algorith...