Simulated Performance Analysis of Multiprocessor Dynamic Space-Sharing Scheduling policy

نویسندگان

  • Amit Chhabra
  • Gurvinder Singh
  • Gaurav Kumar
چکیده

Multiprocessor systems are the wave of the future rightly said because they offer tremendous potential to solve inherently parallel and complex computation intensive applications. In order to exploit the full potential of such computing systems, job scheduling or processor allocation (both are considered synonyms here) decisions plays a great role. Such scheduling decisions involves determining number of jobs to execute simultaneously as well as the number of processors to be allocated to each running application in a manner so as to minimize job’s execution time and/or maximizing throughput. The growth of such multiprocessor systems has in turn paves the way for creation of efficient processor allocation policies in order to reduce job response time and make efficient utilization of system’s processors. When we submit jobs or applications to multiprocessor system which in turn relies on job scheduling policies to allocate processors to such incoming jobs, we are really interested to know how well such policies are performing. Performance evaluation methodologies like actual experimental setup i.e. multiprocessor or parallel system, Theoretical/Analytical modelling and Simulation can be used to evaluate the performance of scheduling policies. Actual experimentation on multiprocessor or parallel system is still a costly and complex approach and moreover these systems are still out of reach to young researchers even doing research in higher education institutes like universities or technical colleges in developing countries India, Pakistan, Malaysia and Bangladesh etc. There may be several reasons for the nonavailability of these systems. One can very well evade out theoretical/analytical modelling to be used for the same purpose due to their inaccuracy. All these drawbacks have motivated us to switch towards virtualization or simulation of multiprocessor environment for the performance measurement of processor allocation policies. Simulation provides the powerful way to measure performance before the system under study has not actually been implemented. Such simulation can capture the dynamic interaction between applications and parallel architectures. Also it offers flexibility as one can make modifications to the simulation model and check their effect easily. This paper is an effort to provide a GUI based simulated multiprocessor framework/environment for the performance measurement of dynamic space sharing scheduling policy. Virtualization of multiprocessor environment is carried out with the help of simulated program which simulates all components of actual multiprocessor so as to give best possible outcome. Such simulated framework will provide the stage for the young researchers to model and evaluate their scheduling policies on virtual multiprocessor environment. The intention behind this multiprocessor simulation environment is the necessity to facilitate the research of multiprocessor systems and performance measurement of scheduling algorithms in developing countries.

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

ثبت نام

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

منابع مشابه

The Impact of Program Structure on the Performance of Scheduling Policies in Multiprocessor Systems ‡

A simple fork and join type of job structure has been extensively used for performance evaluation of processor scheduling policies in multiprocessor systems. However, parallel programs often exhibit a more complicated structure. It is not clear how the program structure affects the performance of processor scheduling policies. This paper studies the impact of the program structure on the perfor...

متن کامل

Performance of Hierarchical Processor Scheduling in Shared-Memory Multiprocessor Systems

Processor scheduling policies can be broadly divided into space-sharing and time-sharing policies. Space-sharing policies partition system processors and each partition is allocated exclusively to a job. In time-sharing policies, processors are temporally shared by jobs (e.g., in a round robin fashion). Space-sharing policies can be either static (processor allocation remains constant during th...

متن کامل

An Efficient Adaptive Scheduling Scheme for Distributed Memory Multicomputers

ÐTraditional multiprocessor scheduling schemes have been one of either space-sharing or time-sharing. Space-sharing schemes perform better than time-sharing at low to moderate system loads. However, they have a disadvantage of wasting processing power within partitions at medium to high system loads. Time sharing schemes tend to perform better at medium to high system loads. Almost all the sche...

متن کامل

An Efficient Kernel-level Scheduling Methodology for Multiprogrammed Shared Memory Multiprocessors

In this work we present an innovative kernel-level scheduling methodology designed for multiprogrammed shared-memory multiprocessors. We propose three scheduling policies equipped with both dynamic space sharing and time sharing, to ensure the scalability of parallel programs under multiprogramming while increasing processor utilization and overall system performance. Our scheduling methodology...

متن کامل

A Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study

This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...

متن کامل

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


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

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

ثبت نام

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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2009