Minimizing paging tradeoffs applying coscheduling techniques in a linux cluster

Francesc Giné; Francesc Solsona; Porfidio Hernández; Emilio Luque

Minimizing paging tradeoffs applying coscheduling techniques in a linux cluster

Francesc Giné, Francesc Solsona, Porfidio Hernández, Emilio Luque

Research output: Contribution to journal › Article › Research › peer-review

Abstract

Our research is focused on keeping both local and parallel jobs together in a non-dedicated cluster or NOW (Network of Workstations) and efficiently scheduling them by means of coscheduling mechanisms. The performance of a good coscheduling policy can decrease drastically if memory requirements are not kept in mind. The overflow of the physical memory into the virtual memory usually provokes a severe performance penalty. A real implementation of a coscheduling technique for reducing the number of page faults across a non-dedicated Linux cluster is presented in this article. Our technique is based on knowledge of events obtained during execution, such as communication activity, page faults and memory size of every task. Its performance is analyzed and compared with other coscheduling algorithms. © Springer-Verlag Berlin Heidelberg 2003.

Original language	English
Pages (from-to)	593-607
Journal	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2565
Publication status	Published - 1 Dec 2003

Keywords

Cluster and Grid Computing
Distributed Computing

Cite this

@article{10263aa0f6b544439f82c500896a2eb7,

title = "Minimizing paging tradeoffs applying coscheduling techniques in a linux cluster",

abstract = "Our research is focused on keeping both local and parallel jobs together in a non-dedicated cluster or NOW (Network of Workstations) and efficiently scheduling them by means of coscheduling mechanisms. The performance of a good coscheduling policy can decrease drastically if memory requirements are not kept in mind. The overflow of the physical memory into the virtual memory usually provokes a severe performance penalty. A real implementation of a coscheduling technique for reducing the number of page faults across a non-dedicated Linux cluster is presented in this article. Our technique is based on knowledge of events obtained during execution, such as communication activity, page faults and memory size of every task. Its performance is analyzed and compared with other coscheduling algorithms. {\textcopyright} Springer-Verlag Berlin Heidelberg 2003.",

keywords = "Cluster and Grid Computing, Distributed Computing",

author = "Francesc Gin{\'e} and Francesc Solsona and Porfidio Hern{\'a}ndez and Emilio Luque",

year = "2003",

month = dec,

day = "1",

language = "English",

volume = "2565",

pages = "593--607",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

}

Minimizing paging tradeoffs applying coscheduling techniques in a linux cluster. / Giné, Francesc; Solsona, Francesc; Hernández, Porfidio et al.

In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 2565, 01.12.2003, p. 593-607.

Research output: Contribution to journal › Article › Research › peer-review

TY - JOUR

T1 - Minimizing paging tradeoffs applying coscheduling techniques in a linux cluster

AU - Giné, Francesc

AU - Solsona, Francesc

AU - Hernández, Porfidio

AU - Luque, Emilio

PY - 2003/12/1

Y1 - 2003/12/1

N2 - Our research is focused on keeping both local and parallel jobs together in a non-dedicated cluster or NOW (Network of Workstations) and efficiently scheduling them by means of coscheduling mechanisms. The performance of a good coscheduling policy can decrease drastically if memory requirements are not kept in mind. The overflow of the physical memory into the virtual memory usually provokes a severe performance penalty. A real implementation of a coscheduling technique for reducing the number of page faults across a non-dedicated Linux cluster is presented in this article. Our technique is based on knowledge of events obtained during execution, such as communication activity, page faults and memory size of every task. Its performance is analyzed and compared with other coscheduling algorithms. © Springer-Verlag Berlin Heidelberg 2003.

AB - Our research is focused on keeping both local and parallel jobs together in a non-dedicated cluster or NOW (Network of Workstations) and efficiently scheduling them by means of coscheduling mechanisms. The performance of a good coscheduling policy can decrease drastically if memory requirements are not kept in mind. The overflow of the physical memory into the virtual memory usually provokes a severe performance penalty. A real implementation of a coscheduling technique for reducing the number of page faults across a non-dedicated Linux cluster is presented in this article. Our technique is based on knowledge of events obtained during execution, such as communication activity, page faults and memory size of every task. Its performance is analyzed and compared with other coscheduling algorithms. © Springer-Verlag Berlin Heidelberg 2003.

KW - Cluster and Grid Computing

KW - Distributed Computing

M3 - Article

SN - 0302-9743

VL - 2565

SP - 593

EP - 607

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

ER -

Minimizing paging tradeoffs applying coscheduling techniques in a linux cluster

Abstract

Keywords

Fingerprint

Cite this