12,950 Hits in 2.5 sec

A concurrent algorithm for avoiding deadlocks in multiprocess multiple resource systems

Rafael O. Fontao
1971 Proceedings of the third symposium on Operating systems principles - SOSP '71  
This is a standard requirement for deadlock avoidance algorithms ( dynamic avoidance ). In addition, requests are restricted so that a process may request only units from a single resource class.  ...  This algorithm is executed concurrently with other processes between requests for resource allocations.  ...  This is a standard requirement for deadlock avoidance algorithms ( dynamic avoidance ). In addition, requests are restricted so that a process may request only units from a single resource class.  ... 
doi:10.1145/800212.806502 dblp:conf/sosp/Fontao71 fatcat:f765ne75pbc5tjk543rvxaqezy

An Algorithm for Avoiding Deadlock

Md. Nawab Yousuf Ali, Mohammad Zakir Hossain Sarker
2005 2005 Pakistan Section Multitopic Conference  
Finally, the deadlock avoidance algorithm for multiprocessors system is presented.  ...  In this paper a method has been proposed to avoid the deadlock in multiprocessor system. A multiprocessor system with two processors has been used here. Two resources i.e.  ...  Our Algorithm to avoid deadlock In two processors system if there are two processes for each processor and two resources the algorithm will be as follow: Step 1: While any of the processes of a processor  ... 
doi:10.1109/inmic.2005.334477 fatcat:jvjmav73mnhrlmykhjykhqw6xa

The application of supervisory control to deadlock avoidance in concurrent software

Yin Wang, Terence Kelly, Manjunath Kudlur, Scott Mahlke, Stephane Lafortune
2008 2008 9th International Workshop on Discrete Event Systems  
We propose and validate a novel methodology for dynamically controlling the execution of concurrent software in order to provably avoid deadlocks.  ...  Specifically, we synthesize feedback controllers for concurrent programs based on the theory of supervision based on place invariants and implement the controllers online to guarantee deadlock avoidance  ...  ; 2) a new approach for modeling concurrent software in a systematic manner based on compiler techniques; 3) a novel adaptation of the SBPI method to the deadlock avoidance problem in concurrent software  ... 
doi:10.1109/wodes.2008.4605961 fatcat:kmsncptxbjc3pcjpxhbx2necju

A Scalable, Sound, Eventually-Complete Algorithm for Deadlock Immunity [chapter]

Horatiu Jula, George Candea
2008 Lecture Notes in Computer Science  
We introduce the concept of deadlock immunity-a program's ability to avoid all deadlocks that match patterns of deadlocks experienced in the past.  ...  Deadlock immunity is as useful as complete freedom from deadlocks in many practical cases, so we see the present algorithm as a pragmatic step toward ridding complex concurrent programs of their deadlocks  ...  This paper makes three main contributions: (a) An algorithm for developing deadlock immunity with no assistance from programmers or users; (b) Proof that the algorithm is sound (i.e., avoids deadlocks  ... 
doi:10.1007/978-3-540-89247-2_8 fatcat:4s5wwk2utjaudk2hdzrbr2o2nm

An evaluation of the Chandy-Misra-Bryant algorithm for digital logic simulation

Larry Soulé, Anoop Gupta
1991 ACM Transactions on Modeling and Computer Simulation  
A quantitative evaluation of the concurrency exhibited by the CMB algorithm shows that an average of 42-196 element activations can be evaluated in parallel if arbitrary many processors are available.  ...  Using domain-specific knowledge, we propose and evaluate several methods for both reducing the number of deadlock occurrences and for reducing the time spent on each occurrence.  ...  This algorithm was shown to exhibit a concurrency of 42-196 for the six benchmark circuits.  ... 
doi:10.1145/130611.130613 fatcat:3lki7xqyejgpxmug6q6bxo7yna

Slider: an online and active deadlock avoider by serial execution of critical sections

Zhen Yu, Xiaohong Su, Peijun Ma
2016 International Journal of High Performance Systems Architecture  
Existing dynamic deadlock avoidance techniques have four main drawbacks: limited capability, offline avoidance algorithm, passive avoidance strategy and poor usability.  ...  To solve these problems, we propose a user-friendly, online and active avoidance technique, called Slider, to avoid multiple types of deadlocks.  ...  Additionally, unlike STM systems, Slider does not rollback/re-execute a target program, so it can correctly avoid deadlocks for concurrent programs performing IO operations.  ... 
doi:10.1504/ijhpsa.2016.076193 fatcat:m4zeehco4rgxplzheyh4zrf7de

CalFuzzer: An Extensible Active Testing Framework for Concurrent Programs [chapter]

Pallavi Joshi, Mayur Naik, Chang-Seo Park, Koushik Sen
2009 Lecture Notes in Computer Science  
In this paper, we present an extensible framework for active testing of Java programs. The framework currently implements three active testers based on data races, atomic blocks, and deadlocks.  ...  It first uses predictive off-the-shelf static or dynamic program analyses to identify potential concurrency bugs, such as data races, deadlocks, and atomicity violations.  ...  This research was supported in part by a generous gift from Intel, Microsoft and Intel funding (award #20080469), matching funding by U.C. Discovery (award #DIG07-10227), and NSF Grant CNS-0720906.  ... 
doi:10.1007/978-3-642-02658-4_54 fatcat:n46tnwdgafa4hf6ujds67drx4e

Efficient Multithreaded Context ID Allocation in MPI [chapter]

James Dinan, David Goodell, William Gropp, Rajeev Thakur, Pavan Balaji
2012 Lecture Notes in Computer Science  
Through this work, we have discovered a subtle concurrency bug in the existing algorithm that can result in deadlock.  ...  We present an efficient algorithm for multithreaded context ID allocation that builds on an existing production algorithm developed to support MPI 2.2.  ...  Eliminating the Overhead of Deadlock Avoidance As discussed in Section 3, a synchronization step before entry to the context ID allocation loop is necessary to avoid deadlock.  ... 
doi:10.1007/978-3-642-33518-1_11 fatcat:uemotlsot5bphdlotmwzwhbwry

A Novel Priority-based Deadlock Detection and Resolution Algorithm in Mobile Agent Systems

Wei Lu, Yong Yang, Weiwei Xing, Liqiang Wang, Xiaoping Che
2016 Proceedings of the 22nd International Conference on Distributed Multimedia Systems  
In this paper, we propose a deadlock detection and resolution algorithm in mobile agent systems.  ...  Analysis and simulation results indicate that our algorithm can provide better performance and avoid duplicate detection and resolutions of the same deadlock in condition of concurrent execution.  ...  The proposed algorithm asserts a deadlock when a detection agent visiting a consume agent twice. In addition, the proposed algorithm supports deadlock avoidance and multiple detection agents.  ... 
doi:10.18293/dms2016-014 dblp:conf/dms/YangXWCL16 fatcat:6wzbm53krfh6xaua4um42i3xcm

The Deadlock Problem: An Overview

Isloor, Marsland
1980 Computer  
Such contemporary systems exhibit a high degree of resource and data sharing, a situation in which deadlock is a constant threat.  ...  Modern multiprogramming systems are designed to support a high degree of parallelism by ensuring that as many system components as possible are operating concurrently.  ...  Acknowledgments This research was supported in part by a grant from the National Science and Engineering Council of Canada.  ... 
doi:10.1109/mc.1980.1653786 fatcat:mfafoaoaurf6rjeznv2774glny

Formal Verification of Programs That Use MPI One-Sided Communication [chapter]

Salman Pervez, Ganesh Gopalakrishnan, Robert M. Kirby, Rajeev Thakur, William Gropp
2006 Lecture Notes in Computer Science  
Considering that many other areas of concurrent hardware and software design are now routinely employing model checking, our experience confirms that the MPI community can greatly benefit from the use  ...  Fig. 2 .Fig. 3 .Fig. 4 . 234 Pseudocode for the deadlock-free byte-range locking algorithm (Pseudocode for the deadlock-free byte-range locking algorithm (Avoiding circular loops among processes picked  ...  We avoid this deadlock following the algorithm in Figure 4 which, essentially, looks for a cycle among all the processes that are about to wait on each other.  ... 
doi:10.1007/11846802_13 fatcat:buuzci3ec5acvmjado4xgvafoq

Analysis of Emerging Field Related to Distributed Concurrency control

Rajdeep Singh Solanki
2018 International Journal for Research in Applied Science and Engineering Technology  
We also show other issues cause by distributed concurrency control. We discuss that recovery considerations do not affect the correctness of our results.  ...  In this chapter, we explore the emerging field related to distribute concurrency control. We discuss advance transaction process called nested transaction and issues of nested transaction.  ...  There is a deadlock. IX. ALGORITHM FOR DEADLOCK A. Path-Pushing Algorithms The basic idea underlying this class of algorithms is to build some simplified form of global WFG at each site.  ... 
doi:10.22214/ijraset.2018.1434 fatcat:5eerz7tnxbajbou5ataz6djjaa

Page 2942 of Mathematical Reviews Vol. , Issue 95e [page]

1995 Mathematical Reviews  
ISBN 3-486-22859-5 Summary: “We provide a designer of an application in concurrent systems with a method for predicting and avoiding potential static deadlocks.  ...  Augustin) % On deadlocks in concurrent systems: a Petri net based approach for deadlock prediction and avoidance. (English summary) Dissertation, University of Koblenz-Landau, Koblenz, 1993.  ... 

A Survey on Determining the Characteristics of Deadlock, Scheduling and Workflow Instances and Providing New Algorithms for the Issues Arising in Hybrid Cloud

B. Arunkumar, T.Ravichandran T.Ravichandran
2015 International Journal of Computer Applications  
Effective scheduling is a key concern for the execution of performance driven cloud applications.  ...  To improve the performance of the entire system a high degree of concurrency is obtained by running multiple instances at the same time.  ...  to avoid the deadlock.  ... 
doi:10.5120/19386-0883 fatcat:lbhzzgqh6rcndo6gxbortrhl6a

Design Principles for Scaling Multi-core OLTP Under High Contention

Kun Ren, Jose M. Faleiro, Daniel J. Abadi
2016 Proceedings of the 2016 International Conference on Management of Data - SIGMOD '16  
We find that these two principles alone result in significantly improved scalability on high-contention workloads, and an order of magnitude increase in throughput for a non-trivial subset of these contended  ...  Thus, linear scalability for contended workloads is impossible.  ...  We thank the anonymous SIGMOD 2016 reviewers for their insightful feedback.  ... 
doi:10.1145/2882903.2882958 dblp:conf/sigmod/RenFA16 fatcat:roaa2bqhybb4lidgkk5zaeplcy
« Previous Showing results 1 — 15 out of 12,950 results