The weighted graph mapping problem is motivated by the problem of assigning program modules to processors in parallel architectures. The formulation of the weighted graph mapping problem has not only led to a novel approach to assigning modules, but has also suggested new and challenging graph-theoretic problems. The main objectives of this Research Planning Grant proposal are to develop a good understanding of the proposed research problems, to establish a competitive research project, and to prepare a grant proposal to NSF.//

Agency
National Science Foundation (NSF)
Institute
Division of Computer and Communication Foundations (CCF)
Type
Standard Grant (Standard)
Application #
9109512
Program Officer
Dana S. Richards
Project Start
Project End
Budget Start
1991-06-15
Budget End
1993-05-31
Support Year
Fiscal Year
1991
Total Cost
$18,000
Indirect Cost
Name
George Washington University
Department
Type
DUNS #
City
Washington
State
DC
Country
United States
Zip Code
20052