Concurrency control and view notification algorithms for collaborative replicated objects

Strom, Robert E.; Banavar, Guruduth; Miller, K.; Prakash, Atul; Ward, Michael J.

doi:10.1109/12.675714

Cited by 38 publications

(6 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Equation (1) indicates that the initiation of an action by Pi does not depend on which other participants are initiating actions. Accordingly, the action of Pi may be viewed as spontaneous.…”

Section: B a State-machine Based View Of Player Interactionsmentioning

confidence: 99%

See 1 more Smart Citation

Managing shared contexts in distributed multi-player game systems

Ravindran

Mukhopadhyay

Sidhanta

et al. 2014

2014 Sixth International Conference on Communication Systems and Networks (COMSNETS)

View full text Add to dashboard Cite

In this paper, we consider the impact of a weaker model of eventual consistency on distributed multi-player games. This model is suitable for networks in which hosts can leave and join at anytime, e.g., in an intermittently connected envi ronment. Such a consistency model is provided by the Secure Infrastructure for Networked Systems (SINS) [24], a reliable middleware framework. SINS allows agents to communicate asynchronously through a distributed transactional key-value store using anonymous publish-subscribe. It uses Lamport's Paxos protocol [17] to replicate state. We consider a multi-player maze game as example to illustrate our consistency model and the impact of network losses/delays therein. The framework based on SINS presented herein provides a vehicle for studying the effect of human elements participating in collaborative simulation of a physical world as in war games.

show abstract

Section: B a State-machine Based View Of Player Interactionsmentioning

confidence: 99%

“…The serialization protocol commits k ' of the actions gener ated, say, {al,j,·· . , ak' , j }, and aborts the remaining actions 1 Note that 00 is the initial state of window at the start of game session. …”

Section: B a State-machine Based View Of Player Interactionsmentioning

confidence: 99%

Managing shared contexts in distributed multi-player game systems

Ravindran

Mukhopadhyay

Sidhanta

et al. 2014

2014 Sixth International Conference on Communication Systems and Networks (COMSNETS)

View full text Add to dashboard Cite

show abstract

“…Th=e systems propagate AWT input events from remote sites to a central site which procases the input events. AWT There are many too~ts which provide infrastructures for btiding collaborative apphcations, including DECAF [16,2], Coast [15], Viia [5] and NSTP [12]. Many of the underlying concepts of the Live system have been derived from earfier work on DECAF and Viia.…”

Section: Related Workmentioning

confidence: 99%

“…TVe have chosen to implement a component suite that meets the requirements of classes of applications that, based on our previous experience with tookts [16,5], are poptiar and gener~y considered useti. lfore importitly, however, our component suite is &emihle, since it is bfit as a layer that exposes a subset of the functiontity supported by a sophisticated underlying system ded five As a restit, new components can be bdt as and when the need aris~.…”

mentioning

confidence: 99%

Rapidly building synchronous collaborative applications by direct manipulation

Banavar

Doddapaneni

Miller

et al. 1998

Proceedings of the 1998 ACM Conference on Computer Supported Cooperative Work

View full text Add to dashboard Cite

Msting GUI btider technology supports btiding user interfaces for interactive applications via direct manip ulation. However, it is notoriously~ctit to btid the underlying data sharing and application logic for rmdti-user synchronous co~aborative applications. This paper describes a co~ection of very high-levd software components, bfit using the JavaBeans component standard, that enables domain experts and application dsigners to rapi~y bfid entire co~aborative apphcatiorts via Visual progr arnming -drag-and~op, customization and wiring. Our component suite supports conference setup, awareness, data sharing, media streaming, acc~s synchronization, and tempordy coordinated media and event streams. TVe~nstrate that the task of btiding non-trivia mdti-user applications using this approach is si@-tly s"np~ed. Ke~ordsRapid Application Devdopment, Visud"Rogramming, Software Components, Java Beans,~en&Server Synchronous CoUaboratioñ TRODUCTIONAs the use of distributed applications is becoming more widespread in today's networked world, the relevance of synchronous collaboration is sharply increasing. Users in a number of application domains are seeking syn&onous co~aboration~pabiities within their appfication~. The requirements of this broad range of ap~c ations me diverse enough that a 'one size fits d" approach to b@ding applications is no longer satisfactory. Our qerience suggests that rapid turnaround of customized co~aborative applications is critid to meet this incressed demand for synchronous co~aboration.Permission to make di~tal or hard copies of d] or part ofthis \\-orkfor personal or cl~aom use is granted without fee protided that copies are not made or dis~%uted for profit or commercial adv-antageand that copies bar this notice and tie fill citation on tie fmt paga To copy orhmlisa to Tepubtish.to post on swera or to rdlsmiute to~sts, rquires prior~etific permission and!or a f= CS~V 98 Sattle Ii'zshington GSA Cop~fight AChI 199S 1-5S1134094/9S/1 1...S5.00There are several advanced tools to rapidly construct the GW part of applications via direct manipulation. However, btiding the distributed application logic for mdti-user applications is notoriously~cult. This part of applications typically involve software compñ ents running on separate computers, communicating and synchronizing with ah other, sharing data as needed, and managing user information. To get rapid turnaround, it is necessary to design programming tools that hide this complexi~under cl=, -y-t-use interfaces so that application domain experts and GUI designers are able to rapidy put together the underlying distribution logic of applications within a visual builder q environment.Most applications needing synchronous collaboration capabfities *O need a variety of other apabifities, such as a sophisticated GUI, datab=e access, wor~ow services, etc. It is thus necessary to provide synchronous co~aboration =pab%ties = components that can interoperate with components provided by other vendors. fithermore, the component set needs to be extensible so th...

show abstract

“…This scheme is appropriate for asynchronous groupware, which is the target application domain of Bayou, but will substantially degrade responsiveness in highly interactive applications deployed in a wide-area environment. The DECAF algorithm [14] has properties of both independent and dependent stamping algorithms. It uses a Lamport clock to stamp operations, but the stamp is validated by the primary copies of the objects that the operation accesses.…”

Section: Algorithms~systemsmentioning

confidence: 99%

1/k phase stamping for continuous shared data (extended abstract)

Bhola

Ahamad

2000

Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing

View full text Add to dashboard Cite

Interactive distributed applications are a relatively new class of applications that are enabled by sharing continuously evolving data across distributed sites (and users). The characteristics of application data include very fine-grained updates that can atomically access a subset of the shared data, masking of update effects, and irregular locality and contention for access. Existing programming approaches are not appropriate for programming such continuous shared data in a wide-area environment.We define an object-set abstraction, where a set is replicated at sites interested in the objects, and is modified using add, delete and update operations. The key features of this abstraction are issue-time access information for update operations, and the potential for replicating the computation associated with updates. Ordering of operations is an important problem, and we present a fast, scalable ordering algorithm, 1/k phase stamping, that uses distributed tokens that correspond to objects in the set. This algorithm provides substantially better performance than alternative algorithms, is deadlock and abort free, and requires no queuing at the tokens. Therefore, tokens can be located inside a programmable 'active' network. The precise stamps generated with 1/k phase stamping enable a dynamic communication optimization technique, effect and stamp merging, which can reduce communication and allow utilization of best-effort message delivery. These algorithms have been implemented in the RAGA system which can tolerate crash failures.

show abstract

Concurrency control and view notification algorithms for collaborative replicated objects

Cited by 38 publications

References 12 publications

Managing shared contexts in distributed multi-player game systems

Managing shared contexts in distributed multi-player game systems

Rapidly building synchronous collaborative applications by direct manipulation

1/k phase stamping for continuous shared data (extended abstract)

Contact Info

Product

Resources

About