Sciweavers

1134 search results - page 123 / 227
» Distributed Proving in Access-Control Systems
Sort
View
WDAG
2007
Springer
82views Algorithms» more  WDAG 2007»
15 years 9 months ago
The Space Complexity of Unbounded Timestamps
The timestamp problem captures a fundamental aspect of asynchronous distributed computing. It allows processes to label events throughout the system with timestamps that provide in...
Faith Ellen, Panagiota Fatourou, Eric Ruppert
118
Voted
ICCS
2005
Springer
15 years 9 months ago
Safety of a Server-Based Version Vector Protocol Implementing Session Guarantees
Session guarantees are used to manage replica consistency of a distributed system from the client perspective. This paper defines formally the guarantees, presents and proves safe...
Jerzy Brzezinski, Cezary Sobaniec, Dariusz Wawrzyn...
111
Voted
MOR
2010
121views more  MOR 2010»
15 years 1 months ago
Customer Abandonment in Many-Server Queues
We study G/G/n + GI queues in which customer patience times are independent, identically distributed following a general distribution. When a customer’s waiting time in queue ex...
J. G. Dai, Shuangchi He
SPAA
2005
ACM
15 years 9 months ago
The expansion and mixing time of skip graphs with applications
We prove that with high probability a skip graph contains a 4-regular expander as a subgraph, and estimate the quality of the expansion via simulations. As a consequence skip grap...
James Aspnes, Udi Wieder
111
Voted
IASTEDSE
2004
15 years 4 months ago
A coordination architecture for time-dependent components
The integration of distributed, data dependent components requires a data synchronisation model. We consider a class of systems where data-dependent components produce data in dis...
Michael N. Barth, Alexander Knapp