article · 1998

Lock-Free Distributed Objects: A Shared Spreadsheet

Christopher R. Palmer, Gordon V. Cormack

Cited by 0Abstract and details only

Abstract

A Lock-Free Distributed System is a purely-replicated environment (replication with no central authority) in which updates are performed with no inter-object communication. All replicated copies of an object take on a common state when there are no messages in transit. Such a system is often used for groupware applications and operation transformations are a popular technique in this field. We broaden the scope of operation transformations by using a lock-free concurrency system to specify a distributed spreadsheet. The resulting spreadsheet is highly fault tolerant and the interactive performance is independent of the speed and the quality of the underlying network. To specify the concurrent semantics of the spreadsheet, an abstract data type is defined and a general model of a subset of the operations is proposed. 1 Introduction In the most general sense, an object is a store that has well-defined access methods. That is, an object may assume any of a (potentially infinite) set of v...

Cite this paper

APA 7

Palmer, C. R., & Cormack, G. V. (1998). Lock-Free Distributed Objects: A Shared Spreadsheet.

MLA 9

Palmer, Christopher R., and Gordon V. Cormack. “Lock-Free Distributed Objects: A Shared Spreadsheet.” 1998.

Chicago

Palmer, Christopher R., and Gordon V. Cormack. 1998. “Lock-Free Distributed Objects: A Shared Spreadsheet.”

Harvard

Palmer, C.R. and Cormack, G.V. (1998) ‘Lock-Free Distributed Objects: A Shared Spreadsheet’.

BibTeX

@article{palmer1998lock,
  title = {{Lock-Free Distributed Objects: A Shared Spreadsheet}},
  author = {Palmer, Christopher R. and Cormack, Gordon V.},
  year = {1998}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.