A new task scheduling method for distributed programs which require memory management in grids

Hiroshi Koide, Yuji Oie

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

In the Grid applications, it is very likely that object oriented languages, like Java and Ruby, will be employed as well as large-scale semi-structured data like XML. However, their inherent dynamic memory management has to suspend the execution of all the tasks running on processors when it is invoked. This will adversely affect the Grid computing severely unless the task scheduling system can avoid it with some special mechanism. In this paper, we propose a new task scheduling method, referenced to as CP/MM, which can efficiently schedule tasks for applications requiring memory management. The underlying concept is to consider the cost due to memory management when the task scheduling system allocates ready coarse grain tasks, or macro-tasks, to processors. We have developed three task scheduling modules including an implementation of CP/MM into a task scheduling system is implemented on Java RMI (Remote Method Invocation) communication infrastructure. Moreover, we evaluate the fundamental performance of CP/MM in two ways. The first is the performance evaluation of CP/MM which is applied to a small but practical test application program on a PC cluster. The second is the performance evaluation for test programs which have many tasks with complicated dependency relations on the test bed system consisting of computers on our two campuses located at a distance of approximately 32 km. These experimental results show that CP/MM can successfully prevent high priority macro-tasks from being affected by the garbage collection arising from the memory management, so that CP/MM can efficiently schedule distributed programs whose critical paths are relatively long.

Original languageEnglish
Title of host publicationProceedings - 2004 International Symposium on Applications and the Internet Workshops (Saint 2004Workshops)
Pages666-673
Number of pages8
Publication statusPublished - Jun 14 2004
Externally publishedYes
EventProceedings - 2004 International Symposium on Applications and the Internet Workshops (Saint 2004Workshop) - Tokyo, Japan
Duration: Jan 26 2004Jan 30 2004

Publication series

NameProceedings - International Symposium on Applications and the Internet Workshops

Other

OtherProceedings - 2004 International Symposium on Applications and the Internet Workshops (Saint 2004Workshop)
CountryJapan
CityTokyo
Period1/26/041/30/04

Fingerprint

Scheduling
Data storage equipment
Macros
Ruby
Grid computing
Object oriented programming
Application programs
XML
Computer systems
Communication
Costs

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this

Koide, H., & Oie, Y. (2004). A new task scheduling method for distributed programs which require memory management in grids. In Proceedings - 2004 International Symposium on Applications and the Internet Workshops (Saint 2004Workshops) (pp. 666-673). (Proceedings - International Symposium on Applications and the Internet Workshops).

A new task scheduling method for distributed programs which require memory management in grids. / Koide, Hiroshi; Oie, Yuji.

Proceedings - 2004 International Symposium on Applications and the Internet Workshops (Saint 2004Workshops). 2004. p. 666-673 (Proceedings - International Symposium on Applications and the Internet Workshops).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Koide, H & Oie, Y 2004, A new task scheduling method for distributed programs which require memory management in grids. in Proceedings - 2004 International Symposium on Applications and the Internet Workshops (Saint 2004Workshops). Proceedings - International Symposium on Applications and the Internet Workshops, pp. 666-673, Proceedings - 2004 International Symposium on Applications and the Internet Workshops (Saint 2004Workshop), Tokyo, Japan, 1/26/04.
Koide H, Oie Y. A new task scheduling method for distributed programs which require memory management in grids. In Proceedings - 2004 International Symposium on Applications and the Internet Workshops (Saint 2004Workshops). 2004. p. 666-673. (Proceedings - International Symposium on Applications and the Internet Workshops).
Koide, Hiroshi ; Oie, Yuji. / A new task scheduling method for distributed programs which require memory management in grids. Proceedings - 2004 International Symposium on Applications and the Internet Workshops (Saint 2004Workshops). 2004. pp. 666-673 (Proceedings - International Symposium on Applications and the Internet Workshops).
@inproceedings{75d438f31fcd43b48b1eabdd344f2b80,
title = "A new task scheduling method for distributed programs which require memory management in grids",
abstract = "In the Grid applications, it is very likely that object oriented languages, like Java and Ruby, will be employed as well as large-scale semi-structured data like XML. However, their inherent dynamic memory management has to suspend the execution of all the tasks running on processors when it is invoked. This will adversely affect the Grid computing severely unless the task scheduling system can avoid it with some special mechanism. In this paper, we propose a new task scheduling method, referenced to as CP/MM, which can efficiently schedule tasks for applications requiring memory management. The underlying concept is to consider the cost due to memory management when the task scheduling system allocates ready coarse grain tasks, or macro-tasks, to processors. We have developed three task scheduling modules including an implementation of CP/MM into a task scheduling system is implemented on Java RMI (Remote Method Invocation) communication infrastructure. Moreover, we evaluate the fundamental performance of CP/MM in two ways. The first is the performance evaluation of CP/MM which is applied to a small but practical test application program on a PC cluster. The second is the performance evaluation for test programs which have many tasks with complicated dependency relations on the test bed system consisting of computers on our two campuses located at a distance of approximately 32 km. These experimental results show that CP/MM can successfully prevent high priority macro-tasks from being affected by the garbage collection arising from the memory management, so that CP/MM can efficiently schedule distributed programs whose critical paths are relatively long.",
author = "Hiroshi Koide and Yuji Oie",
year = "2004",
month = "6",
day = "14",
language = "English",
isbn = "0769520502",
series = "Proceedings - International Symposium on Applications and the Internet Workshops",
pages = "666--673",
booktitle = "Proceedings - 2004 International Symposium on Applications and the Internet Workshops (Saint 2004Workshops)",

}

TY - GEN

T1 - A new task scheduling method for distributed programs which require memory management in grids

AU - Koide, Hiroshi

AU - Oie, Yuji

PY - 2004/6/14

Y1 - 2004/6/14

N2 - In the Grid applications, it is very likely that object oriented languages, like Java and Ruby, will be employed as well as large-scale semi-structured data like XML. However, their inherent dynamic memory management has to suspend the execution of all the tasks running on processors when it is invoked. This will adversely affect the Grid computing severely unless the task scheduling system can avoid it with some special mechanism. In this paper, we propose a new task scheduling method, referenced to as CP/MM, which can efficiently schedule tasks for applications requiring memory management. The underlying concept is to consider the cost due to memory management when the task scheduling system allocates ready coarse grain tasks, or macro-tasks, to processors. We have developed three task scheduling modules including an implementation of CP/MM into a task scheduling system is implemented on Java RMI (Remote Method Invocation) communication infrastructure. Moreover, we evaluate the fundamental performance of CP/MM in two ways. The first is the performance evaluation of CP/MM which is applied to a small but practical test application program on a PC cluster. The second is the performance evaluation for test programs which have many tasks with complicated dependency relations on the test bed system consisting of computers on our two campuses located at a distance of approximately 32 km. These experimental results show that CP/MM can successfully prevent high priority macro-tasks from being affected by the garbage collection arising from the memory management, so that CP/MM can efficiently schedule distributed programs whose critical paths are relatively long.

AB - In the Grid applications, it is very likely that object oriented languages, like Java and Ruby, will be employed as well as large-scale semi-structured data like XML. However, their inherent dynamic memory management has to suspend the execution of all the tasks running on processors when it is invoked. This will adversely affect the Grid computing severely unless the task scheduling system can avoid it with some special mechanism. In this paper, we propose a new task scheduling method, referenced to as CP/MM, which can efficiently schedule tasks for applications requiring memory management. The underlying concept is to consider the cost due to memory management when the task scheduling system allocates ready coarse grain tasks, or macro-tasks, to processors. We have developed three task scheduling modules including an implementation of CP/MM into a task scheduling system is implemented on Java RMI (Remote Method Invocation) communication infrastructure. Moreover, we evaluate the fundamental performance of CP/MM in two ways. The first is the performance evaluation of CP/MM which is applied to a small but practical test application program on a PC cluster. The second is the performance evaluation for test programs which have many tasks with complicated dependency relations on the test bed system consisting of computers on our two campuses located at a distance of approximately 32 km. These experimental results show that CP/MM can successfully prevent high priority macro-tasks from being affected by the garbage collection arising from the memory management, so that CP/MM can efficiently schedule distributed programs whose critical paths are relatively long.

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

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

M3 - Conference contribution

AN - SCOPUS:2642545946

SN - 0769520502

T3 - Proceedings - International Symposium on Applications and the Internet Workshops

SP - 666

EP - 673

BT - Proceedings - 2004 International Symposium on Applications and the Internet Workshops (Saint 2004Workshops)

ER -