This paper presents Vassal, a system that enables applications to dynamically load and unload CPU scheduling policies into the operating system kernel, allowing multiple policies to be in effect simultaneously. With Vassal, applications can utilize scheduling algorithms tailored to their specific needs and generalpurpose operating systems can support a wide variety of special-purpose scheduling...

______________________________________________________________________ In order to guarantee database consistency, a database system should synchronize operations of concurrent transactions. The database component responsible for such synchronization is the scheduler. A scheduler synchronizes operations belonging to different transactions by means of concurrency control protocols. Concurrency c...

Proving stabilization of a complex algorithm under the distributed scheduler is a non-trivial task. This paper introduces a new method which allows to extend proofs for the central scheduler to the distributed scheduler. The practicability of the method is shown by applying it to two existing algorithms, for which stabilization under the distributed scheduler was an open problem.

Running jobs on the IBM SP2, as in most distributed memory parallel system in the market today, is done by giving each job a subset of the available processors for its exclusive use. Scheduling jobs in FCFS order suffers from severe fragmentation that leads to utilization loss. This led Argonne National Lab, where the first large SP1 was installed, to develop the EASY scheduler, which has since...

The paradigm of distributed computation in heterogeneous resources, grid computing, has given rise to a large amount of research on resource scheduling. This paper presents a Meta-Scheduler for grid computing that does not need any given information about tasks length or tasks arrival time unlike traditional dynamic heuristics. Our Meta-Scheduler is of multi-criteria type, because it solves two...

All recently proposed packet-scheduling algorithms for output-buffered switches that support quality-of-service (QoS) transmit packets in some priority order, e.g., according to deadlines, virtual finishing times, eligibility times, or other time stamps that are associated with a packet. Since maintaining a sorted priority queue introduces significant overhead, much emphasis on QoS scheduler de...