Parallel Scheduling of a Non Procedural Specification
{'Code': '05010400', 'Directorate': {'Abbreviation': 'CSE', 'LongName': 'Direct For Computer & Info Scie & Enginr'}, 'Division': {'Abbreviation': 'CCF', 'LongName': 'Division of Computing and Communication Foundations'}}
{'SignBlockName': 'name not available', 'PO_EMAI': None, 'PO_PHON': None}
This work is concerned with synthesizing a parallel schedule for a set of       equations in a nonprocedural specification.  Two forms of parallelism           will be exploited.  The first is forall parallelism, in which multiple          independent loop bodies may be run concurrently.  The second is task            level parallelism, in which multiple modules (perhaps including forall          loops) are active concurrently.                                                                                                                                 Previous research in program synthesis from non procedural specification        has been directed toward sequential, dataflow and distributed processing        environments.  This work focuses on an increasingly important target            machine class:  shared memory MIMD configurations, in which a program           consists of a task force rather than one monolithic single instruction          stream task.                                                                                                                                                    Other research efforts in generating parallel programs for MIMD machines        have dealt with parallelizing sequential FORTRAN programs.  In this work,       a very high level language for problem description (PS) is defined.  Use        of such a language enables domain experts (as opposed to programmers) to        produce parallel computer programs.                                                                                                                                                                                                                                                                                             The study of parallelism in programs has become an important challenge          for the affective use of multiple instruction stream computers.  This           effort will add to the understanding of the topic.
{'FirstName': 'B. David', 'LastName': 'Saunders', 'PI_MID_INIT': None, 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'B. David Saunders', 'EmailAddress': 'saunders@udel.edu', 'NSF_ID': '000334997', 'StartDate': '08/01/1987', 'EndDate': None, 'RoleCode': 'Principal Investigator'}
{'Name': 'University of Delaware', 'CityName': 'NEWARK', 'ZipCode': '197160099', 'PhoneNumber': '3028312136', 'StreetAddress': '220 HULLIHEN HALL', 'StreetAddress2': None, 'CountryName': 'United States', 'StateName': 'Delaware', 'StateCode': 'DE', 'CONGRESSDISTRICT': '00', 'CONGRESS_DISTRICT_ORG': 'DE00', 'ORG_UEI_NUM': 'T72NHKM259N3', 'ORG_LGL_BUS_NAME': 'UNIVERSITY OF DELAWARE', 'ORG_PRNT_UEI_NUM': 'T72NHKM259N3'}
{'Name': None, 'CityName': None, 'StateCode': None, 'ZipCode': None, 'StreetAddress': None, 'CountryCode': None, 'CountryName': None, 'StateName': None, 'CountryFlag': None, 'CONGRESSDISTRICT': None, 'CONGRESS_DISTRICT_PERF': '""'}
{'Code': '2875', 'Text': 'SYSTEM SOFTWARE'}
{'url': 'https://www.nsf.gov/awardsearch/download?DownloadFileName=1986&All=true', 'xml': '8614219.xml'}