Tree Algorithms for Controlling Large Parallel Computers
{'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 is a grant for research into ways that allow reliable and                  efficient control of large parallel systems containing thousands or             millions of component computers.  Candidate algorithms will be analysed         with a combination of the two techniques: direct simulation of as many          as two thousand computer nodes to explore major factors in algorithm            performance and mathematical analysis to give precise formulae for              scaling results onto even larger systems.                                                                                                                       Expected benefits from this research include:                                                                                                                   (1) creation of distributed tree algorithms to control global resources         in large systems;                                                                                                                                               (2) creation and evaluation of partially distributed algorithms                 tailored for efficient execution on large parallel processing systems           by locally using shared cluster memory and very globally using slower           communications to exchange data;                                                                                                                                (3) comparison of major algorithms for performing key tasks in large            parallel systems, for example, to determine at what systems size                asynchronous gossip techniques for keeping distributed copies of system         databses weakly consistent become more efficient than synchronous               mehtods of assuring mutual consistency of all copies before any changes         are made; and                                                                                                                                                   (4) generally establishing and confirming design techniques for                 operating systems for large parallel computers, especially as they              differ from the control techniques needed for small systems.
{'FirstName': 'Larry', 'LastName': 'Wittie', 'PI_MID_INIT': 'D', 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'Larry D Wittie', 'EmailAddress': 'lw@cs.usb.edu', 'NSF_ID': '000367486', 'StartDate': '01/01/1988', 'EndDate': None, 'RoleCode': 'Principal Investigator'}
{'Name': 'SUNY at Stony Brook', 'CityName': 'STONY BROOK', 'ZipCode': '117940001', 'PhoneNumber': '6316329949', 'StreetAddress': 'W5510 FRANKS MELVILLE MEMORIAL L', 'StreetAddress2': None, 'CountryName': 'United States', 'StateName': 'New York', 'StateCode': 'NY', 'CONGRESSDISTRICT': '01', 'CONGRESS_DISTRICT_ORG': 'NY01', 'ORG_UEI_NUM': 'M746VC6XMNH9', 'ORG_LGL_BUS_NAME': 'THE RESEARCH FOUNDATION FOR THE STATE UNIVERSITY OF NEW YORK', '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': '2875', 'Text': 'SYSTEM SOFTWARE'}
{'url': 'https://www.nsf.gov/awardsearch/download?DownloadFileName=1987&All=true', 'xml': '8713865.xml'}