Back to search

NJIT

Implementation of an automatic mapping tool for massively parallel computing

Abstract

dc:description.abstract

In this thesis, an implementation of a generic technique for fine grain mapping of portable parallel algorithms onto multiprocessor architectures is presented. The implemented mapping algorithm is a component of Cluster-M. Cluster-M is a novel parallel programming tool which facilitates the design and mapping of portable softwares onto various parallel systems. The other components of Cluster-M are the Specifications and the Representations. Using the Specifications, machine independent parallel algorithms are presented in a "clustered" fashion specifying the concurrent computations and communications at every step of the overall execution. The Representations, on the other hand, are a form of clustering the underlying architecture to simplify the mapping process. The mapping algorithm implemented and tested in this thesis is an efficient method for matching the Specification clusters to the Representation clusters.

Degree

thesis:*
Name thesis:degree_name
Master of Science in Computer Science - (M.S.)
Discipline thesis:degree_discipline
Computer and Information Science

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Gadangi, Ajitha
Contributors dc:contributor
  • Mary M. Eshaghian
  • Daniel Y. Chao
  • David T. Wang

Subjects

dc:subject × 2

Identifiers

dc:identifier.*
Repository record dc:identifier
https://digitalcommons.njit.edu/theses/1623

Chain of custody

source
Harvested from
NJIT
Base URL
digitalcommons.njit.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Gadangi, Ajitha. Implementation of an automatic mapping tool for massively parallel computing. https://digitalcommons.njit.edu/theses/1623