PICASSO:  A Vehicle for Multicomputer Systems Research
{'Code': '05010300', 'Directorate': {'Abbreviation': 'CSE', 'LongName': 'Direct For Computer & Info Scie & Enginr'}, 'Division': {'Abbreviation': 'CCF', 'LongName': 'Division of Computing and Communication Foundations'}}
{'SignBlockName': 'Yechezkel Zalcstein', 'PO_EMAI': 'zzalcste@nsf.gov', 'PO_PHON': '7032920000'}
The research proposed focuses on developing algorithms and system               software for a high-performance multicomputer system.  A multicomputer          system consists of a large number of interconnected computing nodes             that asynchronously cooperate via message passing to execute the tasks          of parallel programs.  Each network node, fabricated as a small number          of VLSI chips, contains a processor, a local memory, and (preferably) a         communication controller capable of routing messages without delaying           the computation processor.  The recent appearance of commercial                 multicomputer systems (i.e., hypercubes), with rudimentary software             support, allows testing of many new ideas in operating systems,                 algorithms, communication, and parallel programming.                                                                                                            Because there is no global memory, a multicomputer system supporting            computations that dynamically create tasks must schedule those tasks on         idle nodes using information local to the area where the tasks were             created.  Problem partitioning and new algorithm designs for                    communicating tasks must be explored if multicomputer systems are to be         used effectively.  In addition, communication software capable of               efficiently routing messages to their destination are needed.  The PI           has partially tested, via analysis and simulation, many techniques and          ideas for resolving these problems in scheduling and routing.  Picasso,         a hypercube operating system with modules for dynamic task scheduling           and adaptive message routing, is being developed to experimentally              explore the interaction of task scheduling, adaptive routing                    algorithms, and algorithm design.
{'FirstName': 'Daniel', 'LastName': 'Reed', 'PI_MID_INIT': 'A', 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'Daniel A Reed', 'EmailAddress': 'dan.reed@utah.edu', 'NSF_ID': '000356566', 'StartDate': '05/01/1988', 'EndDate': None, 'RoleCode': 'Principal Investigator'}
{'Name': 'University of Illinois at Urbana-Champaign', 'CityName': 'URBANA', 'ZipCode': '618013620', 'PhoneNumber': '2173332187', 'StreetAddress': '506 S WRIGHT ST', 'StreetAddress2': None, 'CountryName': 'United States', 'StateName': 'Illinois', 'StateCode': 'IL', 'CONGRESSDISTRICT': '13', 'CONGRESS_DISTRICT_ORG': 'IL13', 'ORG_UEI_NUM': 'Y8CWNJRCNN91', 'ORG_LGL_BUS_NAME': 'UNIVERSITY OF ILLINOIS', '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': '471500', 'Text': 'COMPUTER SYSTEMS ARCHITECTURE'}
{'url': 'https://www.nsf.gov/awardsearch/download?DownloadFileName=1987&All=true', 'xml': '8706653.xml'}