Project Grant 2403194

COLLABORATIVE RESEARCH: CIF: MEDIUM: TOWARDS OPTIMAL SCHEDULING FOR PARALLELIZABLE MACHINE LEARNING TRAINING WORKLOADS -IN THE PAST FIFTEEN YEARS, THERE HAS BEEN EXPLOSIVE GROWTH IN THE NUMBER OF APPLICATIONS SEEKING TO LEVERAGE MACHINE LEARNING (ML) MODELS. BEFORE AN ML MODEL CAN BE DEPLOYED, THE MODEL MUST BE ?TRAINED? BY REPEATEDLY PROCESSING EXAMPLES. EACH EXAMPLE HELPS THE MODEL TO MAKE PROGRESSIVELY MORE ACCURATE PREDICTIONS, LEARNING HOW TO SOLVE THE PROBLEM AT HAND. UNFORTUNATELY, THIS TRAINING STEP REQUIRES A LARGE AMOUNT OF EXPENSIVE, HIGHLY-SPECIALIZED HARDWARE AND CAN TAKE SEVERAL HOURS TO COMPLETE. GIVEN LIMITED HARDWARE RESOURCES, IT IS NOT OBVIOUS HOW TO ALLOCATE (SHARE) THESE RESOURCES ACROSS A STREAM OF ML TRAINING JOBS. THE GOAL OF THIS PROJECT IS TO DEVELOP NEW RESOURCE ALLOCATION POLICIES THAT ALLOW US TO PRODUCE HIGHLY-ACCURATE ML MODELS, QUICKLY, AND WITH LIMITED RESOURCES. THE MAIN CHALLENGE IN THIS WORK IS THAT ML TRAINING JOBS PRESENT A NUMBER OF UNIQUE CHARACTERISTICS COMPARED TO OTHER COMPUTING WORKLOADS. ML TRAINING JOBS ARE HIGHLY PARALLELIZABLE, MEANING A SINGLE TRAINING JOB MIGHT RUN ACROSS MULTIPLE SERVERS. EACH JOB ALSO HAS A LARGE NUMBER OF CONFIGURATION OPTIONS THAT AFFECT HOW FAST THE MODEL LEARNS A PARTICULAR PROBLEM. THIS PROJECT USES MATHEMATICAL MODELING TO DEVELOP NEW ALLOCATION POLICIES SPECIFICALLY DESIGNED FOR ML TRAINING JOBS. THIS RESEARCH WILL BE ACCOMPANIED BY THE DEVELOPMENT OF NEW COURSES AND MENTORSHIP PROGRAMS DESIGNED TO RECRUIT STUDENTS FROM UNDERREPRESENTED BACKGROUNDS INTO RESEARCH ON THE MODELING OF COMPUTER SYSTEMS. MACHINE LEARNING (ML) MODELS ARE INCREASINGLY BEING DEPLOYED ACROSS A WIDE VARIETY OF APPLICATIONS. THE GROWTH IN ML MODELS HAS BEEN ACCOMPANIED BY THE DEVELOPMENT OF SPECIALIZED HARDWARE ACCELERATORS THAT HELP REDUCE THE TRAINING TIME FOR ML MODELS. HOWEVER, THERE HAS NOT BEEN A SIMILAR DEGREE OF SPECIALIZATION IN THE SCHEDULING ALGORITHMS USED TO TRAIN ML MODELS ON CLUSTERS OF SPECIALIZED HARDWARE. THE QUESTION OF HOW TO BEST SCHEDULE ML TRAINING JOBS IS NON-TRIVIAL. ML TRAINING JOBS PRESENT MANY UNIQUE CHARACTERISTICS COMPARED TO OTHER COMPUTING WORKLOADS. FIRST, ML TRAINING JOBS VARY IN THEIR DEGREE OF PARALLELIZABILITY (ABILITY TO SCALE OUT ACROSS SERVERS), WITH SOME JOBS BEING HIGHLY ELASTIC AND OTHERS BEING INELASTIC IN THEIR SCALABILITY. IT IS NOT CLEAR HOW TO ALLOCATE (SHARE) HARDWARE RESOURCES AMONG JOBS WITH SUCH DIFFERENT CHARACTERISTICS. TO MAKE THINGS MORE COMPLICATED, EACH TRAINING JOB IS PARAMETERIZED BY A SET OF TUNING PARAMETERS CALLED HYPERPARAMETERS. THE PARALLELIZABILITY OF AN ML TRAINING JOB VARIES OVER TIME AS THE JOB HYPERPARAMETERS CHANGE. HENCE, SYSTEMS WHICH EITHER RELY ON STATIC RESOURCE RESERVATIONS OR EXISTING HEURISTIC SCHEDULING POLICIES ARE POORLY SUITED FOR ML TRAINING JOBS. FINALLY, THE INHERENT WORK ASSOCIATED WITH AN ML JOB IS NOT A FIXED QUANTITY. INSTEAD, ML JOBS ARE GENERALLY TRAINED UNTIL THE MODEL MEETS A DESIRED LEVEL OF ACCURACY. HENCE, THE EXISTING SCHEDULING THEORY THAT FAVORS ?SHORT? JOBS DOES NOT APPLY IN THIS CASE. THIS PROPOSAL DEVELOPS A NEW THEORETIC FRAMEWORK FOR MODELING THE DYNAMICS OF ML JOBS RUNNING IN A SHARED CLUSTER. THIS FRAMEWORK WILL BE USED TO DEVELOP SCHEDULING AND ALLOCATION POLICIES THAT ARE SPECIALIZED TO ML TRAINING JOBS, AND TO PROVE PERFORMANCE GUARANTEES ON THESE POLICIES. 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.