Providing QoS while optimizing the LTE network in a cost efficient manner is very challenging. Thus, radio scheduling is one of the most important functions in mobile broadband networks. The design of a mobile network radio scheduler holds several objectives that need to be satisfied, for example: the scheduler needs to maximize the radio performance by efficiently distributing the limited radi...

In the last few years an interest in native XML databases has surfaced. With other authors we argue that such databases need their own provisions for concurrency control since traditional methods are inadequate to capture the complicated update-behavior that is possible for XML documents. Ideally, updates should not be limited to entire document trees, but should involve subtrees and even indiv...

We describe a scheduler that processes a high number of typed events per second while enabling certain event types to be allocated more resources than others in a workconserving fashion. The scheduler is the core of a high volume messaging system, it uses a lock-free approach allowing it to scale with increasing number of processors. The scheduler threads coordinate using a lock-free concurrent...

This paper presents the implementation of a wireless scheduling algorithm that provides backbone Quality of Service (QoS) support to mobile stations. The algorithm described in this paper maps all existing ATM traac types into priorities and weights for a Multiclass Priority Fair Queue (MPFQ) scheduler. The MPFQ scheduler is designed to operate in a wireless base station. A prototype driver has...

In a previous research project [5], we found there are several disadvantages of the current Linux scheduler. So we employed a alternative scheduler, Resource-Based Earliest Deadline First scheduler(RB-EDF), to solve these problems. Though RB-EDF performs better than the Linux scheduler in handling soft realtime processes, it can not enforce resource usages smaller than 1 tick(10ms) using the re...

Parallel data processing and parallel streaming systems become quite popular. They are employed in various domains such as real-time signal processing, OLAP database systems, or high performance data extraction. One of the key components of these systems is the task scheduler which plans and executes tasks spawned by the system on available CPU cores. The multiprocessor systems and CPU architec...

Repair mechanisms are important within resilient systems to maintain the system in an operational state after an error occurred. Usually, constraints on the repair mechanisms are imposed, e.g., concerning the time or resources required (such as energy consumption or other kinds of costs). For systems modeled by Markov decision processes (MDPs), we introduce the concept of resilient schedulers, ...

This paper describes COTAMA (COntextual TAsk Management Architecture), a control software architecture layered into tow levels: Decisional level and executive level. The decisional level is in charge of mission monitoring and decision making according to robot context. The executive level applies these decisions while managing all real time aspects such instrumentation conflicts or tasks deadli...

We describe extensions to lottery scheduling, a proportional-share resource management algorithm, to provide the performance assurances present in traditional nonreal time process schedulers. Lottery scheduling enables flexible control over relative process execution rates with a ticket abstraction and provides load insulation among groups of processes using currencies. We first show that a str...

We present an adaptive controlled scheduler for heterogeneous applications running on general purpose computers. Our scheduler can effectively support diverse application requirements. It employs uniform rate-based sharing. Application heterogeneity is satisfied by partitioning CPU capacity into service classes, each with a different criterion for admission control. As a result, we are able to ...