A new task scheduling method for distributed programs that require memory management

Hiroshi Koide, Yuji Oie

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

In parallel and distributed applications, it is very likely that object-oriented languages, such as Java and Ruby, and large-scale semistructured data written in XML will be employed. However, because of their inherent dynamic memory management, parallel and distributed applications must sometimes suspend the execution of all tasks running on the processors. This adversely affects their execution on the parallel and distributed platform. In this paper, we propose a new task scheduling method called CP/MM (Critical Path/Memory Management) 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 (executable) coarse-grain tasks, or macro-tasks, to processors. We have developed three task scheduling modules, including CP/MM, for a task scheduling system which is implemented on a Java RMI (Remote Method Invocation) communication infrastructure. Our experimental results show that CP/MM can successfully prevent high-priority macro-tasks from being affected by the garbage collection arising from memory management, so that CP/MM can efficiently schedule distributed programs whose critical paths are relatively long.

Original languageEnglish
Pages (from-to)941-958
Number of pages18
JournalConcurrency Computation Practice and Experience
Volume18
Issue number9
DOIs
Publication statusPublished - Aug 10 2006
Externally publishedYes

Fingerprint

Memory Management
Task Scheduling
Critical Path
Scheduling
Data storage equipment
Parallel Applications
Distributed Applications
Java
Macros
Schedule
Semistructured Data
Garbage Collection
Object-oriented Languages
Ruby
Object oriented programming
XML
Infrastructure
Likely
Module
Communication

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Computer Science Applications
  • Computer Networks and Communications
  • Computational Theory and Mathematics

Cite this

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

In: Concurrency Computation Practice and Experience, Vol. 18, No. 9, 10.08.2006, p. 941-958.

Research output: Contribution to journalArticle

@article{9cc5925ac5664a00a6f9f6671e3d80b1,
title = "A new task scheduling method for distributed programs that require memory management",
abstract = "In parallel and distributed applications, it is very likely that object-oriented languages, such as Java and Ruby, and large-scale semistructured data written in XML will be employed. However, because of their inherent dynamic memory management, parallel and distributed applications must sometimes suspend the execution of all tasks running on the processors. This adversely affects their execution on the parallel and distributed platform. In this paper, we propose a new task scheduling method called CP/MM (Critical Path/Memory Management) 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 (executable) coarse-grain tasks, or macro-tasks, to processors. We have developed three task scheduling modules, including CP/MM, for a task scheduling system which is implemented on a Java RMI (Remote Method Invocation) communication infrastructure. Our experimental results show that CP/MM can successfully prevent high-priority macro-tasks from being affected by the garbage collection arising from memory management, so that CP/MM can efficiently schedule distributed programs whose critical paths are relatively long.",
author = "Hiroshi Koide and Yuji Oie",
year = "2006",
month = "8",
day = "10",
doi = "10.1002/cpe.963",
language = "English",
volume = "18",
pages = "941--958",
journal = "Concurrency Computation Practice and Experience",
issn = "1532-0626",
publisher = "John Wiley and Sons Ltd",
number = "9",

}

TY - JOUR

T1 - A new task scheduling method for distributed programs that require memory management

AU - Koide, Hiroshi

AU - Oie, Yuji

PY - 2006/8/10

Y1 - 2006/8/10

N2 - In parallel and distributed applications, it is very likely that object-oriented languages, such as Java and Ruby, and large-scale semistructured data written in XML will be employed. However, because of their inherent dynamic memory management, parallel and distributed applications must sometimes suspend the execution of all tasks running on the processors. This adversely affects their execution on the parallel and distributed platform. In this paper, we propose a new task scheduling method called CP/MM (Critical Path/Memory Management) 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 (executable) coarse-grain tasks, or macro-tasks, to processors. We have developed three task scheduling modules, including CP/MM, for a task scheduling system which is implemented on a Java RMI (Remote Method Invocation) communication infrastructure. Our experimental results show that CP/MM can successfully prevent high-priority macro-tasks from being affected by the garbage collection arising from memory management, so that CP/MM can efficiently schedule distributed programs whose critical paths are relatively long.

AB - In parallel and distributed applications, it is very likely that object-oriented languages, such as Java and Ruby, and large-scale semistructured data written in XML will be employed. However, because of their inherent dynamic memory management, parallel and distributed applications must sometimes suspend the execution of all tasks running on the processors. This adversely affects their execution on the parallel and distributed platform. In this paper, we propose a new task scheduling method called CP/MM (Critical Path/Memory Management) 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 (executable) coarse-grain tasks, or macro-tasks, to processors. We have developed three task scheduling modules, including CP/MM, for a task scheduling system which is implemented on a Java RMI (Remote Method Invocation) communication infrastructure. Our experimental results show that CP/MM can successfully prevent high-priority macro-tasks from being affected by the garbage collection arising from 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=33746922337&partnerID=8YFLogxK

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

U2 - 10.1002/cpe.963

DO - 10.1002/cpe.963

M3 - Article

AN - SCOPUS:33746922337

VL - 18

SP - 941

EP - 958

JO - Concurrency Computation Practice and Experience

JF - Concurrency Computation Practice and Experience

SN - 1532-0626

IS - 9

ER -