Accession Number:

ADA207877

Title:

BM/C(3) Algorithm Mapping Onto Concurrent Processors

Descriptive Note:

Final rept. May-Dec 1987

Corporate Author:

CONNECTICUT UNIV STORRS DEPT OF ELECTRICAL AND SYSTEMS ENGINEERING

Report Date:

1989-03-01

Pagination or Media Count:

97.0

Abstract:

This report is concerned with the mapping of large scale resource allocation algorithms onto parallel computing architectures. The mapping problem is viewed as one of assigning the nodes of a finite, directed, acylic task graph representing the logical and data dependencies among the tasks constituting the algorithm onto the nodes of a finite, undirected processor graph denoting the parallel computing architecture. The objective is to minimize the completion time of the algorithm such that the redundancy, processor memory and security constraints are satisfied. The delays introduced by task queueing, message transmission, message collision and precedence constraints are explicitly modeled. We present four algorithms to solve the mapping problem.

Subject Categories:

  • Computer Programming and Software

Distribution Statement:

APPROVED FOR PUBLIC RELEASE