For medical imaging applications, a timely execution of tasks is essential. Hence, running multiple applications on the same system, scheduling with the capability of task preemption and prioritization becomes mandatory. Using GPUs as accelerators in this domain, imposes new challenges since GPU’s common FIFO scheduling does not support task prioritization and preemption. As a remedy, this pape...

Providing Quality-of-Service in random access multi-hop wireless networks requires support from both medium access and packet scheduling algorithms. However, due to the distributed nature of ad hoc networks, nodes may not be able to determine the next packet that would be transmitted in a (hypothetical) centralized and ideal dynamic priority scheduler. In this paper, we develop two mechanisms f...

In this paper, we consider a tandem of two head-of-line (HOL) non-preemptive priority queuing systems, each with a single server and a deterministic service-time. Two classes of traffic are considered, namely high priority and low priority traffic. By means of a generating function approach, we present a technique to derive closed-form expressions for the mean buffer occupancy at each node and ...

This thesis deals with the problem of scheduling a set of tasks to meet deadlines on a computer with multiple processors. Static-priority scheduling is considered, that is, a task is assigned a priority number that never changes and at every moment the highestpriority tasks that request to be executed are selected for execution. The performance metric used is the capacity that tasks can request...

Fixed Priority Scheduling with Deferred Preemption (FPDS) offers a balance between Fixed Priority Non-preemptive Scheduling (FPNS) and Fixed Priority Preemptive Scheduling (FPPS), by allowing preemptions only at specified preemption points. It provides finer grained preemptions than FPNS, improving the schedulability of higher priority tasks, and a coarser grain preemptions than FPPS, reducing ...

In this paper, we consider a multicore real-time scheduling algorithm incorporating benefits of both fixed-priority and dynamic-priority disciplines. Specifically, the algorithm first assigns globally-effective priorities to real-time tasks statically, based on the well-known Rate-Monotonic scheduling policy. It may however change the task priorities at runtime, only when the tasks reach the ze...

This paper describes the experience of implementing CBQ's top-level link sharing code as described previously in [FJ95]. This implementation incorporates work from previous implementations of Class-Based Queueing from LBNL [Jac95] and UCL [WGC 95]. This implementation extends the work of previous implementations by incorporating both Top-Level link-sharing and Weighted Round Robin within priori...

This paper investigates the effect of changing priority bonuses of Inter-Core Aggregation Scheduler (IAS). IAS is a kernellevel thread scheduler for commodity Chip Multi-Processing (CMP) platforms. To utilize a shared cache and memory on a CMP platform to enhance the performance, IAS executes sibling threads, kernel-level threads sharing the same memory address space, simultaneously on differen...

This chapter discusses the problem of jointly scheduling hard deadline periodic tasks and both hard and soft deadline aperiodic tasks using xed-priority methods. A recently developed algorithm, the slack stealing algorithm developed by the authors, is introduced and its properties are discussed. The methods introduced provide a uniied framework for dealing with several related problems, includi...