PASSION Runtime Library for Parallel I/O

Total Page:16

File Type:pdf, Size:1020Kb

PASSION Runtime Library for Parallel I/O Syracuse University SURFACE Electrical Engineering and Computer Science College of Engineering and Computer Science 1994 PASSION Runtime Library for Parallel I/O Rajeev Thakur Syracuse University, Northeast Parallel Architectures Center, and Department of Electrical and Computer Engineering, [email protected] Rajesh Bordawekar Syracuse University Alok Choudhary Syracuse University, Northeast Parallel Architectures Center, and Department of Electrical and Computer Engineering Ravi Ponnusamy Syracuse University, Northeast Parallel Architectures Center, and Department of Electrical and Computer Engineering, [email protected] Follow this and additional works at: https://surface.syr.edu/eecs Part of the Computer Sciences Commons Recommended Citation Thakur, Rajeev; Bordawekar, Rajesh; Choudhary, Alok; and Ponnusamy, Ravi, "PASSION Runtime Library for Parallel I/O" (1994). Electrical Engineering and Computer Science. 30. https://surface.syr.edu/eecs/30 This Working Paper is brought to you for free and open access by the College of Engineering and Computer Science at SURFACE. It has been accepted for inclusion in Electrical Engineering and Computer Science by an authorized administrator of SURFACE. For more information, please contact [email protected]. Scalable Parallel Libraries Conference Oct PASSION Runtime Library for Parallel IO Rajeev Thakur Rajesh Bordawekar Alok Choudhary Ravi Ponnusamy Tarvinder Singh Dept of Electrical and Computer Eng and Northeast Parallel Architectures Center Syracuse University Syracuse NY thakur rajesh choudhar ravi tpsingh npacsyredu At Syracuse University we consider the IO prob Abstract lem from a language compiler and runtime supp ort We are developing a compiler and runtime sup p oint of view We are developing a compiler and run port system cal led PASSION Paral lel And Scalable time supp ort system called PASSION Parallel And Software for InputOutput PASSION provides soft Scalable Software for InputOutput PASSION ware support for IO intensive outofcore loosely syn provides supp ort for compiling outofcore data paral chronous problems This paper gives an overview lel programs parallel inputoutput of data of the PASSION Runtime Library and describes two communication of outofcore data redistribution of of the optimizations incorporated in it namely Data data stored on disks many optimizations including Prefetching and Data Sieving Performance improve data prefetching from disks data sieving data reuse ments provided by these optimizations on the Intel etc as well as supp ort at the op erating system level Touchstone Delta are discussed together with an out We have also develop ed an initial framework for run ofcore Median Filtering application time supp ort for outofcore irregular problems This pap er gives an overview of PASSION and de Intro duction scrib es some of the main features of the PASSION There are a numb er of applications which deal with Runtime Library We explain the basic mo del of very large quantities of data These applications exist computation and IO used by the runtime library in diverse areas such as large scale scientic compu The runtime routines supp orted by PASSION are dis tations database applications hyp ertext and multi cussed A numb er of optimizations have b een in media systems information retrieval and many other corp orated in the runtime library to reduce the IO applications of the Information Age The numb er of cost We describ e in detail two of these optimizations such applications and their data requirements keep namely Data Prefetching and Data Sieving Perfor increasing day by day Consequently it has b ecome mance improvements provided by these optimizations apparent that IO p erformance rather than CPU or on the Intel Touchstone Delta are discussed together communication p erformance may b e the limiting fac with an outofcore Median Filtering application tor in future computing systems Recent advances in high p erformance computing have resulted in comput PASSION Overview ers which can provide more than Gops of com PASSION provides software supp ort for IO inten puting p ower However the p erformance of the IO sive lo osely synchronous problems It has a layered ap systems of these machines has lagged far b ehind It proach and provides supp ort at the compiler runtime is still several orders of magnitude more exp ensive to and op erating systems level as shown in Figure The read data from disk than to read it from lo cal memory PASSION compiler translates outofcore HPF pro Improvements are needed b oth in hardware as well as grams to message passing no de programs with explicit software to reduce the imbalance b etween CPU p er parallel IO It extracts information from user direc formance and IO p erformance tives ab out the data distribution which is required by the PASSION runtime system It restructures lo ops This work was supp orted in part by NSF Young Investiga having outofcore arrays and also decides the trans tor Award CCR grants from Intel SSD and IBM Corp formations on outofcore data to map the distribu and in part by USRA CESDIS Contract This work tion on disks with the usage in the lo ops The PAS was p erformed in part using the Intel Touchstone Delta System SION compiler uses well known techniques such as op erated by Caltech on b ehalf of the Concurrent Sup ercomput lo op stripmining iteration blo cking etc to generate ing Consortium Access to this facility was provided by CRPC I/O Intensive OOC Applications Compiler & Runtime Support Prefetch Manager I/O Controller and Disk Subsystem Cache and Buffer Manager Two-Phase Access Manager Compiler Support for HPF Directives Support for prefetching etc. Loosely Synchronous Computations Figure PASSION Rings program written in a highlevel data parallel language ecient co de for IO intensive applications It also like HPF can b e translated into ecient co de using emb eds calls to appropriate PASSION runtime rou the PASSION compiler and runtime system A de tines which carry out IO eciently The Compiler tailed description of all the features of PASSION is and Runtime Layers pass data distribution and access given in pattern information to the TwoPhase Access Man ager and the Prefetch Manager They optimize IO Mo del for Computation and IO using buering redistribution and prefetching strate In the SPMD Single Program Multiple Data pro gies At the op erating system level PASSION pro gramming mo del each pro cessor has a lo cal array as vides supp ort to handle prefetching and buering so ciated with it In an incore program the lo cal array The PASSION runtime supp ort system makes IO resides in the lo cal memory of the pro cessor For large optimizations transparent to users The runtime pro data sets however lo cal arrays cannot entirely t in cedures can either b e used together with a compiler to main memory In such cases parts of the lo cal array translate outofcore data parallel programs or used have to b e stored on disk We refer to such a lo cal ar directly by application programmers The runtime li ray as an Outofcore Lo cal Array OCLA Parts brary p erforms the following functions of the OCLA need to b e swapp ed b etween main mem ory and disk during the course of the computation hides disk data distribution from the user The basic mo del for computation and IO used by provides consistent IO p erformance indep endent PASSION is shown in Figure The simplest way to of data distribution view this mo del is to think of each pro cessor as hav ing another level of memory which is much slower than reorders IO requests to minimize seek time main memory Since the lo cal arrays are outofcore eliminates duplicate IO requests to reduce IO they have to b e stored in les on disk The lo cal ar cost ray of each pro cessor is stored in a separate le called the Lo cal Array File LAF of that pro cessor The prefetches disk data to hide IO latency no de program explicitly reads from and writes into the le when required If the IO architecture of the Writing message passing parallel programs with ef system is such that each pro cessor has its own disk cient parallel IO is a tedious pro cess Instead a Global Array To P0 To P1 To P2 To P3 P0 P1 P2 P3 Processors ICLA ICLA Disks Disks Local array Local array Files Files Figure Mo del for Computation and IO ized routines for parallel IO and collective commu the LAF of each pro cessor will b e stored on the disk nication These routines are built using the native attached to that pro cessor If there is a common set communication and IO primitives of the system and of disks for all pro cessors the LAF will b e distributed provide a high level abstraction which avoids the in across one or more of these disks In other words convenience of working directly with the lower layers we assume that each pro cessor has its own logical disk For example the routines hide details such as buer with the LAF stored on that disk The mapping of ing mapping of les on disks lo cation of data in les the logical disk to the physical disks is system dep en synchronization optimum message size for communi dent At any time only a p ortion of the lo cal array is cation b est communication algorithms communica fetched and stored in main memory The size of this tion scheduling IO scheduling etc p ortion dep ends on the amount of memory available The p ortion of the lo cal array which is in main mem PASSION Runtime Library ory is called the InCore Lo cal Array ICLA All The PASSION routines can b e divided into four computations are p erformed on the data in the ICLA main categories
Recommended publications
  • Clangjit: Enhancing C++ with Just-In-Time Compilation
    ClangJIT: Enhancing C++ with Just-in-Time Compilation Hal Finkel David Poliakoff David F. Richards Lead, Compiler Technology and Lawrence Livermore National Lawrence Livermore National Programming Languages Laboratory Laboratory Leadership Computing Facility Livermore, CA, USA Livermore, CA, USA Argonne National Laboratory [email protected] [email protected] Lemont, IL, USA [email protected] ABSTRACT body of C++ code, but critically, defer the generation and optimiza- The C++ programming language is not only a keystone of the tion of template specializations until runtime using a relatively- high-performance-computing ecosystem but has proven to be a natural extension to the core C++ programming language. successful base for portable parallel-programming frameworks. As A significant design requirement for ClangJIT is that the runtime- is well known, C++ programmers use templates to specialize al- compilation process not explicitly access the file system - only gorithms, thus allowing the compiler to generate highly-efficient loading data from the running binary is permitted - which allows code for specific parameters, data structures, and so on. This capa- for deployment within environments where file-system access is bility has been limited to those specializations that can be identi- either unavailable or prohibitively expensive. In addition, this re- fied when the application is compiled, and in many critical cases, quirement maintains the redistributibility of the binaries using the compiling all potentially-relevant specializations is not practical. JIT-compilation features (i.e., they can run on systems where the ClangJIT provides a well-integrated C++ language extension allow- source code is unavailable). For example, on large HPC deploy- ing template-based specialization to occur during program execu- ments, especially on supercomputers with distributed file systems, tion.
    [Show full text]
  • Overview of LLVM Architecture of LLVM
    Overview of LLVM Architecture of LLVM Front-end: high-level programming language => LLVM IR Optimizer: optimize/analyze/secure the program in the IR form Back-end: LLVM IR => machine code Optimizer The optimizer’s job: analyze/optimize/secure programs. Optimizations are implemented as passes that traverse some portion of a program to either collect information or transform the program. A pass is an operation on a unit of IR code. Pass is an important concept in LLVM. LLVM IR - A low-level strongly-typed language-independent, SSA-based representation. - Tailored for static analyses and optimization purposes. Part 1 Part 1 has two kinds of passes: - Analysis pass (section 1): only analyze code statically - Transformation pass (section 2 & 3): insert code into the program Analysis pass (Section 1) Void foo (uint32_t int, uint32_t * p) { LLVM IR ... Clang opt } test.c test.bc stderr mypass.so Transformation pass (Section 2 & 3) mypass.so Void foo (uint32_t int, uint32_t * p) { ... LLVM IR opt LLVM IR } test.cpp Int main () { test.bc test-ins.bc ... Clang++ foo () ... LLVM IR } Clang++ main.cpp main.bc LLVM IR lib.cpp Executable lib.bc Section 1 Challenges: - How to traverse instructions in a function http://releases.llvm.org/3.9.1/docs/ProgrammersManual.html#iterating-over-the-instruction-in-a-function - How to print to stderr Section 2 & 3 Challenges: 1. How to traverse basic blocks in a function and instructions in a basic block 2. How to insert function calls to the runtime library a. Add the function signature to the symbol table of the module Section 2 & 3 Challenges: 1.
    [Show full text]
  • Compiling a Higher-Order Smart Contract Language to LLVM
    Compiling a Higher-Order Smart Contract Language to LLVM Vaivaswatha Nagaraj Jacob Johannsen Anton Trunov Zilliqa Research Zilliqa Research Zilliqa Research [email protected] [email protected] [email protected] George Pîrlea Amrit Kumar Ilya Sergey Zilliqa Research Zilliqa Research Yale-NUS College [email protected] [email protected] National University of Singapore [email protected] Abstract +----------------------+ Scilla is a higher-order polymorphic typed intermediate | Blockchain Smart | | Contract Module | level language for implementing smart contracts. In this talk, | in C++ (BC) | +----------------------+ we describe a Scilla compiler targeting LLVM, with a focus + state variable | + ^ on mapping Scilla types, values, and its functional language foo.scilla | | | & message | fetch| | constructs to LLVM-IR. | | |update v v | The compiled LLVM-IR, when executed with LLVM’s JIT +--------------------------------------+---------------------------------+ framework, achieves a speedup of about 10x over the refer- | | | +-------------+ +----------------+ | ence interpreter on a typical Scilla contract. This reduced | +-----------------> |JIT Driver | +--> | Scilla Run-time| | | | |in C++ (JITD)| | Library in C++ | | latency is crucial in the setting of blockchains, where smart | | +-+-------+---+ | (SRTL) | | | | | ^ +----------------+ | contracts are executed as parts of transactions, to achieve | | | | | | | foo.scilla| | | peak transactions processed per second. Experiments on the | | | foo.ll| | | | | | | Ackermann
    [Show full text]
  • Using ID TECH Universal SDK Library Files in a C++ Project
    Using ID TECH Universal SDK Library Files in a C++ Project Introduction From time to time, customers who wish to use ID TECH's Universal SDK for Windows (which is .NET-based and comes with C# code examples) ask if it is possible to do development against the SDK solely in C++ (on Windows). The answer is yes. Universal SDK library files (DLLs) are COM-visible and ready to be accessed from C++ code. (SDK runtimes require the .NET Common Language Runtime, but your C++ binaries can still use the SDK.) Note that while the example shown in this document involves Microsoft's Visual Studio, it is also possible to use SDK libraries in C++ projects created in Eclipse or other IDEs. How to Use the IDTechSDK.dll File in a C++ Project: 1. Create a Visual C++ project in Visual Studio 2015 (shown below, an MFC Application as an example). 2. Change the properties of the Visual C++ project. Under the General tag, set Commom Language Runtime Support under Target Platform to "Common Language Runtime Support (/clr)" under Windows. 3. Under VC++ Directories, add the path to the C# .dll file(s) to Reference Directories. 4. Under C/C++ General, set Commom Language Runtime Support to "Common Language Runtime Support (/clr)." 5. Under C/C++ Preprocessor, add _AFXDLL to Preprocessor Definitions. 6. Under C/C++ Code Generation, change Runtime Library to "Multi-threaded DLL (/MD)." 7. Under Code Analysis General, change Rule Set to "Microsoft Mixed (C++ /CLR) Recommended Rules." 8. Use IDTechSDK.dll in your .cpp file. a.
    [Show full text]
  • Using Ld the GNU Linker
    Using ld The GNU linker ld version 2 January 1994 Steve Chamberlain Cygnus Support Cygnus Support [email protected], [email protected] Using LD, the GNU linker Edited by Jeffrey Osier (jeff[email protected]) Copyright c 1991, 92, 93, 94, 95, 96, 97, 1998 Free Software Foundation, Inc. Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided also that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another lan- guage, under the above conditions for modified versions. Chapter 1: Overview 1 1 Overview ld combines a number of object and archive files, relocates their data and ties up symbol references. Usually the last step in compiling a program is to run ld. ld accepts Linker Command Language files written in a superset of AT&T’s Link Editor Command Language syntax, to provide explicit and total control over the linking process. This version of ld uses the general purpose BFD libraries to operate on object files. This allows ld to read, combine, and write object files in many different formats—for example, COFF or a.out. Different formats may be linked together to produce any available kind of object file. See Chapter 5 [BFD], page 47, for more information. Aside from its flexibility, the gnu linker is more helpful than other linkers in providing diagnostic information.
    [Show full text]
  • Performance Analyses and Code Transformations for MATLAB Applications Patryk Kiepas
    Performance analyses and code transformations for MATLAB applications Patryk Kiepas To cite this version: Patryk Kiepas. Performance analyses and code transformations for MATLAB applications. Computa- tion and Language [cs.CL]. Université Paris sciences et lettres, 2019. English. NNT : 2019PSLEM063. tel-02516727 HAL Id: tel-02516727 https://pastel.archives-ouvertes.fr/tel-02516727 Submitted on 24 Mar 2020 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Préparée à MINES ParisTech Analyses de performances et transformations de code pour les applications MATLAB Performance analyses and code transformations for MATLAB applications Soutenue par Composition du jury : Patryk KIEPAS Christine EISENBEIS Le 19 decembre 2019 Directrice de recherche, Inria / Paris 11 Présidente du jury João Manuel Paiva CARDOSO Professeur, University of Porto Rapporteur Ecole doctorale n° 621 Erven ROHOU Ingénierie des Systèmes, Directeur de recherche, Inria Rennes Rapporteur Matériaux, Mécanique, Michel BARRETEAU Ingénieur de recherche, THALES Examinateur Énergétique Francois GIERSCH Ingénieur de recherche, THALES Invité Spécialité Claude TADONKI Informatique temps-réel, Chargé de recherche, MINES ParisTech Directeur de thèse robotique et automatique Corinne ANCOURT Maître de recherche, MINES ParisTech Co-directrice de thèse Jarosław KOŹLAK Professeur, AGH UST Co-directeur de thèse 2 Abstract MATLAB is an interactive computing environment with an easy programming language and a vast library of built-in functions.
    [Show full text]
  • Meson Manual Sample.Pdf
    Chapter 2 How compilation works Compiling source code into executables looks fairly simple on the surface but gets more and more complicated the lower down the stack you go. It is a testament to the design and hard work of toolchain developers that most developers don’t need to worry about those issues during day to day coding. There are (at least) two reasons for learning how the system works behind the scenes. The first one is that learning new things is fun and interesting an sich. The second one is that having a grasp of the underlying system and its mechanics makes it easier to debug the issues that inevitably crop up as your projects get larger and more complex. This chapter aims outline how the compilation process works starting from a single source file and ending with running the resulting executable. The information in this chapter is not necessary to be able to use Meson. Beginners may skip it if they so choose, but they are advised to come back and read it once they have more experience with the software build process. The treatise in this book is written from the perspective of a build system. Details of the process that are not relevant for this use have been simplified or omitted. Entire books could (and have been) written about subcomponents of the build process. Readers interested in going deeper are advised to look up more detailed reference works such as chapters 41 and 42 of [10]. 2.1 Basic term definitions compile time All operations that are done before the final executable or library is generated are said to happen during compile time.
    [Show full text]
  • Intel® Vtune™ Amplifier 2019 Update 3 Release Notes
    Intel® VTune™ Amplifier 2019 Update 3 Release Notes 8 March 2019 Intel® VTune™ Amplifier 2019 Update 3 Customer Support For technical support, including answers to questions not addressed in this product, visit the technical support forum, FAQs, and other support information at: https://software.intel.com/en-us/vtune/support/get-help http://www.intel.com/software/products/support/ https://software.intel.com/en-us/vtune Please remember to register your product at https://registrationcenter.intel.com/ by providing your email address. Registration entitles you to free technical support, product updates and upgrades for the duration of the support term. It also helps Intel recognize you as a valued customer in the support forum. NOTE: If your distributor provides technical support for this product, please contact them for support rather than Intel. Contents 1 Introduction 2 2 What’s New 3 3 System Requirements 6 4 Where to Find the Release 10 5 Installation Notes 11 6 Known Issues 11 7 Attributions 23 8 Legal Information 23 1 Introduction Intel® VTune™ Amplifier 2019 Update 3 provides an integrated performance analysis and tuning environment with graphical user interface that helps you analyze code performance on systems with IA-32 or Intel® 64 architectures. This document provides system requirements, issues and limitations, and legal information. VTune Amplifier has a standalone graphical user interface (GUI) as well as a command-line interface (CLI). Intel® VTune Amplifier for macOS* supports viewing of results collected on other OSs. Native collection on macOS* is not currently available. To learn more about this product, see: New features listed in the What’s New section below.
    [Show full text]
  • GNU Offloading and Multi Processing Runtime Library
    GNU Offloading and Multi Processing Runtime Library The GNU OpenMP and OpenACC Implementation Published by the Free Software Foundation 51 Franklin Street, Fifth Floor Boston, MA 02110-1301, USA Copyright c 2006-2017 Free Software Foundation, Inc. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with the Invariant Sections being \Funding Free Software", the Front-Cover texts being (a) (see below), and with the Back-Cover Texts being (b) (see below). A copy of the license is included in the section entitled \GNU Free Documentation License". (a) The FSF's Front-Cover Text is: A GNU Manual (b) The FSF's Back-Cover Text is: You have freedom to copy and modify this GNU Manual, like GNU software. Copies published by the Free Software Foundation raise funds for GNU development. i Short Contents Introduction ::::::::::::::::::::::::::::::::::::::::::::: 1 1 Enabling OpenMP :::::::::::::::::::::::::::::::::::: 3 2 Runtime Library Routines :::::::::::::::::::::::::::::: 5 3 Environment Variables :::::::::::::::::::::::::::::::: 19 4 Enabling OpenACC :::::::::::::::::::::::::::::::::: 25 5 OpenACC Runtime Library Routines :::::::::::::::::::: 27 6 OpenACC Environment Variables ::::::::::::::::::::::: 39 7 CUDA Streams Usage :::::::::::::::::::::::::::::::: 41 8 OpenACC Library Interoperability :::::::::::::::::::::: 43 9 The libgomp ABI :::::::::::::::::::::::::::::::::::: 47 10 Reporting Bugs ::::::::::::::::::::::::::::::::::::::
    [Show full text]
  • Know Your Personal Computer 3
    SERIES I ARTICLE Know Your Personal Computer 3. The Personal Computer System Software S K GhoshQI This article surveys system software organization in per­ sonal computers, using the IBM personal computer soft­ ware. Details of the hierarchical levels of the system soft­ ware organization are explained. Introduction Siddhartha Kumar Ghoshal works with An overview of the system software organization of a PC is given whatever goes on inside in Figure 1. BIOS (basic input output system) is the lowest level of parallel computers. That the operating system. It hides the details ofthe specific motherboard includes hardware, system and projects a higher level interface to the physical hardware. software, algorithms and applications. From his MSDOS (microsoft disk operating system), the most common early childhood he has operating system of the IBM PC uses it to run application pro­ designed and built grams. These programs can be written in anyone of a number of electronic gadgets. high-level languages (HLL) such as Pascal, C, FORTRAN. Each One of the most recent ones is a sixteen HLL presents the programmer with an abstract view of the processor parallel computer. computer with IBM PC motherboards. The complex operations supported by a HLL are implemented by a runtime library (RTL) specific to that language. The RTL makes calls to the MSDOS operating system so that various tasks may be performed by the IBM PC hardware and BIOS. Figure' System software of computers are organized· Organization of System Software into Levels in layers like an onion. Appllcotion progrom Organizing system software into many hierarchical levels or Runtime IIbrory MSDOS layers as shown in Figure 1 gives it the following advantages: BIOS II Hordware II Portability: Programs written using a PC can be moved, com­ piled and run on any other computer.
    [Show full text]
  • Using Ld the GNU Linker
    Using ld The GNU linker ld version 2 Version 2.17 Steve Chamberlain Ian Lance Taylor Red Hat Inc [email protected], [email protected] Using LD, the GNU linker Edited by Jeffrey Osier (jeff[email protected]) Copyright c 1991, 92, 93, 94, 95, 96, 97, 98, 99, 2000, 2001, 2002, 2003, 2004 Free Software Foundation, Inc. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.1 or any later version published by the Free Software Foundation; with no Invariant Sections, with no Front-Cover Texts, and with no Back-Cover Texts. A copy of the license is included in the section entitled “GNU Free Documentation License”. Chapter 1: Overview 1 1 Overview ld combines a number of object and archive files, relocates their data and ties up symbol references. Usually the last step in compiling a program is to run ld. ld accepts Linker Command Language files written in a superset of AT&T’s Link Editor Command Language syntax, to provide explicit and total control over the linking process. This version of ld uses the general purpose BFD libraries to operate on object files. This allows ld to read, combine, and write object files in many different formats—for example, COFF or a.out. Different formats may be linked together to produce any available kind of object file. See Chapter 5 [BFD], page 79, for more information. Aside from its flexibility, the gnu linker is more helpful than other linkers in providing diagnostic information. Many linkers abandon execution immediately upon encountering an error; whenever possible, ld continues executing, allowing you to identify other errors (or, in some cases, to get an output file in spite of the error).
    [Show full text]
  • XL C/C++ Compiler and Runtime Migration Guide for the Application Programmer
    z/OS Version 2 Release 3 XL C/C++ Compiler and Runtime Migration Guide for the Application Programmer IBM GC14-7306-30 Note Before using this information and the product it supports, read the information in “Notices” on page 129. This edition applies to Version 2 Release 3 of z/OS (5650-ZOS) and to all subsequent releases and modifications until otherwise indicated in new editions. Last updated: 2019-02-15 © Copyright International Business Machines Corporation 1996, 2017. US Government Users Restricted Rights – Use, duplication or disclosure restricted by GSA ADP Schedule Contract with IBM Corp. Contents About this document.............................................................................................xi z/OS XL C/C++ on the World Wide Web.................................................................................................... xix Where to find more information...........................................................................................................xix Technical support...................................................................................................................................... xix How to send your comments to IBM.........................................................................................................xix If you have a technical problem........................................................................................................... xx Part 1. Introduction..............................................................................................
    [Show full text]