Relevant bibliographies by topics / Deadlock minimization

Contents

  1. Journal articles
  2. Dissertations / Theses

Academic literature on the topic 'Deadlock minimization'

Author: Grafiati
Published: 11 September 2023
Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Deadlock minimization.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Deadlock minimization"

1

Rudy, Jarosław, Radosław Idzikowski, Elzbieta Roszkowska, and Konrad Kluwak. "Multiple Mobile Robots Coordination in Shared Workspace for Task Makespan Minimization." Processes 10, no. 10 (2022): 2087. http://dx.doi.org/10.3390/pr10102087.

Full text
Abstract:
In this paper we consider a system of multiple mobile robots (MMRS) and the process of their concurrent motion in a shared two-dimensional workspace. The goal is to plan the robot movement along given fixed paths so as to minimize the completion time of all the robots while ensuring that they never collide. Thus, the considered problem combines the problems of robot schedule optimization with collision and deadlock avoidance. The problem formulation is presented and its equivalent reformulation that does not depend explicitly on the geometry of the robot paths is proposed. An event-based solut
APA, Harvard, Vancouver, ISO, and other styles
2

Pritykin, F. N. "SIMULATION OF HYPERSURFACES BASED ON THE DATABASE OF KINEMATIC PARAMETERS OF THE ANDROID ROBOT MECHANISM." Vestnik komp'iuternykh i informatsionnykh tekhnologii, no. 217 (July 2022): 21–29. http://dx.doi.org/10.14489/vkit.2022.07.pp.021-029.

Full text
Abstract:
The paper proposes a method that allows the modernization of the methodology for constructing manipulator movements according to the velocity vector, which makes it possible to exclude the occurrence of deadlocks in the process of computer simulation of movements. The developed algorithm is based on the use of a database characterizing the values of kinematic parameters that set the permissible instantaneous states of the manipulator mechanism at its various positions. A graphical representation of the hypersurface reflecting the relationship of these kinematic parameters from the values of ge
APA, Harvard, Vancouver, ISO, and other styles
3

Junior, Luneque, Nadia Nedjah, and Luiza Mourelle. "ACO-based Algorithms for Search and Optimization of Routes in NoC Platform." JUCS - Journal of Universal Computer Science 18, no. (7) (2012): 917–36. https://doi.org/10.3217/jucs-018-07-0917.

Full text
Abstract:
Network-on-Chip (NoC) have been used as an interesting option in design of communication infrastructures for embedded systems, providing a scalable structure and balancing the communication between cores. Because several data packets can be transmitted simultaneously through the network, an efficient routing strategy must be used in order to avoid congestion delays. In this paper, ant colony algorithms were used to find and optimize routes in a mesh-based NoC. The routing optimization is driven by the minimization of total latency in packets transmission. The simulation results show the effect
APA, Harvard, Vancouver, ISO, and other styles
4

Сенчуков, В. Ф., та Т. В. Денисова. "V-МІНІМІЗАЦІЯ БУЛЕВИХ ФУНКЦІЙ ЗА МАТРИЦЕЮ ВІДСТАНЕЙ ТА ЗВЕДЕННЯМ ДО ЗАДАЧІ МАТЕМАТИЧНОГО ПРОГРАМУВАННЯ". Open Information and Computer Integrated Technologies, № 88 (6 листопада 2020): 123–33. http://dx.doi.org/10.32620/oikit.2020.88.10.

Full text
Abstract:
The further development of the analytical method for minimizing Boolean functions (BF) in the class of disjunctive normal forms by the numbers of sets of argument values, called -minimization, is proposed. Such an approach allows to reduce the process of minimizing the BF to the use of an exclusively analytical description of all its steps using functions of the number of the set of the BF argument values. In general, the idea is to develop such a toolkit that allows at all stages of the minimization process to operate only with numerical objects – Boolean vectors, not involve a visual analysi
APA, Harvard, Vancouver, ISO, and other styles
5

Сенчуков, Віктор Федорович, та Тетяна Володимирівна Денисова. "МІНІМІЗАЦІЯ БУЛЕВИХ ФУНКЦІЙ ЗА НОМЕРАМИ НАБОРІВ ЗНАЧЕНЬ АРГУМЕНТІВ". Open Information and Computer Integrated Technologies, № 83 (23 травня 2019): 156–67. http://dx.doi.org/10.32620/oikit.2019.83.11.

Full text
Abstract:
An original approach to analytic canonical minimization of switching (Boolean) functions, which is based on the representation of Boolean functions (BF) as a function of one variable – the number of the set í of values of its arguments, is proposed. For this, using the Antje function, the dependence (in the form of formulas) of the values of each of n variables on the number í is established. To construct a minimal disjunctive or conjunctive normal form of the BF are repelled from the corresponding perfect forms. In this connection the need to describe the sequence of numbers of sets, on which
APA, Harvard, Vancouver, ISO, and other styles
6

Liang, Jiali, Marc Ernoult, Xavier Doligez, Sylvain David, Léa Tillard, and Nicolas Thiollière. "Robustness Study of Electro-Nuclear Scenario under Disruption." Journal of Nuclear Engineering 2, no. 1 (2021): 1–8. http://dx.doi.org/10.3390/jne2010001.

Full text
Abstract:
As the future of nuclear power is uncertain, only choosing one development objective for the coming decades can be risky; while trying to achieve several possible objectives at the same time may lead to a deadlock due to contradiction among them. In this work, we study a simple scenario to illustrate the newly developed method of robustness study, which considers possible change of objectives. Starting from the current French fleet, two objectives are considered regarding the possible political choices for the future of nuclear power: A. Complete substitution of Pressurized Water Reactors by S
APA, Harvard, Vancouver, ISO, and other styles
7

Noura, Boudiaf, and Chaoui Allaoua. "Double Reduction of Ada-ECATNet Representation using Rewriting Logic." October 22, 2008. https://doi.org/10.5281/zenodo.1080971.

Full text
Abstract:
One major difficulty that faces developers of concurrent and distributed software is analysis for concurrency based faults like deadlocks. Petri nets are used extensively in the verification of correctness of concurrent programs. ECATNets [2] are a category of algebraic Petri nets based on a sound combination of algebraic abstract types and high-level Petri nets. ECATNets have 'sound' and 'complete' semantics because of their integration in rewriting logic [12] and its programming language Maude [13]. Rewriting logic is considered as one of very powerful logics in terms of description, verific
APA, Harvard, Vancouver, ISO, and other styles
8

Zhu, Yazhen, Qing Song, and Meng Li. "Multi-AGV multitask collaborative scheduling based on an improved ant colony algorithm." International Journal of Advanced Robotic Systems 22, no. 1 (2025). https://doi.org/10.1177/17298806241312784.

Full text
Abstract:
Research on multitask scheduling systems in factory environments is a popular topic in the field of intelligent manufacturing. Existing research mainly focuses on the optimization of automated guided vehicle (AGV) path planning and scheduling, emphasizing on the minimization of conflicts and deadlocks, multi-objective task scheduling, and metaheuristic algorithm optimization, while ignoring path stability and real-time path planning in dynamic environments. Therefore, this paper aims to address these issues to better handle dynamic changes in actual operating environments. This paper establish
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Deadlock minimization"

1

VATS, PREETI. "RELAXED MUTUAL EXCLUSION ALGORITHM IN MOBILE CELLULAR NETWORK." Thesis, 2016. http://dspace.dtu.ac.in:8080/jspui/handle/repository/14753.

Full text
Abstract:
ABSTRACT Now a days, Mobile computing networks revolutionize the way computers are used. Mobile hosts have small memory, a relatively slow processor and low power batteries, and communicate over low bandwidth wireless communication links. Distributed dynamic channel allocation in mobile cellular networks and other similar structures is a fundamental resource management problem. It has aroma of distributed mutual exclusion but is not exactly mutual exclusion problem because a channel must be reused in different cells. Existing mutual exclusion algorithms for cellular systems are not suit
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography