IDEAS home Printed from https://ideas.repec.org/a/igg/jfsa00/v4y2015i3p25-49.html
   My bibliography  Save this article

Designing of Vague Logic Based Fair-Share CPU Scheduler: VFS CPU Scheduler

Author

Listed:
  • Supriya Raheja

    (ITMU, Gurgaon, India)

  • Reena Dadhich

    (University of Kota, Kota, India)

  • Smita Rajpal

    (Alpha Global IT, Toronto, Ontario, Canada)

Abstract

CPU scheduler is the primary component of an operating system which supports multitasking. Fair Share CPU scheduler uses static policy to share the CPU time among different levels of system. Static sharing of CPU time can affect the performance of system. Moreover, Fair share scheduler does not consider the impreciseness and uncertainty related to tasks. The objective is to design a vague based fair share scheduler (VFS). VFS scheduler extends the research in the field of fair sharing of CPU time where the functions of VFS scheduler are threefold: firstly, it deals with the impreciseness of task. Secondly, it dynamically shares the CPU time among users as well as among tasks. Thirdly, it supplies the dynamic priority to each task. It improves the performance of system. The VFS scheduler has three modules, VIS-DCS vague inference system for sharing CPU time; VIS-DP vague inference system for assigning dynamic priority to each task and scheduling algorithm to schedule the tasks. The novelty of this approach is to introduce the vague logic based CPU scheduler. Simulation results show that the VFS scheduler has improved performance over the fair share scheduler.

Suggested Citation

  • Supriya Raheja & Reena Dadhich & Smita Rajpal, 2015. "Designing of Vague Logic Based Fair-Share CPU Scheduler: VFS CPU Scheduler," International Journal of Fuzzy System Applications (IJFSA), IGI Global, vol. 4(3), pages 25-49, July.
  • Handle: RePEc:igg:jfsa00:v:4:y:2015:i:3:p:25-49
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJFSA.2015070103
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jfsa00:v:4:y:2015:i:3:p:25-49. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.