In this paper we present a dynamic bandwidth allocation algorithm for Ethernet Passive Optical Networks (EPON), which makes use of the Multipoint Control Protocol (MPCP) with threshold reporting and with interand intra-ONU priority scheduling. Three varieties of this algorithm are compared under both symmetric and asymmetric traffic conditions, by means of a detailed simulation program, regardi...

Chemicals designated as "priority pollutants" or "toxics" have received special attention recently because the discharge of these compounds into public water is to be restricted to the maximum possible with little regard to water quality or economics. The selection of many of the 129 priority cemicals was not based on an objective scientific assessment of the exposure and effect data. In fact, ...

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 ...

We present an adaptive controlled scheduler for heterogeneous applications running on general purpose computers. Our scheduler can effectively support diverse application requirements. It employs uniform rate-based sharing. Application heterogeneity is satisfied by partitioning CPU capacity into service classes, each with a different criterion for admission control. As a result, we are able to ...

During software development companies are frequently faced with lack of time and resources, which limits their ability to effectively complete testing efforts. Often, the engineering team is compelled to stop their testing efforts abruptly due to schedule pressures. We build upon prior test case prioritization research and present a system-level, value-driven approach to test case prioritizatio...

To allow continuous media (CM) applications fine-grained control over their CPU allocations, and to protect these allocations from each other, thread priorities must have quality-of-service (QoS) interpretation. To this end, we present a CPU scheduler based on the well-defined resource specification of service curve. Service curve is distinguished from the traditional notion of rate by its abil...