نتایج جستجو برای: priority
تعداد نتایج: 52339 فیلتر نتایج به سال:
To reconstruct an object surface from a set of surface points, a fast, practical, and efficient priority driven algorithm is presented. The key idea of the method is to consider the shape changes of an object at the boundary of the mesh growing area and to create a priority queue to the advanced front of the mesh area according to the changes. The mesh growing process is then driven by the prio...
We present a case study in formal specification and toolassisted verification of real-time schedulers, based on the priority ceiling protocol. Starting from operational specifications of the protocol, we obtain rigorous proofs of both synchronization and timing properties, and we derive a schedulability result for sporadic tasks.
Priority trees are a data structure used for priority queue administration. Under the model that all permutations of the numbers 1, . . . , n are equally likely to construct a priority tree of size n we give a detailed averagecase analysis of insertion cost measures: we study the recursion depth and the number of key comparisons when inserting an element into a random size-n priority tree. For ...
In this note, we consider a two-class priority queueing system with Poisson arrivals, general service time distribution and one server, in which customers that are not currently being served may leave the queue according to exponentially distributed patience times, i.e., a M1, M2/G/1 + M system using a generalised Kendall’s notation. We expand the classic methodology to derive analytical formul...
When scheduling a mixed workload of hard and soft(or rm) deadline tasks, we should always guarantee the executions of hard deadline tasks. The priority inversion is one of the problems which may prevent such guarantee for hard deadline tasks. The Priority Ceiling Protocol(PCP) could be a solution to the priority inversion problem. However, the sigle blocking property of PCP is sometimes very re...
This paper shows how priority ceiling techniques can be added to object-based real-time semantic concurrency control. The resulting protocol provides more potential concurrency for real-time object-oriented databases than previous priority ceiling techniques, while alleviating priority inversion and deadlock problems of previous object-based semantic concurrency control techniques. It is also a...
This paper proposes an efficient priority assignment algorithm for fixed priority preemption threshold scheduling (PTS), which we named FAST-TRAVERSE. It is optimal in the sense that it always finds a feasible priority assignment if one exists. While there are existing optimal algorithms, they are inefficient to be used in practice. The key ideas of FAST-TRAVERSE are to prune sibling traverses ...
In this paper, we consider several discrete-time priority queues with priority jumps. In a priority scheduling scheme with priority jumps, real-time and non-real-time packets arrive in separate queues, i.e., the highand low-priority queue respectively. In order to deal with possibly excessive delays however, non-real-time packets in the low-priority queue can in the course of time jump to the h...
In this paper we report on a study of a two level preemptive priority queue with balking and reneging for lower priority level. The inter-arrival and the service times for both levels follow exponential distribution. We use a finite difference equation approach for solving the balance equations of the governing queuing model whose states are described by functions of one independent variable. H...
In their recent editorial, Baltussen and colleagues provide a concise summary of the prevailing discourse on priority-setting in health policy. Their perspective is entirely consistent with current practice, yet they unintentionally demonstrate the narrowness and moral precariousness of that discourse and practice. I respond with demonstrations of the importance of ‘interrogating scarcity’ in a...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید