Paper Info
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. Copyright (c) 2005 John Wiley & Sons, Ltd.
Year
DOI
Venue
2006
10.1002/cpe.963
CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE
Keywords
DocType
Volume
task scheduling, memory management, garbage collection, critical path scheduling, CP/MM, Java
Journal
18
Issue
ISSN
Citations 
9
1532-0626
0
PageRank 
References 
Authors
0.34
0
2
Name
Order
Citations
PageRank
Hiroshi Koide1528.58
Yuji Oie237868.37