%0 Conference Paper %1 citeulike:7083879 %A Wang, Yin %A Liao, Hongwei %A Nazeem, Ahmed %A Reveliotis, Spyros %A Kelly, Terence %A Mahlke, Scott %A Lafortune, Stephane %B 2009 IEEE International Conference on Automation Science and Engineering %D 2009 %I IEEE %K avoidance, banker, banquero, citas, citeulike deadlock, permissive, programming, programs %P 37--41 %R 10.1109/coase.2009.5234118 %T Maximally permissive deadlock avoidance for multithreaded computer programs (Extended abstract) %U http://dx.doi.org/10.1109/coase.2009.5234118 %X Multicore architectures in computer hardware bring an unprecedented need for parallel programming. In the work considered in this presentation, we are especially interested in multithreaded programs with shared data. In this widely- used programming paradigm, "lock" primitives are employed to control access to the shared data within the program threads.In this write-up, we report the progress of an ongoing project, called Gadara1, that seeks to provide a systematic solution to the aforementioned deadlock handling problem. More specifically, Gadara uses discrete event control theory and its specialization in the context of resource allocation in order to detect potential deadlocks and control the run-time execution of the underlying programs in a way that guarantees that these deadlocks never occur. %@ 978-1-4244-4578-3

@inproceedings{citeulike:7083879, abstract = {{Multicore architectures in computer hardware bring an unprecedented need for parallel programming. In the work considered in this presentation, we are especially interested in multithreaded programs with shared data. In this widely- used programming paradigm, "lock" primitives are employed to control access to the shared data within the program threads.In this write-up, we report the progress of an ongoing project, called Gadara1, that seeks to provide a systematic solution to the aforementioned deadlock handling problem. More specifically, Gadara uses discrete event control theory and its specialization in the context of resource allocation in order to detect potential deadlocks and control the run-time execution of the underlying programs in a way that guarantees that these deadlocks never occur.}}, added-at = {2017-09-08T10:52:59.000+0200}, author = {Wang, Yin and Liao, Hongwei and Nazeem, Ahmed and Reveliotis, Spyros and Kelly, Terence and Mahlke, Scott and Lafortune, Stephane}, biburl = {https://www.bibsonomy.org/bibtex/25dc4c2fab9e7a132e5321d3794fb73af/fernand0}, booktitle = {2009 IEEE International Conference on Automation Science and Engineering}, citeulike-article-id = {7083879}, citeulike-linkout-0 = {http://dx.doi.org/10.1109/coase.2009.5234118}, citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5234118}, doi = {10.1109/coase.2009.5234118}, interhash = {f3fd6a56d288f8ecddd418561622e217}, intrahash = {5dc4c2fab9e7a132e5321d3794fb73af}, isbn = {978-1-4244-4578-3}, keywords = {avoidance, banker, banquero, citas, citeulike deadlock, permissive, programming, programs}, location = {Bangalore, India}, month = aug, pages = {37--41}, posted-at = {2010-04-26 09:43:03}, priority = {2}, publisher = {IEEE}, timestamp = {2017-09-08T10:53:23.000+0200}, title = {{Maximally permissive deadlock avoidance for multithreaded computer programs (Extended abstract)}}, url = {http://dx.doi.org/10.1109/coase.2009.5234118}, year = 2009 }