Evaluation of a process scheduling policy for a WWW server based on its contents

Sukanya Suranauwarat, Hideo Taniguchi

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Traditional process schedulers in operating systems control the sharing of the processor resources among processes using a fixed scheduling policy based on the utilization of a computer system such as a real-time or a timesharing system. Since the control over processor allocation is based on a fixed policy, not based on contents or behavior of processes, this can hinder an effective use of a processor or can extend the processing time of a process unnecessarily in some cases. \Ve have already proposed a process scheduling policy, which responds to the behavior of multiple processes of a WWW server, in order to improve the response time of a WWW server. This policy gives any process of a WWW server that is predicted to be a WWW server process handling a text data request from a browser priority over all other processes by moving it to the head of the ready queue where processes waiting for the processor to become available are placed. In this paper, we present the experimental evaluation of our proposed process scheduling policy with regard to the number of simultaneous accesses from browsers and the processor load of the server machine, and explain the results we obtained.

Original languageEnglish
Pages (from-to)1752-1761
Number of pages10
JournalIEICE Transactions on Information and Systems
VolumeE83-D
Issue number9
Publication statusPublished - 2000
Externally publishedYes

Fingerprint

World Wide Web
Servers
Scheduling
Response time (computer systems)
Computer systems
Processing

Keywords

  • Execution behavior
  • Predict
  • Process scheduling
  • Response time
  • WWW server

ASJC Scopus subject areas

  • Information Systems
  • Computer Graphics and Computer-Aided Design
  • Software

Cite this

Evaluation of a process scheduling policy for a WWW server based on its contents. / Suranauwarat, Sukanya; Taniguchi, Hideo.

In: IEICE Transactions on Information and Systems, Vol. E83-D, No. 9, 2000, p. 1752-1761.

Research output: Contribution to journalArticle

@article{baf9b216b41f467abf32678ec145a495,
title = "Evaluation of a process scheduling policy for a WWW server based on its contents",
abstract = "Traditional process schedulers in operating systems control the sharing of the processor resources among processes using a fixed scheduling policy based on the utilization of a computer system such as a real-time or a timesharing system. Since the control over processor allocation is based on a fixed policy, not based on contents or behavior of processes, this can hinder an effective use of a processor or can extend the processing time of a process unnecessarily in some cases. \Ve have already proposed a process scheduling policy, which responds to the behavior of multiple processes of a WWW server, in order to improve the response time of a WWW server. This policy gives any process of a WWW server that is predicted to be a WWW server process handling a text data request from a browser priority over all other processes by moving it to the head of the ready queue where processes waiting for the processor to become available are placed. In this paper, we present the experimental evaluation of our proposed process scheduling policy with regard to the number of simultaneous accesses from browsers and the processor load of the server machine, and explain the results we obtained.",
keywords = "Execution behavior, Predict, Process scheduling, Response time, WWW server",
author = "Sukanya Suranauwarat and Hideo Taniguchi",
year = "2000",
language = "English",
volume = "E83-D",
pages = "1752--1761",
journal = "IEICE Transactions on Information and Systems",
issn = "0916-8532",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "9",

}

TY - JOUR

T1 - Evaluation of a process scheduling policy for a WWW server based on its contents

AU - Suranauwarat, Sukanya

AU - Taniguchi, Hideo

PY - 2000

Y1 - 2000

N2 - Traditional process schedulers in operating systems control the sharing of the processor resources among processes using a fixed scheduling policy based on the utilization of a computer system such as a real-time or a timesharing system. Since the control over processor allocation is based on a fixed policy, not based on contents or behavior of processes, this can hinder an effective use of a processor or can extend the processing time of a process unnecessarily in some cases. \Ve have already proposed a process scheduling policy, which responds to the behavior of multiple processes of a WWW server, in order to improve the response time of a WWW server. This policy gives any process of a WWW server that is predicted to be a WWW server process handling a text data request from a browser priority over all other processes by moving it to the head of the ready queue where processes waiting for the processor to become available are placed. In this paper, we present the experimental evaluation of our proposed process scheduling policy with regard to the number of simultaneous accesses from browsers and the processor load of the server machine, and explain the results we obtained.

AB - Traditional process schedulers in operating systems control the sharing of the processor resources among processes using a fixed scheduling policy based on the utilization of a computer system such as a real-time or a timesharing system. Since the control over processor allocation is based on a fixed policy, not based on contents or behavior of processes, this can hinder an effective use of a processor or can extend the processing time of a process unnecessarily in some cases. \Ve have already proposed a process scheduling policy, which responds to the behavior of multiple processes of a WWW server, in order to improve the response time of a WWW server. This policy gives any process of a WWW server that is predicted to be a WWW server process handling a text data request from a browser priority over all other processes by moving it to the head of the ready queue where processes waiting for the processor to become available are placed. In this paper, we present the experimental evaluation of our proposed process scheduling policy with regard to the number of simultaneous accesses from browsers and the processor load of the server machine, and explain the results we obtained.

KW - Execution behavior

KW - Predict

KW - Process scheduling

KW - Response time

KW - WWW server

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

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

M3 - Article

AN - SCOPUS:0034270535

VL - E83-D

SP - 1752

EP - 1761

JO - IEICE Transactions on Information and Systems

JF - IEICE Transactions on Information and Systems

SN - 0916-8532

IS - 9

ER -