In this paper, an Integrated Radio Resource Allocation (IRRA) framework is proposed for enhanced uplink UTRA-FDD with fixed relay stations (FRSs). It comprises two entities: Relaying Link Scheduler (RLS), and Transmission Mode Aware Packet Scheduler (TMAPS). RLS is responsible for the scheduling of user transmission modes (direct or relaying) and routes, whereas TMAPS is responsible for the sch...

In a database system, the scheduler has the goal of synchronizing operations belonging to several concurrent transactions. The scheduler implements a concurrency control protocol, which may have either conservative or aggressive behavior. Existing database systems have schedulers with static behavior. This paper presents a self-adaptable scheduler, called Intelligent Transaction Scheduler (ITS)...

We present the Dynamic Priority (DP) parallel task scheduler for Hadoop. It allows users to control their allocated capacity by adjusting their spending over time. This simple mechanism allows the scheduler to make more efficient decisions about which jobs and users to prioritize and gives users the tool to optimize and customize their allocations to fit the importance and requirements of their...

CPU scheduler is a very important key concept in operating system which affects scheduling objectives and criteria. Choosing or modifying scheduling policy for running threads depends on predefined and specific objectives and criteria. In this paper, we investigate the effectiveness of thread weight readjustment scheduler (TWRS) for multithreaded processes in multitasking operating systems from...

The DECAF multi-agent architecture has a scheduler that makes runtime choices based on a user-speci ed utility function that considers action quality, cost, and duration. To make good use of the intelligent scheduler, a planner must provide the scheduler with choices. Every autonomous DECAF agent has an HTN planner that designs plans to make use of the scheduler's intelligence. Previous conting...

Lecture Summary 1. The Cilk Scheduler We review the Cilk scheduler. 2. Location of Shallowest Thread We define the depth of a thread and the shallowest thread. Next, We prove that the shallowest thread on a processor is either at the top of a deque or being executed. 3. Critical Threads We construct a computation graph G′ similar to the computation graph G, such that when a thread has no incomp...

A exible scheduler for distributing and-and or-parallel work in the Andorra-I system is presented. The scheduler allows workers to move freely between teams. Its strategy is based on estimates of and-and or-parallelism available in the execution tree. Preliminary results show that in most cases we can reach or surpass the best performance of Andorra-I running with any xed team connguration. Sin...