739 Hits in 6.1 sec

Multiprocessor architectures for concurrent programs

Per Brinch Hansen
1978 SIGARCH Computer Architecture News  
Initially, me looked at programming languages in whic h all communication between concurrent processes takes place by messages only.  ...  If we assume t hat load and store operations on the common store take place one at a time (thanks to the ha r dware a r b i t e r) , then it is not necessary f or a delayed process to lock the gate variable  ... 
doi:10.1145/641829.641830 fatcat:3vzaddij5fhwhl2rvcakisfopm

Multiprocessor Architectures For Concurrent Programs

Per Brinch Hansen
1978 Proceedings of the 1978 annual conference on - ACM 78  
Initially, me looked at programming languages in whic h all communication between concurrent processes takes place by messages only.  ...  If we assume t hat load and store operations on the common store take place one at a time (thanks to the ha r dware a r b i t e r) , then it is not necessary f or a delayed process to lock the gate variable  ... 
doi:10.1145/800127.804119 dblp:conf/acm/Hansen78 fatcat:ygywdgi7wreblbtfyql6rzu3rm

Concurrent object-oriented programming

Gul Agha
1990 Communications of the ACM  
of the Silicon Valley Patterns Group performed similar valuable service for preliminary versions of the second edition.  ...  When an object constructs a new ThreadGroup, it is nested under its current group. The method getThreadGroup returns the group of any thread.  ...  Concurrency Like most computing terms, "concurrency" is tricky to pin down. Informally, a concurrent program is one that does more than one thing at a time.  ... 
doi:10.1145/83880.84528 fatcat:natymhbbtbh7zivohgmsjbwg3m

Concurrency control in advanced database applications

Naser S. Barghouti, Gail E. Kaiser
1991 ACM Computing Surveys  
Convenient access: providing a powerful query language to access sets of data items at a time. 5.  ...  These two concepts are central to all conventional concurrency control mechanisms. 6 been locked earlier in the transaction, and (2) are divided into a growing phase, in which locks are only acquired,  ...  We would like to thank Terrance Boult and Soumitra Sengupta for reviewing earlier versions of this paper.  ... 
doi:10.1145/116873.116875 fatcat:7djdmy5phnbazn37wyu7nbulju

Concurrent programming without locks

Keir Fraser, Tim Harris
2007 ACM Transactions on Computer Systems  
OSTM allows a simpler implementation than WSTM, but at the cost of reengineering the code to use OSTM objects.  ...  Mutual exclusion locks remain the de facto mechanism for concurrency control on shared-memory data structures.  ...  This implementation is based on using the orecs as mutual exclusion locks, allowing at most one transaction to own an orec at a given time.  ... 
doi:10.1145/1233307.1233309 fatcat:u2fl7u7lxrfndp6qduitxy5sbq

VCC: A Practical System for Verifying Concurrent C [chapter]

Ernie Cohen, Markus Dahlweid, Mark Hillebrand, Dirk Leinenbach, Michał Moskal, Thomas Santen, Wolfram Schulte, Stephan Tobies
2009 Lecture Notes in Computer Science  
VCC takes a program (annotated with function contracts, state assertions, and type invariants) and attempts to prove the correctness of these annotations.  ...  VCC is an industrial-strength verification environment for low-level concurrent system code written in C.  ...  Acknowledgments Thanks to everyone in the project: Artem Alekhin, Eyad Alkassar, Mike Barnett  ... 
doi:10.1007/978-3-642-03359-9_2 fatcat:rx2mo46vivdhzhdmpyjinauypy

A survey of concurrent object-oriented languages

Michael Philippsen
2000 Concurrency Practice and Experience  
Always the prime objective has been to provide the advantages of object-oriented software design at the increased power of parallel machines.  ...  Unnumbered proposals have been made to combine both developments.  ...  Thanks to Claudio Fleiner, Bernhard Haumacher, Lutz Prechelt, Walter Tichy, and Wolf Zimmermann for commenting on earlier drafts.  ... 
doi:10.1002/1096-9128(20000825)12:10<917::aid-cpe517>;2-f fatcat:ufz4njwtvbcqjemdppdv7cpa6q

A Tutorial on Parallel and Concurrent Programming in Haskell [chapter]

Simon Peyton Jones, Satnam Singh
2009 Lecture Notes in Computer Science  
In distributed and real-time systems we have to model and react to events in the real world e.g. handling multiple server requests in parallel. 1 a 'par' b An example of this expression executing in parallel  ...  Real world concurrency.  ...  Leshchinskiy's thesis [8] extended this work to cover higher order languages ( [19] gives a paper-sized summary), while Chakravarty and Keller explain a further generalization to handle user-defined  ... 
doi:10.1007/978-3-642-04652-0_6 fatcat:jw2rtmej2jbvhf6yqwg4thv2cu

Guest Editorial: Special issue on outstanding papers from RTNS 2019

Ye-Qiong Song, Christopher Gill
2021 Real-time systems  
Anderson, titled "Concurrency Groups: A New Way to Look at Real-Time Multiprocessor Lock Nesting," proposes to group lock requests whose safe concurrent execution can be determined off-line, and provides  ...  a new real-time multiprocessor locking protocol called the CGLP, based on those concurrency groups.  ... 
doi:10.1007/s11241-021-09363-6 fatcat:tf5q3lbu5zdoxaxrqzpttp6ttq

Concurrent Computing in the Many-core Era (Dagstuhl Seminar 15021)

Michael Philippsen, Pascal Felber, Michael L. Scott, J. Eliot B. Moss, Marc Herbstritt
2015 Dagstuhl Reports  
The current seminar built on the previous seminars by notably (1) broadening the scope to concurrency beyond transactional memory and shared-memory multicores abstractions, (2) focusing on the new challenges  ...  This seminar is a successor to Dagstuhl Seminars 08241 "Transactional memory: From implementation to application" and 12161 "Abstractions for scalable multicore computing", respectively held in June 2008  ...  Scott] suggests a single hierarchical mechanism -perhaps similar to concurrent nested transactions, or to re-acquisition of the same lock in a subroutine in Java -that is, re-entrant locks depend on a  ... 
doi:10.4230/dagrep.5.1.1 dblp:journals/dagstuhl-reports/PhilippsenFSM15 fatcat:owcmta65hzb5vmglwq3dwzbehy

Concepts and Notations for Concurrent Programming

Gregory R. Andrews, Fred B. Schneider
1983 ACM Computing Surveys  
writing concurrent programs.  ...  Much has been learned in the last decade about concurrent programming..This patmr identifies the major concepts of concurrent programming and describes some of the more importam language notations for  ...  Tony Wasserman has also provided helpful advice; it has been a joy to have him as the editor for this paper.  ... 
doi:10.1145/356901.356903 fatcat:u5mjeuve7jbyfivbbtkdnb5h44

Concurrency and distribution in object-oriented programming

Jean-Pierre Briot, Rachid Guerraoui, Klaus-Peter Lohr
1998 ACM Computing Surveys  
This paper aims at discussing and classifying the various ways in which the object paradigm is used in concurrent and distributed contexts.  ...  The library approach applies object-oriented concepts, as they are, to structure concurrent and distributed systems through class libraries.  ...  ACKNOWLEDGMENT The comments of the reviewers have greatly contributed to improving the quality of this article.  ... 
doi:10.1145/292469.292470 fatcat:becxelcchfa25pkezpycfqagpu

Fast memory snapshot for concurrent programmingwithout synchronization

Jaewoong chung, Woongki Baek, Christos Kozyrakis
2009 Proceedings of the 23rd international conference on Conference on Supercomputing - ICS '09  
Since modern processors support atomic access only to a single word, programmers should add synchronization code to process a multiword dataset concurrently in multithreading environment.  ...  We propose MShot, a hardware-assisted memory snapshot for concurrent programming without synchronization code. It supports atomic multi-word read operations on a large dataset.  ...  While this is smaller than what a real environment would use, the applications still exhibit reasonable ratios of GC time over the total execution time (from 1% for Cfrac to 18% for Gzip).  ... 
doi:10.1145/1542275.1542297 dblp:conf/ics/ChungBK09 fatcat:5outddrtgngczcsxnpfdbglqxe

Modelling and Verifying an Object-Oriented Concurrency Model in GROOVE [article]

Claudio Corrodi
2015 arXiv   pre-print
SCOOP is a programming model and language that allows concurrent programming at a high level of abstraction.  ...  We propose a fully automatic approach to verifying (a subset of) SCOOP programs by translation to graph-based models. First, we present a graph transformation based semantics for SCOOP.  ...  to in case the current call is a nested call.  ... 
arXiv:1505.05265v1 fatcat:3do6ltbic5fydaimj7uzggwnoy

Falcon: On‐line monitoring for steering parallel programs

Weiming Gu, Greg Eisenhauer, Karsten Schwan, Jeffrey Vetter
1998 Concurrency Practice and Experience  
The time-scale of these changes can vary from rapid modi cations to the implementation of single program abstractions e.g., a single mutex lock in a parallel code 41 to the occasional modi cation of program  ...  These changes may range in complexity from modi cations of a few selected application parameters to concerted changes of complex run-time program states.  ...  We thank Niru Mallavarupu for contributing to early implementations of Falcon components.  ... 
doi:10.1002/(sici)1096-9128(19980810)10:9<699::aid-cpe367>;2-z fatcat:tub5fr4ufzcq5pprzilqiy33ou
« Previous Showing results 1 — 15 out of 739 results