Date of Award

Spring 2005

Document Type

Thesis

Degree Name

Master of Science (MS)

Department

Electrical & Computer Engineering

Program/Concentration

Computer Engineering

Committee Director

Roland R. Mielke

Committee Member

James Leathrum

Committee Member

Stephen A. Zahorian

Call Number for Print

Special Collections LD4331.E55 H39 2005

Abstract

This thesis describes the development of a software tool that facilitates the creation of software environments that make a simulation tool execute k replications of an application program on several nodes of an M-node Beowulf cluster. It is assumed that each cluster-node consists of p processors. The p processors that are contained in the master cluster-node are termed master processors, and the p processors that are contained in a slave cluster-node are termed slave processors. The slave processors are used to execute the replications, while the master processors are dedicated to schedule the replications and process other housekeeping chores. For each slave cluster-node that is selected, P processors are specified to participate in the execution of the replications, where 1 ≤ P ≤ p. The total slave processors selected to execute the replications is N. These slave processors are contained in the set ∏ with cardinality |∏| = N. Therefore, the k replications are executed concurrently if k ≤ N . Otherwise, the k replications are grouped into batches that are executed concurrently as processors become available.

Rights

In Copyright. URI: http://rightsstatements.org/vocab/InC/1.0/ This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).

DOI

10.25777/11yf-hq97

Download

Share

COinS