Sciweavers

5580 search results - page 18 / 1116
» Randomized priority algorithms
Sort
View
ICALP
2010
Springer
13 years 9 months ago
Resource Oblivious Sorting on Multicores
We present a new deterministic sorting algorithm that interleaves the partitioning of a sample sort with merging. Sequentially, it sorts n elements in O(n log n) time cache-oblivi...
Richard Cole, Vijaya Ramachandran
ICCCN
1997
IEEE
13 years 12 months ago
Time dependent priority scheduling for guaranteed QoS systems
With the advances in server technology, and the advent of fast Gigabit networks, it has become possible to support multi-media applications. To support the requirements for the tr...
Shailender Chaudhry, Alok N. Choudhary
LCTRTS
1995
Springer
13 years 11 months ago
Scheduling of Hard Aperiodic Tasks in Hybrid Static/Dynamic Priority Systems
In this paper, we present a preemptive joint scheduling of hard deadline periodic and hard deadline aperiodic tasks on a uniprocessor real-time system. The scheduling has extended...
Jongwon Lee, Sungyoung Lee, Hyungill Kim
CEE
2007
107views more  CEE 2007»
13 years 7 months ago
A non-preemptive scheduling algorithm for soft real-time systems
Real-time systems are often designed using preemptive scheduling and worst-case execution time estimates to guarantee the execution of high priority tasks. There is, however, an i...
Wenming Li, Krishna M. Kavi, Robert Akl
CORR
2010
Springer
120views Education» more  CORR 2010»
13 years 6 months ago
Implementing Distributed Controllers for Systems with Priorities
is a challenging problem. We consider here abstract specifications consisting of a composition of components and a controller given in the form of a set of interactions and a prior...
Imene Ben Hafaiedh, Susanne Graf, Hammadi Khairall...