self configuration and self optimization algorithmic
play

Self-Configuration and Self-Optimization Algorithmic Skeletons using - PowerPoint PPT Presentation

Self-Configuration and Self-Optimization Algorithmic Skeletons using Events Gustavo Pabn Ludovic Henrio NIC Chile Research Labs INRIA Sophia Antipolis Part of the SCADA Associate Team: OASIS / NIC Labs Taken from


  1. Self-Configuration and Self-Optimization Algorithmic Skeletons using Events Gustavo Pabón Ludovic Henrio NIC Chile Research Labs INRIA Sophia Antipolis Part of the SCADA Associate Team: OASIS / NIC Labs

  2. Taken from http://www.extremetech.com/extreme/146967-stanford-breaks-million-core-supercomputing-barrier2 PMAM 2014. Self-Configuration and Self-Optimization Autonomic Skeletons using Events Slide 2/22

  3. Taken from http://www.extremetech.com/extreme/146967-stanford-breaks-million-core-supercomputing-barrier2 Large-scale parallel and distributed environments allow the resolution of large-scale problems. PMAM 2014. Self-Configuration and Self-Optimization Autonomic Skeletons using Events Slide 2/22

  4. Taken from http://www.extremetech.com/extreme/146967-stanford-breaks-million-core-supercomputing-barrier2 Large-scale parallel and distributed environments allow the resolution of large-scale problems. IBM’s Blue Gene/Q Sequoia at the Lawrence Livermore National Lab, first million core supercomputer. Jan/2013 PMAM 2014. Self-Configuration and Self-Optimization Autonomic Skeletons using Events Slide 2/22

  5. Taken from http://www.extremetech.com/extreme/146967-stanford-breaks-million-core-supercomputing-barrier2 Large-scale parallel and distributed environments allow the resolution of large-scale problems. However, parallel software development is hard PMAM 2014. Self-Configuration and Self-Optimization Autonomic Skeletons using Events Slide 2/22

  6. Taken from http://www.extremetech.com/extreme/146967-stanford-breaks-million-core-supercomputing-barrier2 Large-scale parallel and distributed environments allow the resolution of large-scale problems. However, parallel software development is hard and currently, we are facing an increasing challenge due to the increasing number of cores available. Indeed many-core supercomputers are almost impossible to program efficiently, PMAM 2014. Self-Configuration and Self-Optimization Autonomic Skeletons using Events Slide 2/22

  7. Taken from http://www.extremetech.com/extreme/146967-stanford-breaks-million-core-supercomputing-barrier2 COLE '89 PMAM 2014. Self-Configuration and Self-Optimization Autonomic Skeletons using Events Slide 3/22

  8. Taken from http://www.extremetech.com/extreme/146967-stanford-breaks-million-core-supercomputing-barrier2 COLE '89 Map Reduce Master - Slave Divide & Conquer PMAM 2014. Self-Configuration and Self-Optimization Autonomic Skeletons using Events Slide 3/22

  9. Taken from http://www.extremetech.com/extreme/146967-stanford-breaks-million-core-supercomputing-barrier2 Large-scale parallel and distributed environments allow the resolution of large-scale problems. However, parallel software development is hard and currently, we are facing an increasing challenge due to the increasing number of cores available. Indeed many-core supercomputers are almost impossible to program efficiently, and those architectures are even more difficult to maintain. According to gartner '12, IT operations management costs are the 36% of the total operation IT budget. PMAM 2014. Self-Configuration and Self-Optimization Autonomic Skeletons using Events Slide 4/22

  10. Taken from http://www.extremetech.com/extreme/146967-stanford-breaks-million-core-supercomputing-barrier2 IBM 2001 PMAM 2014. Self-Configuration and Self-Optimization Autonomic Skeletons using Events Slide 5/22

  11. Self-Configuration and Self-Optimization Algorithmic Skeletons using Events PMAM 2014. Self-Configuration and Self-Optimization Autonomic Skeletons using Events Slide 6/22

  12. Self-Configuration and Self-Optimization Algorithmic Skeletons using Events PROBLEM PMAM 2014. Self-Configuration and Self-Optimization Autonomic Skeletons using Events Slide 7/22

  13. Self-Configuration and Self-Optimization Algorithmic Skeletons using Events PROBLEM PMAM 2014. Self-Configuration and Self-Optimization Autonomic Skeletons using Events Slide 7/22

  14. Self-Configuration and Self-Optimization Algorithmic Skeletons using Events PROBLEM PMAM 2014. Self-Configuration and Self-Optimization Autonomic Skeletons using Events Slide 7/22

  15. Self-Configuration and Self-Optimization Algorithmic Skeletons using Events PROBLEM PMAM 2014. Self-Configuration and Self-Optimization Autonomic Skeletons using Events Slide 7/22

  16. Self-Configuration and Self-Optimization Algorithmic Skeletons using Events Goals: ● Monitoring the Skeleton's execution. ● Creating a clear separation of concerns (SoC) Challenge: Inversion of Control. PMAM 2014. Self-Configuration and Self-Optimization Autonomic Skeletons using Events Slide 8/22

  17. Self-Configuration and Self-Optimization Algorithmic Skeletons using Events Map Before Merge class MyListener implements ... { public P handler(P param, Skeleton[] strace) { ... return param; } } myMap.addBeforeMergeListener(myListener); PMAM 2014. Self-Configuration and Self-Optimization Autonomic Skeletons using Events Slide 8/22

  18. Self-Configuration and Self-Optimization Algorithmic Skeletons using Events Let's say that QoS Wall Clock Time (WCT): 12 seg. WCT using 2 threads: 14 secs . PMAM 2014. Self-Configuration and Self-Optimization Autonomic Skeletons using Events Slide 9/22

  19. Self-Configuration and Self-Optimization Algorithmic Skeletons using Events Let's say that QoS Wall Clock Time (WCT): 12 seg. WCT using 2 threads: 14 secs . WCT using 4 threads: 10 secs . PMAM 2014. Self-Configuration and Self-Optimization Autonomic Skeletons using Events Slide 9/22

  20. Self-Configuration and Self-Optimization Algorithmic Skeletons using Events WCT using 2 threads: 14 secs . How to calculate them? WCT using 4 threads: 10 secs . PMAM 2014. Self-Configuration and Self-Optimization Autonomic Skeletons using Events Slide 10/22

  21. Self-Configuration and Self-Optimization Algorithmic Skeletons using Events Activity Dependency Graph WCT using 2 threads: 14 secs . WCT using 4 threads: 10 secs . fe fe fs fm fe fe PMAM 2014. Self-Configuration and Self-Optimization Autonomic Skeletons using Events Slide 10/22

  22. Self-Configuration and Self-Optimization Algorithmic Skeletons using Events Activity Dependency Graph WCT using 2 threads: 14 secs . Best Effort Estimation WCT using 4 threads: 10 secs . Let's assume that we know in advanced the following values: fe |fs| = 4 t(fs) = 3 fe t(fe) = 4 t(fm) = 3 fs fm fe fe PMAM 2014. Self-Configuration and Self-Optimization Autonomic Skeletons using Events Slide 11/22

  23. Self-Configuration and Self-Optimization Algorithmic Skeletons using Events Activity Dependency Graph WCT using 2 threads: 14 secs . Best Effort Estimation WCT using 4 threads: 10 secs . Let's assume that we know in advanced the following values: fe 3 7 |fs| = 4 t(fs) = 3 fe t(fe) = 4 3 7 t(fm) = 3 fs fm 10 0 3 7 fe 3 7 fe 3 7 PMAM 2014. Self-Configuration and Self-Optimization Autonomic Skeletons using Events Slide 11/22

  24. Self-Configuration and Self-Optimization Algorithmic Skeletons using Events Activity Dependency Graph WCT using 2 threads: 14 secs . Best Effort Estimation WCT using 4 threads: 10 secs . Let's assume that we know in advanced the following values: fe 3 7 |fs| = 4 t(fs) = 3 fe t(fe) = 4 3 7 t(fm) = 3 fs fm 10 0 3 7 Estimated Execution Time Line fe 3 7 [0,3) 1 [3,7) 4 fe 3 7 [7,10) 1 PMAM 2014. Self-Configuration and Self-Optimization Autonomic Skeletons using Events Slide 11/22

  25. Self-Configuration and Self-Optimization Algorithmic Skeletons using Events Activity Dependency Graph WCT using 2 threads: 14 secs . Fixed Level of Parallelism(2) WCT using 4 threads: 10 secs . Let's assume that we know in advanced the following values: fe |fs| = 4 t(fs) = 3 fe t(fe) = 4 t(fm) = 3 fs fm Estimated Execution Time Line fe fe PMAM 2014. Self-Configuration and Self-Optimization Autonomic Skeletons using Events Slide 12/22

  26. Self-Configuration and Self-Optimization Algorithmic Skeletons using Events Activity Dependency Graph WCT using 2 threads: 14 secs . Fixed Level of Parallelism(2) WCT using 4 threads: 10 secs . Let's assume that we know in advanced the following values: fe 3 7 |fs| = 4 t(fs) = 3 fe t(fe) = 4 3 7 t(fm) = 3 fs fm 0 3 11 14 Estimated Execution Time Line fe 7 11 [0,3) 1 [3,7) 2 fe 7 11 [7,11) 2 [11,14) 1 PMAM 2014. Self-Configuration and Self-Optimization Autonomic Skeletons using Events Slide 12/22

  27. Self-Configuration and Self-Optimization Algorithmic Skeletons using Events Estimating Future Work Let's assume that we know in advanced the following values: |fs| = 4 t(fs) = 3 t(fe) = 4 t(fm) = 3 How to estimate this values on the fly? PMAM 2014. Self-Configuration and Self-Optimization Autonomic Skeletons using Events Slide 13/22

  28. Self-Configuration and Self-Optimization Algorithmic Skeletons using Events Estimating Future Work Let's assume that we know in advanced the following values: |fs| = 4 t(fs) = 3 t(fe) = 4 t(fm) = 3 How to estimate this values on the fly? PMAM 2014. Self-Configuration and Self-Optimization Autonomic Skeletons using Events Slide 13/22

  29. Self-Configuration and Self-Optimization Algorithmic Skeletons using Events The executive summary of our proposal is to extend the Algorithmic Skeleton model by: 1. Introducing separation of concerns using events (monitoring) 2. Implementing autonomic concerns by using a. Activity dependency graphs b. Estimating future work based on: PMAM 2014. Self-Configuration and Self-Optimization Autonomic Skeletons using Events Slide 14/22

Recommend


More recommend