Evaluation of an advanced knowledge-based process scheduler

S. Suranauwarat, Hideo Taniguchi

Research output: Contribution to journalArticle

Abstract

Conventional process schedulers in operating systems control the sharing of the CPU resources among processes using a fixed scheduling policy, in which the utilization of a computer system (e.g., a real-time or a time-sharing system) is a major concern rather than content or behaviour of a process. As a result, the CPU resource is likely to be used in an inefficient manner, or the processing time of a process may be extended unnecessarily. Therefore, we proposed a process' behaviour-based scheduler in oder to reduce the processing time and the process switching cost. More specifically, our scheduler allows a process to continue its execution even though its time-slice has already expired, when it is predicted from an advanced knowledge called PFS (Program Flow Sequence) that the process needs a little bit more CPU time before it voluntarily relinquishes the CPU. In this paper, we present the experimental evaluation of our proposed scheduler.

Original languageEnglish
Pages (from-to)179-184
Number of pages6
JournalResearch Reports on Information Science and Electrical Engineering of Kyushu University
Volume6
Issue number2
Publication statusPublished - Sep 2001
Externally publishedYes

Fingerprint

Program processors
Time sharing systems
Computer operating systems
Processing
Computer systems
Scheduling
Costs

Keywords

  • Behaviour
  • Content
  • Predict
  • Process scheduler
  • Response time
  • WWW server

ASJC Scopus subject areas

  • Hardware and Architecture
  • Engineering (miscellaneous)
  • Electrical and Electronic Engineering

Cite this

Evaluation of an advanced knowledge-based process scheduler. / Suranauwarat, S.; Taniguchi, Hideo.

In: Research Reports on Information Science and Electrical Engineering of Kyushu University, Vol. 6, No. 2, 09.2001, p. 179-184.

Research output: Contribution to journalArticle

@article{612c7b3ed73c4864802e5d96b7411079,
title = "Evaluation of an advanced knowledge-based process scheduler",
abstract = "Conventional process schedulers in operating systems control the sharing of the CPU resources among processes using a fixed scheduling policy, in which the utilization of a computer system (e.g., a real-time or a time-sharing system) is a major concern rather than content or behaviour of a process. As a result, the CPU resource is likely to be used in an inefficient manner, or the processing time of a process may be extended unnecessarily. Therefore, we proposed a process' behaviour-based scheduler in oder to reduce the processing time and the process switching cost. More specifically, our scheduler allows a process to continue its execution even though its time-slice has already expired, when it is predicted from an advanced knowledge called PFS (Program Flow Sequence) that the process needs a little bit more CPU time before it voluntarily relinquishes the CPU. In this paper, we present the experimental evaluation of our proposed scheduler.",
keywords = "Behaviour, Content, Predict, Process scheduler, Response time, WWW server",
author = "S. Suranauwarat and Hideo Taniguchi",
year = "2001",
month = "9",
language = "English",
volume = "6",
pages = "179--184",
journal = "Research Reports on Information Science and Electrical Engineering of Kyushu University",
issn = "1342-3819",
publisher = "Kyushu University, Faculty of Science",
number = "2",

}

TY - JOUR

T1 - Evaluation of an advanced knowledge-based process scheduler

AU - Suranauwarat, S.

AU - Taniguchi, Hideo

PY - 2001/9

Y1 - 2001/9

N2 - Conventional process schedulers in operating systems control the sharing of the CPU resources among processes using a fixed scheduling policy, in which the utilization of a computer system (e.g., a real-time or a time-sharing system) is a major concern rather than content or behaviour of a process. As a result, the CPU resource is likely to be used in an inefficient manner, or the processing time of a process may be extended unnecessarily. Therefore, we proposed a process' behaviour-based scheduler in oder to reduce the processing time and the process switching cost. More specifically, our scheduler allows a process to continue its execution even though its time-slice has already expired, when it is predicted from an advanced knowledge called PFS (Program Flow Sequence) that the process needs a little bit more CPU time before it voluntarily relinquishes the CPU. In this paper, we present the experimental evaluation of our proposed scheduler.

AB - Conventional process schedulers in operating systems control the sharing of the CPU resources among processes using a fixed scheduling policy, in which the utilization of a computer system (e.g., a real-time or a time-sharing system) is a major concern rather than content or behaviour of a process. As a result, the CPU resource is likely to be used in an inefficient manner, or the processing time of a process may be extended unnecessarily. Therefore, we proposed a process' behaviour-based scheduler in oder to reduce the processing time and the process switching cost. More specifically, our scheduler allows a process to continue its execution even though its time-slice has already expired, when it is predicted from an advanced knowledge called PFS (Program Flow Sequence) that the process needs a little bit more CPU time before it voluntarily relinquishes the CPU. In this paper, we present the experimental evaluation of our proposed scheduler.

KW - Behaviour

KW - Content

KW - Predict

KW - Process scheduler

KW - Response time

KW - WWW server

UR - http://www.scopus.com/inward/record.url?scp=0035454315&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035454315&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0035454315

VL - 6

SP - 179

EP - 184

JO - Research Reports on Information Science and Electrical Engineering of Kyushu University

JF - Research Reports on Information Science and Electrical Engineering of Kyushu University

SN - 1342-3819

IS - 2

ER -