Acknowledgments Diagnosing and Tolerating Bugs in Deployed Systems

Total Page:16

File Type:pdf, Size:1020Kb

Acknowledgments Diagnosing and Tolerating Bugs in Deployed Systems The Dissertation Committee for Michael David Bond certifies that this is the approved version of the following dissertation: Acknowledgments Diagnosing and Tolerating Bugs in Deployed Systems I am deeply grateful to Kathryn McKinley for supporting and mentor- by ing me in many ways. Kathryn has provided invaluable technical expertise Diagnosing and Tolerating Bugs in Deployed Systems and feedback even as we worked in new areas. She has been unwaveringly Michael David Bond, B.S., M.C.S. enthusiastic and positive about students and ideas and projects, and she has been a strong advocate, putting my and other students’ interests first. I en- tered graduate school uncertain about getting a Ph.D., and I leave inspired to pursue an academic career because of Kathryn. Committee: Steve Blackburn has been an enthusiastic supporter and has devoted a lot of his time to solving problems and giving advice, both solicited and unso- Copyright DISSERTATION Kathryn S. McKinley, Supervisor licited. Steve, Keshav Pingali, Peter Stone, and Emmett Witchel have given by Presented to the Faculty of the Graduate School of helpful feedback and spent a lot of time reading long documents and attending Michael David Bond Stephen M. Blackburn The University of Texas at Austin long talks. Vitaly Shmatikov and Steve Keckler have provided valuable advice 2008 in Partial Fulfillment and mentoring. David Padua and Craig Zilles were supportive advisors when Keshav Pingali of the Requirements I was a master’s student at the University of Ilinois. for the Degree of The graduate student community at UT has been incredibly support- Peter Stone ive. I am thankful to have Ben Wiedermann, Xianglong Huang, and Milind DOCTOR OF PHILOSOPHY Kulkarni as friends and colleagues. I am indebted to them and to the fol- Emmett Witchel lowing friends and colleagues for their technical and personal support: Kar- tik Agaram, Katherine Coons, Boris Grot, Sam Guyer, Jungwoo Ha, Maria Jump, Byeongcheol Lee, Bert Maher, Kristi Morton, Nick Nethercote, Phoebe THE UNIVERSITY OF TEXAS AT AUSTIN Nethercote, Alison Norman, Dimitris Prountzos, Jennifer Sartor, Simha Sethu- madhavan, and Suriya Subramaniam. In my cohort but outside my area, Jason December 2008 iv Davis, Justin Brickell, and Matt Taylor have been good friends and colleagues Diagnosing and Tolerating Bugs in Deployed Systems To diagnose post-deployment failures, programmers need to understand some embedded systems have no disk. Our second technique, leak pruning, without the good sense to be systems researchers. the program operations—control and data flow—responsible for failures. Prior addresses these limitations by automatically reclaiming likely leaked memory. approaches for widespread tracking of control and data flow often slow pro- It preserves semantics by waiting until heap exhaustion to reclaim memory— This thesis would have not have been possible without Jikes RVM. I am Publication No. indebted to all Jikes RVM developers and especially Steve Blackburn, Daniel grams by two times or more and increase memory usage significantly, making then intercepting program attempts to access reclaimed memory. them impractical for online use. We present novel techniques for representing Frampton, Robin Garner, David Grove, and Ian Rogers for their generous Michael David Bond, Ph.D. We demonstrate the utility and efficiency of post-deployment debugging control and data flow that add modest overhead while still providing diagnos- efforts maintaining and improving Jikes RVM. The University of Texas at Austin, 2008 on large, real-world programs—where they pinpoint bug causes and improve tic information directly useful for fixing bugs. The first technique, probabilistic I am thankful for guidance and help provided by Gem Naviar, Tom software availability. Post-deployment debugging efficiently exposes and ex- calling context (PCC), provides low-overhead context sensitivity to dynamic Horn, Aubrey Hooser, and Gloria Ramirez. Gloria Ramirez and Bill Mark Supervisor: Kathryn S. McKinley ploits programming language semantics and opens up a promising direction analyses that detect new or anomalous deployed behavior. Second, Bell statis- helped solve a two-body problem that would have prevented me from attending for improving software robustness. tically correlates control flow with data, and it reconstructs program locations UT. Intel funded my research with an internship and a fellowship, and Suresh associated with data. We apply Bell to leak detection, where it tracks and Srinivas has supported and mentored me. Deployed software is never free of bugs. These bugs cause software to fail, wasting billions of dollars and sometimes causing injury or death. Bugs reports program locations responsible for real memory leaks. The third tech- I am thankful for the unconditional love and support that my parents are pervasive in modern software, which is increasingly complex due to demand nique, origin tracking, tracks the originating program locations of unusable have provided throughout my life. for features, extensibility, and integration of components. Complete validation values such as null references, by storing origins in place of unusable values. My partner Julia has selflessly supported and tolerated me while also and exhaustive testing are infeasible for substantial software systems, and These origins are cheap to track and are directly useful for diagnosing real- being awesome and fun, and I am grateful. therefore deployed software exhibits untested and unanalyzed behaviors. world null pointer exceptions. Software behaves differently after deployment due to different environ- Post-deployment diagnosis helps developers find and fix bugs, but in ments and inputs, so developers cannot find and fix all bugs before deploying the meantime, users need help with failing software. We present techniques software, and they cannot easily reproduce post-deployment bugs outside of that tolerate memory leaks, which are particularly difficult to diagnose since the deployed setting. This dissertation argues that post-deployment is a com- they have no immediate symptoms and may take days or longer to mate- pelling environment for diagnosing and tolerating bugs, and it introduces a rialize. Our techniques effectively narrow the gap between reachability and general approach called post-deployment debugging. Techniques in this class liveness by providing the illusion that dead but reachable objects do not con- are efficient enough to go unnoticed by users and accurate enough to find and sume resources. The techniques identify stale objects not used in a while and report the sources of errors to developers. We demonstrate that they help de- remove them from the application and garbage collector’s working set. The velopers find and fix bugs and help users get more functionality out of failing first technique, Melt, relocates stale memory to disk, so it can restore objects if software. the program uses them later. Growing leaks exhaust the disk eventually, and v vi vii viii 3.2 Probabilistic Calling Context . 22 4.4.1 Methodology ........................ 60 6.2.3 Multithreading . 112 3.2.1 CallingContext ...................... 22 4.4.2 SPECjbb2000........................ 62 6.2.4 SavingStaleSpace . 113 Table of Contents 3.2.2 ProbabilisticApproach . 23 4.4.3 Eclipse ........................... 66 6.3 Results............................... 113 3.2.3 Computing Calling Context Values . 24 4.4.4 AdaptiveProfiling . 68 6.3.1 Melt’sOverhead . 114 3.2.4 Querying Calling Context Values . 27 4.4.5 Discussion ......................... 70 6.3.2 ToleratingLeaks . 120 Acknowledgments iv 3.3 Implementation .......................... 28 4.5 Performance ............................ 72 6.4 ConclusionandInterpretation . 135 3.3.1 ComputingthePCCvalue . 28 4.5.1 Methodology ........................ 72 Abstract vi 3.3.2 QueryingthePCCvalue. 29 4.5.2 SpaceOverhead ...................... 73 Chapter 7. Leak Pruning 137 3.3.3 Defining Calling Context . 30 4.5.3 CompilationOverhead. 73 7.1 ApproachandSemantics . 138 List of Tables xiv 3.4 Results............................... 32 4.5.4 TimeOverhead....................... 74 7.1.1 Motivation ......................... 139 7.1.2 TriggeringLeakPruning. 140 List of Figures xv 3.4.1 Deterministic Calling Context Profiling . 32 4.6 ConclusionandInterpretation . 77 3.4.2 PotentialPCCClients . 33 7.1.3 Reclaiming Reachable Memory . 144 Chapter 5. Tracking the Origins of Unusable Values 78 Chapter 1. Introduction 1 3.4.3 PCCAccuracy ....................... 34 7.1.4 Exception and Collection Semantics . 144 5.1 OriginTrackinginJava. 81 1.1 Bugs in Deployed Software Systems . 1 3.4.4 PCCPerformance . .. .. 36 7.2 AlgorithmandImplementation. 146 5.1.1 Supporting Nonzero Null References . 81 1.2 Improving Reliability in the Deployed Setting . .. 3 3.4.5 Evaluating Context Sensitivity . 41 7.2.1 PredictingDeadObjects. 146 5.1.2 EncodingProgramLocations . 82 1.2.1 Diagnosing Bugs by Tracking Flow . 4 3.5 ConclusionandInterpretation . 43 7.2.2 The OBSERVE State .................... 147 1.2.2 ToleratingMemoryLeaks . 6 5.1.3 RedefiningProgramOperations. 83 7.2.3 The SELECT State ..................... 148 1.3 MeaningandImpact ....................... 9 Chapter 4. Storing Per-Object Sites in a Bit with Bell 45 5.1.4 Implementation . .. .. 86 7.2.4 The PRUNE State ..................... 150 4.1 Encoding and Decoding Per-Object Information . 46 5.2 FindingandFixingBugs . 87 7.2.5 Intercepting Accesses to Pruned References . 151 Chapter 2. Background 11 4.1.1 Encoding .........................
Recommended publications
  • Apache Harmony Project Tim Ellison Geir Magnusson Jr
    The Apache Harmony Project Tim Ellison Geir Magnusson Jr. Apache Harmony Project http://harmony.apache.org TS-7820 2007 JavaOneSM Conference | Session TS-7820 | Goal of This Talk In the next 45 minutes you will... Learn about the motivations, current status, and future plans of the Apache Harmony project 2007 JavaOneSM Conference | Session TS-7820 | 2 Agenda Project History Development Model Modularity VM Interface How Are We Doing? Relevance in the Age of OpenJDK Summary 2007 JavaOneSM Conference | Session TS-7820 | 3 Agenda Project History Development Model Modularity VM Interface How Are We Doing? Relevance in the Age of OpenJDK Summary 2007 JavaOneSM Conference | Session TS-7820 | 4 Apache Harmony In the Beginning May 2005—founded in the Apache Incubator Primary Goals 1. Compatible, independent implementation of Java™ Platform, Standard Edition (Java SE platform) under the Apache License 2. Community-developed, modular architecture allowing sharing and independent innovation 3. Protect IP rights of ecosystem 2007 JavaOneSM Conference | Session TS-7820 | 5 Apache Harmony Early history: 2005 Broad community discussion • Technical issues • Legal and IP issues • Project governance issues Goal: Consolidation and Consensus 2007 JavaOneSM Conference | Session TS-7820 | 6 Early History Early history: 2005/2006 Initial Code Contributions • Three Virtual machines ● JCHEVM, BootVM, DRLVM • Class Libraries ● Core classes, VM interface, test cases ● Security, beans, regex, Swing, AWT ● RMI and math 2007 JavaOneSM Conference | Session TS-7820 |
    [Show full text]
  • Oracle Lifetime Support Policy for Oracle Fusion Middleware Guide
    ORACLE INFORMATION-DRIVEN SUPPORT Oracle Lifetime Support Policy Oracle Fusion Middleware Oracle Fusion Middleware 8 Oracle Fusion Middleware Releases 8 Application Development Tools 9 Oracle’s Application Development Tools 9 Oracle’s GraalVM Enterprise Releases 9 Oracle Cloud Application Foundation Releases 10 Oracle’s Sun and Glassfish Application Server Releases 12 Oracle’s Java Releases 13 Oracle’s Sun JDK Releases 13 Oracle’s Blockchain Platform Releases 14 Business Intelligence 14 Oracle Business Intelligence EE Releases 14 Oracle’s HyperRoll Releases 21 Oracle’s Siebel Technology Releases 22 Oracle’s Siebel Applications Releases 22 Oracle Big Data Discovery Releases 23 Oracle Endeca Information Discovery Releases 23 Oracle’s Endeca Releases 25 Master Data Management and Data Integrator 26 Oracle’s GoldenGate Releases 26 Oracle Data Integrator Releases 28 Oracle Data Integrator (Formerly Sunopsis) Releases 28 Oracle’s Sun Master Data Management and Data Integrator Releases 28 Oracle’s Silver Creek and EDQP Releases 29 Oracle's Datanomic and EDQ Releases 30 Oracle WebCenter Portal Releases 31 Oracle’s Sun Portal Releases 32 Oracle WebCenter Content Releases 32 Oracle’s Stellent Releases (Enterprise Content Management) 34 Oracle’s Captovation Releases (Enterprise Content Management) 35 Oracle WebCenter Sites Releases 36 Oracle FatWire Releases (WebCenter Sites) 36 Oracle Identity and Access Management Releases 37 Oracle’s Bharosa Releases 40 Oracle’s Passlogix Releases 41 Oracle’s Bridgestream Releases 41 Oracle’s Oblix Releases 42
    [Show full text]
  • Thread Scheduling in Multi-Core Operating Systems Redha Gouicem
    Thread Scheduling in Multi-core Operating Systems Redha Gouicem To cite this version: Redha Gouicem. Thread Scheduling in Multi-core Operating Systems. Computer Science [cs]. Sor- bonne Université, 2020. English. tel-02977242 HAL Id: tel-02977242 https://hal.archives-ouvertes.fr/tel-02977242 Submitted on 24 Oct 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. Ph.D thesis in Computer Science Thread Scheduling in Multi-core Operating Systems How to Understand, Improve and Fix your Scheduler Redha GOUICEM Sorbonne Université Laboratoire d’Informatique de Paris 6 Inria Whisper Team PH.D.DEFENSE: 23 October 2020, Paris, France JURYMEMBERS: Mr. Pascal Felber, Full Professor, Université de Neuchâtel Reviewer Mr. Vivien Quéma, Full Professor, Grenoble INP (ENSIMAG) Reviewer Mr. Rachid Guerraoui, Full Professor, École Polytechnique Fédérale de Lausanne Examiner Ms. Karine Heydemann, Associate Professor, Sorbonne Université Examiner Mr. Etienne Rivière, Full Professor, University of Louvain Examiner Mr. Gilles Muller, Senior Research Scientist, Inria Advisor Mr. Julien Sopena, Associate Professor, Sorbonne Université Advisor ABSTRACT In this thesis, we address the problem of schedulers for multi-core architectures from several perspectives: design (simplicity and correct- ness), performance improvement and the development of application- specific schedulers.
    [Show full text]
  • Design and Analysis of a Scala Benchmark Suite for the Java Virtual Machine
    Design and Analysis of a Scala Benchmark Suite for the Java Virtual Machine Entwurf und Analyse einer Scala Benchmark Suite für die Java Virtual Machine Zur Erlangung des akademischen Grades Doktor-Ingenieur (Dr.-Ing.) genehmigte Dissertation von Diplom-Mathematiker Andreas Sewe aus Twistringen, Deutschland April 2013 — Darmstadt — D 17 Fachbereich Informatik Fachgebiet Softwaretechnik Design and Analysis of a Scala Benchmark Suite for the Java Virtual Machine Entwurf und Analyse einer Scala Benchmark Suite für die Java Virtual Machine Genehmigte Dissertation von Diplom-Mathematiker Andreas Sewe aus Twistrin- gen, Deutschland 1. Gutachten: Prof. Dr.-Ing. Ermira Mezini 2. Gutachten: Prof. Richard E. Jones Tag der Einreichung: 17. August 2012 Tag der Prüfung: 29. Oktober 2012 Darmstadt — D 17 For Bettina Academic Résumé November 2007 – October 2012 Doctoral studies at the chair of Prof. Dr.-Ing. Er- mira Mezini, Fachgebiet Softwaretechnik, Fachbereich Informatik, Techni- sche Universität Darmstadt October 2001 – October 2007 Studies in mathematics with a special focus on com- puter science (Mathematik mit Schwerpunkt Informatik) at Technische Uni- versität Darmstadt, finishing with a degree of Diplom-Mathematiker (Dipl.- Math.) iii Acknowledgements First and foremost, I would like to thank Mira Mezini, my thesis supervisor, for pro- viding me with the opportunity and freedom to pursue my research, as condensed into the thesis you now hold in your hands. Her experience and her insights did much to improve my research as did her invaluable ability to ask the right questions at the right time. I would also like to thank Richard Jones for taking the time to act as secondary reviewer of this thesis.
    [Show full text]
  • Virtual Appliances for Applications High Performance, High Density & Operationally Efficient Java Virtualization
    Virtual Appliances for Applications High Performance, High Density & Operationally Efficient Java Virtualization Axel Grosse Principal Sales Consultant Server Technologies Competence Center – FMW Mitte 1 The following is intended to outline our general product direction. It is intended for information purposes only, and may not be incorporated into any contract. It is not a commitment to deliver any material, code, or functionality, and should not be relied upon in making purchasing decisions. The development, release, and timing of any features or functionality described for Oracle’s products remains at the sole discretion of Oracle. 2 Cloud auf dem Peak der Hype Kurve Source: Gartner "Hype Cycle for Cloud Computing, 2009" Research Note G00168780 3 SaaS, PaaS und IaaS Anwendungen als Service für Software as a Service Endbenutzer im Netzwerk Entwicklungs- und Deployment Platform as a Service Plattformen als Service im Netzwerk Server, Storage und Netzwerk Infrastructure as a Service Hardware samt dazugehöriger Software als Service im Netzwerk 4 Public Clouds und Private Clouds Public Clouds Private Cloud • Externer Anbieter • Eigene IT als Anbieter • Weniger Aufwand I I SaaS SaaS N N • Mehr Aufwand • Weniger Einfluss T T PaaS auf PaaS E R • Mehr Einfluss A R IaaS •Sicherheit N N IaaS •Verfügbarkeit E E T T •... Benutzer 5 Cloud Computing: Oracle’s Perspektive • Basiert auf neuen Ideen und Möglichkeiten, basiert jedoch auf etablierter Technologie • Interessante Vorteile begleitet von ernstzunehmenden Bedenken • Unternehmen werden einen
    [Show full text]
  • Jikes RVM and IBM DK for Java ƒ Understanding System Behavior ƒ Other Issues 4
    Dynamic Compilation and Adaptive Optimization in Virtual Machines Instructor: Michael Hind Material contributed by: Matthew Arnold, Stephen Fink, David Grove, and Michael Hind © 2006 IBM Corporation IBM Research Who am I? Helped build Jikes RVM (1998-2006) – GC Maps, live analysis, dominators, register allocation refactoring – Adaptive optimization system – Management, project promotion, education, etc. Work for IBM, home of 2 other Java VMs – IBM DK for Java, J9 In previous lives, worked on – Automatic parallelization (PTran) – Ada implementation (Phd Thesis) – Interprocedural ptr analysis – Professor for 6 years Excited to share what I know – And learn what I don’t! 2 ACACES’06 | Dynamic Compilation and Adaptive Optimization in Virtual Machines | July 24-28, 2006 © 2006 IBM Corporation IBM Research Course Goals Understand the optimization technology used in production virtual machines Provide historical context of dynamic/adaptive optimization technology Debunk common misconceptions Suggest avenues of future research 3 ACACES’06 | Dynamic Compilation and Adaptive Optimization in Virtual Machines | July 24-28, 2006 © 2006 IBM Corporation IBM Research Course Outline 1. Background 2. Engineering a JIT Compiler 3. Adaptive Optimization 4. Feedback-Directed and Speculative Optimizations 5. Summing Up and Looking Forward 4 ACACES’06 | Dynamic Compilation and Adaptive Optimization in Virtual Machines | July 24-28, 2006 © 2006 IBM Corporation IBM Research Course Outline 1. Background Why software optimization matters Myths, terminology, and historical context How programs are executed 2. Engineering a JIT Compiler What is a JIT compiler? Case studies: Jikes RVM, IBM DK for Java, HotSpot High level language-specific optimizations VM/JIT interactions 3. Adaptive Optimization Selective optimization Design: profiling and recompilation Case studies: Jikes RVM and IBM DK for Java Understanding system behavior Other issues 4.
    [Show full text]
  • A Comparative Study of Garbage Collection Techniques in Java Virtual Machines
    Sindh Univ. Res. Jour. (Sci. Ser.) Vol.44 (4) 667- 672 (2012) SINDH UNIVERSITY RESEARCH JOURNAL (SCIENCE SERIES) A Comparative Study of Garbage Collection Techniques in Java Virtual Machines S. IQBAL, M.A. KHAN, I.A. MEMON* Department of Computer Science, Bahauddin Zakariya University, Pakistan. Received 07th February 2012 and Revised 12th July 2012 Abstract: Garbage collection mechanisms implemented in Java Virtual Machines (JVMs) are used to reclaim memory allocated to the objects that become inaccessible during program execution. An efficient garbage collection mechanism certainly facilitates in smooth running of an application. This paper performs a comparative analysis of garbage collection techniques implemented in Sun HotSpot, Oracle JRockit and IBM J9 virtual machines. We perform experiments with several benchmarks containing dynamic creation for objects of TreeMap, ArrayList and String array data types. Due to the creation of a large number of big sized memory objects and loss of references, the garbage is created that is collected by the garbage collectors implemented in the virtual machines. The experiments are carried out on different hardware architectures including Intel Core 2 Quad and Intel Xeon based systems. The performance of each garbage collector is computed in terms of the rate of garbage collection that mainly depends upon the strategy implemented for garbage collection. Our results show that the Sun HotSpot garbage collector performs 4.66 times better than the Oracle JRockit and 144.06 times better than the IBM J9 garbage collectors. Keywords: Garbage Collection, Java Virtual Machines, JRockit, IBM J9, Sun HotSpot, Bytecode. This paper contributes towards a performance 1. INTRODUCTION Java is a widely used language that is analysis of the garbage collection approaches implemented on a large variety of platforms ranging implemented in virtual machines.
    [Show full text]
  • Using HPM-Sampling to Drive Dynamic Compilation
    Using HPM-Sampling to Drive Dynamic Compilation Dries Buytaerty Andy Georgesy Michael Hind∗ Matthew Arnold∗ Lieven Eeckhouty Koen De Bosscherey y Department of Electronics and Information Systems, Ghent University, Belgium ∗IBM T.J. Watson Research Center, New York, NY, USA fdbuytaer,[email protected], fhindm,[email protected], fleeckhou, [email protected] Abstract guage require a dynamic execution environment called a All high-performance production JVMs employ an adaptive virtual machine (VM). To achieve high performance, pro- strategy for program execution. Methods are first executed duction Java virtual machines contain at least two modes unoptimized and then an online profiling mechanism is used of execution: 1) unoptimized execution, using interpreta- to find a subset of methods that should be optimized during tion [21, 28, 18] or a simple dynamic compiler [16, 6, 10, 8] the same execution. This paper empirically evaluates the de- that produces code quickly, and 2) optimized execution us- sign space of several profilers for initiating dynamic com- ing an optimizing dynamic compiler. Methods are first ex- pilation and shows that existing online profiling schemes ecuted using the unoptimized execution strategy. An online suffer from several limitations. They provide an insufficient profiling mechanism is used to find a subset of methods to number of samples, are untimely, and have limited accu- optimize during the same execution. Many systems enhance racy at determining the frequently executed methods. We de- this scheme to provide multiple levels of optimized execu- scribe and comprehensively evaluate HPM-sampling, a sim- tion [6, 18, 28], with increasing compilation cost and bene- ple but effective profiling scheme for finding optimization fits at each level.
    [Show full text]
  • Security Policy Level 1
    20.10.20 RSA® BSAFE® Crypto-J JSAFE and JCE Software Module 6.2 and 6.2.1.1 Security Policy Level 1 This document is a non-proprietary security policy for RSA BSAFE Crypto-J JSAFE and JCE Software Module 6.2 and 6.2.1.1 (Crypto-J JSAFE and JCE Software Module) security software. This document may be freely reproduced and distributed whole and intact including the copyright notice. Note: Refer to the Change Summary for the location of the latest change to this document. Contents: Preface .............................................................................................................2 Terminology .............................................................................................2 Document Organization .........................................................................2 1 The Cryptographic Module .........................................................................3 1.1 Introduction ........................................................................................3 1.2 Module Characteristics .....................................................................3 1.3 Module Interfaces ............................................................................10 1.4 Roles and Services ......................................................................... 11 1.5 Cryptographic Key Management ..................................................23 1.6 Cryptographic Algorithms ...............................................................26 1.7 Self-tests ...........................................................................................28
    [Show full text]
  • SIMD Intrinsics on Managed Language Runtimes
    1 56 2 SIMD Intrinsics on Managed Language Runtimes 57 3 58 4 Anonymous Author(s) 59 5 60 6 Abstract speedup, but neither languages like Java, JavaScript, Python, 61 7 Managed language runtimes such as the Java Virtual Ma- or Ruby, nor their managed runtimes, provide direct access 62 8 chine (JVM) provide adequate performance for a wide range to SIMD facilities. This means that SIMD optimizations, if 63 9 of applications, but at the same time, they lack much of the available at all, are left to the virtual machine (VM) and the 64 10 low-level control that performance-minded programmers built-in just-in-time (JIT) compiler to carry out automatically, 65 11 appreciate in languages like C/C++. One important example which often leads to suboptimal code. As a result, developers 66 12 of such a control is the intrinsics interface that expose in- may be pushed to use low-level languages such as C/C++ to 67 13 structions of SIMD (Single Instruction Multiple Data) vector gain access to the intrinsics API. But leaving the high-level 68 14 ISAs (Instruction Set Architectures). In this paper we present ecosystem of Java or other languages also means to abandon 69 15 an automatic approach for including native intrinsics in the many high-level abstractions that are key for the produc- 70 16 runtime of a managed language. Our implementation con- tive and efficient development of large-scale applications, 71 17 sists of two parts. First, for each vector ISA, we automatically including access to a large set of libraries.
    [Show full text]
  • Trace Register Allocation
    Submitted by DI Josef Eisl, BSc. Submitted at Institute for System Software Supervisor and First Examiner o.Univ.-Prof. DI Dr.Dr.h.c. Hanspeter Mössenböck Second Examiner Ao.Univ.-Prof. DI Dr. Andreas Krall October 2018 Trace Register Allocation Doctoral Thesis to obtain the academic degree of Doktor der technischen Wissenschaften in the Doctoral Program Technische Wissenschaften JOHANNES KEPLER UNIVERSITY LINZ Altenbergerstraße 69 4040 Linz, Österreich www.jku.at DVR 0093696 Oracle, Java, HotSpot, and all Java-based trademarks are trademarks or registered trademarks of Oracle in the United States and other countries. All other product names mentioned herein are trademarks or registered trademarks of their respective owners. In memory of my brother. (Wolfgang Eisl, 1973–2016) v Abstract Register allocation, i.e., mapping the variables of a programming language to the physical reg- isters of a processor, is a mandatory task for almost every compiler and consumes a significant portion of the compile time. In a just-in-time compiler, compile time is a particular issue because compilation happens during program execution and contributes to the overall application run time. Compilers often use global register allocation approaches, such as graph coloring or linear scan, which only have limited potential for improving compile time since they process a whole method at once. With growing methods sizes, these approaches are reaching their scalability boundary due to their limited flexibility. We developed a novel trace register allocation framework, which competes with global approaches in both, compile time and code quality. Instead of processing a whole method at once, our al- locator processes linear code segments (traces) independently and is therefore able to (1) select different allocation strategies based on the characteristics of a trace in order to control thetrade- off between compile time and peak performance, and (2) to allocate traces in parallel inorderto reduce compilation latency, i.e., the time until the result of a compilation is available.
    [Show full text]
  • Bachelor Degree Project Evaluation of Graalvm Performance for Java
    Bachelor Degree Project Evaluation of GraalVM Performance for Java Programs Author: Robin Larsson Supervisor: Sabri Pllana Semester: VT 2020 Subject: Computer Science Abstract GraalVM is a new Java Development Kit developed by Oracle that promises improved performance when running Java programs. In this paper we compare the performance of both the community edition and the enterprise edition of GraalVM to OpenJDK and OracleJDK, using both Java 8 and Java 11. We use the DaCapo bench- mark suite to test these JDKs. The results are analysed using statistically rigorous methodology. We find that the performance of the different JDKs vary significantly depending on the benchmark, making it difficult to draw any definitive conclusions. In the end we can see that GraalVM Enterprise Edition using Java 8 will outperform the other JDKs tested in the majority of cases. Keywords: Java, GraalVM, performance, JDK, JVM Preface I would like to extend my thanks to my supervisor Sabri Pllana for all his advice and support during this project. Contents List of Figures List of Tables 1 Introduction1 1.1 Background.................................1 1.2 Related work................................1 1.3 Problem formulation............................2 1.4 Motivation..................................2 1.5 Objectives..................................2 1.6 Scope....................................3 1.7 Target group.................................4 1.8 About the JVM...............................4 1.8.1 Garbage collection.........................4 1.8.2 The Java HotSpot
    [Show full text]