A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
Filters
An Associative Broadcast Based Coordination Model for Distributed Processes
[chapter]
2002
Lecture Notes in Computer Science
Preserved Fulltext
We define and describe a model for coordination of distributed processes or components based on associative broadcast. Associative broadcast encapsulates processes with an associative interface. ...
Distributed mutual exclusion is formulated in associative broadcast as an illustration. ...
This research was supported by the State of Texas Coordinating Board for Higher Education under TARP grant 003658-0508-1999. ...
doi:10.1007/3-540-46000-4_11
fatcat:cwwxypv5ojep5ppaejbwz4jscq
CoorSet: A Development Environment for Associatively Coordinated Components
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
A development environment for applications specified in an extended version of a previously developed coordination model based on associatively broadcast interactions is presented. ...
An interface definition language based on the extended coordination model and a compiler for the language are defined and described. ...
We also wish to express our gratitude to the reviewers who suggested additional related work for our consideration, as well as future lines of research. ...
doi:10.1007/978-3-540-24634-3_17
fatcat:ckwhk2m67ndofb26f4c57gyiwa
Failure detector-Ring Paxos-based atomic broadcast algorithm
2017
International Journal of Critical Computer-Based Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
The Atomic broadcast problem constitutes an essential component in fault-tolerant distributed systems. An Atomic broadcast algorithm ensures that all processes deliver the same messages sequence. ...
In this paper, we propose a new Ring Paxos-based atomic broadcast algorithm for distributed systems. It inherits some of Ring Paxos characteristics and uses failure detectors to tolerate failures. ...
INTRODUCTION An Atomic Broadcast Algorithm is an important building block in distributed fault-tolerant systems. ...
doi:10.1504/ijccbs.2017.084065
fatcat:aa3ry6khbjaxhbnk3yfedelhnu
A SCALABLE DISTRIBUTED MULTIMEDIA KNOWLEDGE RETRIEVAL SYSTEM ON A CLUSTER OF HETEROGENEOUS HIGH PERFORMANCE ARCHITECTURES
2000
International journal on artificial intelligence tools
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
The knowledge is represented using facts and rules in an associative logic-programming model. ...
The paper describes an abstract instruction set for the distributed version of the associative logic programming and the corresponding implementation. ...
The authors also acknowledge Greg Follen and other researchers and NASA administration for useful discussions and continued support of this project. ...
doi:10.1142/s0218213000000227
fatcat:7mknubcjibapni4py3avhcx3um
Practical Impact of Group Communication Theory
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Consider for example atomic broadcast. The algorithm in [1.11] solves atomic broadcast by reduction to consensus. ...
It emerged over the years as a topic with a strong synergy between theory and practice: group communication is highly relevant for building distributed systems, and is also of theoretical importance, because ...
The paper presents algorithms for causal broadcast (based on piggybacking on every message m the messages that are in the causal past of m) and for atomic broadcast, based on an idea by Skeen (for each ...
doi:10.1007/3-540-37795-6_1
fatcat:uxnuulm2c5ctbiktwjbkjsen6q
Coordinating mobile agents through the Broadcast Channel
2001
Journal of the Brazilian Computer Society
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In distributed applications based on mobile agents, coordination and synchronization of the actions executed by a team of mobile agents are difficult tasks. ...
In this paper we present a mechanism for coordinating mobile agents which handles the problem of locating and addressing members in a group of mobile agents. ...
Examples of systems based on this coordination model are Ara [20] and MOLE [3] . • Blackboard-based coordination. ...
doi:10.1590/s0104-65002001000100007
fatcat:kjfh3c2itbd5lmlaztb2v7lncu
ActorSpace: an open distributed programming paradigm
1993
Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming - PPOPP '93
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
ActorSpace provides a new communication model based on destination patt ems. ...
We address these difficulties with the ActorSpace model. Linda [8, 16] provides process interaction through a globally shared memory with associative operations on the contents. ...
A coordinator process usea the network connection to broadcast information to other coordinators in order
The role of managers is what is new in open systems; in an open system clients cannot be trusted ...
doi:10.1145/155332.155335
dblp:conf/ppopp/AghaC93
fatcat:5c75kw5tkzabrpitbica74zyyq
Defence Applications of Agent-Based Information Fusion
2010
Computer journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Two options are analysed: distributed coordination in which nodes establish shared situation awareness and run replicated central coordination algorithms, and decentralised agent-based coordination which ...
Decentralised coordination is shown to be more responsive than distributed coordination in sparsely connected networks with delays. ...
Distributed and decentralised agent-based coordination mechanisms were considered for a simple one-to-one task allocation problem. ...
doi:10.1093/comjnl/bxq045
fatcat:6vzm7tydrnephi6tq6yz54c2ui
Formal Development of a Total Order Broadcast for Distributed Transactions Using Event-B
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
Later we outline how a refinement based approach with Event-B can be used for formal development of the models of total order broadcast. ...
Introduction of the transactions based on group communication primitives represents an important step towards extending the power of group communication in an asynchronous distributed system [34] . ...
In our model, update messages from the coordinator site are broadcast using a reliable broadcast. ...
doi:10.1007/978-3-642-00867-2_8
fatcat:zjbuv5zkfngkfdxocwp4uhhcfm
Open Heterogeneous Computing in Actorspace
1994
Journal of Parallel and Distributed Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The paradigm provides powerful support for component-based construction of heterogeneous scalable distributed applications. ...
An actorspace is a computationally passive container of actors which acts as a context for matching patterns. ...
The authors would like to thank Svend Fr lund, WooYoung Kim, Rajendra Panwar, Anna Patterson, Daniel Sturman and Carolyn Talcott for helpful comments and stimulating discussions on the structure and problems ...
doi:10.1006/jpdc.1994.1060
fatcat:sc5dsko6obbpta3dkkkw7fhbwi
P2P matchmaking solution for online games
2019
Peer-to-Peer Networking and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
A distributed algorithm is presented and its correctness is proven. ...
Matchmaking players is an important problem in online multiplayer games. Existing solutions employ client-server architecture, which induces several problems. ...
If coordinator fails during the broadcast of notification, operation continues. Based on lemma 5, coordinator will be replaced. ...
doi:10.1007/s12083-019-00725-3
fatcat:wuz6bfc2yjbs5orm4b5wh5iquq
Timed Broadcast via Off-the-Shelf WLAN Distributed Coordination Function for Safety-Critical Systems
2012
2012 Ninth European Dependable Computing Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The experimental results for packet loss ratio, communication delays, and broadcast completion are used to calibrate a stochastic simulation model that allows to extrapolate the expected long-term performance ...
Experimental and simulation studies are conducted in which the protocol is implemented on top of IEEE 802.11e Distributed Coordination Function (DCF). ...
It shows the distribution of the poll+request transmission times (and associated processing time). It is seen that in both cases, this message flow is completed within a few ms. ...
doi:10.1109/edcc.2012.26
dblp:conf/edcc/MalinowskyGSCBN12
fatcat:m6jyrewtuvcnfaq6j4ruwextzu
Minimal Synchrony for Byzantine Consensus
2015
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing - PODC '15
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In a synchronous system, consensus can be solved (a) for any value of t (i.e., t < n) in the crash failure model, (b) for t < n/2 in the general omission failure model, and (c) for t < n/3 in the Byzantine ...
process crash failure model) and assume that at most one process may be faulty (i.e., t = 1) [15] . ...
DISCMAT devoted to connections between mathematics and distributed computing. ...
doi:10.1145/2767386.2767418
dblp:conf/podc/BouzidMR15
fatcat:c4mmtnwowfaabm6necrfuu64ui
Cognitive forwarding control in wireless ad-hoc networks with slow fading channels
2015
Wireless networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2014 pre-print arXiv:1402.0521v1 fatcat:tgvy2sdya5aqddnv7efjruea6qOther Versions
Given the non stationarity induced by the fading process, an online solution for the formulated game would then require an adaptive procedure capable of both convergence to and tracking strategic equilibria ...
We propose a decentralized stochastic control solution for the broadcast message dissemination problem in wireless ad hoc networks with slow fading channels. ...
For a Rayleigh model, the channel state ( ) is an exponentially distributed random variable with mean ̅ ( ) (probability density function expressed in (3-1)). ...
doi:10.1007/s11276-015-0919-y
fatcat:kfgrhrk6d5gzremtayicbm2q5e
Quantitative Safety and Security Analysis from a Communication Perspective
2015
Proceedings of the 8th International Conference on Performance Evaluation Methodologies and Tools
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
By embedding an authentication scheme (TV-HORS) into a real-time communication protocol for safetycritical scenarios, we can rely on the protocol's individual safety and security properties. ...
This paper introduces and exemplifies a trade-off analysis of safety and security properties in distributed systems. ...
In each time slot, the associated node is polled by the coordinator, with the node sending a request back to the coordinator (containing status information or a new message for distribution), and the coordinator ...
doi:10.4108/icst.valuetools.2014.258185
dblp:conf/valuetools/MalinowskySJ14
fatcat:bsvd7oxe2zcurbl6wrcld6v7ou
« Previous
Showing results 1 — 15 out of 74,816 results