The transport of real-time data flows over wireless channels can be optimized by cross-layer schedulers which serve the different users dependent on their traffic load and channel state. This paper investigates the delay performance of a two-stage cross-layer scheduler which has been designed to meet the above requirements. The well-known Weighted Fair Queuing Scheduler can tramsmit packets wit...

Virtual memory management has come to play an increasingly adversarial role in the scheduling of processes. While it is the job of the CPU scheduler to determine the order and length of execution of processes, its attempts to meet the desired scheduling constraints are thwarted by the memory manager under memory pressure. This is because scheduler policies like priority are not supported by mem...

We model and simulate the execution of parallel jobs represented by directed acyclic graphs on a system of networked distributed heterogeneous computers. We tested two online schedulers, the Enhanced Cilk Scheduler ECS and the Central Manager CM . ECS is a decentralized scheduler, which implements work stealing and processor mugging techniques. CM is a centralized greedy scheduler. Our simulati...

Internet of Things (IoT) systems can rely on energy harvesting to extend battery lifetimes or even render batteries obsolete. Such employ an scheduler optimise their behaviour and thus performance by adapting the system's operation. Predictive models sources, which are inherently non-deterministic consequently challenging predict, often necessary for performance. Because inaccurate predictions ...

The execution order of a block of computer instructions on a pipelined machine can make a difference in its running time by a factor of two or more. In order to achieve the best possible speed, compilers use heuristic schedulers appropriate to each specific architecture implementation. However, these heuristic schedulers are time-consuming and expensive to build. We present empirical results us...

In this paper, we consider the one-bit feedback scheduler with a threshold in a wireless network. Due to its feedback reduction structure, the one-bit feedback scheduler has been studied as one of good candidates implementable in a practical wireless network, and it is important to determine the threshold value of the one-bit feedback scheduler. To solve this problem, network throughput and/or ...

Fair scheduling algorithms are an important component of most QoS mechanisms designed to support the performance guarantees required by real-time applications. In this paper, we present Greedy Fair Queueing (GrFQ), a novel scheduler based on a greedy strategy of reducing the maximum difference in normalized service received by any two flows at each trasmission boundary. We prove that the GrFQ s...