Jakub T. Mościcki Understanding and Mastering Dynamics

Total Page:16

File Type:pdf, Size:1020Kb

Jakub T. Mościcki Understanding and Mastering Dynamics UvA-DARE (Digital Academic Repository) Understanding and mastering dynamics in computing grids: processing moldable tasks with user-level overlay Mościcki, J.T. Publication date 2011 Document Version Final published version Link to publication Citation for published version (APA): Mościcki, J. T. (2011). Understanding and mastering dynamics in computing grids: processing moldable tasks with user-level overlay. General rights It is not permitted to download or to forward/distribute the text or part of it without the consent of the author(s) and/or copyright holder(s), other than for strictly personal, individual use, unless the work is under an open content license (like Creative Commons). Disclaimer/Complaints regulations If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library: https://uba.uva.nl/en/contact, or a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible. UvA-DARE is a service provided by the library of the University of Amsterdam (https://dare.uva.nl) Download date:24 Sep 2021 Understanding and Mastering Dynamics in Computing Grids Jakub T. Mościcki is a researcher and software engineer at CERN, Geneva, Switzerland. He obtained the MSc in Computer Science from the AGH University of Science and Technology in Kraków, Poland. He is a lead developer of the Ganga project and creator of the DIANE framework, which are used to support very large LHC user communities as well as users of multidisciplinary applications in theoretical physics, medical and radiation studies, bio-informatics, drug design, telecommunications. His research interests focus on scheduling and management of distributed and parallel applications, large-scale computing infrastructures such as grids, and various forms of High Throughput and High Performance Computing. Understanding and Mastering Thousands of scientific users witness every day inherent instabilities and bottlenecks of large-scale task processing systems: lost or incomplete jobs and hard-to-predict completion times. They are struggling to resubmit failed jobs and get consistent results. And it is always Dynamics in Computing Grids difficult to catch up with latest deployed software environments or system configurations. In addition, the users have often more than one system to deal with: they continue to use locally available computing power (a desktop PC, a nearby computing center, a small cluster Processing Moldable Tasks next door) while exploiting global resources such as grids. On top of this, grids use a large variety of middleware stacks, which are customized in different ways by user communities. Quality of Service and usability are the two keywords probably most frequently echoed in with User-Level Overlay the corridors of many "grid-enabled" research labs. Jakub T. Mościcki This PhD dissertation presents scientific research from the problem statement, system analysis, modeling and simulation, to validation through experimental results. It captures and characterizes complexity and dynamics of global task processing systems using as an example the largest scientific grid to date - the EGEE/EGI Grid. A task processing model developed in this work allows to rigorously explain why the late-binding method is superior to traditional task scheduling based on early binding. A study of statistical properties of task processing times is complemented by Monte Carlo simulation. This book is also addressed to grid practitioners: developers and users. Presenting several successful application examples from diverse domains, it explains how heterogeneity and dynamics of global task processing systems may be addressed and mastered in a cost- effective way directly by the users. It describes a User-level Overlay, based on two software packages, Ganga and DIANE, which are ready to use with little or no customization for your application. Advanced resource selection strategies and scheduling approaches developed in this book may be reused in your environment. Jakub T. Mościcki 5 800054 694140 Understanding and Mastering Dynamics in Computing Grids: Processing Moldable Tasks with User-Level Overlay ACADEMISCH PROEFSCHRIFT ter verkrijging van de graad van doctor aan de Universiteit van Amsterdam op gezag van de Rector Magnificus prof. dr. D.C van den Boom ten overstaan van een door het college voor promoties ingestelde commissie, in het openbaar te verdedigen in de Agnietenkapel op dinsdag 12 april 2011, te 12:00 uur door Jakub Tomasz Mo´scicki geboren te Krak´ow, Polen. Promotiecommissie Promotor: Prof. Dr. Marian T. Bubak Co-promotor: Prof. Dr. Peter M.A. Sloot Overige leden: Prof. Dr. Hamideh Afsarmanesh Dr. ir. Alfons G. Hoekstra Dr. Juergen Knobloch Prof. Dr. ir. Cees Th.A.M. de Laat Prof. Dr. Krzysztof Zielinski Faculteit: Faculteit der Natuurwetenschappen Wiskunde en Informatica This work makes use of results produced by the Enabling Grids for E-sciencE project, a project co-funded by the European Commission (under contract number INFSO-RI- 222667) through the Seventh Framework Programme. EGEE brings together 91 part- ners in 32 countries to provide a seamless Grid infrastructure available to the European research community 24 hours a day. Full information is available at www.eu-egee.org and www.egi.eu The book cover uses Stacy Reed's Chaos From Order artwork which she kindy shared with me for this purpose. Stacy is a diverse artist who enjoys exploring chaos through fractal applications. Chaos From Order represents the notion that in evolution, chaotic shapes and patterns, mutations, abnormalities and anomalies emerge over time, from what was once, in this case, a perfect mathematical form. More of her artwork can be viewed by visiting www.shedreamsindigital.net. Author contact: [email protected] Printed by lulu.com Copyright © 2011 Jakub T. Mo´scicki Table of Contents 1 Motivation and research objectives 1 1.1 Distributed applications: common patterns and characteristics . 2 1.2 Infrastructures for scientific computing ................... 8 1.3 Higher-level middleware systems ...................... 9 1.4 User requirements .............................. 13 1.5 The research objectives and roadmap .................... 15 2 Dynamics of large computing grids 19 2.1 EGEE { world's largest computing and data Grid . 19 2.2 Grid as an infrastructure ........................... 22 2.3 Grid as a task processing system ...................... 27 2.4 Summary ................................... 39 3 Analysis and modeling of task processing with late binding on the Grid 41 3.1 Introduction .................................. 41 3.2 Task processing model ............................ 42 3.3 Distribution of job queuing time ...................... 44 3.4 Simulation of task processing models .................... 48 3.5 Summary ................................... 57 4 Development of the User-level Overlay 59 4.1 Vision ..................................... 60 4.2 Functional breakdown and architecture ................... 62 4.3 DIANE and Ganga software packages ................... 63 4.4 Operation of the User-level Overlay ..................... 64 4.5 The DIANE task coordination framework . 66 4.6 The Ganga resource access API and user interface . 73 iv TABLE OF CONTENTS 4.7 Heuristic resource selection ......................... 80 4.8 Adaptive workload balancing ........................ 85 4.9 Summary ................................... 89 5 User-level Overlay in action 91 5.1 Monte Carlo simulation with Geant4 toolkit . 92 5.2 Workflows for medical imaging simulations . 99 5.3 Data processing for ATLAS and LHCb experiments . 102 5.4 Massive molecular docking for Avian Flu . 103 5.5 Other examples of using DIANE/Ganga overlay . 105 5.6 Summary ................................... 106 6 Capability computing case study: ITU broadcasting planning 109 6.1 Introduction .................................. 109 6.2 Broadcasting planning process . 110 6.3 Compatibility analysis ............................ 111 6.4 Implementation of grid-based analysis system for the RRC06 . 113 6.5 Analysis of task processing . 115 6.6 Summary ................................... 120 7 Capacity computing case study: LatticeQCD simulation 121 7.1 Introduction .................................. 121 7.2 Problem to be solved ............................. 122 7.3 Simulation model ............................... 123 7.4 Implementation and operation of the simulation system . 125 7.5 Task scheduling and prioritization . 130 7.6 Analysis of adaptive resource selection . 137 7.7 Exploiting low-level parallelism for finer lattices . 139 7.8 Summary ................................... 140 8 Conclusions and future work 143 8.1 Grid dynamics and its consequences for task processing . 143 8.2 Contributions of this work . 144 8.3 Open issues .................................. 146 8.4 Future work .................................. 147 8.5 Postscriptum ................................. 148 Bibliography 164 Summary 165 Nederlandse samenvatting 167 Streszczenie po polsku 169 Publications 171 TABLE OF CONTENTS v Acknowledgments 175 Index 177 vi TABLE OF CONTENTS List of Abbreviations AWLB Adaptive Workload Balancing CDF Cumulative Probability Distribution Function CE Computing Element CERN European Laboratory for
Recommended publications
  • Concurrent Cilk: Lazy Promotion from Tasks to Threads in C/C++
    Concurrent Cilk: Lazy Promotion from Tasks to Threads in C/C++ Christopher S. Zakian, Timothy A. K. Zakian Abhishek Kulkarni, Buddhika Chamith, and Ryan R. Newton Indiana University - Bloomington, fczakian, tzakian, adkulkar, budkahaw, [email protected] Abstract. Library and language support for scheduling non-blocking tasks has greatly improved, as have lightweight (user) threading packages. How- ever, there is a significant gap between the two developments. In previous work|and in today's software packages|lightweight thread creation incurs much larger overheads than tasking libraries, even on tasks that end up never blocking. This limitation can be removed. To that end, we describe an extension to the Intel Cilk Plus runtime system, Concurrent Cilk, where tasks are lazily promoted to threads. Concurrent Cilk removes the overhead of thread creation on threads which end up calling no blocking operations, and is the first system to do so for C/C++ with legacy support (standard calling conventions and stack representations). We demonstrate that Concurrent Cilk adds negligible overhead to existing Cilk programs, while its promoted threads remain more efficient than OS threads in terms of context-switch overhead and blocking communication. Further, it enables development of blocking data structures that create non-fork-join dependence graphs|which can expose more parallelism, and better supports data-driven computations waiting on results from remote devices. 1 Introduction Both task-parallelism [1, 11, 13, 15] and lightweight threading [20] libraries have become popular for different kinds of applications. The key difference between a task and a thread is that threads may block|for example when performing IO|and then resume again.
    [Show full text]
  • Parallel Computing a Key to Performance
    Parallel Computing A Key to Performance Dheeraj Bhardwaj Department of Computer Science & Engineering Indian Institute of Technology, Delhi –110 016 India http://www.cse.iitd.ac.in/~dheerajb Dheeraj Bhardwaj <[email protected]> August, 2002 1 Introduction • Traditional Science • Observation • Theory • Experiment -- Most expensive • Experiment can be replaced with Computers Simulation - Third Pillar of Science Dheeraj Bhardwaj <[email protected]> August, 2002 2 1 Introduction • If your Applications need more computing power than a sequential computer can provide ! ! ! ❃ Desire and prospect for greater performance • You might suggest to improve the operating speed of processors and other components. • We do not disagree with your suggestion BUT how long you can go ? Can you go beyond the speed of light, thermodynamic laws and high financial costs ? Dheeraj Bhardwaj <[email protected]> August, 2002 3 Performance Three ways to improve the performance • Work harder - Using faster hardware • Work smarter - - doing things more efficiently (algorithms and computational techniques) • Get help - Using multiple computers to solve a particular task. Dheeraj Bhardwaj <[email protected]> August, 2002 4 2 Parallel Computer Definition : A parallel computer is a “Collection of processing elements that communicate and co-operate to solve large problems fast”. Driving Forces and Enabling Factors Desire and prospect for greater performance Users have even bigger problems and designers have even more gates Dheeraj Bhardwaj <[email protected]>
    [Show full text]
  • Control Replication: Compiling Implicit Parallelism to Efficient SPMD with Logical Regions
    Control Replication: Compiling Implicit Parallelism to Efficient SPMD with Logical Regions Elliott Slaughter Wonchan Lee Sean Treichler Stanford University Stanford University Stanford University SLAC National Accelerator Laboratory [email protected] NVIDIA [email protected] [email protected] Wen Zhang Michael Bauer Galen Shipman Stanford University NVIDIA Los Alamos National Laboratory [email protected] [email protected] [email protected] Patrick McCormick Alex Aiken Los Alamos National Laboratory Stanford University [email protected] [email protected] ABSTRACT 1 for t = 0, T do We present control replication, a technique for generating high- 1 for i = 0, N do −− Parallel 2 for i = 0, N do −− Parallel performance and scalable SPMD code from implicitly parallel pro- 2 for t = 0, T do 3 B[i] = F(A[i]) grams. In contrast to traditional parallel programming models that 3 B[i] = F(A[i]) 4 end 4 −− Synchronization needed require the programmer to explicitly manage threads and the com- 5 for j = 0, N do −− Parallel 5 A[i] = G(B[h(i)]) munication and synchronization between them, implicitly parallel 6 A[j] = G(B[h(j)]) 6 end programs have sequential execution semantics and by their nature 7 end 7 end avoid the pitfalls of explicitly parallel programming. However, with- 8 end (b) Transposed program. out optimizations to distribute control overhead, scalability is often (a) Original program. poor. Performance on distributed-memory machines is especially sen- F(A[0]) . G(B[h(0)]) sitive to communication and synchronization in the program, and F(A[1]) . G(B[h(1)]) thus optimizations for these machines require an intimate un- .
    [Show full text]
  • Regent: a High-Productivity Programming Language for Implicit Parallelism with Logical Regions
    REGENT: A HIGH-PRODUCTIVITY PROGRAMMING LANGUAGE FOR IMPLICIT PARALLELISM WITH LOGICAL REGIONS A DISSERTATION SUBMITTED TO THE DEPARTMENT OF COMPUTER SCIENCE AND THE COMMITTEE ON GRADUATE STUDIES OF STANFORD UNIVERSITY IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF DOCTOR OF PHILOSOPHY Elliott Slaughter August 2017 © 2017 by Elliott David Slaughter. All Rights Reserved. Re-distributed by Stanford University under license with the author. This work is licensed under a Creative Commons Attribution- Noncommercial 3.0 United States License. http://creativecommons.org/licenses/by-nc/3.0/us/ This dissertation is online at: http://purl.stanford.edu/mw768zz0480 ii I certify that I have read this dissertation and that, in my opinion, it is fully adequate in scope and quality as a dissertation for the degree of Doctor of Philosophy. Alex Aiken, Primary Adviser I certify that I have read this dissertation and that, in my opinion, it is fully adequate in scope and quality as a dissertation for the degree of Doctor of Philosophy. Philip Levis I certify that I have read this dissertation and that, in my opinion, it is fully adequate in scope and quality as a dissertation for the degree of Doctor of Philosophy. Oyekunle Olukotun Approved for the Stanford University Committee on Graduate Studies. Patricia J. Gumport, Vice Provost for Graduate Education This signature page was generated electronically upon submission of this dissertation in electronic format. An original signed hard copy of the signature page is on file in University Archives. iii Abstract Modern supercomputers are dominated by distributed-memory machines. State of the art high-performance scientific applications targeting these machines are typically written in low-level, explicitly parallel programming models that enable maximal performance but expose the user to programming hazards such as data races and deadlocks.
    [Show full text]
  • Implicit Parallelism, Mixed Approaches
    Parallel Programming Concepts Implicit Parallelism & Mixed Approaches Peter Tröger / Frank Feinbube Sources: Clay Breshears: The Art of Concurrency Blaise Barney: Introduction to Parallel Computing Martin Odersky: Scala By Example Parallel Programming Data Parallel / Task Parallel / Multi- PThreads, OpenMP, OpenCL, SIMD MIMD Tasking Linda, Cilk, ... GPU, Cell, SSE, ManyCore/ Shared Vector SMP system Message MPI, PVM, CSP Channels, Memory processor Passing Actors, ... (SM) ... ... Implicit Map/Reduce, PLINQ, HPF, Shared Parallelism Lisp, Fortress, ... processor-array cluster systems Nothing / systems MPP systems Distributed systolic arrays Mixed Ada, Scala, Clojure, Erlang, Memory Hadoop ... Approaches X10, ... (DM) ... Parallel Execution Application Environment ParProg | Languages 2 PT 2013 Implicit Parallelism Multi- PThreads, OpenMP, OpenCL, Tasking Linda, Cilk, ... Message MPI, PVM, CSP Channels, Passing Actors, ... Implicit Map/Reduce, PLINQ, HPF, Parallelism Lisp, Fortress, ... Mixed Ada, Scala, Clojure, Erlang, Approaches X10, ... ParProg | Languages 3 PT 2013 Functional Programming • Programming paradigm that treats execution as function evaluation -> map some input to some output • Contrary to imperative programming that focuses on statement execution for global state modification (closer to hardware model of execution) • Programmer no longer specifies control flow explicitly • Side-effect free computation through avoidance of local state -> referential transparency (no demand for particular control flow) • Typically strong focus on
    [Show full text]
  • Lawrence Berkeley National Laboratory Recent Work
    Lawrence Berkeley National Laboratory Recent Work Title A survey of software implementations used by application codes in the Exascale Computing Project Permalink https://escholarship.org/uc/item/05z557r4 Authors Evans, TM Siegel, A Draeger, EW et al. Publication Date 2021 DOI 10.1177/10943420211028940 Peer reviewed eScholarship.org Powered by the California Digital Library University of California Journal Title XX(X):2–13 A Survey of Software c The Author(s) 0000 Reprints and permission: Implementations Used sagepub.co.uk/journalsPermissions.nav DOI: 10.1177/ToBeAssigned by Application Codes www.sagepub.com/ SAGE in the Exascale Computing Project Thomas M. Evans1∗, Andrew Siegel2, Erik W. Draeger3, Jack Deslippe4, Marianne M. Francois5, Timothy C. Germann5, William E. Hart6, and Daniel F. Martin4 Abstract The US Department of Energy Office of Science and the National Nuclear Security Administration(NNSA) initiated the Exascale Computing Project(ECP) in 2016 to prepare mission-relevant applications and scientific software for the delivery of the exascale computers starting in 2023. The ECP currently supports 24 efforts directed at specific applications and six supporting co-design projects. These 24 application projects contain 62 application codes that are implemented in three high-level languages—C, C++, and Fortran—and use 22 combinations of GPU programming models. The most common implementation language is C++, which is used in 53 different application codes. The most common programming models across ECP applications are CUDA and Kokkos, which are employed in 15 and 14 applications, respectively. This paper provides a survey of the programming languages and models used in the ECP applications codebase that will be used to achieve performance on the future exascale hardware platforms.
    [Show full text]
  • 14. Parallel Computing 14.1 Introduction 14.2 Independent
    14. Parallel Computing 14.1 Introduction This chapter describes approaches to problems to which multiple computing agents are applied simultaneously. By "parallel computing", we mean using several computing agents concurrently to achieve a common result. Another term used for this meaning is "concurrency". We will use the terms parallelism and concurrency synonymously in this book, although some authors differentiate them. Some of the issues to be addressed are: What is the role of parallelism in providing clear decomposition of problems into sub-problems? How is parallelism specified in computation? How is parallelism effected in computation? Is parallel processing worth the extra effort? 14.2 Independent Parallelism Undoubtedly the simplest form of parallelism entails computing with totally independent tasks, i.e. there is no need for these tasks to communicate. Imagine that there is a large field to be plowed. It takes a certain amount of time to plow the field with one tractor. If two equal tractors are available, along with equally capable personnel to man them, then the field can be plowed in about half the time. The field can be divided in half initially and each tractor given half the field to plow. One tractor doesn't get into another's way if they are plowing disjoint halves of the field. Thus they don't need to communicate. Note however that there is some initial overhead that was not present with the one-tractor model, namely the need to divide the field. This takes some measurements and might not be that trivial. In fact, if the field is relatively small, the time to do the divisions might be more than the time saved by the second tractor.
    [Show full text]
  • Implicitly-Multithreaded Processors
    Implicitly-Multithreaded Processors ∗ Il Park, Babak Falsafi and T. N. Vijaykumar ∗ School of Electrical & Computer Engineering Computer Architecture Laboratory (CALCM) Purdue University Carnegie Mellon University {parki,vijay}@ecn.purdue.edu [email protected] http://min.ecn.purdue.edu/~parki http://www.ece.cmu.edu/~impetus http://www.ece.purdue.edu/~vijay Abstract In this paper, we propose the Implicitly-Multi- Threaded (IMT) processor. IMT executes compiler-speci- This paper proposes the Implicitly-MultiThreaded fied speculative threads from a sequential program on a (IMT) architecture to execute compiler-specified specula- wide-issue SMT pipeline. IMT is based on the fundamental tive threads on to a modified Simultaneous Multithreading observation that Multiscalar’s execution model — i.e., pipeline. IMT reduces hardware complexity by relying on compiler-specified speculative threads [11] — can be the compiler to select suitable thread spawning points and decoupled from the processor organization — i.e., distrib- orchestrate inter-thread register communication. To uted processing cores. Multiscalar [11] employs sophisti- enhance IMT’s effectiveness, this paper proposes three cated specialized hardware, the register ring and address novel microarchitectural mechanisms: (1) resource- and resolution buffer, which are strongly coupled to the distrib- dependence-based fetch policy to fetch and execute suit- uted core organization. In contrast, IMT proposes to map able instructions, (2) context multiplexing to improve utili- speculative threads on to generic SMT. zation and map as many threads to a single context as IMT differs fundamentally from prior proposals, TME allowed by availability of resources, and (3) early thread- and DMT, for speculative threading on SMT. While TME invocation to hide thread start-up overhead by overlapping executes multiple threads only in the uncommon case of one thread’s invocation with other threads’ execution.
    [Show full text]
  • Parallel Programming – Multicore Systems
    FYS3240 PC-based instrumentation and microcontrollers Parallel Programming – Multicore systems Spring 2014 – Lecture #9 Bekkeng, 12.5.2014 Introduction • Until recently, innovations in processor technology have resulted in computers with CPUs that operate at higher clock rates. • However, as clock rates approach their theoretical physical limits, companies are developing new processors with multiple processing cores. – P = ACV2f (P is consumed power, A is active chip area, C is the switched capacitance, f is frequency and V is voltage). • With these multicore processors the best performance and highest throughput is achieved by using parallel programming techniques This requires knowledge and suitable programming tools to take advantage of the multicore processors Multiprocessors & Multicore Processors Multicore Processors contain any Multiprocessor systems contain multiple number of multiple CPUs on a CPUs that are not on the same chip single chip The multiprocessor system has a divided The multicore processors share the cache with long-interconnects cache with short interconnects Hyper-threading • Hyper-threading is a technology that was introduced by Intel, with the primary purpose of improving support for multi- threaded code. • Under certain workloads hyper-threading technology provides a more efficient use of CPU resources by executing threads in parallel on a single processor. • Hyper-threading works by duplicating certain sections of the processor. • A hyper-threading equipped processor (core) pretends to be two "logical" processors
    [Show full text]
  • MT 2015 21011433 8070.Pdf
    Deanship of Graduate Studies Al-Quds University Performance Evaluation of Message Passing vs. Multithreading Parallel Programming Paradigms on Multi-core Systems Hadi Mahmoud Khalilia M.Sc. Thesis Jerusalem – Palestine 1435/ 2014 Deanship of Graduate Studies Al-Quds University Performance Evaluation of Message Passing vs. Multithreading Parallel Programming Paradigms on Multi-core Systems Prepared By Hadi Mahmoud Khalilia Supervisor: Dr.Nidal Kafri Co-Supervisor: Dr.Rezek Mohammad Thesis Submitted in Partial Fulfillment of the Requirements for the Degree of Master of Computer Science at Al-Quds University 1435/ 2014 Al-Quds University Deanship of Graduate Studies Master in Computer Science Computer Science & Information Technology Thesis Approval Performance Evaluation of Message Passing vs. Multithreading Parallel Programming Paradigms on Multi-core Systems Prepared By: Hadi Mahmoud Khalilia Registration No: 21011433 Supervisor: Dr.Nidal Kafri Master thesis submitted and accepted, Date: / / 2015 The names and signatures of the examining committee members are as follows: 1- Head of Committee: Dr.Jehad Najjar Signature …………... 2- Internal Examiner: Signature …………... 3- External Examiner: Signature …………... 4- Committee Member: Dr.Nidal Kafri Signature …………... 5- Co-Supervisor: Dr.Rezek Mohammad Signature …………... Jerusalem – Palestine 1435 / 2014 Dedication To my beloved Country Palestine To My Parents and family To My wife and sons (Zaid and Mahmoud) Declaration I certify that this thesis submitted for the degree of Master, is the result of my own research, except where otherwise acknowledged, and that this study (or any part of the same) has not been submitted for a higher degree to any other university or institution. Signed…………………………… Hadi Mahmoud Yousef Khalilia Date:…………………………….. i Acknowledgments For his support and guidance, I would like to thank my supervisors, Dr.
    [Show full text]
  • Global HPCC Benchmarks in Chapel: STREAM Triad, Random Access, and FFT (Revision 1.4 — June 2007 Release)
    Global HPCC Benchmarks in Chapel: STREAM Triad, Random Access, and FFT (Revision 1.4 — June 2007 Release) Bradford L. Chamberlain, Steven J. Deitz, Mary Beth Hribar, Wayne A. Wong Chapel Team, Cray Inc. chapel [email protected] Abstract—Chapel is a new parallel programming language execution and performance optimizations in mind, minimal being developed by Cray Inc. as part of its participation in development effort has been invested toward these activities DARPA’s High Productivity Computing Systems program. In this to date. As a result, this article does not contain performance article, we describe Chapel implementations of the global HPC Challenge (HPCC) benchmarks for the STREAM Triad, Random results since they would not reflect our team’s emphasis. Access, and FFT computations. The Chapel implementations use Beginning in 2007, we have focused our implementation effort 5–13× fewer lines of code than the reference implementations on serial performance optimizations and distributed-memory supplied by the HPCC team. All codes in this article compile and execution, and we expect to have publishable performance run with the current version of the Chapel compiler. We provide results for our codes within the coming year. an introduction to Chapel, highlight key features used in our HPCC implementations, and discuss our plans and challenges Though this article does not report on performance, we for obtaining performance for these codes as our compiler did write our benchmark implementations to be portable, development progresses. The full codes are listed in appendices performance-minded parallel codes rather than simply op- to this article. timizing for elegance, clarity, and size.
    [Show full text]
  • SCS5108 Parallel Systems Unit II Parallel Programming
    SCS5108 Parallel Systems Unit II Parallel Programming Programming parallel machines is notoriously difficult. Factors contributing to this difficulty include the complexity of concurrency, the effect of resource allocation on performance and the current diversity of parallel machine models. The net result is that effective portability, which depends crucially on the predictability of performance, has been lost. Functional programming languages have been put forward as solutions to these problems, because of the availability of implicit parallelism. However, performance will be generally poor unless the issue of resource allocation is addressed explicitly, diminishing the advantage of using a functional language in the first place. We present a methodology which is a compromise between the extremes of explicit imperative programming and implicit functional programming. We use a repertoire of higher- order parallel forms, skeletons , as the basic building blocks for parallel implementations and provide program transformations which can convert between skeletons, giving portability between differing machines. Resource allocation issues are documented for each skeleton/machine pair and are addressed explicitly during implementation in an interactive, selective manner, rather than by explicit programming. Threads A thread of execution is the smallest sequence of programmed instructions that can be managed independently by a scheduler, which is typically a part of the operating system.[1] The implementation of threads and processes differs between operating systems, but in most cases a thread is a component of a process. Multiple threads can exist within the same process, executing concurrently (one starting before others finish) and share resources such as memory, while different processes do not share these resources.
    [Show full text]