Relevant bibliographies by topics / Protocollo Priority Inheritance

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Protocollo Priority Inheritance'

Author: Grafiati
Published: 4 June 2021
Last updated: 18 February 2022

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 'Protocollo Priority Inheritance.'

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 "Protocollo Priority Inheritance"

1

Zhang, Xingyuan, Christian Urban, and Chunhan Wu. "Priority Inheritance Protocol Proved Correct." Journal of Automated Reasoning 64, no. 1 (February 12, 2019): 73–95. http://dx.doi.org/10.1007/s10817-019-09511-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Abu-Ras, Jim. "Priority inheritance protocol in Ada 95." Information and Software Technology 38, no. 2 (January 1996): 121–25. http://dx.doi.org/10.1016/0950-5849(95)01056-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Sha, L., R. Rajkumar, and J. P. Lehoczky. "Priority inheritance protocols: an approach to real-time synchronization." IEEE Transactions on Computers 39, no. 9 (1990): 1175–85. http://dx.doi.org/10.1109/12.57058.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Zöbel, Dieter, and David Polock. "Priority Inheritance Revisited. Towards the conformance of real-time protocols." Techniques et sciences informatiques 24, no. 8 (October 1, 2005): 939–61. http://dx.doi.org/10.3166/tsi.24.939-961.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Baek, Hyeongboo, and Jinkyu Lee. "FT-PIP: Flush Task Incorporated Priority-Inheritance Protocol to Reduce Information Leakage on Multiprocessor Real-Time Systems." IEEE Access 9 (2021): 81882–94. http://dx.doi.org/10.1109/access.2021.3086304.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Faldella, Eugenio, and Daniela Loreti. "Precise Worst-case Blocking Time of Tasks under Priority Inheritance Protocol." IEEE Transactions on Computers, 2020, 1. http://dx.doi.org/10.1109/tc.2020.3029328.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Protocollo Priority Inheritance"

1

Ranaldo, Pierfrancesco. "Modelli ILP per la determinazione delle prestazioni conseguibili con il protocollo "Priority Inheritance" in applicazioni multitasking hard real-time." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2017. http://amslaurea.unibo.it/13059/.

Full text
Abstract:
Regole ed esempi pratici sulla costruzione di Modelli di Programmazione Lineare Intera per la rappresentazione di task periodici di Applicazioni Real-Time e delle loro interazioni bloccanti; utili per la determinazione del "massimo tempo di blocco" che i processi possono subire, nell'ipotesi: che siano schedulati con strategia "Rate Monotonic Priority Order"; che la politica di gestione degli accessi alle risorse condivise sia quella definita dal protocollo "Priority Inheritance".
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Protocollo Priority Inheritance"

1

Zhang, Xingyuan, Christian Urban, and Chunhan Wu. "Priority Inheritance Protocol Proved Correct." In Interactive Theorem Proving, 217–32. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-32347-8_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Pandey, Sarvesh, and Udai Shanker. "A One Phase Priority Inheritance Commit Protocol." In Distributed Computing and Internet Technology, 288–94. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-72344-0_24.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ko, Kwangsun, Seong-Goo Kang, Gyehyeon Gyeong, and Young Ik Eom. "Recursive Priority Inheritance Protocol for Solving Priority Inversion Problems in Real-Time Operating Systems." In Computational Science – ICCS 2007, 977–80. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-72590-9_149.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Pandey, Sarvesh, and Udai Shanker. "On Using Priority Inheritance-Based Distributed Static Two-Phase Locking Protocol." In Advances in Data and Information Sciences, 179–88. Singapore: Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-10-8360-0_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Marwedel, Peter. "System Software." In Embedded Systems, 203–37. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-60910-8_4.

Full text
Abstract:
AbstractIn order to cope with the complexity of applications of embedded systems, reuse of components is a key technique. As pointed out by Sangiovanni-Vincentelli (The context for platform-based design. IEEE Design and Test of Computers, 2002), software and hardware components must be reused in the platform-based design methosdology (see p. 296). These components comprise knowledge from earlier design efforts and constitute intellectual property (IP). Standard software components that can be reused include system software components such as embedded operating systems (OSs) and middleware. The last term denotes software that provides an intermediate layer between the OS and application software. This chapter starts with a description of general requirements for embedded operating systems. This includes real-time capabilities as well as adaptation techniques to provide just the required functionality. Mutually exclusive access to resources can result in priority inversion, which is a serious problem for real-time systems. Priority inversion can be circumvented with resource access protocols. We will present three such protocols: the priority inheritance, priority ceiling, and stack resource protocols. A separate section covers the ERIKA real-time system kernel. Furthermore, we will explain how Linux can be adapted to systems with tight resource constraints. Finally, we will provide pointers for additional reusable software components, like hardware abstraction layers (HALs), communication software, and real-time data bases. Our description of embedded operating systems and of middleware in this chapter is consistent with the overall design flow.
APA, Harvard, Vancouver, ISO, and other styles
6

Krishna, Siddharth, Alexander J. Summers, and Thomas Wies. "Local Reasoning for Global Graph Properties." In Programming Languages and Systems, 308–35. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-44914-8_12.

Full text
Abstract:
AbstractSeparation logics are widely used for verifying programs that manipulate complex heap-based data structures. These logics build on so-called separation algebras, which allow expressing properties of heap regions such that modifications to a region do not invalidate properties stated about the remainder of the heap. This concept is key to enabling modular reasoning and also extends to concurrency. While heaps are naturally related to mathematical graphs, many ubiquitous graph properties are non-local in character, such as reachability between nodes, path lengths, acyclicity and other structural invariants, as well as data invariants which combine with these notions. Reasoning modularly about such graph properties remains notoriously difficult, since a local modification can have side-effects on a global property that cannot be easily confined to a small region.In this paper, we address the question: What separation algebra can be used to avoid proof arguments reverting back to tedious global reasoning in such cases? To this end, we consider a general class of global graph properties expressed as fixpoints of algebraic equations over graphs. We present mathematical foundations for reasoning about this class of properties, imposing minimal requirements on the underlying theory that allow us to define a suitable separation algebra. Building on this theory, we develop a general proof technique for modular reasoning about global graph properties expressed over program heaps, in a way which can be directly integrated with existing separation logics. To demonstrate our approach, we present local proofs for two challenging examples: a priority inheritance protocol and the non-blocking concurrent Harris list.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Protocollo Priority Inheritance"

1

Okumura, Keisuke, Manao Machida, Xavier Défago, and Yasumasa Tamura. "Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding." In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/76.

Full text
Abstract:
The Multi-agent Path Finding (MAPF) problem consists in all agents having to move to their own destinations while avoiding collisions. In practical applications to the problem, such as for navigation in an automated warehouse, MAPF must be solved iteratively. We present here a novel approach to iterative MAPF, that we call Priority Inheritance with Backtracking (PIBT). PIBT gives a unique priority to each agent every timestep, so that all movements are prioritized. Priority inheritance, which aims at dealing effectively with priority inversion in path adjustment within a small time window, can be applied iteratively and a backtracking protocol prevents agents from being stuck. We prove that, regardless of their number, all agents are guaranteed to reach their destination within finite time, when the environment is a graph such that all pairs of adjacent nodes belong to a simple cycle of length 3 or more (e.g., biconnected). Our implementation of PIBT can be fully decentralized without global communication. Experimental results over various scenarios confirm that PIBT is adequate both for finding paths in large environments with many agents, as well as for conveying packages in an automated warehouse.
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