A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
Filters
Tiddle
2009
Proceedings of the Seventh International Workshop on Dynamic Analysis - WODA '09
Preserved Fulltext
Dynamic analysis is a promising technique for finding concurrency bugs in multithreaded programs. However, testing a dynamic analysis tool can be difficult. ...
Although our implementation is targeted towards Java, the ideas extend to any other languages which support mutable fields and multiple threads. ...
Data Races. A data race occurs when two threads simultaneously access a shared variable, at least one access is a write, and there is no synchronization between the two accesses. ...
doi:10.1145/2134243.2134248
dblp:conf/issta/SadowskiY09
fatcat:23yzcbkpcbdl5aqszlowfzwm3a
Sequential Object Monitors
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
This paper illustrates SOM expressiveness with several classical concurrency problems, and high-level abstractions like guards and chords. ...
Programming with Java monitors is recognized to be difficult, and potentially inefficient due to many useless context switches induced by the notifyAll primitive. ...
We would like to thank Jacques Noyé and the anonymous ECOOP reviewers for their constructive comments. ...
doi:10.1007/978-3-540-24851-4_15
fatcat:aoghtrv7yrgj3hwq5g7rkk4lom
Concurrent programming with revisions and isolation types
2010
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Programmers declare what data they wish to share between tasks by using isolation types, and execute tasks concurrently by forking and joining revisions. ...
In particular, it is often desirable to enable various tasks to read or modify shared data concurrently without requiring complicated locking schemes that may throttle concurrency and introduce bugs. ...
Acknowledgments We thank Tom Ball, Ben Zorn, and Tim Harris for helpful comments and discussions. ...
doi:10.1145/1932682.1869515
fatcat:6snan464pbdtrd7xc6cg7cdls4
The universe model
2000
Proceedings of the 8th ACM SIGSOFT international symposium on Foundations of software engineering twenty-first century applications - SIGSOFT '00/FSE-8
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
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. ...
logic, and similar in concept to the axioms of an abstract data type. ...
doi:10.1145/355045.355049
fatcat:dbtqgkl4mvclpgtluzzhj6ln2u
The universe model
2000
Software engineering notes
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
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. ...
logic, and similar in concept to the axioms of an abstract data type. ...
doi:10.1145/357474.355049
fatcat:3yap7otnanao5i2alaawmten3i
Prettier concurrency
2012
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This article presents an extension to the work of Launchbury and Peyton-Jones on the ST monad. ...
Using deterministic conflict resolution, concurrent revisions can deal well with situations where there are many conflicts between different threads that modify a shared data structure. ...
The vcreateMF function allows us to specify an extra operation that is called when a versioned variable is first accessed after a fresh fork:
Read-and write-skew The concurrent revision model is very ...
doi:10.1145/2096148.2034686
fatcat:eqo42rsezrhtrc2l2ew4r3cxpa
Towards a Substrate Framework of Computation
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
This paper demonstrates how a hypergraph rewriting framework nicely integrates various forms and ingredients of concurrent computation and how simple static analyses help the understanding and optimization ...
A grand challenge in computing is to establish a substrate computational model that encompasses diverse forms of non-sequential computation. ...
Acknowledgments The author is indebted to the present and past members of the LMNtal group for fruitful discussions and building the (Hyper)LMNtal system on which the present work was successfully based ...
doi:10.1007/978-3-662-44471-9_15
fatcat:2dzmeq5m7nfbjb2loolqk6zxh4
Semantics of Concurrent Revisions
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
Despite allowing concurrent execution and locally nondeterministic scheduling, we prove that the calculus is confluent and guarantees determinacy. ...
We recently developed a programming model based on concurrent revisions that addresses this challenge in a novel way: each forked task gets a conceptual copy of all the shared state, and state changes ...
Acknowledgments We thank Tim Harris and Tom Ball for helpful comments and discussions. ...
doi:10.1007/978-3-642-19718-5_7
fatcat:vxmzc5hlujaytn6noqqgt4o7t4
Task-Level Data Model for Hardware Synthesis Based on Concurrent Collections
2012
Journal of Electrical and Computer Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
Polyhedral models are embedded in TLDM for concise expression of task instances, array accesses, and dependencies. ...
for data processing applications. ...
Acknowledgement This work is partially funded by the Center for Domain-Specific Computing (NSF Expeditions in Computing Award CCF-0926127), and the Semiconductor Research Corporation under Contract 2009 ...
doi:10.1155/2012/691864
fatcat:p25oxad2e5e3neqpzegft77qhe
Eventually Consistent Transactions
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
To demonstrate that eventually consistent transactions can be effectively implemented, we establish a handful of simple operational rules for managing replicas, versions and updates, based on graphs called ...
When distributed clients query or update shared data, eventual consistency can provide better availability than strong consistency models. ...
We thank Marc Shapiro for introducing us to a principled world of eventual consistency, and for general guidance. ...
doi:10.1007/978-3-642-28869-2_4
fatcat:k7vnr5bounevxlzqhqqf22owuq
Runtime Verification of k-Mutual Exclusion for SoCs
2007
2007 Eighth International Workshop on Microprocessor Test and Verification
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We present an efficient runtime verification environment for detecting mutual exclusion predicates. Such predicates are important for keeping the safe operation of concurrent systems. ...
Our k-exclusion algorithm exploits the fact that if there is a k-exclusion violation then it is impossible to partition events from critical sections into k queues. ...
Abstract-We present an efficient runtime verification environment for detecting mutual exclusion predicates. Such predicates are important for keeping the safe operation of concurrent systems. ...
doi:10.1109/mtv.2007.21
dblp:conf/mtv/IkizS07
fatcat:kbn267xgbrddbiyx6hbfe23pfm
The role of APL and J in high-performance computation
1993
Proceedings of the international conference on APL - APL '93
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The paper discusses the value of abstraction and semantic richness, performance issues, portability, potential degree of parallelism, data distribution, process creation, communication and synchronization ...
Parallelism in algorithm design is difficult for those who think in von Neumann terms. ...
In APL, on the other hand, all array accesses are abstract, and it is impossible for a user to discern the internal storage representation used for an array. ...
doi:10.1145/166197.166201
dblp:conf/apl/Bernecky93a
fatcat:fxy4bleuxnebbjwtskouzncmyq
Identifying a Unifying Mechanism for the Implementation of Concurrency Abstractions on Multi-language Virtual Machines
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Supporting all known abstractions for concurrent and parallel programming in a virtual machines (VM) is a futile undertaking, but it is required to give programmers appropriate tools and performance. ...
Our survey of parallel and concurrent programming concepts identifies concurrency abstractions as the ones benefiting most from support in a VM. ...
Stefan Marr is supported by a doctoral scholarship of the Institute for the Promotion of Innovation through Science and Technology in Flanders (IWT-Vlaanderen), Belgium. ...
doi:10.1007/978-3-642-30561-0_13
fatcat:bciuuqrsgrfalk7k5wnpslwviq
Provably good scheduling for parallel programs that use data structures through implicit batching
2014
Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures - SPAA '14
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
BATCHER takes as input (1) a dynamically multithreaded program that makes arbitrary parallel accesses to an abstract data type, and (2) an implementation of the abstract data type as a batched data structure ...
, even though the data structure is accessed concurrently. ...
Acknowledgements This research was supported by National Science Foundation grants CCF-1340571, CCF-1150036, CCF-1218017, CCF-1218188, and CCF-1314633. ...
doi:10.1145/2612669.2612688
dblp:conf/spaa/AgrawalFLSSU14
fatcat:elh5i3dm5zecxpovgmqpk4mvem
Provably good scheduling for parallel programs that use data structures through implicit batching
2014
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
BATCHER takes as input (1) a dynamically multithreaded program that makes arbitrary parallel accesses to an abstract data type, and (2) an implementation of the abstract data type as a batched data structure ...
, even though the data structure is accessed concurrently. ...
Acknowledgements This research was supported by National Science Foundation grants CCF-1340571, CCF-1150036, CCF-1218017, CCF-1218188, and CCF-1314633. ...
doi:10.1145/2692916.2555284
fatcat:cpekjtlmdrfdjl64xgt5g6ma7u
« Previous
Showing results 1 — 15 out of 1,319 results