Fairness is an essential requirement of any operating system scheduler. Unfortunately, existing fair scheduling algorithms are either inaccurate or inefficient and non-scalable fo...
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
In this paper, we propose a personal navigation system for tourism called P-Tour. When a tourist specifies multiple destinations with relative importance and restrictions on arriva...
— We consider several object sharing synchronization mechanisms including lock-based, lock-free, and wait-free sharing for LNREF [1], an optimal real-time scheduling algorithm on...
Hyeonjoong Cho, Binoy Ravindran, E. Douglas Jensen
We consider the problem of implementing shared objects in uniprocessor and multiprocessor real-time systems in which tasks are executed using a scheduling quantum. In most quantum...