Files in this item

FilesDescriptionFormat

application/pdf

application/pdf9210934.pdf (8MB)Restricted to U of Illinois
(no description provided)PDF

Description

Title:Empirical study of load distribution strategies on multicomputers
Author(s):Nazief, Bobby Achirul Awal
Doctoral Committee Chair(s):Reed, Daniel
Department / Program:Computer Science
Discipline:Computer Science
Degree Granting Institution:University of Illinois at Urbana-Champaign
Degree:Ph.D.
Genre:Dissertation
Subject(s):Computer Science
Abstract:In this thesis, we examine an important issue in the execution of parallel programs on multicomputers. We consider parallel programs that consist of dynamically created tasks. These tasks communicate via message passing. The important issue is: how to assign the tasks of a parallel program on multicomputer nodes, such that the program execution time is minimal. This is but one facet of the class of resource allocation problems known as load distribution.
We have identified two groups of load distribution strategies on multicomputers. The first contains task placement strategies that assign newly created tasks to nodes. Once a task starts executing, it cannot be reassigned to a different node. The second group contains task migration strategies that manage initial task placement, and potential task relocation. Tasks may now be relocated to different nodes even after they have begun execution. To determine the performance of these strategies, we must study their behavior for a given range of machine architectures and a set of computational models.
In this thesis, we study the behavior of task placement and task migration strategies on multicomputers by comparing their static and dynamic performance through parametric simulations. In particular, we study the interaction between task placement strategies and parallel programs under different hardware and machine architectures. We also study whether task migration strategies can improve the performance obtained by task placement strategies alone. Because the cost of task migration may potentially be more expensive than that of task placement, we also study the possibility of reducing the task migration overhead.
Issue Date:1991
Type:Text
Language:English
URI:http://hdl.handle.net/2142/21154
Rights Information:Copyright 1991 Nazief, Bobby Achirul Awal
Date Available in IDEALS:2011-05-07
Identifier in Online Catalog:AAI9210934
OCLC Identifier:(UMI)AAI9210934


This item appears in the following Collection(s)

Item Statistics