Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 693 papers for “priority inversion”
Universität Karlsruhe, System Architecture Group · 2010
Some examples of scheduling in daily life, e.g.! time schedules in schools/universities,! train schedules,! airline schedules etc. Problem: Find appropriate traffic solutions (e.g. to be in time for the desired flight to Sydney, Australia) ⇒ Scheduling has to be done Scheduling ~ planning “minor or major events”, e.g. elections, examinations, weddings, recipes, etc.
Cited by 0
2012
Some examples of scheduling in daily life, e.g.! time schedules in schools/universities,! train schedules,! airline schedules etc. Problem: Find appropriate traffic solutions (e.g. to be in time for the desired flight to Sydney, Australia) ⇒ Scheduling has to be done Scheduling ~ planning “minor or major events”, e.g.
Cited by 0
Corey Edward Tabaka · 2020
Cited by 0
Özalp Babaoğlu, Keith Marzullo, F.B. Schneider · 1991
A priority inversion occurs when a low-priority task causes execution of a higher-priority task to be delayed. The possibility of priority inversions complicates the analysis of systems that use priority-based schedulers because priority inversions invalidate the assumption that a task can be delayed only by higher-priority tasks. This paper formalizes priority inversion and gives sufficient conditions as well as some new protocols for preventing priority inversions.
Cited by 4
Hiroaki Takada, Ken Sakamura · 1995
Making critical sections abortable is a promising approach to controlling priority inversions. To improve the schedulability of a system using abortions, the maximum number of abortions should be decreased. In this paper, we propose a real-time synchronization protocol named the selective abort protocol (SAP) which introduces a new abort scheme to the priority ceiling protocol. Our proposed scheme can make the maximum number of abortions smaller than with the conventional priority-based abort schemes. A method to determine an upper bound on the number of abortions under the SAP is presented, and schedulability analyses of systems using the protocol are illustrated. Some extensions of the SAP are also discussed.
Cited by 0
Özalp Babaoğlu, Keith Marzullo, Fred B. Schneider · Real-Time Systems · 1993
Cited by 33
Leslie C. Lander, Sandeep Mitra, Thomas F. Piatkowski · 1990
Priority inversion is any situation where low priority tasks are served before higher priority tasks. It is recognized as a serious problem for real-time systems. We have observed priority inversion due to the elaboration order in versions of AIsys I Ada and VAX ~ Ada. This paper presents a rigorous description of Alsys Ada's priority inversion during elaboration of library packages; this behavior is specified in a semi-formal partial model of the elaboration algorithm of the Alsys 286 DOS Ada Compiler V4.2, running under PC-DOS Version 3.30 on an IBM PC AT. s The model was deduced from a series of experiments designed to illuminate the full scheduling features of the system. These results may provide useful insight for users of this and other Ada compilers. Similar priority inversion was also observed for VAX Ada running under VMS.
Cited by 5Open access
Requests By Active, Y. Wang, F. Brasileiro et al. · 2007
We consider the priority inversion problem in an actively replicated system. Priority inversion was originally defined in the context of non-replicated systems. Therefore we first introduce the concept of group priority inversion, which extends the concept of (local) priority inversion to the context of a group of processors that perform an actively replicated processing. We then present the properties of a request scheduling protocol to enforce a total ordering for the processing of requests while avoiding group priority inversions. These properties have been implemented in a protocol that relies on a timed asynchronous system model equipped with a failure detector of the class 3S. The proposed solution allows to replicate a critical server while ensuring that the processing of all the incoming requests is consistent (mechanisms for solving the atomic broadcast problem) and predictable (mechanisms for solving the group priority inversion problem). Thus, the described request scheduling protocol is a key component which can be used to develop fault tolerant real time applications in a timed asynchronous system.
Cited by 0
Chuntao Man, Peng Li, Yan Li · 2006
Aiming at the priority inversion of the process scheduling, through the analysis of the process scheduling in Linux kernel, this paper mainly studies the reason leading to priority inversion and the mutex based on semaphore, it also makes priority inheritance protocol into operation through modified the mutex. The priority inheritance protocol of the mutex reduces scheduling postpone and enhances the real-time performance, which has been proved by the experimentation
Cited by 4
Chi-sing Chen, Pratit Santiprabhob · 1991
Cited by 0
D Silambarasan, Ramanatha Venkatesan M · 2016
Cited by 1
Sunghwa Son (3142434), Kyung-Joon Park (3142440), Eun-Chan Park (3142437) · Figshare · 2016
Cited by 0Open access
Lihchyun Shu, Michal Young, Ragunathan Rajkumar · 1994
Cited by 0
Dorota Kurowicka, Catalin Bucura, Roger Cooke et al. · Risk Analysis · 2010
This article presents methodology of applying probabilistic inversion in combination with expert judgment in priority setting problem. Experts rank scenarios according to severity. A linear multi-criteria analysis model underlying the expert preferences is posited. Using probabilistic inversion, a distribution over attribute weights is found that optimally reproduces the expert rankings. This model is validated in three ways. First, consistency of expert rankings is checked, second, a complete model fitted using all expert data is found to adequately reproduce observed expert rankings, and third, the model is fitted to subsets of the expert data and used to predict rankings in out-of-sample expert data.
Cited by 22
Shankar, Udai 1963-, Pandey, Sarvesh 1994- · Advances in data mining and database management book series · 2020
"This book explores technologies that can enable high performance atomicity, consistency, isolation, and durability in time-constrained distributed databases"--
Cited by 10
L. Ruiz, J.-D. Decotignie · 2002
Traditionally, networks supporting hard real-time applications such as process control or manufacturing applications use static scheduling policies for message scheduling within the bus. The main reason for that being the fact that for these applications guarantees must be insured by the network. On the other hand, recent works have shown that under certain conditions or limitations in the real-time traffic it is possible to achieve guarantees with dynamic priority driven scheduling algorithms such as earliest deadline first or minimum laxity first. These guarantees are based on what is called schedulability functions. Thus, if a message set fulfils the conditions imposed by the schedulability functions, then its scheduling without missing deadlines is guaranteed. However, one common assumption for calculating the schedulability functions is that clocks of the different nodes are perfectly synchronized. This assumption does not correspond to the reality. In real distributed systems it is not possible to achieve perfect clock synchronization. In this paper, we make a step further in finding schedulability guarantees for dynamic priority driven algorithms used to schedule messages over a bus. In fact, we address the problem that can arise due to the imperfect clock synchronization of local clock of stations. We prove that this lack of clock synchronization can lead to priority inversion and propose a new schedulability test which can be used in such a case.
Cited by 0
Jae-Hong Shim, Kyunghee Choi, Gihyun Jung et al. · 2002
We propose a resource management model to avoid priority inversion problem that may occur when two tasks attempt to send service requests to a server task, and then the server task sends a request to another server task in a nested fashion. In this model we introduce two new concepts: job identifier inheritance and priority ceiling inheritance. We also suggest a new resource locking condition of the priority ceiling protocol for the computational model of the microkernel-based real-time system, called Mike, in which both IPC and synchronization are utilized and client/server communication model is frequently used in a nested fashion. To see the effectiveness, the proposed model has been implemented in Real-Time Mike developed previously. The implemented system shows that the resource management model efficiently prevents the priority inversion problem and avoids deadlock and multiple blocking.
Cited by 5
Gregory S. Hartman, Priya Narasimhan · 2003
Virtual memory (VM) sub-systems in many widely adopted desktop and server operating systems rely on approximations of the least-recently-used (LRU) heuristic to select pages for replacement. These heuristics work well when memory is abundant, but they produce counter-intuitive behavior when applications' memory demands substantially exceeds the available physical memory. This paper describes the results of preliminary experiments with a new instrumentation framework that observes Linux VM behavior in a controlled setting. Repeated experiments with a microbenchmark consistently reveal three types of misbehavior. First, the CPU scheduler's intended priorities can be inverted for an indefinite period of time when low-priority processes push higher-priority processes out of memory. Second, the VM heuristics can perpetually assign unequal amounts of memory to simultaneously running, identical processes. Finally, processes with modest memory requirements experience execution delays during periods of memory shortage.
Cited by 0
Mikael Collin, Mladen Nikitovic, Christer Norström · 2007
In a singleprocessor real-time system the question whether a taskset is schedulable or not is essential and not always easy to answer, and it is even more challenging in multiprocessor real-time systems. To determine the schedulability of a taskset the maximum blocking time for each task must be known. When considering schedulability of tasks on a multiprocessor with a shared bus, both local blocking and interprocessor blocking must be known and considered. To reduce the time high priority tasks are blocked by low priority task on a shared bus multiprocessor system we propose a dynamic priority based arbitration of processors. In our proposal, a processor's priority is a direct mapping of the relative priority of all tasks currently executing. The mapping of priorities onto processors is managed by a hardware operating system kernel which continuously updates the arbiter with priority changes. The information shared between the hardware operating system and the arbiter is done in parallel and does not put additional strain on bus trac. The solution is implemented by augmenting an hardware realtime scheduler and an arbiter unit with added functionality. Systems-on-a-Chip (SoC's) oers the design freedom needed for our proposed solution to reduce occurrences of priority inversion in Multiprocessor SoC (MSoC).
Cited by 0
Sérgio V. Campos · 1993
Priority inversion is a serious problem that can make real-time systems unpredictable in subtle ways. This makes it more difficult to implement and debug such systems. Our work discusses this problem and presents one possible solution. The solution is formalized and verified using temporal logic model checking techniques. In order to perform the verification, the bdd-based symbolic model checking algorithm given in [4, 11] was extended to handle real-time properties using the bounded until operator [9]. We believe that this algorithm, which is based on discrete time, is able to handle many real-time properties that arise in practical problems. This research was sponsored in part by the National Science Foundation under grant no. CCR-8722633, by the Semiconductor Research Corporation under contract 92-DJ-294, and by The Defense Advanced Research Projects Agency, Information Science and Technology Office, under the title "Research on Parallel Computing", ARPA Order No. 7330, issued by DA...
Cited by 0