Downloaded 10 times
![MareIncognito: Project structure 4 relevant apps: Materials: SIESTA Geophisics imaging: RTM Comp. Mechanics: ALYA Plasma: EUTERPE General kernels Automatic analysis Coarse/fine grain prediction Sampling Clustering Integration with Peekperf Contention, Collectives Overlap computation/communication Slimmed Networks Direct versus indirect networks Contribution to new Cell design Support for programming model Support for load balancing Support for performance tools Issues for future processors Coordinated scheduling: Run time, Process, Job Power efficiency StarSs: CellSs, SMPSs [email_address] OpenMP++ MPI + OpenMP/StarSs Performance analysis tools Processor and node Load balancing Interconnect Applications Programming models Models and prototype](https://image.slidesharecdn.com/valladolid-final-septiembre-2010-101004030145-phpapp01/85/Valladolid-final-septiembre-2010-29-320.jpg)
![High Performance Computing as key-enabler 1980 1990 2000 2010 2020 2030 Capacity: # of Overnight Loads cases run Available Computational Capacity [Flop/s] CFD-based LOADS & HQ Aero Optimisation & CFD-CSM Full MDO Real time CFD based in flight simulation x10 6 1 Zeta (10 21 ) 1 Peta (10 15 ) 1 Tera (10 12 ) 1 Giga (10 9 ) 1 Exa (10 18 ) 10 2 10 3 10 4 10 5 10 6 LES CFD-based noise simulation RANS Low Speed RANS High Speed HS Design Data Set UnsteadyRANS “ Smart” use of HPC power: Algorithms Data mining knowledge Capability achieved during one night batch Courtesy AIRBUS France](https://image.slidesharecdn.com/valladolid-final-septiembre-2010-101004030145-phpapp01/85/Valladolid-final-septiembre-2010-31-320.jpg)
Uploaded byTELECOM I+D
Valladolid final-septiembre-2010
The document discusses the evolution of computer architectures from early technological achievements like the transistor and integrated circuit. It describes increasing transistor densities following Moore's Law. Future technologies will focus on increasing core counts while decreasing cycle times and voltages. Performance will come from parallelism rather than clock speed increases due to heat limitations. The document outlines challenges in scaling to exascale systems by 2018.
More Related Content
Similar to Valladolid final-septiembre-2010
Valladolid final-septiembre-2010
- 1. “ Evolución dela Arquitectura de Computadores ” Valladolid, Septiembre 2010 Prof. Mateo Valero Director
- 2. Technological Achievements Transistor(Bell Labs, 1947) DEC PDP-1 (1957) IBM 7090 (1960) Integrated circuit (1958) IBM System 360 (1965) DEC PDP-8 (1965) Microprocessor (1971) Intel 4004
- 3. Pipeline (H.Ford)
- 4.
- 5.
- 6.
- 7. Power Density 110 100 1000 i386 i486 Pentium® Pentium® Pro Pentium® II Pentium® III Hot plate Nuclear Reactor Sun's Surface Rocket Nozzle * “New Microarchitecture Challenges in the Coming Generations of CMOS Process Technologies” – Fred Pollack, Intel Corp. Micro32 conference keynote - 1999. Pentium® 4 Watts/cm 2
- 8.
- 9. Technology Outlook ShekharBorkar, Micro37, P Medium High Very High Variability Energy scaling will slow down >0.5 >0.5 >0.35 Energy/Logic Op scaling 0.5 to 1 layer per generation 8-9 7-8 6-7 Metal Layers 1 1 1 1 1 1 1 1 RC Delay Reduce slowly towards 2-2.5 <3 ~3 ILD (K) Low Probability High Probability Alternate, 3G etc 128 11 2016 High Probability Low Probability Bulk Planar CMOS Delay scaling will slow down >0.7 ~0.7 0.7 Delay = CV/I scaling 256 64 32 16 8 4 2 Integration Capacity (BT) 8 16 22 32 45 65 90 Technology Node (nm) 2018 2014 2012 2010 2008 2006 2004 High Volume Manufacturing
- 10. We have seenincreasing number of gates on a chip and increasing clock speed. Heat becoming an unmanageable problem, Intel Processors > 100 Watts We will not see the dramatic increases in clock speeds in the future. However, the number of gates on a chip will continue to increase. Increasing the number of gates into a tight knot and decreasing the cycle time of the processor Lower Voltage Increase Clock Rate & Transistor Density Core Cache Core Cache Core C1 C2 C3 C4 Cache C1 C2 C3 C4 Cache C1 C2 C3 C4 C1 C2 C3 C4 C1 C2 C3 C4 C1 C2 C3 C4
- 11. Increasing chip performance: Intel´s Petaflop chip 80 processors in a die of 300 square mm. Terabytes per second of memory bandwidth Note: The barrier of the Teraflops was obtained by Intel in 1991 using 10.000 Pentium Pro processors contained in more than 85 cabinets occupying 200 square meters This will be possible in 3 years from now ICPP-2009, September 23rd 2009 Thanks to Intel
- 12. NVIDIA Fermi ArchitectureUnified 768KB L2 cache serves all threads GigaThread hardware scheduler assigns Thread Blocks to SMs Wide DRAM interface provides 12 GB/s bandwidth 16 Streaming- Multiprocessors (512 cores) execute Thread Blocks 620 Gigaflops
- 13. Cell Broadband Engine TM : A Heterogeneous Multi-core Architecture * Cell Broadband Engine is a trademark of Sony Computer Entertainment, Inc.
- 14. Intel/UPC Since 2002(Roger Espasa, Toni Juan) 40 People Microprocessor Development (Larrabee x86 many core)
- 15.
- 16. Looking at theGordon Bell Prize 1 GFlop/s; 1988; Cray Y-MP; 8 Processors Static finite element analysis 1 TFlop/s; 1998; Cray T3E; 1024 Processors Modeling of metallic magnet atoms, using a variation of the locally self-consistent multiple scattering method. 1 PFlop/s; 2008; Cray XT5; 1.5x10 5 Processors Superconductive materials 1 EFlop/s; ~2018; ?; 1x10 7 Processors (10 9 threads) Jack Dongarra
- 17. BSC-CNS e iniciativasa nivel internacional: IESP Build an international plan for developing the next generation open source software for scientific high-performance computing Improve the world’s simulation and modeling capability by improving the coordination and development of the HPC software environment
- 18. 1 EFlop/s “CleanSheet of Paper” Strawman 4 FPUs+RegFiles/Core (=6 GF @1.5GHz) 1 Chip = 742 Cores (=4.5TF/s) 213MB of L1I&D; 93MB of L2 1 Node = 1 Proc Chip + 16 DRAMs (16GB) 1 Group = 12 Nodes + 12 Routers (=54TF/s) 1 Rack = 32 Groups (=1.7 PF/s) 384 nodes / rack 3.6EB of Disk Storage included 1 System = 583 Racks (=1 EF/s) 166 MILLION cores 680 MILLION FPUs 3.6PB = 0.0036 bytes/flops 68 MW w’aggressive assumptions Sizing done by “balancing” power budgets with achievable capabilities Largely due to Bill Dally Courtesy of Peter Kogge, UND
- 19. Education for ParallelProgramming Multicore-based pacifier I multi-core programming I many-core programming We all massive parallel prog. I games
- 20. Navigating the MareNostrum
- 21. Initial developments Mechanicalmachines 1854: Boolean algebra by G. Boole 1904: Diode vacuum tube by J.A. Fleming 1938: Boolean Algebra & Electronics Switches, C. Shannon 1946: ENIAC by J.P. Eckert and J. Mauchly 1945: Stored program by J.V. Neuma nn ?????? 1947 : First transistor (Bell Labs) 1949: EDSAC by M. Wilkes 1952: UNIVAC I and IBM 701
- 22. In 50 Years... Eniac , Eckert&Mauchly1946 ... 18000 vacuum tubes Pentium III playing DVD, 1998 ... 24 M transistors
- 23. Technology Trends: Microprocessor Capacity 2X transistors/Chip Every 1.5 years Called “ Moore’s Law ” Moore’s Law Microprocessors have become smaller, denser, and more powerful. Not just processors, bandwidth, storage, etc Gordon Moore (co-founder of Intel) predicted in 1965 that the transistor density of semiconductor chips would double roughly every 18 months.
- 24.
- 25. Computer Architecture Achievements1951 : Microprogramming (M. Wilkes) 1962 : Virtual Memory (Atlas, Manchester) 1964 : Pipeline (CDC 6600, S. Cray, 10 Mflop/s) 1965 : Cache memory (M. Wilkes) 1975 : Vector processors (S. Cray) 1980 : RISC architecture (IBM, Berkeley, Stanford) 1982 : Multiprocessors with distributed memory 1990 : Superscalar processors : PA-Risc (HP) and RS-6000 (IBM) 1991 : Multiprocessors with distributed shared memory 1994 : SMT (M. Nemirowski, D. Tullsen, S. Eggers) 1994 : Speculative Multiprocessors ( G. Sohi, Winsconsin) 1996 : Value Prediction (J.P.Shen and M.Lipasti, CMU) 2000: Multicore/Manycore Architectures
- 26.
- 27. Virtual Worlds havehuge potential beyond Games Commerce & Advertising Corporate Education First Responders Government Health Military Science Community Facilitation Social Change
- 28. Cray XT5-HE systemOver 37,500 quad-core AMD Opteron processors running at 2.6 GHz, 224,162 cores. Power: 6.95 Mwatts 300 terabytes of memory 10 petabytes of disk space. 240 gigabytes per second disk bandwidth Cray's SeaStar2+ interconnect network. Jaguar @ ORNL: 1.75 PF/s Jack Dongarra
- 29. MareIncognito: Project structure4 relevant apps: Materials: SIESTA Geophisics imaging: RTM Comp. Mechanics: ALYA Plasma: EUTERPE General kernels Automatic analysis Coarse/fine grain prediction Sampling Clustering Integration with Peekperf Contention, Collectives Overlap computation/communication Slimmed Networks Direct versus indirect networks Contribution to new Cell design Support for programming model Support for load balancing Support for performance tools Issues for future processors Coordinated scheduling: Run time, Process, Job Power efficiency StarSs: CellSs, SMPSs [email_address] OpenMP++ MPI + OpenMP/StarSs Performance analysis tools Processor and node Load balancing Interconnect Applications Programming models Models and prototype
- 30. Supercomputación y eCiencia22 grupos de élite M ás de 120 investigadores seniors Más de 300 estudiantes de doctorado BSC-CNS: vertebrador de la investigación en supercomputación en España Application scope “Earth Sciences” Application scope “Astrophysics” Application scope “Engineering” Application scope “Physics” Application scope “Life Sciences” Compilers and tuning of application kernels Programming models and performance tuning tools Architectures and hardware technologies
- 31. High Performance Computingas key-enabler 1980 1990 2000 2010 2020 2030 Capacity: # of Overnight Loads cases run Available Computational Capacity [Flop/s] CFD-based LOADS & HQ Aero Optimisation & CFD-CSM Full MDO Real time CFD based in flight simulation x10 6 1 Zeta (10 21 ) 1 Peta (10 15 ) 1 Tera (10 12 ) 1 Giga (10 9 ) 1 Exa (10 18 ) 10 2 10 3 10 4 10 5 10 6 LES CFD-based noise simulation RANS Low Speed RANS High Speed HS Design Data Set UnsteadyRANS “ Smart” use of HPC power: Algorithms Data mining knowledge Capability achieved during one night batch Courtesy AIRBUS France
- 32. Diseño del ITERTOKAMAK (JET, Oxford)
- 33. Supercomputación, teoría yexperimentación Cortesia de IBM
- 34. Weather, Climate andEarth Sciences: Roadmap 2009 Resolution : 80 Km Memory: ≈110 GB Storage: ≈ 8 TB NEC-SX9 48 vector procs: ≈ 40 days run 2015 Resolution : 20 Km MemSory: ≈ 3,5 TB Storage: ≈ 180 TB High resolution model with complete carbon cycle model Challenges: data viz and post-processing, data discovery, archiving 2020 Resolution : 1 Km Memory: ≈ 4 PB Storage: ≈ 150 PB Higher resolution with global cloud resolving model Challenges: data sharing, transfer memory management, I/O management
- 35. Education for ParallelProgramming Multicore-based pacifier I multi-core programming I many-core programming We all massive parallel prog. I games
- 36. Navigating the MareNostrum
Editor's Notes
- #11 Access latency for main memory, even using a modern SDRAM with a CAS latency of 2, will typically be around 9 cycles of the **memory system clock** -- the sum of The latency between the FSB and the chipset (Northbridge) (+/- 1 clockcycle) The latency between the chipset and the DRAM (+/- 1 clockcycle) The RAS to CAS latency (2-3 clocks, charging the right row) The CAS latency (2-3 clocks, getting the right column) 1 cycle to transfer the data. The latency to get this data back from the DRAM output buffer to the CPU (via the chipset) (+/- 2 clockcycles) Assuming a typical 133 MHz SDRAM memory system (eg: either PC133 or DDR266/PC2100), and assuming a 1.3 GHz processor, this makes 9*10 = 90 cycles of the CPU clock to access main memory! Yikes, you say! And it gets worse – a 1.6 GHz processor would take it to 108 cycles, a 2.0 GHz processor to 135 cycles, and even if the memory system was increased to 166 MHz (and still stayed CL2), a 3.0 GHz processor would wait a staggering 162 cycles! Caches make the memory system seem almost as fast as the L1 cache, yet as large as main memory. A modern primary (L1) cache has a latency of just two or three **processor cycles**, which is dozens of times faster than accessing main memory, and modern primary caches achieve hit rates of around 90% for most applications. So 90% of the time, accessing memory only takes a couple of cycles. Good overview http://www.pattosoft.com.au/Articles/ModernMicroprocessors/
- #28 It is the conclusion of this TTA that, in the very near future (in fact some early examples are clearly in evidence right now), virtual worlds will extend their reach well beyond their current subject matter of on-line fantasy gaming to incorporate all manner of business and commerce. This evolution will quickly encompass many industries and business processes where IBM has traditionally had a significant business interests. In the education industry, it is not at all a stretch to imagine a university physics professor convening a kinematics lecture in a virtual world in which the professor could alter the force of gravity and move large, virtual objects to demonstrate environments on other planets. Closer to our industry, an IBM Industry Solution sales specialist could arrange to meet a client in a virtual world populated by highly realistic (virtual) world venues containing software solutions created by IBM and select business partners. In these virtual sales worlds, clients would interact with the solutions in the same manner as real world users, exploiting all the solution's functional capacities. For example, a virtual mobile work force solution could be demonstrated from multiple perspectives in the context of real business scenarios - the control center, the mobile vehicle etc. The solution demonstration would totally immerse the client in the solution experience there by creating an unparalleled selling tool. The possibilities are limitless. From top left, clockwise: (1) Worlds of Warcraft: A Tavern. This is just a symbolic representation of commerce & advertising within games. Many people run their own businesses within virtual worlds, trading both virtual and real items for virtual and real currencies. Microsoft’s acquisition of Massive Inc. has also now secured them a huge advertising ecosystem of game development companies, advertising agencies and leading brands, using online video games as another advertising channel for directed and personalized ads and product placement deals. The tavern represents the real-world metaphors that build community within virtual worlds, much like the 18 th century coffee houses lead to the formation of stock exchanges. Incidentally, there is a game advertising summit in San Francisco, June 9 th 2006. (2) Hazmat Hot zone: project based at the Entertainment Technology Center at Carnegie Melon University, is one of the earliest serious game projects and now has several scenarios up-and-running using Unreal-Tournament based graphics and game play. Intended users: fire-department personnel who handle HazMat response. HazMat uses multiplayer gaming technology and augmented communication practices to assist with team-based training vital to HazMat and other disaster response practices. (3) Virtual Iraq: Not only are the army using virtual world simulations for the training of troops and engagement planning, but also for the treatment of Post Traumatic Stress Disorder (PTSD) through the ability to “relive” traumatic events through simulation. ( http://www.washingtonpost.com/ac2/wp-dyn/A58360-2005Mar22?language=printer) (4) Simulation of forest fire disasters and how to combat them. (5) Virtual Acropolis: This is an example of using virtual environments as an educational and research tool for the humanities, in this case ancient history. The use of highly detailed models, created collaboratively by historians and researchers, to model world heritage sites for a variety of uses, including tourism, education, simulation of “what-if” scenarios, etc. imagine teaching history of a famous era or battle by immersing the student in a highly realistic, immersive simulation complete with architecture, artifacts and even populace of the period. These may also help the study of social history and sociological development and evolution via large scale community participation. (6) Food Force: From the United Nations World Food Program (WFP), Food Force is an educational video game telling the story of a hunger crisis on the fictitious island of Sheylan. Comprised of 6 mini-games or “missions”, the game takes young players from an initial crisis assessment through to delivery and distribution of food aid, with each sequential mission addressing a particular aspect of this challenging process. (http://www.food-force.com/) (7) Yourself Fitness: Yourself!Fitness is a complete fitness program on a disc - exercise, diet, motivation, and fitness tracking are all included. Your host is Maya, a dynamically generated digital personality who guides you through all aspects of the application. You need nothing more than an Xbox and a television set to partake. ( http://www.yourselffitness.com/) (8) Pulse!! The virtual clinical learning lab and simulation, for training of first responders in treatments and medical and nursing students. ( http://www.businessweek.com/innovate/content/apr2006/id20060410_051875.htm?chan=innovation_game+room_features). (10) Another picture of Worlds of Warcraft: This is just to illustrate the breadth, diversity and scale of virtual environments. It is easy to take for granted that the fact that this huge architectural vista and the tavern above are all parts of a single virtual world that is WoW, is a challenge to the rendering engine, to deal with a broad spectrum of conditions. Why is this important? It means that the same middleware engine can be used to a broad variety of simulation environments and applications these days, rather than purpose built or specialized simulations for specific scenarios, and are configurable through XML & scripting mechanisms. (centre) Google Earth: Now being offered as Enterprise Services for a variety of applications including real-estate, architecture & engineering, insurance, media. Google’s provision of 3D modelling tools and open repository for free is a significant step in them making Google Earth a platform for application development using it as a visualization engine and MySpace of the future. NEED FOR STANDARDS: Multiple Virtual Worlds Interconnected & Interdependent Independently operated Open standard interfaces, to allow: Avatar portability Property portability Security Metering, Billing, Separations, Settlements Distributed problem determination Distributed systems management
- #34 (Please note - this slide includes 2 animation steps) An exciting question to ask, is where is this research heading? In this slide you can see what is probably a familiar chart depicting the progress that has been made in supercomputing since the early 90s. (At each time point, the green line shows the 500th fast supercomputer, the dark blue line the fastest supercomputer, and the light blue line the summed power of the top 500 machines). These lines show a nice trend, which we’ve extrapolated out 10 years. [ANIMATE SLIDE] The IBM team’s latest simulation results fall here on the graph. These latest results represent a model about 4 and a half percent of the scale of the cerebral cortex, which was run at 1/83 of real time. The machine used provided 144 TB of memory and 0.5 PFLop/s. [ANIMATE SLIDE] Turning to the future, you can see that running human scale cortical simulations will require 4 PB of memory and to run these simulations in real time will require over 1 EFLop/s. If the current trends in supercomputing continue, however, the IBM team believes they will have the ability to perform such simulations in the not too distant future.