Not listed
COLLABORATIVE RESEARCH: PPOSS: LARGE: A FULL-STACK ARCHITECTURE FOR SPARSE COMPUTATION -COMPUTER SYSTEMS HAVE BEEN DESIGNED AND OPTIMIZED PRIMARILY FOR DENSE COMPUTATIONS, I.E., THOSE THAT PROCESS REGULARLY STRUCTURED DATA. BUT CURRENT SYSTEMS ARE ILL-SUITED TO SPARSE COMPUTATIONS, I.E., THOSE THAT PROCESS UNSTRUCTURED DATA. SPARSE COMPUTATIONS ARE VERY COMMON BECAUSE MANY RELATIONS AND INTERACTIONS ARE SPARSE. FOR EXAMPLE, MOST PEOPLE ARE NOT FRIENDS AND MOST NEURONS ARE NOT DIRECTLY CONNECTED. SPARSE COMPUTATIONS TAKE ADVANTAGE OF THIS SPARSITY BY ENCODING AND PROCESSING ONLY MEANINGFUL RELATIONS, SUCH AS STORING ONLY THE NON-ZERO ELEMENTS OF A MATRIX. THESE APPLICATIONS ARE CRUCIAL IN MANY DOMAINS, LIKE DEEP LEARNING, DATA ANALYTICS, AND SCIENTIFIC COMPUTING, BUT THEIR IRREGULAR STRUCTURE MAKES THEM INEFFICIENT AND HARD TO SCALE IN CURRENT SYSTEMS, WASTING BILLIONS OF DOLLARS YEARLY. THIS PROJECT AIMS TO REDESIGN THE COMPUTING STACK TO PROVIDE FIRST-CLASS SUPPORT FOR SPARSE COMPUTATIONS. THE PROJECT'S NOVELTIES INCLUDE A FULL SYSTEM STACK THAT SPANS PROGRAMMING LANGUAGES, COMPILERS, AND SPECIALIZED HARDWARE ARCHITECTURES AND LARGE-SCALE COMPUTER SYSTEMS. THE PROJECT'S IMPACTS INCLUDE MAKING FUTURE PARALLEL SYSTEMS MUCH MORE VERSATILE, SCALABLE, ENERGY EFFICIENT AND EASIER TO PROGRAM. THIS PROJECT TAKES A COORDINATED APPROACH ACROSS THE SYSTEM STACK TO UNLOCK THE PERFORMANCE AND SCALABILITY OF SPARSE COMPUTATIONS, BECAUSE THEY POSE CHALLENGES THAT CANNOT BE ADDRESSED AT A SINGLE LAYER. FOR EXAMPLE, SPARSE COMPUTATIONS HAVE A RICH SPACE OF CHOICES IN ALGORITHM, DATA REPRESENTATION, AND SCHEDULE, WHICH CURRENT LANGUAGES AND COMPILERS CANNOT CAPTURE OR OPTIMIZE PROPERLY. THE RIGHT CHOICE OF ALGORITHM AND DATA REPRESENTATION ARE OFTEN UNKNOWN IN ADVANCE AND MAY CHANGE AT RUN-TIME, THWARTING THE RIGID DIVISION BETWEEN CURRENT COMPILERS AND SCHEDULERS. IRREGULAR, DATA-DEPENDENT CONTROL AND MEMORY ACCESSES STYMIE COMPILER ANALYSIS, HINDER PARALLELIZATION, MAKE POOR USE OF HARDWARE, AND INTRODUCE NUMEROUS SIDE CHANNELS THAT THWART SECURITY. FINALLY, THEIR DATA-INTENSIVE NATURE IS A POOR MATCH TO THE PROCESSORS AND ACCELERATORS PERVASIVE IN CURRENT CLUSTERS AND DATACENTERS, WHICH OPTIMIZE FOR COMPUTE OPERATIONS RATHER THAN TO MINIMIZE DATA MOVEMENT. TO TACKLE THESE CHALLENGES, THIS PROJECT WILL DEVELOP A FULL SYSTEM STACK SPANNING DOMAIN-SPECIFIC LANGUAGES, A TIGHTLY INTEGRATED COMPILER AND SCHEDULER, AND SPECIALIZED HARDWARE ARCHITECTURES AND HIGH-PERFORMANCE, MULTI-NODE COMPUTER SYSTEMS AND NETWORKS. THIS STACK IS BUILT AROUND A UNIFYING ABSTRACTION, A NOVEL SPARSE INTERMEDIATE REPRESENTATION THAT (1) ENCODES SEMANTIC INFORMATION ON KEY SPARSE DATA STRUCTURES AND THEIR ITERATIONS, (2) ENABLES OPTIMIZING COMPILER TRANSFORMATIONS AND DYNAMIC SCHEDULING DECISIONS, AND (3) CAN BE EASILY COMPILED TO PARALLEL ARCHITECTURES, INCLUDING GRAPHICS PROCESSING UNITS (GPUS), GENERAL-PURPOSE PROCESSORS, OUR PROPOSED SPECIALIZED ARCHITECTURE, AND THEIR COMBINATION. THE FULL STACK WILL BE DESIGNED WITH SECURITY AT THE FOREFRONT, LEVERAGING NOVEL CROSS-LAYER TECHNIQUES TO ACHIEVE SECURE HIGH PERFORMANCE. THIS SYSTEM WILL BE RIGOROUSLY EVALUATED USING A BROAD SET OF SPARSE APPLICATIONS AND AT A WIDE RANGE OF SYSTEM SCALES, INCLUDING LARGE-SCALE CLUSTERS WITH HUNDREDS OF GPUS OR TENS OF SPECIALIZED PROCESSORS. BY INNOVATING ACROSS THE FULL SOFTWARE AND HARDWARE STACK, THESE TECHNIQUES WILL ACHIEVE PERFORMANCE, SCALABILITY, AND EFFICIENCY GAINS THAT SINGLE-LAYER APPROACHES CANNOT PROVIDE. THIS AWARD REFLECTS NSF'S STATUTORY MISSION AND HAS BEEN DEEMED WORTHY OF SUPPORT THROUGH EVALUATION USING THE FOUNDATION'S INTELLECTUAL MERIT AND BROADER IMPACTS REVIEW CRITERIA.
$549.8k 7/14/22