We consider the dimensioning problem for Internet access links carrying TCP traffic with two priority classes. To this end, we study the behaviour of TCP at the flow level described by a multiple-server Processor Sharing (PS) queueing model with two customer classes, where the customers represent flows generated by downloading Internet objects; the sojourn times represent the object transfer ti...

This paper studies allocation problems with and without monetary transfers, such as multi-unit auctions, school choice, and course assignment. For this class of problems, we introduce a generalized random priority mechanism with budgets (GRP). This mechanism is always ex post incentive compatible and feasible. Moreover, as the market grows large, this mechanism can approximate any incentive com...

This paper investigates the use of genetic programming in automatized synthesis of scheduling heuristics for an arbitrary performance criteria. The applied scheduling technique is priority scheduling, where the next state of the system is determined based on priority values of certain system elements. Genetic programming is used to create the priority function which, coupled with an appropriate...

AbsfructThe IEEE 802.6 standard for metropolitan area networks does not provide multiple priority traffic for connectionless data services. A priority mechanism that was considered in earlier versions of the standard showed to be not effective. As of now, there exists no protocol for multiple access dual bus networks that is able to implement preemptive priorities and, at the same time, can sat...

Existing concurrent priority queues do not allow to update the priority of an element after its insertion. As a result, algorithms that need this functionality, such as Dijkstra’s single source shortest path algorithm, resort to cumbersome and inefficient workarounds. We report on a heap-based concurrent priority queue which allows to change the priority of an element after its insertion. We sh...

When a real-time system is realized on a shared-memory multiprocessor, priority-ordered spin locks are often required to reduce priority inversions. However, simple priority-ordered spin locks can cause uncontrolled priority inversions when they are used for nested spin locks. This paper points out the problem of uncontrolled priority inversions in the context of spin locks and proposes priorit...

Using priority inheritance protocols is an e ective approach to solve the problem of uncontrolled priority inversion, which is among the major sources of deadline violations in hard real-time systems. In this paper, some approaches to incorporate priority inheritance to the ITRON speci cation are discussed. As the result, we propose two speci cations of priority inheritance semaphore functions ...

Oral or intravenous administration of allethrin, a synthetic derivative of the pirethrin-based insecticides, produces neurotoxic symptoms consisting of mild salivation, hyperexcitability, tremors and convulsions which result in death. Intracerebroventricular injection of allethrin to mouse at about one-nineth the dose of intravenous administration, produced qualitatively identical but less prom...

The purpose of this paper is to argue that nonmonotonic reasoning in general can be viewed as monotonic inferences constrained by a simple notion of priority constraint. More important, these type of constrained inferences can be speciied in a knowledge representation language where a theory consists of a collection of logic programming-like rules and a priority constraint among them: that the ...