Fine-Grained Modularity and Reuse of Virtual Machine Components

Total Page:16

File Type:pdf, Size:1020Kb

Fine-Grained Modularity and Reuse of Virtual Machine Components Fine-Grained Modularity and Reuse of Virtual Machine Components Christian Wimmer∗ Stefan Brunthalery Per Larseny Michael Franzy ∗ y Oracle Labs Department of Computer Science, University of California, Irvine [email protected] [email protected] [email protected] [email protected] Abstract Categories and Subject Descriptors D.3.4 [Programming Modularity is a key concept for large and complex applica- Languages]: Processors—Run-time environments, Compil- tions and an important enabler for collaborative research. In ers, Optimization comparison, virtual machines (VMs) are still mostly mono- General Terms Algorithms, Languages, Performance lithic pieces of software. Our goal is to significantly reduce to the cost of extending VMs to efficiently host and ex- Keywords Maxine, languages, dynamic languages, Java, ecute multiple, dynamic languages. We are designing and virtual machine, modularity, modular VM, metacircular implementing a VM following the “everything is extensible” VM, just-in-time compilation, optimization, performance paradigm. Among the novel use cases that will be enabled by our research are: VM extensions by third parties, support for multiple languages inside one VM, and a universal VM for 1. Introduction mobile devices. Modularity enables developers to build increasingly large Our research will be based on the existing state of the and complex applications. It is often not feasible to closely TM art. We will reuse an existing metacircular Java VM and control the entire architecture of such applications. They an existing dynamic language VM implemented in Java. We are often developed by distributed teams or even multiple will split the VMs into fine-grained modules, define explicit vendors, so it is necessary that individual modules are inde- interfaces and extension points for the modules, and finally pendent and have a well-defined interface to the rest of the re-connect them. application. The concept of a module system, i.e., a software Performance is one of the most important concerns for layer that loads, unloads, and connects modules, is well VMs. Modularity improves flexibility but can introduce an understood in the field of software engineering [29]. It is unacceptable performance overhead at the module bound- used on a daily basis with industry standards like OSGi [24]. aries, e.g., for inter-module method calls. We will identify The complexity of virtual machines (VMs) is steadily this overhead and address it with novel feedback-directed increasing. This includes the development of more advanced compiler optimizations. These optimizations will also im- just-in-time (JIT) compilers and garbage collectors, but also prove the performance of modular applications running on optimized run-time services such as thread synchronization. top of our VM. Additionally, the rise of dynamic languages has led to The expected results of our research will be not only new a plethora of new VMs, since a completely new VM is insights and a new design approach for VMs, but also a typically developed for every new language. VMs are still complete reference implementation of a modular VM where mostly monolithic pieces of software. They are developed in everything is extensible by third parties and that supports C or C++, the languages that they aim to replace. In sum- multiple languages. mary, VMs offer a lot of benefits for applications running on top of them, but they mostly do not utilize these benefits for themselves. The reason often cited for this is performance. Many subsystems are highly performance critical or have perfor- mance critical connection points with other subsystems. For Permission to make digital or hard copies of all or part of this work for personal or example, when a garbage collector needs write barriers, the classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation JIT compiler must efficiently embed them into the generated on the first page. To copy otherwise, to republish, to post on servers or to redistribute code. A callback into the garbage collector for every field to lists, requires prior specific permission and/or a fee. AOSD’12, March 25–30, 2012, Potsdam, Germany. access would be too slow. Using modularity and interfaces, Copyright c 2012 ACM 978-1-4503-1092-5/12/03. $10.00 it would be an even slower call that needs dynamic dis- 203 patch. Existing modular VMs therefore have carefully se- Object Layout lected module boundaries to avoid the performance impact. An important step towards true modularity for VMs are metacircular VMs, i.e., VMs written in the same language as Interpreter Garbage Collector they execute. The two most prominent examples for JavaTM are the Jikes RVM [16] and the Maxine VM [20]. Maxine JIT Compiler Synchronization is designed with modularity in mind: the core subsystems are exchangeable using so-called “schemes”. However, there is still no explicit concept of modules. Additionally, the Class Loader Linker modularity is on a coarse level. Individual modules are not Figure 1. Structure of current VMs. designed with fine-grained extensibility in mind. Most current VMs are designed to execute only a sin- gle input language. The monolithic design makes it dif- software development. Consequently, it is not possible to ficult to adapt major parts when building a new VM for implement different VM optimizations independently from a new language. For example, Java VMs have been ex- each other: all parts of a VM interdepend on each other. Fig- tensively optimized over the last decade, which has led to ure 1 shows important subsystems of a current VM. There aggressively optimizing JIT compilers as well as parallel are multiple circular and bidirectional dependencies, e.g., and concurrent garbage collectors. However, the dynamic between the JIT compiler and the garbage collector: the language VMs that have become highly popular in recent JIT compiler emits read and write barriers specifically for a years do not incorporate these implementation-intensive op- garbage collector, while the garbage collector traverses stack timizations. The lack of modularity has prohibited the reuse frames and root pointers defined by the JIT compiler. of existing VM optimizations. With fine-grained modularity, We want to disentangle the structure of the VM by intro- implementing a VM for a new language requires only im- ducing an explicit concept of modules and module depen- plementing the new language-specific parts, while the core dencies. Modules provide well-specified extension points runtime and optimization infrastructure remains unchanged. that are used by other modules. We outline the main features The goal of our research is to investigate the impact of of the resulting system below. fine-grained modularity on VMs. We envision a VM follow- ing the “everything is extensible” paradigm, by combining • No circular dependencies: The module system prohibits best practices of existing VM design and existing module circular dependencies, leading to an overall structure that systems. is easier to understand. We expect our research to contribute along three axes. • Fine-grained modules: Every subsystem is split into sev- eral modules with explicit dependencies and extension • Direct research results: We will study the performance points in between. impact of fine-grained modularity in VMs, develop new optimizations to eliminate possible overhead, and gener- • Ubiquitous extensibility: There is no distinction between alize the results for the benefit of all modular applica- “internal” modules that constitute the core runtime sys- tions. tem, and “external” modules supplied by third-party ven- dors. All use the same extension points and have access • Benefits for future research: We will develop a VM re- to the same data and interfaces. search platform that is ideal for future research. It will make comparisons of different optimizations much easier • Metacircularity: The VM is mostly written in one of the than before. many managed languages that it can execute (we antici- pate the VM to be written in Java). Modules that extend • Optimized VMs for many languages: We will define a the VM are shipped in the same form as applications customizable family of VMs that can easily be configured running on top of the VM. Therefore, all optimizations for different languages (static and dynamic languages), that improve the application speed also improve the VM different target systems (from embedded devices to speed, and it is possible to eliminate the overhead of servers), and different optimization strategies. For some modularity. of these configurations, no optimized VMs are available yet, e.g., we expect to contribute significantly to the 2.1 Performance performance of dynamic language VMs. Performance is a key aspect for VMs because it affects all applications running on top of the VM. However, we believe 2. Vision of a Modular VM that the current VM development process is too centered While the performance and complexity of VMs have been around performance, thereby sacrificing other important as- greatly increased over the last decade, the internal struc- pects such as maintainability, portability, and extensibility. ture of VMs still neglects the concepts of modern modular Many optimizations are applied prematurely because there is 204 Application Library Application Library Use of Complex Class Definition of Use of Complex Class Definition of Numbers Complex Numbers Numbers Complex Numbers VM VM JIT Compiler JIT Compiler Compiler Optimizations Garbage Collector Garbage Collector Memory Layout ... ... (a) Current Structure (b) Envisioned Structure Figure 2. Case study for the support of complex numbers inside the VM. the common belief that they are indispensable. To overcome tions for a certain library is out of scope for a VM—only this, we will follow a three step process. important methods of the standard library that ships with the VM are optimized by the VM. 1. Define the module boundaries so that each module is a Using our approach, the library vendor can also supply small, self-contained, and individually meaningful entity.
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]
  • 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.
    [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]