نتایج جستجو برای: with nineth priority
تعداد نتایج: 9207067 فیلتر نتایج به سال:
We analyse a cell of Cognitive Radio Network ( $CRN$ ) as the multiline queueing system supplying service to two Markovian arrival flows users. Primary (or licensed) users called High Priority Users notation="LaTeX">$HPU\text{s}$ have...
In this paper we show that the widely used normalization constraint ∑ n i=1 wi = 1 does not apply to the priority vectors associated with reciprocal relations, whenever additive transitivity is involved. We show that misleading applications of this type of normalization may lead to unsatisfactory results and we give some examples from the literature. Then, we propose an alternative normalizatio...
In this paper we show how to implement bounded ordered dictionaries, also called bounded priority queues, in O(log log N) time per operation and O(n) space. Here n denotes the number of elements stored in the dictionary and N denotes the size of the universe. Previously, this time bound required O(N) space E77].
A k-bounded priority queue transforms an input sequence CT into an output sequence z which is a re-ordering of the sequence c while never storing more than k elements during the transformation. We consider the set of all such related pairs (a, 7) in both the case that cs is a binary sequence and the case that o is a permutation of 1,2,. , n. We derive properties of this relation and use it to d...
Structuring real-time concurrent programs in the form of groups of fixed-priority processes is an old art which is appropriate for only a small fraction of modern real-time distributed computing application systems. However, it is still practiced on the basis of an insufficient technical foundation. One of the basic issues in using the fixed-priority process structuring approach is to avoid the...
We present several simple probabilistic data structures for implementing priority queues. We present a data structure called simple bottom-up sampled heap (SBSH), supporting insert in O(1) expected time and delete, delete minimum, decrease key and meld in O(log n) time with high probability. An extension of SBSH called BSH1, supporting insert and meld in O(1) worst case time is presented. This ...
The contributions of this paper are threefold. First, a solution to the problem of prioritized mutual exclusion in a distributed system is proved correct. This protocol is based on fewer requirements than prioritized extensions of other protocols and outperforms other protocols with an average complexity of (log n) and a worst-case complexity of O(n) messages for n nodes. Second, the concept of...
Real-Time Mach provides real-time thread and real-time synchronization facilities. A real-time thread can be created for a periodic or aperiodic activity with a timing constraint. Threads can be synchronized among them using a real-time version of the monitor based synchronization mechanism with a suitable locking protocol. In Real-Time Mach, we have implemented several locking policies, such a...
In recent years, real-time operating systems began to support the resource reservation paradigm. This technique has proved to be very effective in providing QoS to both, real-time and legacy applications, ensuring that the temporal misbehavior of an application does not affect any other (temporal isolation). However, resource sharing in a reservation system is still not well understood, and can...
Minoxidil is a highly effective antihypertensive agent for patients with refractory hypertension. Long-term use of a high dose of minoxidil may cause several side effects. However, the concurrence of acute pulmonary edema and rapid progression of renal function after short-term and low-dose therapy is not common. Herein, we report the case of a 70-year-old woman who had diabetes mellitus and mi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید