Sciweavers

165 search results - page 11 / 33
» Safety-Liveness Exclusion in Distributed Computing
Sort
View
COLCOM
2005
IEEE
15 years 5 months ago
Distributed floor control protocols for computer collaborative applications on overlay networks
— Computer supported collaborative applications on overlay networks are gaining popularity among users who are geographically dispersed. Examples of these kinds of applications i...
Shankar M. Banik, Sridhar Radhakrishnan, Tao Zheng...
ICDCS
2008
IEEE
15 years 6 months ago
MC2: Multiple Clients on a Multilevel Cache
In today’s networked storage environment, it is common to have a hierarchy of caches where the lower levels of the hierarchy are accessed by multiple clients. This sharing can h...
Gala Yadgar, Michael Factor, Kai Li, Assaf Schuste...
IPPS
2006
IEEE
15 years 5 months ago
ReConfigME: a detailed implementation of an operating system for reconfigurable computing
Reconfigurable computing applications have traditionally had the exclusive use of the field programmable gate array, primarily because the logic densities of the available devices...
Grant B. Wigley, David A. Kearney, Mark Jasiunas
CONCUR
2003
Springer
15 years 4 months ago
Synthesis of Distributed Algorithms Using Asynchronous Automata
Abstract. We apply the theory of asynchronous automata to the synthesis problem of closed distributed systems. We use safe asynchronous automata as implementation model, and charac...
Alin Stefanescu, Javier Esparza, Anca Muscholl
PODC
1990
ACM
15 years 3 months ago
Self-Stabilization of Dynamic Systems Assuming only Read/Write Atomicity
Three self-stabilizing protocols for distributed systems in the shared memory model are presented. The first protocol is a mutual exclusion protocol for tree structured systems. T...
Shlomi Dolev, Amos Israeli, Shlomo Moran