Intermediate Language Design of High- level Language VMs
|
|
|
- Letitia Johnston
- 6 years ago
- Views:
Transcription
1 Intermediate Language Design of High- level Language VMs Towards Comprehensive Concurrency Support Stefan Marr SoOware Languages Lab Vrije Universiteit Brussel Michael Haupt Hasso PlaKner InsLtute University of Potsdam Theo D Hondt SoOware Languages Lab Vrije Universiteit Brussel VMIL Workshop, 25 th October 2009, Orlando, Florida
2 Agenda MoLvaLon Survey Design Concurrency Support Conclusion Outlook
3 MoLvaLon VMs support concurrency insufficiently! Why? Because, we want mull- language VMs Fast JITs, great GCs How to design an intermediate language? To our knowledge No surveys No overview of design space/tradeoffs
4 How to design an intermediate language? SURVEY DESIGN
5 Survey Design Dalvik VM 1.0 Dis VM 4 th ed. OTP R CLI/ECMA JVM spec svn 2.6 Rubinius Ruby 1.8/ Squeak 3.9 TraceMonkey V8 svn All trademarks and logos are the property of their respeclve owners.
6 Survey Criteria SpecificaLon vs. implementalon AbstracLon level of intermediate language Machine model RepresentaLon, instruclon encoding InstrucLon categories ArithmeLc & logic, control flow, stack, OpLmizaLons
7 Survey Type Abstraction Model #Regs Execution Length in Byte #Ops CLI Spec. Bytecode stack 0- var >= CPython Impl. Bytecode stack 0 switch var 1 or Dalvik VM Impl. Bytecode register threaded var >= Dis VM Spec. Bytecode mem-mem 0- var Erlang Impl. Bytecode register 1024 threaded, JIT fixed JVM Spec. Bytecode stack 0- var >= Lua Impl. Bytecode register 255 switch fixed 4 38 Mozart Impl. Bytecode reg-mem threaded var Parrot Spec. Bytecode register switch,threaded,jit var >= 4 >1200 PHP Impl. Bytecode reg-mem threaded fixed Rubinius Impl. Bytecode stack 0 JIT var Ruby 1.8 Impl. AST stack 0switch Ruby 1.9 Impl. Bytecode stack 2threaded var >= Self Impl. Bytecode stack 0 JIT fixed 1 17 Squeak Impl. Bytecode stack 0 switch, threaded var 1 or 2 71 TraceMonkey Impl. Bytecode stack 1threaded, JIT var >= V8 Impl. AST - -JIT
8 Survey Type Abstraction Model #Regs Execution Length in Byte #Ops CLI Spec. Bytecode stack 0- var >= CPython Impl. Bytecode stack 0 switch var 1 or Dalvik VM Impl. Bytecode register threaded var >= Dis VM Spec. Bytecode mem-mem 0- var Erlang Impl. Bytecode register 1024threaded, JIT fixed JVM Spec. Bytecode stack 0- var >= Lua Impl. Bytecode register 255 switch fixed 4 38 Mozart Impl. Bytecode reg-mem threaded var Parrot Spec. Bytecode register switch,threaded,jit var >= 4 >1200 PHP Impl. Bytecode reg-mem threaded fixed Rubinius Impl. Bytecode stack 0 JIT var Ruby 1.8 Impl. AST stack 0switch Ruby 1.9 Impl. Bytecode stack 2threaded var >= Self Impl. Bytecode stack 0 JIT fixed 1 17 Squeak Impl. Bytecode stack 0 switch, threaded var 1 or 2 71 TraceMonkey Impl. Bytecode stack 1threaded, JIT var >= V8 Impl. AST - -JIT
9 Survey Type Abstraction Model #Regs Execution Length in Byte #Ops CLI Spec. Bytecode stack 0- var >= CPython Impl. Bytecode stack 0 switch var 1 or Dalvik VM Impl. Bytecode register threaded var >= Dis VM Spec. Bytecode mem-mem 0- var Erlang Impl. Bytecode register 1024 threaded, JIT fixed JVM Spec. Bytecode stack 0- var >= Lua Impl. Bytecode register 255 switch fixed 4 38 Mozart Impl. Bytecode reg-mem threaded var Parrot Spec. Bytecode register switch,threaded,jit var >= 4 >1200 PHP Impl. Bytecode reg-mem threaded fixed Rubinius Impl. Bytecode stack 0 JIT var Ruby 1.8 Impl. AST stack 0switch Ruby 1.9 Impl. Bytecode stack 2threaded var >= Self Impl. Bytecode stack 0 JIT fixed 1 17 Squeak Impl. Bytecode stack 0 switch, threaded var 1 or 2 71 TraceMonkey Impl. Bytecode stack 1threaded, JIT var >= V8 Impl. AST - -JIT
10 Survey Type Abstraction Model #Regs Execution Length in Byte #Ops CLI Spec. Bytecode stack 0- var >= CPython Impl. Bytecode stack 0 switch var 1 or Dalvik VM Impl. Bytecode register threaded var >= Dis VM Spec. Bytecode mem-mem 0- var Erlang Impl. Bytecode register 1024 threaded, JIT fixed JVM Spec. Bytecode stack 0- var >= Lua Impl. Bytecode register 255switch fixed 4 38 Mozart Impl. Bytecode reg-mem threaded var Parrot Spec. Bytecode register switch,threaded,jit var >= 4 >1200 PHP Impl. Bytecode reg-mem threaded fixed Rubinius Impl. Bytecode stack 0 JIT var Ruby 1.8 Impl. AST stack 0switch Ruby 1.9 Impl. Bytecode stack 2threaded var >= Self Impl. Bytecode stack 0 JIT fixed 1 17 Squeak Impl. Bytecode stack 0 switch, threaded var 1 or 2 71 TraceMonkey Impl. Bytecode stack 1threaded, JIT var >= V8 Impl. AST - -JIT
11 Survey Type Abstraction Model #Regs Execution Length in Byte #Ops CLI Spec. Bytecode stack 0- var >= CPython Impl. Bytecode stack 0 switch var 1 or Dalvik VM Impl. Bytecode register threaded var >= Dis VM Spec. Bytecode mem-mem 0- var Erlang Impl. Bytecode register 1024 threaded, JIT fixed JVM Spec. Bytecode stack 0- var >= Lua Impl. Bytecode register 255 switch fixed 4 38 Mozart Impl. Bytecode reg-mem threaded var Parrot Spec. Bytecode register switch,threaded,jit var >= 4 >1200 PHP Impl. Bytecode reg-mem threaded fixed Rubinius Impl. Bytecode stack 0 JIT var Ruby 1.8 Impl. AST stack 0switch Ruby 1.9 Impl. Bytecode stack 2threaded var >= Self Impl. Bytecode stack 0 JIT fixed 1 17 Squeak Impl. Bytecode stack 0 switch, threaded var 1 or 2 71 TraceMonkey Impl. Bytecode stack 1threaded, JIT var >= V8 Impl. AST - -JIT
12 Survey Type Abstraction Model #Regs Execution Length in Byte #Ops CLI Spec. Bytecode stack 0- var >= CPython Impl. Bytecode stack 0 switch var 1 or Dalvik VM Impl. Bytecode register threaded var >= Dis VM Spec. Bytecode mem-mem 0- var Erlang Impl. Bytecode register 1024 threaded, JIT fixed JVM Spec. Bytecode stack 0- var >= Lua Impl. Bytecode register 255 switch fixed 4 38 Mozart Impl. Bytecode reg-mem threaded var Parrot Spec. Bytecode register switch,threaded,jit var >= 4 >1200 PHP Impl. Bytecode reg-mem threaded fixed Rubinius Impl. Bytecode stack 0 JIT var Ruby 1.8 Impl. AST stack 0switch Ruby 1.9 Impl. Bytecode stack 2threaded var >= Self Impl. Bytecode stack 0JIT fixed 1 17 Squeak Impl. Bytecode stack 0 switch, threaded var 1 or 2 71 TraceMonkey Impl. Bytecode stack 1threaded, JIT var >= V8 Impl. AST - -JIT
13 How to support concurrency in an intermediate language? CONCURRENCY SUPPORT
14 Reminder: MoLvaLon VMs support concurrency insufficiently! Why? Because, we want mull- language VMs Fast JITs Great GCs Add concurrency to intermediate language
15 Why Concurrency in ILs?
16 Concurrency Support in the IL? Dalvik VM 1.0 Dis VM 4 th ed. OTP R CLI/ECMA JVM spec svn 2.6 Rubinius Ruby 1.8/ Squeak 3.9 TraceMonkey V8 svn
17 Concurrency Support in the IL? Dalvik VM 1.0 Dis VM 4 th ed. OTP R CLI/ECMA JVM spec svn 2.6 Rubinius Ruby 1.8/ Squeak 3.9 TraceMonkey only 6 out of 17 V8 svn
18 Survey Criteria - Concurrency Concurrency support Concurrency model Included instruclons Standard library (stdlib)
19 Common Language Infrastructure volatile. (prefix instruclon) marks a subsequent pointer reference IL Synchronized methods StdLib Memory model Atomic read or write of certain aligned data Standard library Memory barriers, atomic updates Parallel loops, futures, Model Threads/Locks Marginal Low- /high- level
20 Dis VM (spec. 4 th ed.) Inspired by CommunicaLngSequenLalProcesses spawn new thread new* new channel recv, send on given channel alt, nbalt send or receive on ready channel Memory model unspecified Model CSP IL High- level StdLib High- level
21 Erlang Actors model send, wait, wait_timeout remove_message timeout Pure, funclonal language No memory model specified Only high- level constructs in stdlib. Model Actors IL High- level StdLib High- level
22 Java Virtual Machine monitorenter/- exit For synchronized blocks Synchronized methods Memory model Standard library Low- and high- level constructs DalvikVM promises the same Model Threads/Locks IL Marginal StdLib Low- /high- level
23 Mozart LOCKTHREAD No unlock Implicit support Data- flow variables, distribulon Standard library High- level constructs Futures, stream channels, Model Data- flow IL Marginal StdLib High- level
24 Conclusion Model Threads/Locks CSP Actors Data- flow IL Marginal High- level High- level Marginal StdLib Low/high- level High- level High- level High- level Wide range of supported models No nolon of mullple models OOen limited to implicit semanlcs or guaranles OOen most funclonality in standard library
25 Outlook MulL- language VMs have to Enable language designer to invent new constructs/concepts Provide low- and high- level constructs Low- level: Memory barriers, atomic updates, High- level: Tuplespaces, STM, Actors, Open queslon: tradeoffs IL vs. stdlib.
26 +,-.)"/.%0($/1))&$/*%!(2&3- Discussion 111!"!!&'( #"$% '!$)*+ )$,-+ #"./+."00,-+ 111!"#$%!&'()* 5#$:3&%0()& $($;-7")&2%'&'()*!"#$%!&'()* 67)&"2-%"$2%8(/9-56! +/.()- <&=%0()&- -7")&2%'&'()*!&'()*!&'()*!"$*%0()&- &>?3#/#.%/(''1$#/".#($!&'()*!&'()* 4$-.)1/.#($%5&. 0($/)&.& 0($/1))&$/*%!(2&3-
CSE P 501 Compilers. Java Implementation JVMs, JITs &c Hal Perkins Winter /11/ Hal Perkins & UW CSE V-1
CSE P 501 Compilers Java Implementation JVMs, JITs &c Hal Perkins Winter 2008 3/11/2008 2002-08 Hal Perkins & UW CSE V-1 Agenda Java virtual machine architecture.class files Class loading Execution engines
Parrot VM. Allison Randal Parrot Foundation & O'Reilly Media, Inc.
Parrot VM Allison Randal Parrot Foundation & O'Reilly Media, Inc. There's an odd misconception in the computing world that writing compilers is hard. This view is fueled by the fact that we don't write
PyPy - How to not write Virtual Machines for Dynamic Languages
PyPy - How to not write Virtual Machines for Dynamic Languages Institut für Informatik Heinrich-Heine-Universität Düsseldorf ESUG 2007 Scope This talk is about: implementing dynamic languages (with a focus
MultiJav: A Distributed Shared Memory System Based on Multiple Java Virtual Machines. MultiJav: Introduction
: A Distributed Shared Memory System Based on Multiple Java Virtual Machines X. Chen and V.H. Allan Computer Science Department, Utah State University 1998 : Introduction Built on concurrency supported
CSE 506: Opera.ng Systems Na.ve POSIX Threading Library (NPTL)
Na.ve POSIX Threading Library (NPTL) Don Porter 1 Logical Diagram CSE 506: Opera.ng Systems Binary Formats RCU Today s Lecture Scheduling System threads Calls File System Memory Allocators Networking Threads
Agenda. CSE P 501 Compilers. Java Implementation Overview. JVM Architecture. JVM Runtime Data Areas (1) JVM Data Types. CSE P 501 Su04 T-1
Agenda CSE P 501 Compilers Java Implementation JVMs, JITs &c Hal Perkins Summer 2004 Java virtual machine architecture.class files Class loading Execution engines Interpreters & JITs various strategies
Lecture content. Course goals. Course Introduction. TDDA69 Data and Program Structure Introduction
Lecture content TDDA69 Data and Program Structure Introduction Cyrille Berger Course Introduction to the different Programming Paradigm The different programming paradigm Why different paradigms? Introduction
Managed runtimes & garbage collection
Managed runtimes Advantages? Managed runtimes & garbage collection CSE 631 Some slides by Kathryn McKinley Disadvantages? 1 2 Managed runtimes Portability (& performance) Advantages? Reliability Security
Contents in Detail. Who This Book Is For... xx Using Ruby to Test Itself... xx Which Implementation of Ruby?... xxi Overview...
Contents in Detail Foreword by Aaron Patterson xv Acknowledgments xvii Introduction Who This Book Is For................................................ xx Using Ruby to Test Itself.... xx Which Implementation
Intermediate Representations
Intermediate Representations Intermediate Representations (EaC Chaper 5) Source Code Front End IR Middle End IR Back End Target Code Front end - produces an intermediate representation (IR) Middle end
A Survey of Concurrency Constructs. Ted Leung Sun
A Survey of Concurrency Constructs Ted Leung Sun Microsystems ted.leung@sun.com @twleung 16 threads 128 threads Today s model Threads Program counter Own stack Shared Memory Locks Some of the problems
Managed runtimes & garbage collection. CSE 6341 Some slides by Kathryn McKinley
Managed runtimes & garbage collection CSE 6341 Some slides by Kathryn McKinley 1 Managed runtimes Advantages? Disadvantages? 2 Managed runtimes Advantages? Reliability Security Portability Performance?
Advanced concurrent programming in Java Shared objects
Advanced concurrent programming in Java Shared objects Mehmet Ali Arslan 21.10.13 Visibility To see(m) or not to see(m)... 2 There is more to synchronization than just atomicity or critical sessions. Memory
The Z Garbage Collector Low Latency GC for OpenJDK
The Z Garbage Collector Low Latency GC for OpenJDK Per Lidén & Stefan Karlsson HotSpot Garbage Collection Team Jfokus VM Tech Summit 2018 Safe Harbor Statement The following is intended to outline our
Scalable Performance for Scala Message-Passing Concurrency
Scalable Performance for Scala Message-Passing Concurrency Andrew Bate Department of Computer Science University of Oxford cso.io Motivation Multi-core commodity hardware Non-uniform shared memory Expose
CSc 453 Interpreters & Interpretation
CSc 453 Interpreters & Interpretation Saumya Debray The University of Arizona Tucson Interpreters An interpreter is a program that executes another program. An interpreter implements a virtual machine,
Outline. Introduction Concepts and terminology The case for static typing. Implementing a static type system Basic typing relations Adding context
Types 1 / 15 Outline Introduction Concepts and terminology The case for static typing Implementing a static type system Basic typing relations Adding context 2 / 15 Types and type errors Type: a set of
MetaConc. Towards Meta-Level Engineering and Tooling for Complex Concurrent Systems
MetaConc Towards Meta-Level Engineering and Tooling for Complex Concurrent Systems Stefan Marr, Elisa Gonzalez Boix, Hanspeter Mössenböck Brussels, April 21, 2016 ENIAC's main control panel, U. S. Army
Where We Are. Lexical Analysis. Syntax Analysis. IR Generation. IR Optimization. Code Generation. Machine Code. Optimization.
Where We Are Source Code Lexical Analysis Syntax Analysis Semantic Analysis IR Generation IR Optimization Code Generation Optimization Machine Code Where We Are Source Code Lexical Analysis Syntax Analysis
Are We There Yet? Simple Language-Implementation Techniques for the 21st Century
Are We There Yet? Simple Language-Implementation Techniques for the 21st Century Stefan Marr, Tobias Pape, Wolfgang De Meuter To cite this version: Stefan Marr, Tobias Pape, Wolfgang De Meuter. Are We
Software Speculative Multithreading for Java
Software Speculative Multithreading for Java Christopher J.F. Pickett and Clark Verbrugge School of Computer Science, McGill University {cpicke,clump}@sable.mcgill.ca Allan Kielstra IBM Toronto Lab kielstra@ca.ibm.com
Azul Systems, Inc.
1 Stack Based Allocation in the Azul JVM Dr. Cliff Click cliffc@azulsystems.com 2005 Azul Systems, Inc. Background The Azul JVM is based on Sun HotSpot a State-of-the-Art Java VM Java is a GC'd language
The Z Garbage Collector An Introduction
The Z Garbage Collector An Introduction Per Lidén & Stefan Karlsson HotSpot Garbage Collection Team FOSDEM 2018 Safe Harbor Statement The following is intended to outline our general product direction.
code://rubinius/technical
code://rubinius/technical /GC, /cpu, /organization, /compiler weeee!! Rubinius New, custom VM for running ruby code Small VM written in not ruby Kernel and everything else in ruby http://rubini.us git://rubini.us/code
JRuby+Truffle. Kevin Menard. Chris Seaton. Benoit Daloze. A tour through a new Ruby Oracle Oracle Labs
JRuby+Truffle A tour through a new Ruby implementahon Chris Seaton @ChrisGSeaton Oracle Labs Benoit Daloze @eregontp JKU Linz Kevin Menard @nirvdrum Oracle Labs Ruby logo copyright (c) 2006, Yukihiro Matsumoto,
Accelerating Ruby with LLVM
Accelerating Ruby with LLVM Evan Phoenix Oct 2, 2009 RUBY RUBY Strongly, dynamically typed RUBY Unified Model RUBY Everything is an object RUBY 3.class # => Fixnum RUBY Every code context is equal RUBY
High-Level Language VMs
High-Level Language VMs Outline Motivation What is the need for HLL VMs? How are these different from System or Process VMs? Approach to HLL VMs Evolutionary history Pascal P-code Object oriented HLL VMs
Hardware-near Programming in the Common Language Infrastructure
Hardware-near Programming in the Common Language Infrastructure Stefan Richter, Andreas Rasche and Andreas Polze Hasso-Plattner-Institute at University of Potsdam ISORC 2007 7-9 May, 2007 Santorini Island,
CMSC 430 Introduction to Compilers. Fall Language Virtual Machines
CMSC 430 Introduction to Compilers Fall 2018 Language Virtual Machines Introduction So far, we ve focused on the compiler front end Syntax (lexing/parsing) High-level language semantics Ultimately, we
Jython Python for the Java Platform. Jim Baker, Committer twitter.com/jimbaker zyasoft.com/pythoneering
Jython Python for the Java Platform Jim Baker, Committer jbaker@zyasoft.com twitter.com/jimbaker zyasoft.com/pythoneering Jython Milestones 9 years ago - Released JPython 1.1 8 years ago - Released 2.0
<Insert Picture Here> Maxine: A JVM Written in Java
Maxine: A JVM Written in Java Michael Haupt Oracle Labs Potsdam, Germany The following is intended to outline our general product direction. It is intended for information purposes
elprep: a high- performance tool for preparing SAM/BAM files for variant calling Charlo<e Herzeel (Imec) Pascal Costanza (Intel) July 2014
elprep: a high- performance tool for preparing SAM/BAM files for variant calling Charlo
Pause-Less GC for Improving Java Responsiveness. Charlie Gracie IBM Senior Software charliegracie
Pause-Less GC for Improving Java Responsiveness Charlie Gracie IBM Senior Software Developer charlie_gracie@ca.ibm.com @crgracie charliegracie 1 Important Disclaimers THE INFORMATION CONTAINED IN THIS
CMSC 430 Introduction to Compilers. Spring Intermediate Representations and Bytecode Formats
CMSC 430 Introduction to Compilers Spring 2016 Intermediate Representations and Bytecode Formats Introduction Front end Source code Lexer Parser Types AST/IR IR 2 IR n IR n.s Middle end Back end Front
Runtime. The optimized program is ready to run What sorts of facilities are available at runtime
Runtime The optimized program is ready to run What sorts of facilities are available at runtime Compiler Passes Analysis of input program (front-end) character stream Lexical Analysis token stream Syntactic
Type Feedback for Bytecode Interpreters
Type Feedback for Bytecode Interpreters Michael Haupt, Robert Hirschfeld, Marcus Denker To cite this version: Michael Haupt, Robert Hirschfeld, Marcus Denker. Type Feedback for Bytecode Interpreters. ICOOOLPS
Compilers. Intermediate representations and code generation. Yannis Smaragdakis, U. Athens (original slides by Sam
Compilers Intermediate representations and code generation Yannis Smaragdakis, U. Athens (original slides by Sam Guyer@Tufts) Today Intermediate representations and code generation Scanner Parser Semantic
Dynamic Languages Strike Back. Steve Yegge Stanford EE Dept Computer Systems Colloquium May 7, 2008
Dynamic Languages Strike Back Steve Yegge Stanford EE Dept Computer Systems Colloquium May 7, 2008 What is this talk about? Popular opinion of dynamic languages: Unfixably slow Not possible to create IDE-quality
IBM s statements regarding its plans, directions, and intent are subject to change or withdrawal without notice at IBM s sole discretion.
Please note Copyright 2018 by International Business Machines Corporation (IBM). No part of this document may be reproduced or transmitted in any form without written permission from IBM IBM s statements
Java and C II. CSE 351 Spring Instructor: Ruth Anderson
Java and C II CSE 351 Spring 2017 Instructor: Ruth Anderson Teaching Assistants: Dylan Johnson Kevin Bi Linxing Preston Jiang Cody Ohlsen Yufang Sun Joshua Curtis Administrivia Lab 5 Due TONIGHT! Fri 6/2
Programming Language Impact on the Development of Distributed Systems
Programming Language Impact on the Development of Distributed Systems Steve Vinoski Architect, Basho Technologies Cambridge, MA USA vinoski@ieee.org @stevevinoski http://steve.vinoski.net/ Co-Authors Debasish
C#: framework overview and in-the-small features
Chair of Software Engineering Carlo A. Furia, Marco Piccioni, Bertrand Meyer C#: framework overview and in-the-small features Chair of Software Engineering Carlo A. Furia, Marco Piccioni, Bertrand Meyer
Introduction. Lecture 1. Operating Systems Practical. 5 October 2016
Introduction Lecture 1 Operating Systems Practical 5 October 2016 This work is licensed under the Creative Commons Attribution 4.0 International License. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/.
COP4020 Programming Languages. Compilers and Interpreters Robert van Engelen & Chris Lacher
COP4020 ming Languages Compilers and Interpreters Robert van Engelen & Chris Lacher Overview Common compiler and interpreter configurations Virtual machines Integrated development environments Compiler
Beyond the Coffee Cup:
Beyond the Coffee Cup: Leveraging Java Runtime Technologies for Polyglot Daryl Maier Senior Software Developer at IBM Canada IBM Runtimes maier@ca.ibm.com About me IBM Canada Lab in Toronto (-ish) Member
CSc 520 Principles of Programming Languages
CSc 520 Principles of Programming Languages 44: Interpreters Christian Collberg collberg@cs.arizona.edu Department of Computer Science University of Arizona Copyright c 2005 Christian Collberg [1] Compiler
WELCOME TO PERL = Tuesday, June 4, 13
WELCOME TO PERL11 5 + 6 = 11 http://perl11.org/ Stavanger 2012 Moose + p5-mop Workshop Text Preikestolen Will Braswell Ingy döt net Austin 2012 PERL 11 5 + 6 = 11 perl11.org Will Braswell, Ingy döt net,
CSE 401/M501 Compilers
CSE 401/M501 Compilers Intermediate Representations Hal Perkins Autumn 2018 UW CSE 401/M501 Autumn 2018 G-1 Agenda Survey of Intermediate Representations Graphical Concrete/Abstract Syntax Trees (ASTs)
Announcements. My office hours are today in Gates 160 from 1PM-3PM. Programming Project 3 checkpoint due tomorrow night at 11:59PM.
IR Generation Announcements My office hours are today in Gates 160 from 1PM-3PM. Programming Project 3 checkpoint due tomorrow night at 11:59PM. This is a hard deadline and no late submissions will be
Lecture content. Course goals. Course Introduction. TDDA69 Data and Program Structure Introduction
Lecture content TDDA69 Data and Program Structure Introduction Cyrille Berger Course Introduction Introduction to the different Programming Paradigm The different programming paradigms Why different paradigms?
Eliminating Global Interpreter Locks in Ruby through Hardware Transactional Memory
Eliminating Global Interpreter Locks in Ruby through Hardware Transactional Memory Rei Odaira, Jose G. Castanos and Hisanobu Tomari IBM Research and University of Tokyo April 8, 2014 Rei Odaira, Jose G.
Memory Allocation II. CSE 351 Autumn Instructor: Justin Hsia
Memory Allocation II CSE 351 Autumn 2016 Instructor: Justin Hsia Teaching Assistants: Chris Ma Hunter Zahn John Kaltenbach Kevin Bi Sachin Mehta Suraj Bhat Thomas Neuman Waylon Huang Xi Liu Yufang Sun
Fully Automatic and Precise Detection of Thread Safety Violations
Fully Automatic and Precise Detection of Thread Safety Violations Michael Pradel and Thomas R. Gross Department of Computer Science ETH Zurich 1 Motivation Thread-safe classes: Building blocks for concurrent
CSc 453. Compilers and Systems Software. 18 : Interpreters. Department of Computer Science University of Arizona. Kinds of Interpreters
CSc 453 Compiler source Lexer tokens Parser AST Compilers and Systems Software 18 : Interpreters VM Code Gen IR Interm. Code Gen AST Semantic Analyser Department of Computer Science University of Arizona
September 15th, Finagle + Java. A love story (
September 15th, 2016 Finagle + Java A love story ( ) @mnnakamura hi, I m Moses Nakamura Twitter lives on the JVM When Twitter realized we couldn t stay on a Rails monolith and continue to scale at the
OpenMP 4.0 implementation in GCC. Jakub Jelínek Consulting Engineer, Platform Tools Engineering, Red Hat
OpenMP 4.0 implementation in GCC Jakub Jelínek Consulting Engineer, Platform Tools Engineering, Red Hat OpenMP 4.0 implementation in GCC Work started in April 2013, C/C++ support with host fallback only
It turns out that races can be eliminated without sacrificing much in terms of performance or expressive power.
The biggest two problems in multi-threaded programming are races and deadlocks. Races reached new levels with the introduction of relaxed memory processors. It turns out that races can be eliminated without
Copyright 2014 Oracle and/or its affiliates. All rights reserved.
Copyright 2014 Oracle and/or its affiliates. All rights reserved. On the Quest Towards Fastest (Java) Virtual Machine on the Planet! @JaroslavTulach Oracle Labs Copyright 2015 Oracle and/or its affiliates.
Bytecode Manipulation Techniques for Dynamic Applications for the Java Virtual Machine
Bytecode Manipulation Techniques for Dynamic Applications for the Java Virtual Machine Eugene Kuleshov, Terracotta Tim Eck, Terracotta Tom Ware, Oracle Corporation Charles Nutter, Sun Microsystems, Inc.
SOFTWARE ARCHITECTURE 7. JAVA VIRTUAL MACHINE
1 SOFTWARE ARCHITECTURE 7. JAVA VIRTUAL MACHINE Tatsuya Hagino hagino@sfc.keio.ac.jp slides URL https://vu5.sfc.keio.ac.jp/sa/ Java Programming Language Java Introduced in 1995 Object-oriented programming
The New Java Technology Memory Model
The New Java Technology Memory Model java.sun.com/javaone/sf Jeremy Manson and William Pugh http://www.cs.umd.edu/~pugh 1 Audience Assume you are familiar with basics of Java technology-based threads (
Run-time Program Management. Hwansoo Han
Run-time Program Management Hwansoo Han Run-time System Run-time system refers to Set of libraries needed for correct operation of language implementation Some parts obtain all the information from subroutine
Operating Systems (2INC0) 2018/19. Introduction (01) Dr. Tanir Ozcelebi. Courtesy of Prof. Dr. Johan Lukkien. System Architecture and Networking Group
Operating Systems (2INC0) 20/19 Introduction (01) Dr. Courtesy of Prof. Dr. Johan Lukkien System Architecture and Networking Group Course Overview Introduction to operating systems Processes, threads and
Advances in Programming Languages
O T Y H Advances in Programming Languages APL5: Further language concurrency mechanisms David Aspinall (including slides by Ian Stark) School of Informatics The University of Edinburgh Tuesday 5th October
A Causality-Based Runtime Check for (Rollback) Atomicity
A Causality-Based Runtime Check for (Rollback) Atomicity Serdar Tasiran Koc University Istanbul, Turkey Tayfun Elmas Koc University Istanbul, Turkey RV 2007 March 13, 2007 Outline This paper: Define rollback
Programming Languages and Techniques (CIS120)
Programming Languages and Techniques (CIS120) Lecture 30 April 2, 2012 Streams & IO HW 09 will be available today Announcements Covers Java libraries: colleclons & IO Last automalcally graded HW assignment
WebAssembly. neither Web nor Assembly, but Revolutionary
WebAssembly neither Web nor Assembly, but Revolutionary The WebAssembly revolution has begun Jay Phelps Chief Software Architect previously Support, Dev Rel, Staff Augmentation, Mentorship, and more www.thisdot.co
Metaprogramming: InterpretaBon
How to implement a programming language Metaprogramming These slides borrow heavily from Ben Wood s Fall 15 slides. CS251 ming Languages Fall 2017, Lyn Turbak Department of Computer Science Wellesley College
AmbientTalk: Object-oriented Event-driven programming in Mobile Ad hoc Networks
AmbientTalk: Object-oriented Event-driven programming in Mobile Ad hoc Networks Tom Van Cutsem Programming Technology Lab Vrije Universiteit Brussel Brussels, Belgium LAMP - EPFL, July 25th 2007, Lausanne
Run Anywhere. The Hardware Platform Perspective. Ben Pollan, AMD Java Labs October 28, 2008
Run Anywhere The Hardware Platform Perspective Ben Pollan, AMD Java Labs October 28, 2008 Agenda Java Labs Introduction Community Collaboration Performance Optimization Recommendations Leveraging the Latest
CSc 553. Principles of Compilation. 2 : Interpreters. Department of Computer Science University of Arizona
CSc 553 Principles of Compilation 2 : Interpreters Department of Computer Science University of Arizona collberg@gmail.com Copyright c 2011 Christian Collberg Compiler source Lexer tokens Parser AST VM
Erlang and Concurrency. André Pang Rising Sun Research
Erlang and Concurrency André Pang Rising Sun Research Games. Unreal 3 engine. Amazing graphics. (Unreal 3 video demo.) 2004/2005? Still state-of-the-art. What does that game have to do with this talk?
The Actor Model. Towards Better Concurrency. By: Dror Bereznitsky
The Actor Model Towards Better Concurrency By: Dror Bereznitsky 1 Warning: Code Examples 2 Agenda Agenda The end of Moore law? Shared state concurrency Message passing concurrency Actors on the JVM More
Look at all these toys!
Look at all these toys! Help it s Ruby! All alone Is Ruby dying? Where do Rubyists go? Where do Rubyists go? Tobias Pfeiffer @PragTob pragtob.info 673 Responses First Rails Release Rails 1.0 Why did
Virtual Machines. Virtual Machines
Virtual Machines Virtual Machines What is a virtual machine? Examples? Benefits? 1 Virtualization Creation of an isomorphism that maps a virtual guest system to a real host: Maps guest state S to host
Compiler-guaranteed Safety in Code-copying Virtual Machines
Compiler-guaranteed Safety in Code-copying Virtual Machines Gregory B. Prokopski Clark Verbrugge School of Computer Science Sable Research Group McGill University Montreal, Canada International Conference
Java without the Coffee Breaks: A Nonintrusive Multiprocessor Garbage Collector
Java without the Coffee Breaks: A Nonintrusive Multiprocessor Garbage Collector David F. Bacon IBM T.J. Watson Research Center Joint work with C.R. Attanasio, Han Lee, V.T. Rajan, and Steve Smith ACM Conference
KILLER features of the BEAM. And what makes the BEAM a unique and powerful tool that really stands out!
KILLER features of the BEAM And what makes the BEAM a unique and powerful tool that really stands out! Actor Model Hundreds, Thousands, Millions of processes System limit can be between1,024-134,217,727
EDAN65: Compilers, Lecture 13 Run;me systems for object- oriented languages. Görel Hedin Revised:
EDAN65: Compilers, Lecture 13 Run;me systems for object- oriented languages Görel Hedin Revised: 2014-10- 13 This lecture Regular expressions Context- free grammar ATribute grammar Lexical analyzer (scanner)
Audience. Revising the Java Thread/Memory Model. Java Thread Specification. Revising the Thread Spec. Proposed Changes. When s the JSR?
Audience Revising the Java Thread/Memory Model See http://www.cs.umd.edu/~pugh/java/memorymodel for more information 1 This will be an advanced talk Helpful if you ve been aware of the discussion, have
CSE P 501 Compilers. Intermediate Representations Hal Perkins Spring UW CSE P 501 Spring 2018 G-1
CSE P 501 Compilers Intermediate Representations Hal Perkins Spring 2018 UW CSE P 501 Spring 2018 G-1 Administrivia Semantics/types/symbol table project due ~2 weeks how goes it? Should be caught up on
System Software. Computer Science and Engineering College of Engineering The Ohio State University. Lecture 13
System Software Computer Science and Engineering College of Engineering The Ohio State University Lecture 13 Road Map Lectures Administration Abstract machine characteristics Version control Software engineering
A new Mono GC. Paolo Molaro October 25, 2006
A new Mono GC Paolo Molaro lupus@novell.com October 25, 2006 Current GC: why Boehm Ported to the major architectures and systems Featurefull Very easy to integrate Handles managed pointers in unmanaged
Method-Level Phase Behavior in Java Workloads
Method-Level Phase Behavior in Java Workloads Andy Georges, Dries Buytaert, Lieven Eeckhout and Koen De Bosschere Ghent University Presented by Bruno Dufour dufour@cs.rutgers.edu Rutgers University DCS
Concurrent ML. John Reppy January 21, University of Chicago
Concurrent ML John Reppy jhr@cs.uchicago.edu University of Chicago January 21, 2016 Introduction Outline I Concurrent programming models I Concurrent ML I Multithreading via continuations (if there is
Today: Protection. Protection
Today: Protection Goals of Protection Domain of Protection Access Matrix Implementation of Access Matrix Revocation of Access Rights Capability-Based Systems Language-Based Protection 1 Protection Operating
MoarVM. A metamodel-focused runtime for NQP and Rakudo. Jonathan Worthington
MoarVM A metamodel-focused runtime for NQP and Rakudo Jonathan Worthington What does a VM typically do? Execute instructions (possibly by interpreting, possibly by JIT compilation, often a combination)
Architectural Support for Operating Systems. Jinkyu Jeong ( Computer Systems Laboratory Sungkyunkwan University
Architectural Support for Operating Systems Jinkyu Jeong ( jinkyu@skku.edu) Computer Systems Laboratory Sungkyunkwan University http://csl.skku.edu Today s Topics Basic services of OS Basic computer system
Administration CS 412/413. Why build a compiler? Compilers. Architectural independence. Source-to-source translator
CS 412/413 Introduction to Compilers and Translators Andrew Myers Cornell University Administration Design reports due Friday Current demo schedule on web page send mail with preferred times if you haven
High-level languages
High-level languages High-level languages are not immune to these problems. Actually, the situation is even worse: the source language typically operates over mixed-size values (multi-word and bitfield);
Complex, concurrent software. Precision (no false positives) Find real bugs in real executions
Harry Xu May 2012 Complex, concurrent software Precision (no false positives) Find real bugs in real executions Need to modify JVM (e.g., object layout, GC, or ISA-level code) Need to demonstrate realism
Synchronization I. Jo, Heeseung
Synchronization I Jo, Heeseung Today's Topics Synchronization problem Locks 2 Synchronization Threads cooperate in multithreaded programs To share resources, access shared data structures Also, to coordinate
Instrumentation of Java Bytecode for Runtime Analysis
Instrumentation of Java Bytecode for Runtime Analysis Allen Goldberg and Klaus Havelund Kestrel Technology, NASA Ames Research Center Moffett Field, MS 269-3, California USA Phone: 650-604-4858, Email:
Lecture content. Course goals. Course Introduction. TDDA69 Data and Program Structure Introduction Cyrille Berger
Lecture content TDDA69 Data and Program Structure Introduction Cyrille Berger Course Introduction Concepts and models of programming languages The different programming paradigms Why different paradigms?
Scala Actors. Scalable Multithreading on the JVM. Philipp Haller. Ph.D. candidate Programming Methods Lab EPFL, Lausanne, Switzerland
Scala Actors Scalable Multithreading on the JVM Philipp Haller Ph.D. candidate Programming Methods Lab EPFL, Lausanne, Switzerland The free lunch is over! Software is concurrent Interactive applications
AmbientTalk: Object-oriented Event-driven programming in Mobile Ad hoc Networks
AmbientTalk: Object-oriented Event-driven programming in Mobile Ad hoc Networks Tom Van Cutsem Stijn Mostinckx Elisa Gonzalez Boix Jessie Dedecker Wolfgang De Meuter Programming Technology Lab Vrije Universiteit
Linguistic Symbiosis between Actors and Threads
Linguistic Symbiosis between s and Threads Tom Van Cutsem Stijn Mostinckx Wolfgang De Meuter Programming Technology Lab Vrije Universiteit Brussel Brussels, Belgium International Conference on Dynamic
Comprehensive Development and Debug Coverage for Linux and Android on the MIPS Architecture
Comprehensive Development and Debug Coverage for Linux and Android on the MIPS Architecture Presented by MIPS Technologies Powering a Connected World October 2010 Today s presenters: Rick Leatherman VP
Last class: OS and Architecture. OS and Computer Architecture
Last class: OS and Architecture OS and Computer Architecture OS Service Protection Interrupts System Calls IO Scheduling Synchronization Virtual Memory Hardware Support Kernel/User Mode Protected Instructions
Last class: OS and Architecture. Chapter 3: Operating-System Structures. OS and Computer Architecture. Common System Components
Last class: OS and Architecture Chapter 3: Operating-System Structures System Components Operating System Services System Calls System Programs System Structure Virtual Machines System Design and Implementation