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
.
Filters
Isolating failure-inducing thread schedules
2002
Software engineering notes
In a case study, Delta Debugging isolated the failure-inducing schedule difference from 3.8 billion differences in only 50 tests. ...
Using the DEJAVU capture/replay tool, it is possible to record the thread schedule and replay the application in a deterministic way. ...
We use Delta Debugging [21] to automatically isolate the failure cause in a failure-inducing thread schedule. ...
doi:10.1145/566171.566211
fatcat:tvdzg6eq7ralllqmeuwl63fwly
Isolating failure-inducing thread schedules
2002
Software engineering notes
manually -Main idea of the paper Isolating Failure-Inducing Thread Schedules, but solution for automated testing. ...
thread schedule in the padded form < 5, 7, 8, 10, 15 > -failure-inducing thread schedule < 5, 7, 8, 13, 17 > -passing thread schedule stest is defined to return: if the queue holds the value 95 if the ...
doi:10.1145/566172.566211
dblp:conf/issta/ChoiZ02
fatcat:wwj7smjuc5eclea37bkp5gysry
Isolating failure-inducing thread schedules
2002
Software engineering notes
In a case study, Delta Debugging isolated the failure-inducing schedule difference from 3.8 billion differences in only 50 tests. ...
Using the DEJAVU capture/replay tool, it is possible to record the thread schedule and replay the application in a deterministic way. ...
We use Delta Debugging [21] to automatically isolate the failure cause in a failure-inducing thread schedule. ...
doi:10.1145/566210.566211
fatcat:upnhc6prljfyxkvbcrrjfcz5qm
Automatic debugging of System-on-a-Chip designs
2009
2009 IEEE International SOC Conference (SOCC)
In this paper, we present a new approach that supports automatic debugging of SoC designs written in SystemC using a method that isolates failure-inducing process schedules. ...
However, the non-deterministic semantics of such parallel languages could yield failures that are hard to debug. ...
As soon as a passing and a failing schedule are available, the failure-inducing difference is isolated between them using dd. ...
doi:10.1109/soccon.2009.5398027
dblp:conf/socc/RoginDR09
fatcat:eticu4njivahzl2zb4mnpzlmkm
Concurrency debugging with differential schedule projections
2015
Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI 2015
In our experiments, DSPs contain 81% fewer events and 96% fewer data-flows than the full failure-inducing schedules. ...
To build a DSP, Symbiosis first generates a full, failing, multithreaded schedule via thread path profiling and symbolic constraint solving. ...
Concurrency bugs are errors in code that permit multi-threaded schedules that lead to a failure. ...
doi:10.1145/2737924.2737973
dblp:conf/pldi/MachadoLR15
fatcat:khxih52pwzaczmoxygsp4ted7a
Concurrency debugging with differential schedule projections
2015
SIGPLAN notices
In our experiments, DSPs contain 81% fewer events and 96% fewer data-flows than the full failure-inducing schedules. ...
To build a DSP, Symbiosis first generates a full, failing, multithreaded schedule via thread path profiling and symbolic constraint solving. ...
Concurrency bugs are errors in code that permit multi-threaded schedules that lead to a failure. ...
doi:10.1145/2813885.2737973
fatcat:mihkcwn43vckrbqd5kfc5oxqmy
Production-guided concurrency debugging
2016
Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming - PPoPP '16
By leveraging this information from production runs, Cortex synthesizes executions to guide the search for failing schedules. ...
Cortex preemptively exposes failing executions by perturbing the order of events and controlflow behavior in non-failing schedules from production runs of a program. ...
Note that without Cortex's unique ability to explore both schedule and path variations, this failure would not have been exposed. Root cause isolation. ...
doi:10.1145/2851141.2851149
dblp:conf/ppopp/MachadoLR16
fatcat:2ko5kv2jcvcaxkmxbf4dlar2lq
Concurrency Debugging with Differential Schedule Projections
2016
ACM Transactions on Software Engineering and Methodology
In our experiments, DSPs contain 90% fewer events and 96% fewer dataflows than the full failure-inducing schedules. ...
To build a DSP, Symbiosis first generates a full, failing, multithreaded schedule via thread path profiling and symbolic constraint solving. ...
Failing Schedule Generation The symbolic, per-thread traces do not explicitly encode the multithreaded schedule that led to the failure. ...
doi:10.1145/2885495
fatcat:77lubcftobbknk2ac55urpsnm4
Analyzing concurrency bugs using dual slicing
2010
Proceedings of the 19th international symposium on Software testing and analysis - ISSTA '10
Given two schedules, one inducing the failure and the other not, our technique collects traces of the two executions, and compares them to identify salient differences. ...
This paper proposes a novel dynamic analysis that automatically produces the causal path of a concurrent failure leading from the root cause to the failure. ...
For instance, given a buggy program and failure inducing input, chess [13] is able to identify a schedule comprising a bounded sequence of preemptions that induces the failure. ...
doi:10.1145/1831708.1831740
dblp:conf/issta/WeeratungeZSJ10
fatcat:wvt3l32nzzhtjboprtieoan5lq
Analyzing multicore dumps to facilitate concurrency bug reproduction
2010
Proceedings of the fifteenth edition of ASPLOS on Architectural support for programming languages and operating systems - ASPLOS '10
By generating a core dump at this point, and comparing the differences betwen the two dumps, we are able to guide a search algorithm to efficiently generate a failure inducing schedule. ...
The problem is exacerbated in multi-core environments where there are multiple schedulers, one for each core. ...
search algorithm is used to generate failure inducing schedules. ...
doi:10.1145/1736020.1736039
dblp:conf/asplos/WeeratungeZJ10
fatcat:e24j73xpbfdchb4uaglftifxqi
Analyzing multicore dumps to facilitate concurrency bug reproduction
2010
SIGARCH Computer Architecture News
By generating a core dump at this point, and comparing the differences betwen the two dumps, we are able to guide a search algorithm to efficiently generate a failure inducing schedule. ...
The problem is exacerbated in multi-core environments where there are multiple schedulers, one for each core. ...
search algorithm is used to generate failure inducing schedules. ...
doi:10.1145/1735970.1736039
fatcat:ncnn4car6fb5zem35zmrpbs73a
Analyzing multicore dumps to facilitate concurrency bug reproduction
2010
SIGPLAN notices
By generating a core dump at this point, and comparing the differences betwen the two dumps, we are able to guide a search algorithm to efficiently generate a failure inducing schedule. ...
The problem is exacerbated in multi-core environments where there are multiple schedulers, one for each core. ...
search algorithm is used to generate failure inducing schedules. ...
doi:10.1145/1735971.1736039
fatcat:asuuajsrs5fkxave5dvxxtqk4y
Concurrency Debugging with MaxSMT
2019
PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE
However, MaxSMT has seldom been used in debugging multi-threaded software.Multi-threaded programs are usually non-deterministic due to the huge number of possible thread operation schedules, which makes ...
A recent approach to isolate the root cause of concurrency bugs in multi-threaded software is to produce a report that shows the differences between a failing and a non-failing execution. ...
Afterwards, SYMBIOSIS resorts to an SMT solver to solve the constraint system and output a failure-inducing ordering of operations, i.e. the failing schedule. ...
doi:10.1609/aaai.v33i01.33011608
fatcat:6cfxckbscbdbzlbejavmbeksuu
Frugal but flexible multicore topologies in support of resource variation-driven adaptivity
2011
2011 Design, Automation & Test in Europe
With the incorporation of a limited set of neighborhood-centered communication links, threads are allowed to be directly migrated among adjacent cores without physical data movement. ...
These schedules are able to deliver predictable execution despite the increased levels of device unreliability in future multicore systems. ...
As an example, Fig. 1b uses arrows to indicate the workload migration directions to isolate 𝑃 2 . ...
doi:10.1109/date.2011.5763201
dblp:conf/date/YangO11
fatcat:tzy2tqtdw5fdtfy62lkadbzqea
Resilient Work Stealing
[article]
2017
arXiv
pre-print
A comparison with the work-stealing scheduler of Threading Building Blocks on the PARSEC benchmark suite shows that Cobra incurs no performance overhead in the absence of failures, and low performance ...
As a proof of concept, we present Cobra, a novel design for a shared-memory work-stealing scheduler that realizes this notion of restartable task graphs, and enables computations to survive hardware failures ...
In this way, the failure can be isolated and its impact on the running software minimized. ...
arXiv:1706.03539v1
fatcat:6ra44pvelbbpfaixu2vrg5hyim
« Previous
Showing results 1 — 15 out of 11,818 results