Barabasi has shown that the priority-based scheduling rules in single-stage queuing systems (QS) generate fat tail behavior for the task waiting time distributions (WTD). These fat tails are induced by the waiting times of very low priority tasks that stay unserved almost forever as the task priority indices are "frozen in time" (i.e., a task priority is assigned once for all to each incoming t...

We characterize the top trading cycles mechanism for priority-based allocation of indivisible objects when objects have general capacities. We say that a mechanism is top-priority trading-proof if the top ranked agent at any object can never benefit from obtaining (or trading for) a top priority of any agent assigned a copy of this object. This axiom captures a new way that top priorities are r...

This paper proposes a novel scheduling discipline for service differentiation in multi-service networks, which is referred to as the Probabilistic Priority (PP) discipline. PP is based on the Strict Priority (SP) discipline with the difference that each priority class is assigned a parameter. The parameter determines the probability with which its corresponding queue is served when it is polled...

A multimedia ATM network is shared by media channels with diierent performance requirements and traac characteristics. To make eecient use of network resources, the quality of service provided to the users should be as close as possible to their requirements. In this paper a scheme with two levels of cell loss priority within each channel is proposed. Priorities are assigned and enforced by the...

This paper addresses the problem of real-time scheduling of a set of sporadic tasks on uniand multiprocessor platform based on priority promotion. A new preemptive scheduling algorithm, called Fixed-Priority with Priority Promotion (FPP), is proposed. In FPP scheduling, tasks are executed similar to traditional fixed-priority (FP) scheduling but the priority of some tasks are promoted at fixed ...

In fixed-priority scheduling the priority of a job, once assigned, may not change. A new fixed-priority algorthm for scheduling systems of periodic tasks upon identical multiprocessors is proposed. This algorithm has an achievable utilization of (m + 1)/2 upon m unit-capacity processors. It is proven that this algorithm is optimal from the perspective of achievable utilization, in the sense tha...

Many of Ule fundamental problems in computer graphics involve Ute notion of visibility. In one approach to Ute hidden-surface problem, priorities are assigned to Ute faces of a scene. A realistic image is Uten rendered by displaying the faces wiUt Ute resulting priority ordering. We introduce a tree-based formalism for describing priority orderings Utat simplifies an existing algoriUtm. As well...

Grid computing is the federation of pooling resources so as to solve large-scale problems. Scheduling is the main issue in grid computing and is the process of making scheduling decisions over multiple grid resources. In this paper, we propose a scheduling technique which classifies the subtasks based on the priority assigned by the user. This is mainly applicable in places where the high prior...

IMPORTANCE Fostering accountability in the Medicare Accountable Care Organization (ACO) programs may be challenging because traditional Medicare beneficiaries have unrestricted choice of health care providers, are attributed to ACOs based on utilization, and often receive fragmented care. OBJECTIVE To measure 3 related constructs relevant to ACO incentives and their capacity to manage care: s...

It has long been recognised that standard process algebra has difficulty dealing with actions of different priority, such as for instance an interrupt action of high priority. Various solutions have been proposed. We introduce a new approach, involving the addition of “priority guards” to Milner’s process calculus CCS. In our approach, priority is unstratified, meaning that actions are not assi...