PPT-Hierarchical Load Balancing for Charm++ Applications on Large Supercomputers

Gengbin Zheng Esteban Meneses Abhinav Bhatele and Laxmikant V Kale Parallel Programming Lab University of Illinois at Urbana Champaign Motivations Load balancing is key to scalability on very large supercomputers. charmonium. production. in p-A collisions at the CERN SPS. E. . Scomparin. (INFN – Torino, . Italy), NA60 . c. ollaboration. Introduction. . Charmonium. suppression in p-A . (and A-A) . collisions. as well as the server?. Nikhil Handigol. Stanford University. Joint work with Nick . McKeown. and . Ramesh. . Johari. Datacenter. Wide-area. Enterprise. Can’t choose path :’(. LOAD-BALANCER. Client. Sig Freund. Outline. Introduction. Distributed vs. Traditional . scheduling. Process Interaction models. Distributed . Systems. Research Studies. Guess about the Future?. Questions. Introduction. Load Sharing. (Performed By Elvis Presley). BEFORE LISTENING:. List on a piece of paper which good luck charms the song has.. GOOD LUCK CHARM. Don't . want a four leaf clover. Don't want an old horse shoe. Want your kiss 'cause I just can't miss. Tensor Contractions. David . Ozog. *, Jeff R. Hammond. †. , James . Dinan. †. , . Pavan. . Balaji. †. , Sameer . Shende. *, Allen . Malony. * . *University of Oregon . †. Argonne National Laboratory. Tugba . Koc Emrah Cem Oznur Ozkasap. Department of . Computer . Engineering, . Koç . University. , Rumeli . Feneri Yolu, Sariyer, Istanbul . 34450 Turkey. Introduction. Epidemic (gossip-based) principles: highly popular in large scale distributed systems. Angen Zheng. Static. Load . Balancing. Distribute the load evenly across processing unit.. Is this good enough? . It depends!. No data dependency!. Load distribution remain unchanged!. Initial Balanced Load Distribution. . . SUPERCOMPUTERS. Submitted to: Sir. Saleem Afzal . Dhilon. Submitted by: Ms. Zunaira Shafqat. Under title course CS- 161 on December 2, 2013 at UOG. In basic terms, Computer is an . charmonium. production:. results from the NA60 experiment. E. . Scomparin. (INFN – Torino, Italy), NA60 . c. ollaboration. Introduction, experimental set-up. . Charmonium. suppression in p-A and In-In . Kamouraska. . Rockstar. x Stamford First Quality. 100% Ayrshire. SIRE: . Kamouraska. . Rockstar. DAM: Stamford Charm 62 EX92. . .  . G DAM: Stamford Charm 57 VG89. GG Dam: Stamford Charm 48 EX93. Oliver van . Kaick. 1,4 . . Kai . Xu. 2. . Hao. Zhang. 1. . Yanzhen. Wang. 2. . Shuyang. Sun. 1. Ariel Shamir. 3. Daniel Cohen-Or. 4. 4. Tel Aviv University. 1. Simon . Fraser University. Nitin Bhat. Master’s Student. Parallel Programming Lab. UIUC. 1. Nitin Bhat, Vipul Harsh. Motivation. Major bottleneck in HPC Applications – Communication . Strategies to address communication bottlenecks. as well as the server?. Nikhil Handigol. Stanford University. Joint work with Nick . McKeown. and . Ramesh. . Johari. Datacenter. Wide-area. Enterprise. Can’t choose path :’(. LOAD-BALANCER. Client. Sig Freund. Outline. Introduction. Distributed vs. Traditional . scheduling. Process Interaction models. Distributed . Systems. Research Studies. Guess about the Future?. Questions. Introduction. Load Sharing.