1 Hierarchical schedulers are getting increased attention in many research projects because they bring in flexibility, they can take advantage of the best features of different scheduling policies, and allow the composability of applications developed under different scheduling strategies. Most commercial real-time operating systems have an underlying fixed priority scheduler, and for this reas...

The Hadoop scheduler is a centerpiece of Hadoop, the leading processing framework for data-intensive applications in cloud. Given impact failures on performance running testing and verifying critical. Existing approaches such as simulation analytical modeling are inadequate because they not able to ascertain complete verification scheduler. This due wide range constraints aspects involved Hadoo...

This paper presents our real-time disk scheduler called the L scheduler, which optimizes unscheduled best-effort disk requests by giving priority to best-effort disk requests while meeting real-time request deadlines. Our scheduler tries to execute real-time disk requests as much as possible in the background. Only when real-time request deadlines are endangered, our scheduler gives priority to...

A Long Term Evolution (LTE) eNodeB Medium Access Control (MAC) uplink scheduler is proposed in this paper for Single Carrier Frequency Division Multiple Access (SC-FDMA) as the uplink transmission scheme. Uplink scheduling algorithms available in literature commonly do not consider all the essential features of the LTE uplink. The proposed scheduler is shown to provide efficient allocation of r...

Scheduler Fifo Scheduler

We present a software framework for simulating the HCF Controlled Channel Access (HCCA) in an IEEE 802.11e system. The proposed approach allows for flexible integration of different scheduling algorithms with the MAC. The 802.11e system consists of three modules: Classifier, HCCA Scheduler, MAC. We define a communication interface exported by the MAC module to the HCCA Scheduler. A Scheduler mo...

In this work we introduce a history-aware, resourcebased dynamic (or simply HARD) scheduler for heterogeneous CMPs. HARD relies on recording application resource utilization and throughput to adaptively change cores for applications during runtime. We show that HARD can be configured to achieve both performance and power improvements. We compare HARD to a complexity-based static scheduler and s...