Full-System Simulation of Java Workloads with RISC-V and the Jikes Research Virtual Machine

Total Page:16

File Type:pdf, Size:1020Kb

Full-System Simulation of Java Workloads with RISC-V and the Jikes Research Virtual Machine Full-System Simulation of Java Workloads with RISC-V and the Jikes Research Virtual Machine Martin Maas Krste Asanović John Kubiatowicz University of California, Berkeley University of California, Berkeley University of California, Berkeley [email protected] [email protected] [email protected] ABSTRACT architecture research. Specifically, all of the major approaches fall Managed languages such as Java, JavaScript or Python account for short when applied to managed-language applications: a large portion of workloads, both in cloud data centers and on • High-level full-system simulators do not provide the fidelity mobile devices. It is therefore unsurprising that there is an inter- to fully capture managed-language workloads. These work- est in hardware-software co-design for these languages. However, loads often interact at very small time-scales. For example, existing research infrastructure is often unsuitable for this kind of garbage collectors may introduce small delays of ≈ 10 cycles research: managed languages are sensitive to fine-grained inter- each, scattered through the application [10]. Cumulatively, actions that are not captured by high-level architectural models, these delays add up to substantial overheads but individually, yet are also too long-running and irregular to be simulated using they can only be captured with a high-fidelity model. cycle-accurate software simulators. • Software-based cycle-accurate simulators are too slow for Open-source hardware based on the RISC-V ISA provides an managed workloads. These simulators typically achieve on opportunity to solve this problem, by running managed workloads the order of 400 KIPS [17], or 1s of simulated time per 1.5h on RISC-V systems in FPGA-based full-system simulation. This of simulation (per core). Managed-language workloads are approach achieves both the accuracy and simulation speeds re- typically long-running (i.e., a minute and more) and run quired for managed workloads, while enabling modification and across a large number of cores, which means that simulating design-space exploration for the underlying hardware. an 8-core workload for 1 minute takes around a month. A crucial requirement for this hardware-software research is a • Native workloads often take advantage of sampling-based managed runtime that can be easily modified. The Jikes Research approaches, or use solutions such as Simpoints [20] to deter- Virtual Machine (JikesRVM) is a Java Virtual Machine that was mine regions of interest in workloads and then only simulate developed specifically for this purpose, and has become the gold those regions. This does not work for managed workloads, standard in managed-language research. In this paper, we describe as they consist of several components running in parallel our experience of porting JikesRVM to the RISC-V infrastructure. and affecting each other, including the garbage collector, JIT We discuss why this combined setup is necessary, and how it en- compiler and features with dynamically changing state (such ables hardware-software research for managed languages that was as biased locks, inline caching for dynamic dispatch, etc.). infeasible with previous infrastructure. In addition, managed application performance is often not dominated by specific kernels or regions of interests, which makes approaches that change between high-level and de- 1 INTRODUCTION tailed simulation modes (e.g., MARSSx86 [17], Sniper [9]) unsuitable for many of these workloads. Managed languages such as Java, JavaScript and Python account for a large portion of workloads [16]. A substantial body of work For these reasons, a large fraction of managed-language research suggests that managed-language runtimes can significantly benefit relies on stock hardware for experimentation. While this has en- from hardware support and hardware-software co-design [10, 13, 21, abled a large amount of research on improving garbage collectors, 22]. However, despite their pervasiveness, these types of workloads JIT compilers and runtime system abstractions, there has been rela- are often underrepresented in computer architecture research, and tively little research on hardware-software co-design for managed most papers in premier conferences use native workloads such as languages. Further, the research that does exist in this area typically SPEC CPU to evaluate architectural ideas. explores a single design point, often in the context of a released While native workloads represent an important subset of appli- chip or product, such as Azul’s Vega appliance [10]. Architectural cations, they are not representative of a large fraction of workloads design-space exploration is rare, especially in academia. in some of the most important spaces, including cloud and mobile. We believe that easy-to-modify open-source hardware based This disconnect between real-world workloads and evaluation was on the RISC-V ISA, combined with an easy-to-modify managed- pointed out in a prominent Communications-of-the-ACM article language runtime system, can provide an opportunity to address almost 10 years ago [7], but not much has changed since then. A this problem and perform hardware-software research that was part of the problem is arguably that there is currently no good infeasible before. Both pieces of infrastructure already exists: way to evaluate managed languages in the context of computer On one hand, the RocketChip SoC generator [5] provides the infrastructure to generate full SoCs that are realistic (i.e., used in products), and can target both ASIC and FPGA flows. Using an 1st Workshop on Computer Architecture Research with RISC-V, 10/14/2017, Boston, MA 2017. ACM ISBN 978-x-xxxx-xxxx-x/YY/MM. FPGA-based simulation framework such as Strober [14] enables https://doi.org/10.1145/nnnnnnn.nnnnnnn simulating the performance of real RocketChip SoCs at high-fidelity, 1 with FPGA frequencies of 30-100 MHz. This means that this infras- JikesRVM Step 1: Load JikesRVM into itself tructure can achieve the realism, fidelity and simulation speed required to simulate managed-language workloads. JikesRVM Step 2: JIT compiler produces JIT Compiler On the other hand, infrastructure exists for managed-language re- code and stores it to memory search. Specifically, the Jikes Research Virtual Machine (JikesRVM) is a Java VM geared towards experimentation. JikesRVM is easy to Address ObjectReference Word modify, thanks to being written in a high-level language (Java) and using a modular software design that facilitates changing compo- Image nents such as the object layout, GC or JIT passes. Copy compiled code and state We believe that bringing these two projects together will enable Existing “Bootstrap” JVM Step 3: Store novel hardware-software research. In this paper, we present one Image to disk important step towards this vision, by porting JikesRVM to RISC-V. We first discuss why such a port is necessary. We then describe Figure 1: Building the JikesRVM. the porting effort in detail, in the hope that it will be helpful for others porting managed runtime systems to RISC-V. Finally, we demonstrate the running system, and show the research it enables. Java JikesRVM Program In JIT-generated code, primitives Address ObjectReference Word map to actual operations 2 BACKGROUND The shortcomings of existing infrastructure to perform managed- Step 5: Resume at “boot” function. language research have been well-established. For example, Yang Image et al. demonstrated that sampling Java applications at 100 KHz or Step 4: Load boot image into less misses important performance characteristics [23]. Bootloader (C code) memory (bootloader implements Another example is a 2005 paper by Hertz and Berger [11]: In native calls, fault handlers, etc.) order to investigate trade-offs between manual and automatic mem- ory management, the authors had to instrument an existing runtime Figure 2: Running the JikesRVM. system to extract allocated memory addresses, and – in a second pass – inject addresses produced by an oracle. The authors found timing models for off-chip components such as DRAM (running that this was difficult to achieve in software, as the software instru- either on the FPGA or on a host machine). This approach can real- mentation led to a 2-33% perturbation in execution time, which was istically simulate the performance of an ASIC implementation, and larger than the effect they were trying to measure. They therefore provides a combination of accuracy, simulation speed and modifia- decided to use a software simulator (Dynamic SimpleScalar [12]) for bility that makes hardware and software co-design feasible. these experiments. While appropriate in this setting, this approach is often problematic in terms of simulation speed and the reliability 3 THE JIKES RVM of the resulting performance numbers. To facilitate this type of research, several projects have tried To experiment with managed runtimes, we require a runtime system to enable simulation of managed workloads. Zsim [18] enables that can be easily modified. We picked the Jikes Research VM[4], long-running multi-core workloads by using dynamic instrumenta- which is the de facto standard in managed-language research. tion, but this approach sacrifices accuracy and cannot account for Jikes is a VM for Java, and is highly representative of other man- fine-grained interactions such as write-barriers in garbage collec- aged runtime systems. We ported JikesRVM and its non-optimizing tors. Other examples are MARSSx86 [17] and Sniper [9], which are Baseline JIT compiler to RISC-V. To our knowledge, this results full-system emulators that can fast-forward to regions of interest in the first full-system platform for hardware-software research and then simulate those regions at high fidelity. Both simulators on Java applications, allowing modification of the entire hardware have been used to simulate Java workloads [8, 19]. However, this and software stack. In the following section, we describe our port. approach is only appropriate if short, representative regions can We particularly focus on aspects that will be useful for authors of be found, and architectural state does not build up slowly.
Recommended publications
  • Bypassing Portability Pitfalls of High-Level Low-Level Programming
    Bypassing Portability Pitfalls of High-level Low-level Programming Yi Lin, Stephen M. Blackburn Australian National University [email protected], [email protected] Abstract memory-safety, encapsulation, and strong abstraction over hard- Program portability is an important software engineering consider- ware [12], which are desirable goals for system programming as ation. However, when high-level languages are extended to effec- well. Thus, high-level languages are potential candidates for sys- tively implement system projects for software engineering gain and tem programming. safety, portability is compromised—high-level code for low-level Prior research has focused on the feasibility and performance of programming cannot execute on a stock runtime, and, conversely, applying high-level languages to system programming [1, 7, 10, a runtime with special support implemented will not be portable 15, 16, 21, 22, 26–28]. The results showed that, with proper ex- across different platforms. tension and restriction, high-level languages are able to undertake We explore the portability pitfall of high-level low-level pro- the task of low-level programming, while preserving type-safety, gramming in the context of virtual machine implementation tasks. memory-safety, encapsulation and abstraction. Notwithstanding the Our approach is designing a restricted high-level language called cost for dynamic compilation and garbage collection, the perfor- RJava, with a flexible restriction model and effective low-level ex- mance of high-level languages when used to implement a virtual tensions, which is suitable for different scopes of virtual machine machine is still competitive with using a low-level language [2]. implementation, and also suitable for a low-level language bypass Using high-level languages to architect large systems is bene- for improved portability.
    [Show full text]
  • Here I Led Subcommittee Reports Related to Data-Intensive Science and Post-Moore Computing) and in CRA’S Board of Directors Since 2015
    Vivek Sarkar Curriculum Vitae Contents 1 Summary 2 2 Education 3 3 Professional Experience 3 3.1 2017-present: College of Computing, Georgia Institute of Technology . 3 3.2 2007-present: Department of Computer Science, Rice University . 5 3.3 1987-2007: International Business Machines Corporation . 7 4 Professional Awards 11 5 Research Awards 12 6 Industry Gifts 15 7 Graduate Student and Other Mentoring 17 8 Professional Service 19 8.1 Conference Committees . 20 8.2 Advisory/Award/Review/Steering Committees . 25 9 Keynote Talks, Invited Talks, Panels (Selected) 27 10 Teaching 33 11 Publications 37 11.1 Refereed Conference and Journal Publications . 37 11.2 Refereed Workshop Publications . 51 11.3 Books, Book Chapters, and Edited Volumes . 58 12 Patents 58 13 Software Artifacts (Selected) 59 14 Personal Information 60 Page 1 of 60 01/06/2020 1 Summary Over thirty years of sustained contributions to programming models, compilers and runtime systems for high performance computing, which include: 1) Leading the development of ASTI during 1991{1996, IBM's first product compiler component for optimizing locality, parallelism, and the (then) new FORTRAN 90 high-productivity array language (ASTI has continued to ship as part of IBM's XL Fortran product compilers since 1996, and was also used as the foundation for IBM's High Performance Fortran compiler product); 2) Leading the research and development of the open source Jikes Research Virtual Machine at IBM during 1998{2001, a first-of-a-kind Java Virtual Machine (JVM) and dynamic compiler implemented
    [Show full text]
  • Techniques for Real-System Characterization of Java Virtual Machine Energy and Power Behavior Gilberto Contreras Margaret Martonosi
    Techniques for Real-System Characterization of Java Virtual Machine Energy and Power Behavior Gilberto Contreras Margaret Martonosi Department of Electrical Engineering Princeton University 1 Why Study Power in Java Systems? The Java platform has been adopted in a wide variety of devices Java servers demand performance, embedded devices require low-power Performance is important, power/energy/thermal issues are equally important How do we study and characterize these requirements in a multi-layer platform? 2 Power/Performance Design Issues Java Application Java Virtual Machine Operating System Hardware 3 Power/Performance Design Issues Java Application Garbage Class Runtime Execution Collection LoaderJava VirtualCompiler MachineEngine Operating System Hardware How do the various software layers affect power/performance characteristics of hardware? Where should time be invested when designing power and/or thermally aware Java virtual Machines? 4 Outline Approaches for Energy/Performance Characterization of Java virtual machines Methodology Breaking the JVM into sub-components Hardware-based power/performance characterization of JVM sub-components Results Jikes & Kaffe on Pentium M Kaffe on Intel XScale Conclusions 5 Power & Performance Analysis of Java Simulation Approach √ Flexible: easy to model non-existent hardware x Simulators may lack comprehensiveness and accuracy x Thermal studies require tens of seconds granularity Accurate simulators are too slow Hardware Approach √ Able to capture full-system characteristics
    [Show full text]
  • Fedora Core, Java™ and You
    Fedora Core, Java™ and You Gary Benson Software Engineer What is Java? The word ªJavaº is used to describe three things: The Java programming language The Java virtual machine The Java platform To support Java applications Fedora needs all three. What Fedora uses: GCJ and ECJ GCJ is the core of Fedora©s Java support: GCJ includes gcj, a compiler for the Java programming language. GCJ also has a runtime and class library, collectively called libgcj. The class library is separately known as GNU Classpath. ECJ is the Eclipse Compiler for Java: GCJ©s compiler gcj is not used for ªtraditionalº Java compilation. More on that later... Why libgcj? There are many free Java Virtual machines: Cacao, IKVM, JamVM, Jikes RVM, Kaffe, libgcj, Sable VM, ... There are two main reasons Fedora uses libgcj: Availability on many platforms. Ability to use precompiled native code. GNU Classpath Free core class library for Java virtual machines and compilers. The JPackage Project A collection of some 1,600 Java software packages for Linux: Distribution-agnostic RPM packages. Both runtimes/development kits and applications. Segregation between free and non-free packages. All free packages built entirely from source. Multiple runtimes/development kits may be installed. Fedora includes: JPackage-compatible runtime and development kit packages. A whole bunch of applications. JPackage JOnAS Fedora©s Java Compilers gcj can operate in several modes: Java source (.java) to Java bytecode (.class) Java source (.java) to native machine code (.o) Java bytecode (.class, .jar) to native machine code (.o) In Fedora: ECJ compiles Java source to bytecode. gcj compiles that bytecode to native machine code.
    [Show full text]
  • Java in Embedded Linux Systems
    Java in Embedded Linux Systems Java in Embedded Linux Systems Thomas Petazzoni / Michael Opdenacker Free Electrons http://free-electrons.com/ Created with OpenOffice.org 2.x Java in Embedded Linux Systems © Copyright 2004-2007, Free Electrons, Creative Commons Attribution-ShareAlike 2.5 license http://free-electrons.com Sep 15, 2009 1 Rights to copy Attribution ± ShareAlike 2.5 © Copyright 2004-2008 You are free Free Electrons to copy, distribute, display, and perform the work [email protected] to make derivative works to make commercial use of the work Document sources, updates and translations: Under the following conditions http://free-electrons.com/articles/java Attribution. You must give the original author credit. Corrections, suggestions, contributions and Share Alike. If you alter, transform, or build upon this work, you may distribute the resulting work only under a license translations are welcome! identical to this one. For any reuse or distribution, you must make clear to others the license terms of this work. Any of these conditions can be waived if you get permission from the copyright holder. Your fair use and other rights are in no way affected by the above. License text: http://creativecommons.org/licenses/by-sa/2.5/legalcode Java in Embedded Linux Systems © Copyright 2004-2007, Free Electrons, Creative Commons Attribution-ShareAlike 2.5 license http://free-electrons.com Sep 15, 2009 2 Best viewed with... This document is best viewed with a recent PDF reader or with OpenOffice.org itself! Take advantage of internal
    [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]
  • A Deployable Sampling Strategy for Data Race Detection
    A Deployable Sampling Strategy for Data Race Detection Yan Cai1, Jian Zhang1, Lingwei Cao1, and Jian Liu2 1 State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China 2 Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China [email protected], [email protected], [email protected], [email protected] ABSTRACT to a shared memory location should be protected by a common set Dynamic data race detection incurs heavy runtime overheads. of locks. However, even violating such a discipline, no data race Recently, many sampling techniques have been proposed to detect may occur [8][12][19]. The Happens-before relation [29] is usual- data races. However, some sampling techniques (e.g., Pacer) are ly implemented via vector clocks [19]. Each vector clock contains based on traditional happens-before relation and incur a large n clock elements, where n is the number of threads. They are used basic overhead. Others utilize hardware to reduce their sampling to track statuses of threads, locks, and memory locations. Race overhead (e.g., DataCollider) and they, however, detect a race detectors implementing vector clocks incur higher overhead than only when the race really occurs by delaying program executions. the lockset based ones. FastTrack [19] further improves the over- In this paper, we study the limitations of existing techniques and head of the happens-before based race detectors to be the same propose a new data race definition, named as Clock Races, for low level as that of lockset based ones by avoiding most of O(n) oper- overhead sampling purpose.
    [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]
  • Code Coagulation Is an Effective Compilation Technique
    CODE COAGULATION IS AN EFFECTIVE COMPILATION TECHNIQUE FOR THE JVM by Shruthi Padmanabhan Bachelor of Engineering in Information Science, Visvesvaraya Technological University, 2009 A thesis presented to Ryerson University in partial fulfillment of the requirements for the degree of Master of Science in the program of Computer Science Toronto, Ontario, Canada, 2018 c Shruthi Padmanabhan, 2018 Author's Declaration I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I authorize Ryerson University to lend this thesis to other institutions or individuals for the purpose of scholarly research. I further authorize Ryerson University to reproduce this thesis by photocopying or by other means, in total or in part, at the request of other institutions or individuals for the purpose of scholarly research. I understand that my thesis may be made electronically available to the public for the purpose of scholarly research only. ii Abstract CODE COAGULATION IS AN EFFECTIVE COMPILATION TECHNIQUE FOR THE JVM Shruthi Padmanabhan Master of Science, Computer Science Ryerson University, 2018 Compilers are the interface between programmers and computers. The output of a com- piler determines the speed of the resulting program as well as its energy footprint { of increasing importance in this world of climate change and battery-dependent computing. Code coagulation has the potential to improve that performance, particularly relative to (JIT) interpreters. Java and related languages are in wide use, so addressing their per- formance has large potential impact. Optijava is an experimental compiler that applies code coagulation to Java programs.
    [Show full text]
  • Valor: Efficient, Software-Only Region Conflict Exceptions ∗
    Valor: Efficient, Software-Only Region Conflict Exceptions ∗ Swarnendu Biswas Minjia Zhang Michael D. Bond Brandon Lucia Ohio State University Carnegie Mellon University {biswass,zhanminj,mikebond}@cse.ohio-state.edu [email protected] rtifact A Comple * t * te n * A * te is W E s A e n C l l L o D C S o * * c P u e m s E u O e e n v R t e O o d t a y * s E a * l u d a e t Abstract 1. Introduction Data races complicate programming language semantics, and Data races are a fundamental barrier to providing well- a data race is often a bug. Existing techniques detect data defined programming language specifications and to writing races and define their semantics by detecting conflicts be- correct shared-memory, multithreaded programs. A data race tween synchronization-free regions (SFRs). However, such occurs when two accesses to the same memory location are techniques either modify hardware or slow programs dramat- conflicting—executed by different threads and at least one ically, preventing always-on use today. is a write—and concurrent—not ordered by synchronization This paper describes Valor, a sound, precise, software- operations [4]. only region conflict detection analysis that achieves high Data races can cause programs to exhibit confusing and performance by eliminating the costly analysis on each incorrect behavior. They can lead to sequential consistency read operation that prior approaches require. Valor instead (SC), atomicity, and order violations [42, 54] that may corrupt logs a region’s reads and lazily detects conflicts for logged data, cause a crash, or prevent forward progress [28, 36, 52].
    [Show full text]
  • GNU Classpath
    GNU Classpath Core Classes for a Diversity of Java Virtual Machines February 2004 ■ Sascha Brawer [email protected] http://www.dandelis.ch/people/brawer/ ■ Mark Wielaard [email protected] http://www.klomp.org/mark/ Overview ■ Overview – Motivation – Anatomy of a Java-like system – Documentation, Quality assurance, Releases ■ Demo ■ Details – Current state – VMs using GNU Classpath ■ How you can help 2 Motivation ■ Currently, most free software is written in C The Good The Bad The Ugly Close to hardware Easy to make bugs Libraries not Fast execution, even Lacks “modern” well integrated with bad compilers language concepts Difficult to learn Large code base, (“modern” = 1980’ies) many libraries Hard to write Ubiquitous portable code 3 Motivation ■ Java is a good foundation for many projects – Type-safety ● Avoids many typical bugs, crashes, security problems ● More opportunities for optimizing compilers – Modular, object-oriented, concurrent, dynamic – Easier to write structured, portable code – Very rich library, reasonably well designed (mostly) – Large developer base (“COBOL of the 1990’ies”) ● There exist lots of other good (even better?) languages: Oberon, Eiffel, O’Caml, Haskell, Erlang, TOM, Cedar, ... ● But: They have not many free applications/libraries 4 Motivation ■ But: Java does not solve every problem – Over-hyped as a solution to everything – Bad reputation for wasting resources (CPU, RAM) ● It is easy to write inefficient programs ● Early implementations were very slow ● Type-safety and memory management have their cost – Often over-estimated: Array bounds checking (→ no buffer overflows) costs ~2% execution time, avoids ~50% security-related bugs – Syntax similar to C++ → not very easy to learn 5 Motivation ■ Java is a compromise Why GNU Will Be – Not necessarily ideal, Compatible with UNIX but reasonable Unix is not my ideal system, but it is not too bad.
    [Show full text]
  • Guiding Inlining Decisions Using Post-Inlining Transformations Erick
    Guiding Inlining Decisions Using Post-Inlining Transformations by Erick Eduardo Ochoa A thesis submitted in partial fulfillment of the requirements for the degree of Master of Science Department of Computing Science University of Alberta c Erick Eduardo Ochoa, 2019 Abstract Inlining strategies in just-in-time (JIT) compilers have relied on a mixture of heuristics and frequency information to discriminate between inlining candi- dates. Even though nested inlining is the norm in JIT compilers, modeling inlining as a variation of the greedy knapsack algorithm provides sub-optimal solutions. Recent advancements by Craik et al. [16] allow for solutions for the nested inlining problem, however, they require grading inlining candidates based on an abstract notion of \benefit". In this thesis, we define this abstract notion of \benefit” through the use of static analysis and frequency information. The choice of using static analysis instead of heuristics has consequences on the guarantees that an inlining strategy provides and on the compilation time incurred by the compiler. We show that our proposed static analysis is compa- rable to heuristics in terms of compilation time, memory resources used during compilation, and impact on run time. While our proposed inlining strategy increased run time by 4% compared to the default inlining strategies found in the OpenJ9 Java Virtual Machine (JVM), our inlining strategy allows compiler engineers to fine tune the abstract notion of \benefit” and provides human readable reports that show why inlining decisions were taken. The number of proposed inlining plans that differ between the heuristics and the static analyses is small, however, it provides a lower bound for how more powerful static analyses may improve inlining in the future.
    [Show full text]