Asynchronous Algorithms and Concurrency Control
{'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 research is concerned with improving the performance of                    asynchronous algorithms.  These algorithms involve a number of                  independent activities which generally access common data.  Activities          must synchronize with one another to insure that data is kept                   consistent.  Unfortunately, synchronization impairs performance.  The           overall goal of the research is to develop techniques for reducing              synchronization requirements.                                                                                                                                   Much of the research will be concerned with concurrency control in              database systems and will focus on optimistic algorithms. Such                  algorithms are based on the assumption that synchronization is rarely           needed.  They allow activities to execute in an asynchronous fashion            and rely on rollback if situations are detected in which activities             should have synchronized.  Thus, rollback is the major cost and one             goal of the proposed research is to develop techniques for reducing the         probability of its occurence.  These include the use of semantic                information about activities, the use of special techniques for                 handling heavily accessed regions of the data (hotspots), and the use           of information that can be gathered about an activity when it is                formulated as a Prolog program.                                                                                                                                 The application of optimistic algorithms to replicated databases is             another area of interest.  Such databases have been proposed to                 improved the availability of data in failure situations and can also            serve to enhance performance.                                                                                                                                   Finally, research will be done on strategies for performing non-atomic          updates on certain shared data structures.  The goal is to guarantee            that readers, which execute asynchronously, always function correctly.
{'FirstName': 'Arthur', 'LastName': 'Bernstein', 'PI_MID_INIT': 'J', 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'Arthur J Bernstein', 'EmailAddress': 'art@cs.sunysb.edu', 'NSF_ID': '000123070', 'StartDate': '08/01/1987', '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': '8701671.xml'}