A Machine Learning Based Meta-Scheduler for Multi-Core Processors

نویسندگان

  • Jitendra Kumar Rai
  • Atul Negi
  • Rajeev Wankar
  • K. D. Nayak
چکیده

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 the L2 cache related characteristics of the processes. Using the model generated by the process of machine learning, it predicts the L2 cache behavior, i.e., solo-run-L2-cachestress, of the programs. It runs in user mode and guides the underlying operating system process scheduler in intelligent scheduling of processes to reduce the contention of shared L2 caches. In these experiments, the authors observed up to 12 percent speedup in individual as well as overall performance, while using meta-scheduler as compared to default process scheduler (Completely Fair Scheduler) of Linux kernel.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Heterogeneous Multi core processors for improving the efficiency of Market basket analysis algorithm in data mining

-Heterogeneous multi core processors can offer diverse computing capabilities. The efficiency of Market Basket Analysis Algorithm can be improved with heterogeneous multi core processors. Market basket analysis algorithm utilises apriori algorithm and is one of the popular data mining algorithms which can utilise Map/Reduce framework to perform analysis. The algorithm generates association rule...

متن کامل

Building a Practical Event-Scheduler for a Multi-Processor Architecture

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...

متن کامل

A Replication-based Approach to Parallelizing Protocol Stacks

Current multi-core network protocol stack designs use lock-based and scheduler-based approaches to leverage multiple processors. Unfortunately, these approaches limit protocol stack scalability on multicore systems both for high-bandwidth connections and large numbers of concurrent connections. In this paper, we propose a new approach to parallelizing network protocol stacks based on state repl...

متن کامل

A bi-objective model for a scheduling problem of unrelated parallel batch processing machines with fuzzy parameters by two fuzzy multi-objective meta-heuristics

This paper considers a bi-objective model for a scheduling problem of unrelated parallel batch processing machines to minimize the makespan and maximum tardiness, simultaneously. Each job has a specific size and the data corresponding to its ready time, due date and processing time-dependent machine are uncertain and determined by trapezoidal fuzzy numbers. Each machine has a specific capacity,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IJARAS

دوره 1  شماره 

صفحات  -

تاریخ انتشار 2010