DOCSLIB.ORG

Performance Evaluation of Interconnection Networks Using Simulation: Tools and Case Studies

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Performance Evaluation of Interconnection Networks Using Simulation: Tools and Case Studies Department of Computer Architecture and Technology Performance Evaluation of Interconnection Networks using Simulation: Tools and Case Studies PhD Dissertation Javier Navaridas Palma Advisor : Prof. José Miguel-Alonso September, 2009 To the memory of my beloved Mother To my girlfriend for her patience and support To family and friends Acknowledgements There are so many people that helped and supported the author that an acknowledgements list citing them one by one would be almost infinite. Consequently, I will try to make this list as brief as possible: To all the members of my research group, particularly to my advisor Prof. José Miguel-Alonso for his guidance. To all the colleagues from several different institutions that helped developing collaborative works: The University of Cantabria, The University of Burgos, The Technical University of Catalonia, The University of Adelaide, The University of Manchester and Zurich IBM Research Lab. Author is especially grateful to the people from the University of Manchester and to the people from Zurich IBM Research Lab for giving me the invaluable experience of working in international environments, as well as for the received human support. Most of the research work carried out for this dissertation was supported by the Spanish Ministry of Education and Science, grants TIN2004-07440-C02-02 and TIN2007-68023-C02-02, and by the Basque Government grant IT- 242-07. The author was supported by a doctoral grant of the University of the Basque Country UPV/EHU. - 5 - - 6 - Abstract This dissertation focuses on the performance evaluation of interconnection networks. It briefly introduces supercomputing and shows three different classifications of computing systems, which are used to locate the performed researching work. Moreover, the most common methodologies for the performance evaluation of such systems are discussed showing their advantages and limitations. This dissertation thoroughly describes the simulation environment developed within the author’s research group and all the related tools. Remarkable contributions to this environment are the trace-driven engine and the application-kernels that allow the evaluation of interconnection networks using realistic loads. This environment is used to perform several researches in the area of interconnection networks that are shown in the form of four case studies. The first one is the evaluation of the twisted torus topology, a variation of the standard torus which offers better topological properties. In this study we show a pitfall of the derivation of the theoretical throughput from the bisection bandwidth. Furthermore, the two topologies are confronted in order to assess if the better topological characteristics of the twisted torus lead to better-performing execution of applications. The second case study evaluates the thin-tree topology, an alternative to the over-dimensioned k-ary n-tree topology which is shown to be more cost-effective. The third case study evaluates the interconnection network of SpiNNaker, a large- scale system-on-chip-based architecture with severe restrictions in terms of power consumption and chip area; this evaluation is specifically devised to evaluate a bespoke router mechanism focusing on the stability and the fault- tolerance of the system. The last case study measures the influence that job and task allocation policies have on the execution time of parallel applications. It is showed to be significant and dependent on the size of the system and the number of concurrent applications. The conclusion of this study is that allocating applications into isolated subnetworks leads to faster execution of applications. These evaluations have been carried out using mainly simulation, although some results have also been mathematically derived. - 7 - - 8 - Javier Navaridas Palma Table of Contents Table of Contents Acknowledgements...............................................................................................................................................................5 Abstract .................................................................................................................................................................................7 Table of Contents..................................................................................................................................................................9 List of Figures .....................................................................................................................................................................11 List of Tables.......................................................................................................................................................................13 Chapter 1. Introduction ....................................................................................................................................................15 1.1 Classification of Computer Systems ...................................................................................................................16 1.1.1 System Architecture .....................................................................................................................................................16 1.1.2 Objectives of the Computing System ...........................................................................................................................16 1.1.3 Interconnection Network ..............................................................................................................................................17 1.2 Position of this Research Work ...........................................................................................................................18 1.3 Structure of this Dissertation...............................................................................................................................18 Chapter 2. Evaluation Methodologies..............................................................................................................................21 2.1 Analysis...............................................................................................................................................................21 2.1.1 Topological Characteristics ..........................................................................................................................................21 2.1.2 Markov Chains .............................................................................................................................................................23 2.1.3 Queueing Theory..........................................................................................................................................................24 2.1.4 Petri Nets......................................................................................................................................................................25 2.1.5 Other Tools for Analytical Modeling ...........................................................................................................................27 2.2 Simulation ...........................................................................................................................................................27 2.2.1 Simulation Engine ........................................................................................................................................................27 2.2.2 Simulation Frameworks................................................................................................................................................28 2.2.3 Levels of Detail ............................................................................................................................................................29 2.2.4 Examples in the Literature............................................................................................................................................32 2.3 Empirical Evaluation...........................................................................................................................................33 2.3.1 Benchmarks..................................................................................................................................................................33 2.3.2 Examples in the Literature............................................................................................................................................35 2.4 Conclusions .........................................................................................................................................................36 Chapter 3. Simulation Environment................................................................................................................................37 3.1 FSIN ....................................................................................................................................................................37 3.1.1 Simulation Engines.......................................................................................................................................................37 3.1.2 Modeled Routers ..........................................................................................................................................................39 3.1.3 Topologies....................................................................................................................................................................44
Load more

Recommended publications
  • Soluciones Para Entornos HPC
    Soluciones para entornos HPC Dr. Abel Francisco Paz Gallardo. IT Manager / Project Leader @ CETA-Ciemat [email protected] V Jornadas de Supercomputación y Avances en Tecnología CETA-Ciemat/ Noviembre 2012 Soluciones para entornos HPC Abel Francisco Paz Gallardo EXTREMADURA RESEARCH CENTER FOR ADVANCED TECHNOLOGIES INDICE 1 HPC… ¿Qué? ¿Cómo? . 2 Computación. (GPGPU,. UMA/NUMA,. etc.) 3 Almacenamiento en HPC . 4 Gestión de recursos . Soluciones para entornos HPC CETA-Ciemat/ Noviembre 2012 Soluciones para entornos HPC Abel Francisco Paz Gallardo 2 EXTREMADURA RESEARCH CENTER FOR ADVANCED TECHNOLOGIES 1 HPC… ¿Qué? ¿Cómo? ¿Qué? o HPC – High Performance Computing (Computación de alto rendimiento) o Objetivo principal: Resolución de problemas complejos ¿Cómo? Tres pilares fundamentales: o Procesamiento = Cómputo o Almacenamiento o Gestión de recursos HPC = + + CETA-Ciemat/ Noviembre 2012 Soluciones para entornos HPC Abel Francisco Paz Gallardo EXTREMADURA RESEARCH CENTER FOR ADVANCED TECHNOLOGIES 2 Computación (GPGPU, NUMA, etc.) ¿Qué es una GPU? Primera búsqueda en 2006: - Gas Particulate Unit Unidad de partículas de gas ¿? GPU = Graphics Processing Unit (Unidad de procesamiento gráfico). CETA-Ciemat/ Noviembre 2012 Soluciones para entornos HPC Abel Francisco Paz Gallardo EXTREMADURA RESEARCH CENTER FOR ADVANCED TECHNOLOGIES 2 Computación (GPGPU, NUMA, etc.) La cuestión es… Si una GPU en un videojuego procesa miles de polígonos, texturas y sombras en tiempo real… ¿Por qué no utilizar esta tecnología para procesamiento de datos? CETA-Ciemat/
    [Show full text]
  • HP-CAST 20 Final Agenda V3.0 (Sessions and Chairs Are Subject to Change Without Notice)
    HP Consortium for Advanced Scientific and Technical Computing World-Wide User Group Meeting ISS Hyperscale and HPC Organization The Westin Hotel Leipzig HP-CAST 20 Final Agenda V3.0 (Sessions and chairs are subject to change without notice) Supported by: Thursday, June 13th – Registration & Get-Together 18:00 – 22:00 Registration 18:00 – 22:00 Welcome Reception for All Attendees – Sky Bar FALCO at the Westin Hotel Friday, June 14th – Conference Section 08:00 – 18:00 Registration Board Introduction and HP Executive Updates HP-Liaison Frank Baetke, HP 08:15 – 09:20 HP-CAST President Rudolf Lohner, KIT/SCC HP Executive Updates on HPC Trends Paul Santeler, HP Scott Misage, HP Invited Partner Keynotes and Updates 09:20 – 09:50 High-Performance Computing Trends in the Georg Scheuerer, ANSYS Europe Manufacturing Industry 09:50 – 10:00 Making HPC Simulation Access Easier Benoît Vautrin, OVH (Oxalya) France 10:00 – 10:30 Break Invited Customer Keynotes 10:30 – 11:00 IT Infrastructure for HPC and Challenges of HPC Wolfgang Burke, BMW Germany Collocation at BMW 11:00 – 11:20 Deployment of HP Clusters in Iceland Guõbrandur R. Sigurõsson, Opin Kerfi Iceland 11:20 – 11:30 Q&A Session Short Processor Technology Updates Roberto Dognini, AMD Karl Freund, Calxeda (ARM) 11:30 – 12:30 John Hengeveld, Intel Timothy Lanfear, NVIDIA Sanjay Bhal, TI (ARM/DSP) 12:30 – 13:30 Lunch Friday, June 14th – Conference Section Attention: ATTENDANCE RESTRICTIONS APPLY Platforms and Products – #1 In Detail Roadmaps & Updates for Ed Turkel, HP 13:30 – 14:00 - Next Generation
    [Show full text]
  • Application-Level Fault Tolerance and Resilience in HPC Applications
    Doctoral Thesis Application-level Fault Tolerance and Resilience in HPC Applications Nuria Losada 2018 Application-level Fault Tolerance and Resilience in HPC Applications Nuria Losada Doctoral Thesis July 2018 PhD Advisors: Mar´ıaJ. Mart´ın Patricia Gonz´alez PhD Program in Information Technology Research Dra. Mar´ıaJos´eMart´ınSantamar´ıa Dra. Patricia Gonz´alezG´omez Profesora Titular de Universidad Profesora Titular de Universidad Dpto. de Ingenier´ıade Computadores Dpto. de Ingenier´ıade Computadores Universidade da Coru~na Universidade da Coru~na CERTIFICAN Que la memoria titulada \Application-level Fault Tolerance and Resilience in HPC Applications" ha sido realizada por D~na.Nuria Losada L´opez-Valc´arcelbajo nuestra direcci´onen el Departamento de Ingenier´ıade Computadores de la Universidade da Coru~na,y concluye la Tesis Doctoral que presenta para optar al grado de Doctora en Ingenier´ıaInform´aticacon la Menci´onde Doctor Internacional. En A Coru~na,a 26 de Julio de 2018 Fdo.: Mar´ıaJos´eMart´ınSantamar´ıa Fdo.: Patricia Gonz´alezG´omez Directora de la Tesis Doctoral Directora de la Tesis Doctoral Fdo.: Nuria Losada L´opez-Valc´arcel Autora de la Tesis Doctoral A todos los que lo hab´eishecho posible. Acknowledgments I would especially like to thank my advisors, Mar´ıaand Patricia, for all their support, hard work, and all the opportunities they've handed me. I consider my- self very lucky to have worked with them during these years. I would also like to thank Gabriel and Basilio for their collaboration and valuable contributions to the development of this work. I would like to say thanks to all my past and present colleagues in the Computer Architecture Group and in the Faculty of Informatics for their fellowship, support, and all the coffee breaks and dinners we held together.
    [Show full text]
  • Presentación De Powerpoint
    CENTRO DE SUPERCOMPUTACIÓN DE GALICIA High Scalability Multipole Method. Solving Half Billion of Unknowns J.C. Mouriño¹, A. Gómez¹, J.M. Taboada², L. Landesa², J.M. Bértolo³, F. Obelleiro³, J.L. Rodríguez³ ¹ Supercomputing Center of Galicia (CESGA), Spain ² University of Extremadura, Spain ³ University of Vigo, Spain International Supercomputing Conference Hamburg, June 23th 2009 Outline • Introduction • FMM-FFT algorithm • Parallel implementation • HEMCUVE. Challenge history • Experimental Results • Conclusions 2 Introduction • Numerical solution of the integro-differential electromagnetic equations -> important in industry • High frequency in large objects -> scalability limits – 0.78 m² at 3 GHz -> 15000 unknowns – real car at 79 GHz -> 400 million unknowns • Great effort reducing computational time of MoM • Fast Multipole Method (FMM) -> O(N³/²) good scalability • Multilevel FMM (MLFMA) -> O(N log N) poor scalability • Modern HPC systems have thousands of cores • FMM-FFT reduces complexity preserving scalability 3 Introduction • FMM – The geometry is partitioned into M groups using an oct-tree decomposition algorithm – Parallelization: • k-space samples are independent from one another • The workload can be partitioned in the k-space • MLFMA – The same algorithm can be recursively applied in a hierarchical multilevel oct-tree decomposition – Computational cost reduced to O(N log N) – Parallelization: • k-space samples are not independent due to interpolation/ anterpolation of fields across levels • Usually workload distributed by
    [Show full text]
  • Enabling the Deployment of Virtual Clusters on the VCOC Experiment of the Bonfire Federated Cloud
    CLOUD COMPUTING 2012 : The Third International Conference on Cloud Computing, GRIDs, and Virtualization Enabling the Deployment of Virtual Clusters on the VCOC Experiment of the BonFIRE Federated Cloud Raul Valin, Luis M. Carril, J. Carlos Mouri˜no, Carmen Cotelo, Andr´es G´omez, and Carlos Fern´andez Supercomputing Centre of Galicia (CESGA) Santiago de Compostela, Spain Email: rvalin,lmcarril,jmourino,carmen,agomez,[email protected] Abstract—The BonFIRE project has developed a federated OpenCirrus. BonFIRE offers an experimenter control of cloud that supports experimentation and testing of innovative available resources. It supports dynamically creating, updat- scenarios from the Internet of Services research community. ing, reading and deleting resources throughout the lifetime Virtual Clusters on federated Cloud sites (VCOC) is one of the supported experiments of the BonFIRE Project whose main of an experiment. Compute resources can be configured with objective is to evaluate the feasibility of using multiple Cloud application-specific contextualisation information that can environments to deploy services which need the allocation provide important configuration information to the virtual of a large pool of CPUs or virtual machines to a single machine (VM); this information is available to software user (as High Throughput Computing or High Performance applications after the machine is started. BonFIRE also Computing). In this work, we describe the experiment agent, a tool developed on the VCOC experiment to facilitate the supports elasticity within an experiment, i.e., dynamically automatic deployment and monitoring of virtual clusters on create, update and destroy resources from a running node of the BonFIRE federated cloud. This tool was employed in the experiment, including cross-testbed elasticity.
    [Show full text]
  • Efficient Multithreaded Untransposed, Transposed Or Symmetric Sparse
    Efficient Multithreaded Untransposed, Transposed or Symmetric Sparse Matrix-Vector Multiplication with the Recursive Sparse Blocks Format Michele Martonea,1,∗ aMax Planck Society Institute for Plasma Physics, Boltzmannstrasse 2, D-85748 Garching bei M¨unchen,Germany Abstract In earlier work we have introduced the \Recursive Sparse Blocks" (RSB) sparse matrix storage scheme oriented towards cache efficient matrix-vector multiplication (SpMV ) and triangular solution (SpSV ) on cache based shared memory parallel computers. Both the transposed (SpMV T ) and symmetric (SymSpMV ) matrix-vector multiply variants are supported. RSB stands for a meta-format: it recursively partitions a rectangular sparse matrix in quadrants; leaf submatrices are stored in an appropriate traditional format | either Compressed Sparse Rows (CSR) or Coordinate (COO). In this work, we compare the performance of our RSB implementation of SpMV, SpMV T, SymSpMV to that of the state-of-the-art Intel Math Kernel Library (MKL) CSR implementation on the recent Intel's Sandy Bridge processor. Our results with a few dozens of real world large matrices suggest the efficiency of the approach: in all of the cases, RSB's SymSpMV (and in most cases, SpMV T as well) took less than half of MKL CSR's time; SpMV 's advantage was smaller. Furthermore, RSB's SpMV T is more scalable than MKL's CSR, in that it performs almost as well as SpMV. Additionally, we include comparisons to the state-of-the art format Compressed Sparse Blocks (CSB) implementation. We observed RSB to be slightly superior to CSB in SpMV T, slightly inferior in SpMV, and better (in most cases by a factor of two or more) in SymSpMV.
    [Show full text]
  • Searching for Genetic Interactions in Complex Disease by Using Distance Correlation
    Searching for genetic interactions in complex disease by using distance correlation Fernando Castro-Prado, University and Health Research Institute of Santiago de Compostela, Spain. E-mail: [email protected] Javier Costas Health Research Institute of Santiago de Compostela, Spain. and Wenceslao González-Manteiga and David R. Penas University of Santiago de Compostela, Spain. Summary. Understanding epistasis (genetic interaction) may shed some light on the ge- nomic basis of common diseases, including disorders of maximum interest due to their high socioeconomic burden, like schizophrenia. Distance correlation is an association measure that characterises general statistical independence between random variables, not only the linear one. Here, we propose distance correlation as a novel tool for the detection of epistasis from case-control data of single nucleotide polymorphisms (SNPs). This approach will be developed both theoretically (mathematical statistics, in a context of high-dimensional statistical inference) and from an applied point of view (simulations and real datasets). Keywords: Association measures; Distance correlation; Epistasis; Genomics; High- dimensional statistical inference; Schizophrenia 1. Introduction The application field that motivates the present article is going to be explained here- inafter. The starting point is a genomic problem, whose importance and interest will be addressed. In addition, the state of the art on this field of knowledge will be sum- marised; underscoring one of the most recent techniques, which has a strong theoretical basis. Upon this, some hypotheses will be made. arXiv:2012.05285v1 [math.ST] 9 Dec 2020 1.1. Epistasis in complex disease The role of heredity in psychiatry has been studied for almost a century, with Pearson (1931) not having “the least hesitation” in asserting its relevance.
    [Show full text]
  • Enabling Rootless Linux Containers in Multi-User Environments: the Udocker Tool
    DESY 17-096 Enabling rootless Linux Containers in multi-user environments: the udocker tool Jorge Gomes1, Emanuele Bagnaschi2, Isabel Campos3, Mario David1, Lu´ısAlves1, Jo~aoMartins1, Jo~aoPina1, Alvaro L´opez-Garc´ıa3, and Pablo Orviz3 1Laborat´oriode Instrumenta¸c~aoe F´ısicaExperimental de Part´ıculas(LIP), Lisboa, Portugal 2Deutsches Elektronen-Synchrotron (DESY), 22607 Hamburg, Germany 3IFCA, Consejo Superior de Investigaciones Cient´ıficas-CSIC,Santander, Spain June 5, 2018 Abstract Containers are increasingly used as means to distribute and run Linux services and applications. In this paper we describe the architectural design and implementation of udocker, a tool which enables the user to execute Linux containers in user mode. We also present a few practical applications, using a range of scientific codes characterized by different requirements: from single core execution to MPI parallel execution and execution on GPGPUs. 1 Introduction Technologies based on Linux containers have become very popular among soft- ware developers and system administrators. The main reason behind this suc- cess is the flexibility and efficiency that containers offer when it comes to pack- ing, deploying and running software. A given software can be containerized together with all its dependencies in arXiv:1711.01758v2 [cs.SE] 1 Jun 2018 such a way that it can be seamlessly executed regardless of the Linux distribution used by the designated host systems. This is achieved by using advanced features of modern Linux kernels [1], namely control groups and namespaces isolation [2, 3]. Using both features, a set of processes can be placed in a fully isolated environment (using namespaces isolation), with a given amount of resources, such as CPU or RAM, allocated to it (using control groups).
    [Show full text]
  • Prace6ip-D7.1
    E-Infrastructures H2020- INFRAEDI-2018-2020 INFRAEDI-01-2018: Pan-European High Performance Computing infrastructure and services (PRACE) PRACE-6IP PRACE Sixth Implementation Phase Project Grant Agreement Number: INFRAEDI-823767 D7.1 Periodic Report on Results from Projects Supported by Applications Enabling and Porting Services Final Version: 1.0 Author(s): Gabriel Hautreux, CINES; Chris Johnson, EPCC; Sebastian Lührs, JUELICH Date: 16.10.2020 D7.1 Periodic Report on Results from Projects Supported by Applications Enabling and Porting Services Project and Deliverable Information Sheet PRACE Project Project Ref. №: INFRAEDI-823767 Project Title: PRACE Sixth Implementation Phase Project Project Web Site: http://www.prace-project.eu Deliverable ID: D7.1 Deliverable Nature: Report Dissemination Level: Contractual Date of Delivery: PU* 30 / October / 2020 Actual Date of Delivery: 30 / October / 2020 EC Project Officer: Leonardo Flores Añover * - The dissemination level are indicated as follows: PU – Public, CO – Confidential, only for members of the consortium (including the Commission Services) CL – Classified, as referred to in Commission Decision 2005/444/EC. Document Control Sheet Title: Periodic Report on Results from Projects Supported by Document Applications Enabling and Porting Services ID: D7.1 Version: <1.0> Status: Final Available at: http://www.prace-project.eu Software Tool: Microsoft Word 2016 File(s): D7.1.docx Written by: Gabriel Hautreux, CINES; Chris Johnson, Authorship EPCC; Sebastian Lührs, JUELICH Contributors: Adam
    [Show full text]
  • A Comparison of Task Parallel Frameworks Based on Implicit Dependencies in Multi-Core Environments
    Proceedings of the 50th Hawaii International Conference on System Sciences | 2017 A Comparison of Task Parallel Frameworks based on Implicit Dependencies in Multi-core Environments Basilio B. Fraguela Universidade da Coruna,˜ A Coruna,˜ Spain Email: [email protected] Abstract—The larger flexibility that task parallelism offers minimum effort from the developers, while they allow to with respect to data parallelism comes at the cost of a higher build extremely complex task graphs and provide maximum complexity due to the variety of tasks and the arbitrary pat- parallelism thanks to the graph scheduling algorithms they terns of dependences that they can exhibit. These dependencies should be expressed not only correctly, but optimally, i.e. avoid- implement, makes them particularly interesting. ing over-constraints, in order to obtain the maximum perfor- Despite the relevance of this approach, we have not found mance from the underlying hardware. There have been many comparative studies of the existing practical alternatives proposals to facilitate this non-trivial task, particularly within of this kind beyond some performance comparisons [36]. the scope of nowadays ubiquitous multi-core architectures. A very interesting family of solutions because of their large For this reason this paper tackles this issue describing scope of application, ease of use and potential performance and comparing some of the high-level approaches available are those in which the user declares the dependences of each nowadays with a particular focus on their semantics and ease task, and lets the parallel programming framework figure out of use, our main aim being to help identify the best tool which are the concrete dependences that appear at runtime for each problem at hand.
    [Show full text]
  • Potential Use of Supercomputing Resources in Europe and in Spain for CMS (Including Some Technical Points)
    Potential use of supercomputing resources in Europe and in Spain for CMS (including some technical points) Presented by Jesus Marco (IFCA, CSIC-UC, Santander, Spain) on behalf of IFCA team, And with tech contribution from Jorge Gomes, LIP, Lisbon, Portugal @ CMS First Open Resources Computing Workshop CERN 21 June 2016 Some background… The supercomputing node at the University of Cantabria, named ALTAMIRA, is hosted and operated by IFCA It is not large (2500 cores) but it is included in the Supercomputing Network in Spain, that has quite significant resources (more than 80K cores) that will be doubled along next year. As these resources are granted on the basis of the scientific interest of the request, CMS teams in Spain could directly benefit of their use "for free". However the request needs to show the need for HPC resources (multicore architecture in CMS case) and the possibility to run in a “existing" framework (OS, username/passw. access, etc.). My presentation aims to cover these points and ask for experience from other teams/experts on exploiting this possibility. The EU PRACE initiative joins many different supercomputers at different levels (Tier-0, Tier-1) and could also be explored. Evolution of the Spanish Supercomputing Network (RES) See https://www.bsc.es/marenostrum-support-services/res Initially (2005) most of the resources were based on IBM-Power +Myrinet Since 2012 many of the centers evolved to use Intel x86 + Infiniband • First one was ALTAMIRA@UC: – 2.500 Xeon E5 cores with FDR IB to 1PB on GPFS • Next: MareNostrum
    [Show full text]
  • An Experience of Five Years Using Parallel Programming Contests For
    The contest Teaching experiences Changes and Perspectives An experience of five years using parallel programming contests for teaching Domingo Gim´enez Departamento de Inform´atica y Sistemas, University of Murcia, Spain EuroEDUPAR Workshop, Santiago de Compostela, Spain, September 28, 2017 The contest Teaching experiences Changes and Perspectives ... continuation of The Spanish Parallel Programming Contest and its use as an educational resource Francisco Almeida Departamento de Estad´ıstica, Investigaci´on Operativa y Computaci´on, University of La Laguna Javier Cuenca, Ricardo Fern´andez-Pascual Departamento de Ingenier´ıay Tecnolog´ıade Computadores, University of Murcia Domingo Gim´enez Departamento de Inform´atica y Sistemas, University of Murcia Juan Alejandro Palomino Benito Centro de Supercomputaci´on, Fundaci´on Parque Cient´ıfico, Murcia EduPar Workshop, Shanghai, May 21, 2012 The contest Teaching experiences Changes and Perspectives Outline 1 The contest 2 Teaching experiences 3 Changes and Perspectives The contest Teaching experiences Changes and Perspectives Spanish Parallel Programming Contest Since 2011 It has evolved. In 2017: Individual participation, Spanish students no older than 28 In the Jornadas Sarteco (Spanish Society of Computers Architecture), September 20th, M´alaga Using systems of the CESGA (Supercomputing Center of Galicia) Problems to be solved with OpenMP, MPI, CUDA and XeonPhi (OpenMP, offload mode) A sequential solution is provided for each problem, and the score is calculated based on speed-up Automatic, real-time scoring using Mooshak The contest Teaching experiences Changes and Perspectives Spanish Parallel Programming Contest - Structure Mooshak: A tool for organization of contests. From the University of Porto, Portugal. Adapted to work in the cluster and to calculate scoring based on speed-up.
    [Show full text]