High Level Language Programming and Automated Mapping to    Multiprocessors
{'Code': '15030000', 'Directorate': {'Abbreviation': 'TIP', 'LongName': 'Dir for Tech, Innovation, & Partnerships'}, 'Division': {'Abbreviation': 'TI', 'LongName': 'Translational Impacts'}}
{'SignBlockName': 'Ritchie B. Coryell', 'PO_EMAI': None, 'PO_PHON': None}
Crystal and the Crystal Run-time System will make the use of                    large-scale multiprocessors practical for real-world                            problems.  Crystal is a very-high-level language in which a                     user program resembles a concise, formal mathematical                           description.  Crystal is easy to use yet has the modularity                     and freedom from side effects that is critical for the                          automatic detection of parallelism.  Messages need not be                       passed explicitly, and the Crystal compiler automatically                       does task decomposition.  When the pattern of computations in                   a section of the program is known at compile time, a direct                     mapping of the algorithm in question may be performed.  When                    the pattern of computations is fully determined only at                         runtime, the compiler constructs a symbolic representation of                   the data dependencies.  The runtime system will use this                        symbolic representation to aggregate the required                               computations.  When enough regularity is present it will                        create a parameterized mapping scheme.  Using knowledge of                      target machine characteristics, the runtime system will                         choose the appropriate instance of the mapping scheme and                       dynamically map the computations onto the target                                architecture.
{'FirstName': 'David', 'LastName': 'Foulser', 'PI_MID_INIT': None, 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'David Foulser', 'EmailAddress': None, 'PI_PHON': None, 'NSF_ID': '000307754', 'StartDate': '02/01/1988', 'EndDate': None, 'RoleCode': 'Principal Investigator'}
{'Name': 'Scientific Computing Associates Inc', 'CityName': 'NEW HAVEN', 'ZipCode': '065107013', 'PhoneNumber': '2037777442', 'StreetAddress': '265 CHURCH ST STE 1010', 'StreetAddress2': None, 'CountryName': 'United States', 'StateName': 'Connecticut', 'StateCode': 'CT', 'CONGRESSDISTRICT': '03', 'CONGRESS_DISTRICT_ORG': 'CT03', 'ORG_UEI_NUM': None, 'ORG_LGL_BUS_NAME': None, 'ORG_PRNT_UEI_NUM': None}
{'Name': None, 'CityName': None, 'StateCode': None, 'ZipCode': None, 'StreetAddress': None, 'CountryCode': None, 'CountryName': None, 'StateName': None, 'CountryFlag': None, 'CONGRESSDISTRICT': None, 'CONGRESS_DISTRICT_PERF': '""'}
{'Code': '5371', 'Text': 'SBIR Phase I'}
{'url': 'https://www.nsf.gov/awardsearch/download?DownloadFileName=1987&All=true', 'xml': '8760956.xml'}