Filters








3,353 Hits in 2.8 sec

Zero-safe net models for transactions in Linda1 1Research supported by the TMR Network GETGRATS and by the MURST Project TOSCA

Roberto Bruni, Ugo Montanari
2001 Electronical Notes in Theoretical Computer Science  
modeling of Linda-like languages equipped with a primitive mechanism for transactions (along either the ordered or unordered semantics).  ...  These operations make Linda suitable for expressing non-atomic process coordination in a concurrent setting.  ...  Acknowledgement We thank the anonymous referees for their kind comments and suggestions.  ... 
doi:10.1016/s1571-0661(04)00239-7 fatcat:i3ojahq5wbbtlffkksesoi2tji

Optimistic Concurrency Semantics for Transactions in Coordination Languages [chapter]

Suresh Jagannathan, Jan Vitek
2004 Lecture Notes in Computer Science  
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 contribution is a formal characterization of transactions for Linda based on optimistic concurrency that provides scalable and deadlock-free execution.  ... 
doi:10.1007/978-3-540-24634-3_15 fatcat:kk2wnoesqrh23allbtep2rztni

Generalization of ACID Properties [chapter]

Linda L. Hill, Mehmet M. Dalkiliç, Brahim Medjahed, Mourad Ouzzani, Ahmed K. Elmagarmid, Joseph M. Hellerstein, Colin R. Reeves, Christopher B. Jones, Ross S. Purves, Michael F. Goodchild, Jayant Sharma, John Herring (+24 others)
2009 Encyclopedia of Database Systems  
For example, visibility relaxes the isolation property by enabling the sharing of partial results and hence promoting cooperation among concurrent transactions.  ...  SYNONYMS Advanced Transaction Models; Extended Transaction Models DEFINITION ACID (Atomicity, Consistency, Isolation, and Durability) is a set of properties that guarantee the reliability of database transactions  ...  Nesting allows concurrency within a transaction and provides fine-grained and hierarchical control for failure handling.  ... 
doi:10.1007/978-0-387-39940-9_736 fatcat:5gyypjtmrje2zdpsmqpezyw4hq

Triple Space Computing: Adding Semantics to Space-Based Computing [chapter]

Johannes Riemer, Francisco Martin-Recuerda, Ying Ding, Martin Murth, Brahmananda Sapkota, Reto Krummenacher, Omair Shafiq, Dieter Fensel, Eva Kühn
2006 Lecture Notes in Computer Science  
other, TSC enhances this with the semantics required for Semantic Web enabled technologies.  ...  Thereby, the TSC technology will be aligned with emerging technologies for Semantic Web Services.  ...  Acknowledgement The work was supported by the Austrian Federal Ministry for Transport, Innovation, and Technology under the FIT-IT Semantic Systems project Triple Space Computing (TSC 809249).  ... 
doi:10.1007/11836025_30 fatcat:ivsd2braqjaglkefn3ri5far64

Concurrency control and recovery of multidatabase work flows in telecommunication applications

W. Woody Jin, Marek Rusinkiewicz, Linda Ness, Amit Sheth
1993 SIGMOD record  
In a research and technology application project at Bellcore, we used multidatabase transactions to model multisystem workflows of telecommunication applications.  ...  Two of the issues addressed in this project were concurrent execution ofmultidatabase transactions and theirfailure recovery.  ...  In this paper, we discuss the implementation of concurrency control and failure recovery for applicationsbased on the flexible transaction model.  ... 
doi:10.1145/170036.170133 fatcat:5d5depuivvck5b7u6y2uar46vy

Concurrency control and recovery of multidatabase work flows in telecommunication applications

W. Woody Jin, Marek Rusinkiewicz, Linda Ness, Amit Sheth
1993 Proceedings of the 1993 ACM SIGMOD international conference on Management of data - SIGMOD '93  
In a research and technology application project at Bellcore, we used multidatabase transactions to model multisystem workflows of telecommunication applications.  ...  Two of the issues addressed in this project were concurrent execution ofmultidatabase transactions and theirfailure recovery.  ...  In this paper, we discuss the implementation of concurrency control and failure recovery for applicationsbased on the flexible transaction model.  ... 
doi:10.1145/170035.170133 dblp:conf/sigmod/JinRNS93 fatcat:f2tu6wysmzgp3nuvowf6gqzl4u

Linda implementations in Java for concurrent systems

G. C. Wells, A. G. Chalmers, P. G. Clayton
2004 Concurrency and Computation  
The Linda programming model Linda is a coordination language for parallel and distributed processing, providing a communication mechanism based on a logically shared memory space called tuple space.  ...  Some extensions to the original Linda programming model are also presented and discussed, together with examples of their application to parallel processing problems. implications, which are discussed.  ...  ACKNOWLEDGEMENTS This work was supported by the Distributed Multimedia Centre of Excellence in the Department of Computer Science at Rhodes University, with funding from Telkom SA, Comparex Africa, Letlapa  ... 
doi:10.1002/cpe.794 fatcat:cdcbre5q4vgqddrdfvy5pcb4ha

COORDINATION MODELS AND LANGUAGES FOR PARALLEL PROGRAMMING

PAOLO CIANCARINI, THILO KIELMANN
2000 Parallel Computing  
Most conventional approaches to parallel programming are based on some basic kinds of synchronized mechanisms and related models of concurrency control: shared variables, message passing, and remote procedure  ...  concurrency and/or distribution of software components and architectures.  ...  Although it is not provided by current implementations, the Linda model itself allows dynamic and decentralized concurrent systems.  ... 
doi:10.1142/9781848160170_0001 fatcat:uvohztczpfbuxfdndstq5hu5ge

Coordination models, languages and architectures

Paolo Ciancarini, Roberto Gorrieri
1998 Science of Computer Programming  
About coordination The diffusion of multiprocessors and network technology with increasing bandwidth has fuelled the development of distributed computing and concurrent programming.  ...  Coovdinution languages are a new class of programming languages which offer a solution to the problem of managing the interaction among distributed and concurrent programs.  ...  A logic for a coordination model with multiple spaces, by P. Ciancarini, M. Mazza and L.  ... 
doi:10.1016/s0167-6423(97)00019-1 fatcat:ogrlhieshzgjzizlancte3i3jm

Mixed programming metaphors in a shared dataspace model of concurrency

G.-C. Roman, H.C. Cunningham
1990 IEEE Transactions on Software Engineering  
Our own work on language and visualization support for large-scale concurrency led us to propose SDL [27, 31], a language in which processes use powerful transactions to manipulate abstract views of a  ...  A formal operational model for Swarm is presented in an appendix. Over the last decade concurrency has been one of the most active and prolific areas of research in computer science.  ...  In developing the Swarm model and logic, we have benefited from discussions with many colleagues at Washington University-Ken Cox, Wei Chen, Howard Lykins, Mike Ehlers, Jan Tijmen Udding, Dan Kimura, and  ... 
doi:10.1109/32.62445 fatcat:ny2xmfznp5evlldigu5tmag3u4

An Extensible Space-Based Coordination Approach for Modeling Complex Patterns in Large Systems, [chapter]

Eva Kühn, Richard Mordinyi, Christian Schreiber
2008 Communications in Computer and Information Science  
In this paper we present a formal representation for a definition of shared spaces by introducing an "extensible tuple model", based on existing research on Linda coordination, some Linda extensions, and  ...  Coordination is frequently associated with shared data spaces employing Linda coordination.  ...  Basic transaction functionality is obviously essential and transactions have therefore already been suggested by other spaces like JavaSpaces (pessimistic concurrency control) and Corso (optimistic concurrency  ... 
doi:10.1007/978-3-540-88479-8_45 fatcat:weuqnns4a5hktabntcwrowpizy

The universe model

Reimer Behrends, R. E. Kurt Stirewalt
2000 Software engineering notes  
This approach improves program comprehension, module composition, and reliability for concurrent systems.  ...  We present the universe model, a new approach to concurrency management that isolates concurrency concerns and represents them in the modular interface of a component.  ...  Many languages guard transactions with a mechanism for synchronizing access to an object for the duration of such a transaction.  ... 
doi:10.1145/357474.355049 fatcat:3yap7otnanao5i2alaawmten3i

The universe model

Reimer Behrends, R. E. Kurt Stirewalt
2000 Proceedings of the 8th ACM SIGSOFT international symposium on Foundations of software engineering twenty-first century applications - SIGSOFT '00/FSE-8  
This approach improves program comprehension, module composition, and reliability for concurrent systems.  ...  We present the universe model, a new approach to concurrency management that isolates concurrency concerns and represents them in the modular interface of a component.  ...  Many languages guard transactions with a mechanism for synchronizing access to an object for the duration of such a transaction.  ... 
doi:10.1145/355045.355049 fatcat:dbtqgkl4mvclpgtluzzhj6ln2u

Generative communication in Linda

David Gelernter
1985 ACM Transactions on Programming Languages and Systems  
The Linda design encompasses a model of computation with implications beyond distribution and communication as such. In this paper we are concerned, however, with communication exclusively.  ...  The concurrent systems languages that were based on the work of Dijkstra, Hoare, and Brinch-Hansen (for example Brinch-Hansen's Concurrent Pascal [2] and Wirth's Modula [27] ) have generally been taken  ...  ACKNOWLEDGMENTS Thanks to Professor Arthur Bernstein, who directed the thesis in which Linda was first described, and to the referees (particularly the indefatigable "A") for useful, lucid comments.  ... 
doi:10.1145/2363.2433 fatcat:n4uyfrhvyrgi7buqdesb66w25m

Tuplespace-based computing for the Semantic Web: a survey of the state-of-the-art

Lyndon J. B. Nixon, Elena Simperl, Reto Krummenacher, Francisco Martin-Recuerda
2008 Knowledge engineering review (Print)  
incompatible with the REST (REpresentational State Transfer) architectural model of the Web.  ...  Recent advances in the field of middleware propose 'semantic tuplespace computing' as an instrument for coping with this situation.  ...  However, the growing importance of open networks combined with the need for concurrency that tuplespaces provide requires the coordination model of Linda to be rethought.  ... 
doi:10.1017/s0269888907001221 fatcat:z6k24gw6ujcbnoz5f2p23iwoum
« Previous Showing results 1 — 15 out of 3,353 results