A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Context-Bounded Model Checking of Concurrent Software
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
However, the analysis can still discover intricate bugs and is sound up to the bound since within each context, a thread is fully explored for unbounded stack depth. ...
The interaction among concurrently executing threads of a program results in insidious programming errors that are difficult to reproduce and fix. ...
Dynamic Concurrent Pushdown Systems In this section, we define a dynamic concurrent pushdown system with operations for forking and joining on a thread. ...
doi:10.1007/978-3-540-31980-1_7
fatcat:babkdvqg55g7rd6eceozducfae
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.
Finally, we present two operational models (single server and server pool) of systems that provide eventually consistent transactions. ...
However, programming and implementing such systems can be difficult unless we establish a reasonable consistency model, i.e. some minimal guarantees that programmers can understand and systems can provide ...
We also thank Tom Ball, Sean McDirmid and Benjamin Wood for inspired discussions, helpful examples, and constructive comments. ...
doi:10.1007/978-3-642-28869-2_4
fatcat:k7vnr5bounevxlzqhqqf22owuq
Software speculative multithreading for Java
2007
Companion to the 22nd ACM SIGPLAN conference on Object oriented programming systems and applications companion - OOPSLA '07
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.
or fork heuristics that use online profiling data. ...
the extent to which various factors in an SpMT system enable speedup and the extent to which other factors prevent it. ...
Similarly, child joins are always associate with the parent thread exiting a stack frame and returning to a fork point. ...
doi:10.1145/1297846.1297950
dblp:conf/oopsla/Pickett07
fatcat:6zydjc6hwbflvfstmm574e2nam
SideTrack
2009
Proceedings of the 7th Workshop on Parallel and Distributed Systems Testing, Analysis, and Debugging - PADTAD '09
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.
Prior dynamic atomicity analyses include precise tools, which report an error if and only if the observed trace is not serializable; and imprecise tools, which generalize from the observed trace to report ...
We store a call stack for the first and second acquires for the last vulnerable window in the instrumentation state associated with each lock, and call stacks for all locks acquired in the current transaction ...
) and end (t, l), which demarcate an atomic block labelled l; • fork (t, u), which forks a new thread u; and • join(t, u), which blocks until thread u terminates. ...
doi:10.1145/1639622.1639630
dblp:conf/issta/YiSF09
fatcat:oj5t2fyz6vgk3pqzwc6ve63k5e
Featherweight transactions
2007
Proceedings of the 12th ACM SIGPLAN symposium on Principles and practice of parallel programming - PPoPP '07
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 2008; you can also visit the original URL.
The file type is application/pdf.
The implicit connection between transaction memory and threads has the unfortunate effect of limiting the use of transactions because threads are expensive to create and use in most systems. ...
() method), suspend all work items in a specific group, perform group level joins, splits and reductions, etc. ...
doi:10.1145/1229428.1229453
dblp:conf/ppopp/MaratheHL07
fatcat:qousblli4jf4zluhce3wot5zne
Stream Processing with Dependency-Guided Synchronization (Artifact)
[article]
2021
Zenodo
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 2022; you can also visit the original URL.
The file type is application/pdf.
The tree is joined in order to process rules and is then forked back to keep processing transactions. ...
The fork and join are very similar to the ones in Figure 1 and just separate the state with respect to the keys. ...
doi:10.5281/zenodo.5722610
fatcat:gqfjiy3ny5bpdkpvyvem65n2eq
NePaLTM: Design and Implementation of Nested Parallelism for Transactional Memory Systems
[chapter]
2009
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 2017; you can also visit the original URL.
The file type is application/pdf.
This paper fills in that gap by introducing NePaLTM (Nested PAralleLism for Transactional Memory), the first TM system supporting nested parallelism inside transactions. ...
However, all currently existing TM systems deliver on this promise only partially by disallowing parallel execution of computations performed inside transactions. ...
control and OpenMP-style fork-join programming model. ...
doi:10.1007/978-3-642-03013-0_7
fatcat:ashsdngwofdmxl3yfwypke6xyi
NePalTM
2009
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 paper fills in that gap by introducing NePaLTM (Nested PAralleLism for Transactional Memory), the first TM system supporting nested parallelism inside transactions. ...
However, all currently existing TM systems deliver on this promise only partially by disallowing parallel execution of computations performed inside transactions. ...
control and OpenMP-style fork-join programming model. ...
doi:10.1145/1594835.1504220
fatcat:s5p6zp6uszfvlamz7q4a5s43fa
NePalTM
2008
Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming - PPoPP '09
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 paper fills in that gap by introducing NePaLTM (Nested PAralleLism for Transactional Memory), the first TM system supporting nested parallelism inside transactions. ...
However, all currently existing TM systems deliver on this promise only partially by disallowing parallel execution of computations performed inside transactions. ...
control and OpenMP-style fork-join programming model. ...
doi:10.1145/1504176.1504220
dblp:conf/ppopp/VolosWASTN09
fatcat:7nv3yup2tzdkrogvxyuxefdajm
An editor for revision control
1987
ACM Transactions on Programming Languages and Systems
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.
ACKNOWLEDGMENTS The authors thank Dave Hanson and the referees for numerous suggestions that improved both EH and this presentation. ...
ACM Transactions on Programming Languages and Systems, Vol. 9, No. 2, April 1987. ...
ACM Transactions on Programming Languages and Systems, Vol. 9, No. 2, April 1987. ...
doi:10.1145/22719.22948
fatcat:xqxvped6gjcntexdjzsodcoiui
Nested parallelism in transactional memory
2008
Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming - PPoPP '08
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.
In the restricted case when no transactions abort and there are no concurrent readers, CWSTM executes a transactional computation on p processors also in time O(T 1 /p+ pT ∞ ). ...
Using XConflict, we describe CWSTM, a runtime-system design for software transactional memory which supports transactions with nested parallelism and unbounded nesting depth of transactions. ...
CONCLUSIONS The CWSTM model presented in Section 5 describes one approach for implementing a software transactional memory system that supports transactions with nested fork-join parallelism. ...
doi:10.1145/1345206.1345232
dblp:conf/ppopp/AgrawalFS08
fatcat:yyk2pvb53raszg256li6jxxewa
Use case maps as architectural entities for complex systems
1998
IEEE Transactions on Software 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 2001; you can also visit the original URL.
The file type is application/pdf.
The notation has been thoroughly exercised on systems of industrial scale and complexity and the distilled essence of what has been found to work in practice is summarized in this paper. ...
This paper presents a novel, scenario-based notation called Use Case Maps (UCMs) for describing, in a high-level way, how the organizational structure of a complex system and the emergent behavior of the ...
I would particularly like to mention the following relatively recent ones (in alphabetical order): Daniel Amyot, Don Bailey, Francis Bordeleau ...
doi:10.1109/32.738343
fatcat:oocooyny4vhijdyveh7f5ih2hq
BLOCKBENCH: A Framework for Analyzing Private Blockchains
[article]
2017
arXiv
pre-print
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 2019; you can also visit the original URL.
The file type is application/pdf.
Furthermore, there are gaps in performance among the three systems which are attributed to the design choices at different layers of the software stack. ...
The results demonstrate that these systems are still far from displacing current database systems in traditional data processing workloads. ...
Acknowledgment We would like to thank the anonymous reviewers for their comments and suggestions that help us improve the paper. ...
arXiv:1703.04057v1
fatcat:czc76zfsvfd3xhh5jmaob6veeq
BLOCKBENCH
2017
Proceedings of the 2017 ACM International Conference on Management of Data - SIGMOD '17
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 2019; you can also visit the original URL.
The file type is application/pdf.
Furthermore, there are gaps in performance among the three systems which are attributed to the design choices at different layers of the blockchain's software stack. ...
The results demonstrate that these systems are still far from displacing current database systems in traditional data processing workloads. ...
Acknowledgment We would like to thank the anonymous reviewers for their comments and suggestions that help us improve the paper. ...
doi:10.1145/3035918.3064033
dblp:conf/sigmod/DinhW0LOT17
fatcat:i32pmfvtpbhhto2ykzlbk3fo2e
Extensive evaluation of programming models and ISAs impact on multicore soft error reliability
2018
Proceedings of the 55th Annual Design Automation Conference on - DAC '18
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 2019; you can also visit the original URL.
The file type is application/pdf.
As the OpenMP does not fully utilize the available cores due to the fork/join parallelization approach where a loop statement executes in parallel and other code portions hastily. ...
Parallelization API The OpenMP library uses a series of the fork and joins approach to parallelize loop statements (e.g., for, while) where the API automatically create children threads, being suitable ...
doi:10.1145/3195970.3196050
dblp:conf/dac/RosaBRO18
fatcat:t46jlv5y6jc43jkjjv63ucgjna
« Previous
Showing results 1 — 15 out of 1,391 results