• Optimistic concurrency semanti...

Result: Optimistic concurrency semantics for transactions in coordination languages

Title:
Optimistic concurrency semantics for transactions in coordination languages
Authors:
JAGANNATHAN, Suresh, VITEK, Jan
Source:
COORDINATION 2004 : coordination models and languages (Pisa, 24-27 February 2004)Lecture notes in computer science. :183-198
Publisher Information:
Berlin: Springer, 2004.
Publication Year:
2004
Physical Description:
print, 27 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Logiciel, Software, Génie logiciel, Software engineering, Abstraction, Abstracción, Architecture logiciel, Software architecture, Base donnée, Database, Base dato, Complexité programme, Program complexity, Complejidad programa, Consistance sémantique, Soundness, Consistencia semantica, Coordination, Coordinación, Développement logiciel, Software development, Desarrollo logicial, Interblocage, Deadlock, Interbloqueo, Intergiciel, Middleware, Logicial personalizado, Simultanéité informatique, Concurrency, Simultaneidad informatica, Structure donnée, Data structure, Estructura datos, Système réparti, Distributed system, Sistema repartido, Sémantique, Semantics, Semántica, Traitement transaction, Transaction processing, Tratamiento transacción, Langage coordination, Coordination language, Lenguaje coordinación
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Computer Sciences, Purdue University, West Lafayette, IN 47906, United States
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=15759303
Rights:
Copyright 2004 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.15759303
Database:
PASCAL Archive

Further Information

There has been significant recent interest in exploring the role of coordination languages as middleware for distributed systems. These languages provide operations that allow processes to dynamically and atomically access and manipulate collections of shared data. The need to impose discipline on the manner in which these operations occur becomes paramount if we wish to reason about correctness in the presence of increased program complexity. Transactions provide strong serialization guarantees that allow us to reason about programs in terms of higher-level units of abstraction rather than lower-level data structures. In this paper, we explore the role of an optimistic transactional facility for a Linda-like coordination language. We provide a semantics for a transactional coordination calculus and state a soundness result for this semantics. Our use of an optimistic concurrency protocol distinguishes this work from previous efforts such as Javaspaces, and enables scalable, deadlock-free implementations.