Project Grant 2505770

CAREER: ALGORITHM-HARDWARE CO-DESIGN OF EFFICIENT LARGE GRAPH MACHINE LEARNING FOR ELECTRONIC DESIGN AUTOMATION -ESTIMATING POWER, PERFORMANCE, AND AREA (PPA) EARLIER IN THE ELECTRONIC DESIGN AUTOMATION (EDA) FLOW WOULD IMPROVE THE QUALITY OF RESULTS (QOR) AND RELIABILITY IN CHIP DESIGN. THE CLASSICAL ANALYTICAL OR HEURISTIC METHODS CAN BE CHALLENGING TO FINE-TUNE, ESPECIALLY FOR COMPLEX PROBLEMS. MACHINE LEARNING (ML) METHODS HAVE PROVEN TO BE EFFECTIVE IN ADDRESSING THESE PROBLEMS. GRAPH NEURAL NETWORKS (GNNS) HAVE GAINED POPULARITY SINCE THEY ARE AMONG THE MOST NATURAL WAYS TO REPRESENT THE FUNDAMENTAL OBJECTS IN THE EDA FLOW. HOWEVER, WITH INCREASED DESIGN COMPLEXITY AND CHIP CAPACITY, AN INCREASING PERFORMANCE GAP EXISTS BETWEEN THE EXTREMELY LARGE GRAPHS IN EDA AND THE INSUFFICIENT SUPPORT FROM GENERAL-PURPOSE HARDWARE, SUCH AS MAINSTREAM GRAPHICS PROCESSING UNITS (GPUS). THIS PROJECT AIMS TO EXPEDITE THE LARGE GRAPH MACHINE LEARNING ON VARIOUS EDA TASKS, THROUGH A FULL-FLEDGED DEVELOPMENT OF EFFICIENT AND SCALABLE COMPUTING PARADIGMS. THIS PROJECT'S NOVELTIES ARE EDA DOMAIN KNOWLEDGE-AWARE GRAPH MACHINE LEARNING, TRAINING ACCELERATION, AND ALGORITHM-HARDWARE CO-DESIGN AND OPTIMIZATION. THE PROJECT'S BROADER SIGNIFICANCE AND IMPORTANCE INCLUDE: (1) TO ADVANCE THE FIELD OF MACHINE LEARNING IN CHIP DESIGN, HIGHLIGHTED IN NATIONAL ARTIFICIAL INTELLIGENCE INITIATIVE; (2) TO DEEPEN THE UNDERSTANDING OF INTERACTIONS AMONG EDA DOMAIN KNOWLEDGE, GRAPH LEARNING, AND GPU ACCELERATION; (3) TO ENRICH THE COMPUTER ENGINEERING CURRICULUM AND PROMOTE PARTICIPATION FROM UNDERGRADUATES, UNDERREPRESENTED GROUPS, AND K-12 STUDENTS IN STEM FIELDS THROUGH RELEVANT PROGRAMS. THE PROJECT WILL DEVELOP A DESIGN PARADIGM FOR EFFICIENT, SCALABLE AND PRACTICAL ALGORITHM-HARDWARE CO-OPTIMIZED SOLUTIONS TO SIGNIFICANTLY ACCELERATE LARGE GRAPH MACHINE LEARNING ON EDA TASKS USING A SINGLE GPU. THIS PROJECT CONSISTS OF THREE COHERENT RESEARCH THRUSTS: (1) TO DEVELOP AN ALGORITHM-HARDWARE CO-OPTIMIZED PARADIGM, FOCUSING ON RESTUDYING EDA GRAPH FEATURES, INTRODUCING PARTITIONING AND SELECTIVE RE-GROWTH METHODS, AND TAILORING GPU KERNELS FOR UNIFIED GRAPH MACHINE LEARNING ON EDA TASKS USING A SINGLE GPU; (2) TO SPEED UP SINGLE GPU FOR LARGE CIRCUIT GRAPH NEURAL NETWORK (GNN) TRAINING BY IMPLEMENTING A TILED REVERSIBLE ARCHITECTURE FOR LOW-MEMORY TRAINING, AND DESIGNING A MAXK NONLINEARITY FUNCTION TO REDUCE COMPUTATION COSTS; (3) TO JOINTLY INTEGRATE EDA DOMAIN KNOWLEDGE, GRAPH LEARNING, AND HARDWARE OPTIMIZATIONS TO CO-SEARCH FOR THE APPROPRIATE HARDWARE PRIMITIVES AND GNN COMPRESSION STRATEGIES, AS WELL AS CLOSELY LEVERAGE THE UNIQUE PROPERTIES OF CIRCUIT GRAPHS. 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.- SUBAWARDS ARE NOT PLANNED FOR THIS AWARD.