DOCSLIB.ORG

Viprof: Vertically Integrated Full-System Performance Profiler

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Viprof: Vertically Integrated Full-System Performance Profiler VIProf: Vertically Integrated Full-System Performance Profiler Hussam Mousa, Chandra Krintz, Lamia Youseff, and Rich Wolski Dept. of Computer Science University of California, Santa Barbara {husmousa, ckrintz, lyouseff, rich}@cs.ucsb.edu Abstract use virtualization to isolate system instances. Key to our ap- proach is our assumption that a single application executes In this paper, we present VIProf, a full-system, perfor- at a time. This assumption holds for both batched, cluster mance sampling system capable of extracting runtime be- systems that execute scientific applications, as well as for havior across an entire software stack. Our long-term goal a wide range of web, Grid service, and application server is to employ VIProf profiles to guide online optimization systems. Virtualization enables us to customize the system of programs and their execution environments according to stack for a particular application, i.e., the application that is the dynamically changing execution behavior and resource currently executing (or will execute once scheduled), very availability. VIProf thus, must be transparent while produc- aggressively. Then, when the application completes, vir- ing accurate and useful performance profiles. tualization facilitates the replacement of the entire system We overview the design and implementation of VIProf stack with another one (e.g., for another application). and empirically evaluate the system using a popular soft- Given this execution model, i.e., isolated application in- ware stack – one that includes a Linux operating system, stances that execute within guest operating systems over a Java Virtual Machine, and a set of applications. This a virtualizing software layer, we can consider novel tech- composition is commonly employed and important for high- niques for optimization and specialization across all lay- end systems such as application and web servers as well ers of the software system. In particular, we are interested as Computational Grid services. We show that VIProf in- in automatic and dynamic adaptation, customization, and troduces little overhead and is able to capture accurate integration of the application, runtime, and operating sys- (function-level) full-system performance data that previ- tem according to the dynamically changing characteristics ously required multiple profiles and extensive, manual, and of program behavior and underlying resource availability. offline post-processing of profile data. Our approach is called VIVA – Vertically Integrated Vir- tualizAtion, and our preliminary results indicate significant 1. Introduction1 potential and opportunity [12, 32, 31, 30]. As a first step toward enabling dynamic customization, Recent advances in virtualization techniques expose a in this paper, we investigate an efficient and accurate pro- number of new opportunities for applications that execute filing system that captures performance data transparently using them. Virtualization systems are increasingly pop- while the application executes. Such information is vital for ular software systems that multiplex lower-level resources guiding effective runtime (re-)optimization and (re-) adap- among higher level software programs and systems. Exam- tation according to dynamically changing conditions. ples of virtualization systems include a vast body of work Current profiling systems are limited in that they operate in the area of operating systems [22, 14, 7], high-level lan- on a single layer of the execution stack at a time. Ana- guage virtual machines such as those for Java and .Net, and, lyzing profiles and identifying common bottlenecks across most recently, virtual machine monitors (VMM) [28, 20, 1]. layers (OS, JVM, application) is thus, currently not possi- In our research, we investigate opportunities for perfor- ble without manual, offline, and tedious post-processing of mance optimization across the entire system stack (OS, Java profiles collected via different tools. Moreover, even across Virtual Machine, application server, application), when we layers, existing profiling techniques have difficulty captur- ing performance data on all code that executes, e.g. code 1 This work was funded in part by NSF grants CNS-0546737 and ST- that is dynamically compiled. If we are to optimize across HEC-0444412 and Microsoft. the different layers of the software stack, we must be able 1-4244-0910-1/07/$20.00 c 2007 IEEE. to sample all code that executes, and interrelate the perfor- mance data across all software layers. To address this need services, and Java middleware in concert with OS perfor- for a transparent, online, full-system profiling system, we mance and OS-JVM interaction. Extant recent approaches present VIProf, a Vertically Integrated Profiler. to JVM profiling, in particular vertical profiling [8], provide VIProf is an extension of the system wide profiler, OPro- a thorough examination of JVM and Java program internals, file, for Linux [19]. We extend OProfile by integrating its but do not capture fine-grain OS activity and the JVM-OS sampling system to access program-level information from interaction. To address the limitations of these two types any Application Virtual Machine. We implement a VIProf of profiling systems, we have developed VIProf. VIProf is prototype using the open source Jikes Research Virtual Ma- able to correlate hardware performance counter events with chine (JikesRVM) from IBM T.J. Watson Research center. all code that executes in the system regardless of where it We evaluate the overhead and efficacy of this VIProf pro- executes (user or kernel space) and how it is generated and totype and detail how VIProf captures full-system perfor- linked (dynamically or statically). mance behavior. An alternative approach to the one that we take with In the sections that follow, we present the background VIProf, is that of the Performance and Event Monitoring and motivation for our research, as well as other related (PEM) infrastructure from IBM Research [27]. PEM com- work in this area. We then describe VIProf in Section 3. bines information collected by several distinct monitoring In Section 4, we demonstrate the potential benefits of verti- streams that are provided by agents instrumented into the cally integrated profiling and empirically evaluate the over- application or operating system (K42), or by native hard- head and efficacy of our system. Finally, we conclude and ware counter agents on the supported hardware (Power Mac discuss our future research plans in Section 5. G5). VIProf, however, is a lightweight, whole-system, hardware-event profiler that provides a unified perspective of the entire execution stack, and requires no instrumenta- 2. Background and Related Work tion or combination of multiple monitored streams. More- over, VIProf, as a result of our use of OProfile as a base in- To enable dynamic and adaptive customization of the frastructure, supports different operating systems and hard- system stack (all software layers including the application), ware platforms – extant profiling system commonly support we require techniques that capture accurate performance a single OS or architecture. Finally, our implementation is data across the system that we can use to guide optimization simple and general enough to support a wide range of vir- decisions. Currently, extant approaches to profiling capture tual execution environments (multiple Java virtual machines only single-layer information, e.g., within a virtual execu- as well as Microsoft .Net common language runtimes). tion environment (JVM or CLR) [2, 9, 5, 17, 11, 21], across the system but agnostic to JVM-process internals [19, 15], employ complex software instrumentation [13, 23, 26], or 3. Vertically Integrated Profiler (VIProf) require hardware extensions [16, 18, 10, 4]. To achieve VIProf extends the OProfile to enable integrated profil- efficient, full-system profiling currently requires multiple, ing across the virtual layers of a system. OProfile con- complex, profiling tools and tedious, inaccurate, offline in- sists of a Linux kernel module, and a user level applica- tegration of profile data. To address these limitations, we in- tion. The kernel module sets up the hardware performance vestigate a full-system profiling system that captures light- counters (HPCs) with the user’s settings and requests a Non- weight hardware performance event data across both run- Maskable Interrupt (NMI) to be raised whenever a con- times for high-level languages, e.g., Java and Microsoft figurable threshold value is reached. When the prescribed .Net, and for code within the operating system. Our sys- number of hardware events occur, an HPC overflows and tem is called the Vertically Integrated Profiler (VIProf). an NMI is raised by the OS. The kernel module handles VIProf is based on a popular, software-based, operating the interrupt by reading the active Program Counter (PC) system profiler called OProfile [19] that we extended to en- value from the processor. OProfile matches the PC value able the integration of internal JVM profile data. OProfile to a virtual memory region, and identifies the correspond- is a system-wide profiling system that captures hardware ing binary or library. Further, OProfile computes the offset performance counter events and correlates them with vari- into the corresponding object file to pinpoint the method ous parts of the executing system, including applications, li- that was executing at the time the interrupt is raised. OPro- braries, and operating system functions. This system, how- file adds this information,
Load more

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]