Sharing resources such as caches and memory buses between the cores of multi-core processors may cause performance bottlenecks for running programs. In this paper, the authors describe a meta-scheduler, which adapts the process scheduling decisions for reducing the contention for shared L2 caches on multi-core processors. The meta-scheduler takes into account the multi-core topology as well as ...

Response time is one of the characteristics of scheduler, happens to be a prominent attribute of any CPU scheduling algorithm. The proposed New Multi Level Feedback Queue [NMLFQ] Scheduler is compared with dynamic, real time, Dependent Activity Scheduling Algorithm (DASA) and Locke’s Best Effort Scheduling Algorithm (LBESA). We abbreviated beneficial result of NMLFQ scheduler in comparison with...

This paper addresses the problem of scheduling instructions in micronet-based asynchronous processors (MAP), in which the laten-cies of the instructions are not precisely known. A PTD scheduler is proposed which minimises true dependencies, and results are compared with two list schedulers-the Gibbons and Muchnick scheduler, and a variation of the Balanced scheduler. The PTD scheduler has a low...

Increase in amount of data stored and requirement of fast response time has motivated the research in Parallel Database Systems (PDS). Requirement for correctness of data still remains one of the major issues. Concurrency control algorithms used by PDS uses single scheduler approach. Single scheduler approach has some inherent weaknesses such as – very big lock tables, overloaded centralized sc...

We consider a joint sampling and scheduling problem for optimizing data freshness in multi-source systems. Data is measured by non-decreasing penalty function of age information, where all sources have the same age-penalty function. Sources take turns to generate update packets, forward them their destinations one-by-one through shared channel with random delay. There scheduler, that chooses or...

The proportional delay differentiation model provides a consistent packet delay differentiation between various classes of service. The waiting time priority (WTP) scheduler is a priority scheduler in which the priority of a packet increases in proportion to its waiting time, and it is known as the best scheduler to achieve the proportional delay differentiation model. This paper proposes an ad...

There are two commonly used thread models: kernel level threads and user level threads. Kernel level threads suffer from the cost of frequent user-kernel domain crossings and xed kernel scheduling priorities. User level threads are not integrated with the kernel, blocking all threads whenever one thread is blocked. The Scheduler Activations model, proposed by Anderson et al. ANDE91], combines k...