diagnosing memory leaks in large java applications
|
|
- April Conley
- 6 years ago
- Views:
Transcription
1 diagnosing memory leaks in large java applications Nick Mitchell, Gary Sevitsky IBM J Watson Research Center Hawthorne, New York, USA July 24, 2003
2 our two challenges big applications framework-heavy: J2EE web transaction processing object-noisy: myriad language-level memory managers high-volume: problem resolution occurs in (or near) production small tools automated: small budget for expertise and diagnosis time lightweight: tool must slow down production by <5%
3 knowing the common datatypes doesn't help much live instances java/lang/string com/ibm/servlet/util/hashtableentry java/util/hashtable$entry org/apache/xerces/dom/extimpl org/apache/xerces/dom/attrimpl org/apache/xalan/xpath/xml/stringostringable org/apache/xerces/dom/documentimpl 52 (in addition allocation sites are expensive to know, and, by themselves, don't add too much)
4 factoring out objects via heap differencing is insufficient new live instances java/lang/string 9444 org/apache/xerces/dom/extimpl 6810 org/apache/xerces/dom/attrimpl 5290 java/util/hashtable$entry 3244 org/apache/xerces/dom/namednodemapimpl 2713 org/apache/xerces/dom/elementimpl org/apache/xerces/dom/documentimpl 27
5 an atom of a leak (every leaking operation leaks lots of these objects) you're leaking Strings String
6 a bowl leaks (every leaking operation leaks one of these data structures) extimpl (an XML document) arrays ElementImpl AttrImpl DocumentImpl a whole leaking bowl of spaghetti NamedNodeMapImpl Vector AttrImpl String
7 group into data structures? # constituents com/ibm/servlet/dynamicclassloader com/ibm/servlet/dynamicclassloader com/.../xslransform com/.../propertiesfactory elements of Finalizer queue org/apache/xalan/xslt/emplatelist owned by native code if we wait long enough, then the leaking data structure will float to the top; otherwise, noise effects dominate
8 anatomy of a leak diagnose memory problems by understanding how regions within the reference graph evolve over time you're leaking Strings there is a region of the XSL rendering engine that is leaking XML docs leaking into a Vector
9 categories of region evolution XML documents
10 categories of region evolution XML documents
11 categories of region evolution growing without bound (a leak)
12 categories of region evolution constituency doesn't change (a pool) constituency is in flux (hot cache) growing without bound (a leak) transient (transaction-local) shrinking (cold cache)
13 summary of approach 1. reconstitute regions from reference graph use dominance, reachability, age, datatype 2. construct short-list of candidate leaking regions use mixture model to rank regions e.g. from 1M live objects, identify handful of highly-ranked regions 3. online probing validates, categorizes candidates introduce region change detectors, short traversals of a reference graph to detect three kinds of region evolution achieves perturbation of <2%
14 what defines a region? XSLransform XSLEngineImpl Vector [Object
15 what defines a region? oops, a leak! DocumentImpl ElementImpl XSLransform XSLEngineImpl Vector [Object
16 what defines a region? DocumentImpl ElementImpl XSLransform XSLEngineImpl Vector [Object oops, a leak! DocumentImpl ElementImpl
17 what defines a region? DocumentImpl ElementImpl XSLransform XSLEngineImpl Vector [Object DocumentImpl ElementImpl the set of objects that is historically on the fringe between old and new objects
18 what distinguishes regions? two regions, distinguished by datatype on the historic fringe DocumentImpl ElementImpl XSLransform XSLEngineImpl Vector [Object DocumentImpl ElementImpl Keytable
19 what distinguishes regions? two regions, distinguished by owning container DocumentImpl ElementImpl XSLransform XSLEngineImpl Vector [Object DocumentImpl ElementImpl Stack [Object DocumentImpl
20 what distinguishes regions? two regions, distinguished by root data structure DocumentImpl ElementImpl XSLransform XSLEngineImpl Vector [Object DocumentImpl ElementImpl emplatecache Hashtable [Hashtable$Entry DocumentImpl
21 region keys L: leak root DocumentImpl ElementImpl XSLransform XSLEngineImpl Vector [Object O: owner proxy DocumentImpl ElementImpl C: change proxy for each object o, associate region key (L,O,C) set of unique keys is initial set of regions
22 finding L, good leak roots Define leak root metric, LRM=B M G, such that each leaking region has one o with LRM(o)>0, and few o's have LRM(o)>. B: eight binary rules to rule out impossible (be Sherleak Holmes!) narrow from a million to a hundred M: mixture model to rank the remaining narrow from a hundred to tens G: global fixpoint to ensure uniqueness narrow from tens to a handful of highly-ranked leak roots
23 C. ibid for objects not at the head of a single-entry region B: ruling out the impossible (using structural information) fraction of objects remaining # objects -A -A-B -A-B-C -A-B-C-D phone company 267, IDE 350, brokerage1 838, brokerage2 1,015, credit bureau 1,320, D D A. objects pointing to nothing aren't very interesting B. arrays themselves don't leak (but their dominating containers might) C D B A A D. objects which don't uniquely own anything also aren't interesting
24 B: ruling out the impossible (using temporal information) # objects remaining # objects -structural -E -E-F -E-F-G all told phone company 267,956 16, IDE 350,136 25, brokerage1 838,912 26, brokerage2 1,015,112 12, credit bureau 1,320, , E. ignore structures that contain only old or only new objects (e.g. an already-primed pool) F. structures that contain only new arrays are borinng (theres nothing new in those arrays) G. ignore structures with no overlap in datatypes over time H. structures that contain no objects on the fringe are safe to ignore
25 M: the mixture model no single property is entirely indicative instead, use gated mixure of them all instances newer on-stack on-fringe type overlap EventNotifier 377,276 34% % hreaddiscriminator 274,433 2% % FormProperties % % XslemplateCache 32 90% % VerifySignonScenario 18 11% % this application had two leaks e.g. gating function
26 LRM=B M G, on brokerage2 (before applying the bug fixes) # constituents size rank LRM(o) com/.../eventnotifier com/.../formproperties com/.../xslemplatecollection com/.../verifysignonscenario of the highest-ranked candidate roots, the top two indeed leak (from 1,015,112 live objects)
27 LRM=B M G, on brokerage2 (after applying the bug fixes) # constituents size rank LRM(o) com/websphere/alarmhread com/.../contextmodel com/websphere/poolmanager com/websphere/poolepm after fixing the leak, there are no stand-out candidates (from 779,540 live objects)
28 detecting evolution cheaply a region evolves when elements are added to removed from relinked within track evolution with region change detectors
29 detecting evolution cheaply a region evolves when elements are added to removed from relinked within track evolution with region change detectors a detector is a tuple (R,H,,B,P,M) R: region to detect changes in H,: the head and tail of a short, bounded-size traversal B: a sample bias P: a match precondition M: a mutator, updates the set of existing detectors
30 XML documents a region evolves
31 XML documents a region evolves
32 a region evolves growing without bound (a leak)
33 a region evolves along the historic fringe thus, the traversals are the short path which just spans the fringe H
34 a region evolves along the historic fringe H H H H thus, the traversals are the short path which just spans the fringe H
35 preconditions instanceof DocumentImpl for additions, the precondition P is the datatype of the change proxy
36 a precondition is matched
37 once a detector fires, we mutate the set of detectors M: for additions, we remove the firing addition detector increase B of detectors with same R add removal detector add new addition detectors
38 leakbot and its loops snapshot the heap sleep recontruct regions dotimes(n) { d=next detector if(d.b > rand()) { traverse from d.h to d. if(d.p(d.)) { d.m() } } sleep } rank regions generate region change detectors
39 diagnosing memory leaks in large java applications Nick Mitchell, Gary Sevitsky IBM J Watson Research Center Hawthorne, New York, USA July 24, 2003
40 checking data structure properties at runtime, cheaply and automatically Nick Mitchell, Gary Sevitsky IBM J Watson Research Center Hawthorne, New York, USA July 24, 2003
41 leakbot in action just after initial analysis over time... about one minute later a non-leaking region and another few minutes... is downgraded
42 Strategies for Dissecting histogram by datatype Leaks (and some problems with each) Strings are in every data structure histogram by allocation site Strings are allocated everywhere expensive (c.f. HPROF's 5-10x slowdown) visualize reference graph an application doesn't just leak objects, it leaks entire (and entirely ugly) data structures c.f. Jinsight, JProbe, Purify
43 Summary of the LeakBot echnique structure live objects into Co-evolving Regions portions of data structures which change in similar ways rank regions according to likelihood of problem only present to user those regions likely to leak, the suspects e.g. of Schwab's 1M live objects, leakbot identifies three suspects offline mode track evolution of regions as program runs treat structuring and ranking as initial estimates e.g. we might have caught a pool being populated it'll eventually plateau from them, derive a scheme for very lightweight probing verify whether initial estimates correct, and update ranking online mode
44 anatomy of a leak? String
Understanding Performance in Large-scale Framework-based Systems
Research Division Understanding Performance in Large-scale Framework-based Systems Gary Sevitsky, Nick Mitchell, Harini Srinivasan Intelligent Analysis Tools Group April 18, 2005 Background Our group develops
More informationFIOSys (How FIOSys Works)
FIOSys (How FIOSys Works) A Software Developer's Tool that helps other Software Developers bring their products to market faster, with more advanced features, and added value so that their products are
More informationORACLE ENTERPRISE MANAGER 10g ORACLE DIAGNOSTICS PACK FOR NON-ORACLE MIDDLEWARE
ORACLE ENTERPRISE MANAGER 10g ORACLE DIAGNOSTICS PACK FOR NON-ORACLE MIDDLEWARE Most application performance problems surface during peak loads. Often times, these problems are time and resource intensive,
More informationGo with the Flow: Profiling Copies to Find Run-time Bloat
Go with the Flow: Profiling Copies to Find Run-time Bloat Guoqing Xu, Matthew Arnold, Nick Mitchell, Atanas Rountev, Gary Sevitsky Presented by Wei Fang February 10, 2015 Bloat Example A commercial document
More informationSoftware Analysis. Asymptotic Performance Analysis
Software Analysis Performance Analysis Presenter: Jonathan Aldrich Performance Analysis Software Analysis 1 Asymptotic Performance Analysis How do we compare algorithm performance? Abstract away low-level
More informationZing Vision. Answering your toughest production Java performance questions
Zing Vision Answering your toughest production Java performance questions Outline What is Zing Vision? Where does Zing Vision fit in your Java environment? Key features How it works Using ZVRobot Q & A
More informationPaging algorithms. CS 241 February 10, Copyright : University of Illinois CS 241 Staff 1
Paging algorithms CS 241 February 10, 2012 Copyright : University of Illinois CS 241 Staff 1 Announcements MP2 due Tuesday Fabulous Prizes Wednesday! 2 Paging On heavily-loaded systems, memory can fill
More informationJava performance - not so scary after all
Java performance - not so scary after all Holly Cummins IBM Hursley Labs 2009 IBM Corporation 2001 About me Joined IBM Began professional life writing event framework for WebSphere 2004 Moved to work on
More informationmemory management Vaibhav Bajpai
memory management Vaibhav Bajpai OS 2013 motivation virtualize resources: multiplex CPU multiplex memory (CPU scheduling) (memory management) why manage memory? controlled overlap processes should NOT
More informationACM Trivia Bowl. Thursday April 3 rd (two days from now) 7pm OLS 001 Snacks and drinks provided All are welcome! I will be there.
#1 ACM Trivia Bowl Thursday April 3 rd (two days from now) 7pm OLS 001 Snacks and drinks provided All are welcome! I will be there. If you are in one of the top three teams, I will give you one point of
More informationVirtual Memory #3 Oct. 10, 2018
15-410...The cow and Zaphod... Virtual Memory #3 Oct. 10, 2018 Dave Eckhardt Dave O'Hallaron 1 L19_VM3 Synchronization Exam Thursday! 18:30 Doherty A302 Homework 1 due tonight! Not at midnight! 2 Synchronization
More informationAn Indexing Scheme for a Scalable RDF Triple Store
An Indexing Scheme for a Scalable RDF Triple Store David Makepeace 1, David Wood 1, Paul Gearon 1, Tate Jones 1 and Tom Adams 1 1 Tucana Technologies, Inc., 11710 Plaza America Drive, Reston, VA, 20147,
More informationExploiting the Behavior of Generational Garbage Collector
Exploiting the Behavior of Generational Garbage Collector I. Introduction Zhe Xu, Jia Zhao Garbage collection is a form of automatic memory management. The garbage collector, attempts to reclaim garbage,
More informationFrom Java Code to Java Heap Understanding the Memory Usage of Your Application
Chris Bailey IBM Java Service Architect 3 rd October 2012 From Java Code to Java Heap Understanding the Memory Usage of Your Application 2012 IBM Corporation Important Disclaimers THE INFORMATION CONTAINED
More informationThin Locks: Featherweight Synchronization for Java
Thin Locks: Featherweight Synchronization for Java D. Bacon 1 R. Konuru 1 C. Murthy 1 M. Serrano 1 Presented by: Calvin Hubble 2 1 IBM T.J. Watson Research Center 2 Department of Computer Science 16th
More informationMidterm Exam Solutions Amy Murphy 28 February 2001
University of Rochester Midterm Exam Solutions Amy Murphy 8 February 00 Computer Systems (CSC/56) Read before beginning: Please write clearly. Illegible answers cannot be graded. Be sure to identify all
More informationTUTORIAL: WHITE PAPER. VERITAS Indepth for the J2EE Platform PERFORMANCE MANAGEMENT FOR J2EE APPLICATIONS
TUTORIAL: WHITE PAPER VERITAS Indepth for the J2EE Platform PERFORMANCE MANAGEMENT FOR J2EE APPLICATIONS 1 1. Introduction The Critical Mid-Tier... 3 2. Performance Challenges of J2EE Applications... 3
More informationLinked Lists. What is a Linked List?
Linked Lists Along with arrays, linked lists form the basis for pretty much every other data stucture out there. This makes learning and understand linked lists very important. They are also usually the
More informationCS 240 Fall Mike Lam, Professor. Priority Queues and Heaps
CS 240 Fall 2015 Mike Lam, Professor Priority Queues and Heaps Priority Queues FIFO abstract data structure w/ priorities Always remove item with highest priority Store key (priority) with value Store
More informationSummer Final Exam Review Session August 5, 2009
15-111 Summer 2 2009 Final Exam Review Session August 5, 2009 Exam Notes The exam is from 10:30 to 1:30 PM in Wean Hall 5419A. The exam will be primarily conceptual. The major emphasis is on understanding
More informationCSE373: Data Structures & Algorithms Lecture 12: Amortized Analysis and Memory Locality. Linda Shapiro Winter 2015
CSE373: Data Structures & Algorithms Lecture 12: Amortized Analysis and Memory Locality Linda Shapiro Winter 2015 Announcements Winter 2015 CSE 373 Data structures and Algorithms 2 Amortized Analysis In
More informationCSE373: Data Structures & Algorithms Lecture 12: Amortized Analysis and Memory Locality. Lauren Milne Spring 2015
CSE373: Data Structures & Algorithms Lecture 12: Amortized Analysis and Memory Locality Lauren Milne Spring 2015 Announcements Homework 3 due on Wednesday at 11pm Catie back Monday Spring 2015 CSE 373
More informationSegmentation. Multiple Segments. Lecture Notes Week 6
At this point, we have the concept of virtual memory. The CPU emits virtual memory addresses instead of physical memory addresses. The MMU translates between virtual and physical addresses. Don't forget,
More informationStaleness and Isolation in Prometheus 2.0. Brian Brazil Founder
Staleness and Isolation in Prometheus 2.0 Brian Brazil Founder Who am I? One of the core developers of Prometheus Founder of Robust Perception Primary author of Reliable Insights blog Contributor to many
More informationAgenda. 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
More informationOperating Systems Lecture 6: Memory Management II
CSCI-GA.2250-001 Operating Systems Lecture 6: Memory Management II Hubertus Franke frankeh@cims.nyu.edu What is the problem? Not enough memory Have enough memory is not possible with current technology
More informationPerformance of Non-Moving Garbage Collectors. Hans-J. Boehm HP Labs
Performance of Non-Moving Garbage Collectors Hans-J. Boehm HP Labs Why Use (Tracing) Garbage Collection to Reclaim Program Memory? Increasingly common Java, C#, Scheme, Python, ML,... gcc, w3m, emacs,
More informationRuntime. 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
More informationAutomatic Memory Management
Automatic Memory Management Why Automatic Memory Management? Storage management is still a hard problem in modern programming Why Automatic Memory Management? Storage management is still a hard problem
More informationThe Processor Memory Hierarchy
Corrected COMP 506 Rice University Spring 2018 The Processor Memory Hierarchy source code IR Front End Optimizer Back End IR target code Copyright 2018, Keith D. Cooper & Linda Torczon, all rights reserved.
More informationJ2EE Instrumentation for software aging root cause application component determination with AspectJ
J2EE Instrumentation for software aging root cause application component determination with AspectJ Javier Alonso Josep Ll. Berral Ricard Gavaldà Jordi Torres Technical University of Catalonia, Spain Contents
More informationMemory Management: The Details
Lecture 10 Memory Management: The Details Sizing Up Memory Primitive Data Types Complex Data Types byte: char: short: basic value (8 bits) 1 byte 2 bytes Pointer: platform dependent 4 bytes on 32 bit machine
More informationAutomatic Garbage Collection
Automatic Garbage Collection Announcements: PS6 due Monday 12/6 at 11:59PM Final exam on Thursday 12/16 o PS6 tournament and review session that week Garbage In OCaml programs (and in most other programming
More informationKodewerk. Java Performance Services. The War on Latency. Reducing Dead Time Kirk Pepperdine Principle Kodewerk Ltd.
Kodewerk tm Java Performance Services The War on Latency Reducing Dead Time Kirk Pepperdine Principle Kodewerk Ltd. Me Work as a performance tuning freelancer Nominated Sun Java Champion www.kodewerk.com
More informationThe HALFWORD HEAP EMULATOR
The HALFWORD HEAP EMULATOR EXPLORING A VIRTUAL MACHINE patrik Nyblom, Ericsson ab pan@erlang.org The Beam Virtual Machine Björns/Bogdans Erlang Abstract Machine Has evolved over the years and is a joint
More informationAdvanced Programming & C++ Language
Advanced Programming & C++ Language ~6~ Introduction to Memory Management Ariel University 2018 Dr. Miri (Kopel) Ben-Nissan Stack & Heap 2 The memory a program uses is typically divided into four different
More informationHabanero Extreme Scale Software Research Project
Habanero Extreme Scale Software Research Project Comp215: Performance Zoran Budimlić (Rice University) To suffer the penalty of too much haste, which is too little speed. - Plato Never sacrifice correctness
More informationProgramming Language Implementation
A Practical Introduction to Programming Language Implementation 2014: Week 10 Garbage Collection College of Information Science and Engineering Ritsumeikan University 1 review of last week s topics dynamic
More information현재이이미지를표시할수없습니다. Chapter 9: Virtual Memory
현재이이미지를표시할수없습니다. Chapter 9: Virtual Memory Objectives To describe the benefits of a virtual memory system To explain the concepts of demand paging, page-replacement algorithms, and allocation of page frames
More informationLecture 15 Advanced Garbage Collection
Lecture 15 Advanced Garbage Collection I. Break Up GC in Time (Incremental) II. Break Up GC in Space (Partial) Readings: Ch. 7.6.4-7.7.4 CS243: Advanced Garbage Collection 1 Trace-Based GC: Memory Life-Cycle
More informationOne-Slide Summary. Lecture Outine. Automatic Memory Management #1. Why Automatic Memory Management? Garbage Collection.
Automatic Memory Management #1 One-Slide Summary An automatic memory management system deallocates objects when they are no longer used and reclaims their storage space. We must be conservative and only
More informationLecture 13: Garbage Collection
Lecture 13: Garbage Collection COS 320 Compiling Techniques Princeton University Spring 2016 Lennart Beringer/Mikkel Kringelbach 1 Garbage Collection Every modern programming language allows programmers
More informationJune IBM Power Academy. IBM PowerVM memory virtualization. Luca Comparini STG Lab Services Europe IBM FR. June,13 th Dubai
June 2012 @Dubai IBM Power Academy IBM PowerVM memory virtualization Luca Comparini STG Lab Services Europe IBM FR June,13 th 2012 @IBM Dubai Agenda How paging works Active Memory Sharing Active Memory
More informationIP subnetting made easy
Version 1.0 June 28, 2006 By George Ou Introduction IP subnetting is a fundamental subject that's critical for any IP network engineer to understand, yet students have traditionally had a difficult time
More informationRun-Time Environments/Garbage Collection
Run-Time Environments/Garbage Collection Department of Computer Science, Faculty of ICT January 5, 2014 Introduction Compilers need to be aware of the run-time environment in which their compiled programs
More informationWe've tried to include the common errors and grading standard for every question.
Fall 2003 CS61B Midterm (50/300 points) ;;;; Meta ;;;; GS = Grading Standard We've tried to include the common errors and grading standard for every question. QUESTION 1 GS: The T/F questions were worth
More informationNooks. Robert Grimm New York University
Nooks Robert Grimm New York University The Three Questions What is the problem? What is new or different? What are the contributions and limitations? Design and Implementation Nooks Overview An isolation
More informationAcknowledgements These slides are based on Kathryn McKinley s slides on garbage collection as well as E Christopher Lewis s slides
Garbage Collection Last time Compiling Object-Oriented Languages Today Motivation behind garbage collection Garbage collection basics Garbage collection performance Specific example of using GC in C++
More informationCMSC 330: Organization of Programming Languages
CMSC 330: Organization of Programming Languages Memory Management and Garbage Collection CMSC 330 - Spring 2013 1 Memory Attributes! Memory to store data in programming languages has the following lifecycle
More information6.172 Performance Engineering of Software Systems Spring Lecture 9. P after. Figure 1: A diagram of the stack (Image by MIT OpenCourseWare.
6.172 Performance Engineering of Software Systems Spring 2009 Lecture 9 MIT OpenCourseWare Dynamic Storage Allocation Stack allocation: LIFO (last-in-first-out) Array and pointer A used unused P before
More informationErlang in the battlefield. Łukasz Kubica Telco BSS R&D Department Cracow Erlang Factory Lite, 2013
Erlang in the battlefield Łukasz Kubica Telco BSS R&D Department Cracow Erlang Factory Lite, 2013 Agenda Introduction to the SCM Erlang vm and upgrades Tracing Mnesia Final thoughts Questions 2 The Session
More informationException Safety. CS 311 Data Structures and Algorithms Lecture Slides Wednesday, October 28, Glenn G. Chappell. continued
continued CS 311 Data Structures and Algorithms Lecture Slides Wednesday, October 28, 2009 Glenn G. Chappell Department of Computer Science University of Alaska Fairbanks CHAPPELLG@member.ams.org 2005
More informationDynamic Storage Allocation
6.172 Performance Engineering of Software Systems LECTURE 10 Dynamic Storage Allocation Charles E. Leiserson October 12, 2010 2010 Charles E. Leiserson 1 Stack Allocation Array and pointer A un Allocate
More informationSummary: Open Questions:
Summary: The paper proposes an new parallelization technique, which provides dynamic runtime parallelization of loops from binary single-thread programs with minimal architectural change. The realization
More informationPractical Lessons in Memory Analysis
Practical Lessons in Memory Analysis Krum Tsvetkov SAP AG Andrew Johnson IBM United Kingdom Limited GOAL > Learn practical tips and tricks for the analysis of common memory-related problems 2 Agenda >
More informationData structures. Priority queues, binary heaps. Dr. Alex Gerdes DIT961 - VT 2018
Data structures Priority queues, binary heaps Dr. Alex Gerdes DIT961 - VT 2018 Announcements Course representatives - Mohamad Qutbuddin Habib - Carl Agrell - Gunnar Stenlund Kunsulttid: jag är på kontor
More informationVirtual or Logical. Logical Addr. MMU (Memory Mgt. Unit) Physical. Addr. 1. (50 ns access)
Virtual Memory - programmer views memory as large address space without concerns about the amount of physical memory or memory management. (What do the terms 3-bit (or 6-bit) operating system or overlays
More informationBasic Steps and Features Walk-through
Welcome to the SAP Memory Analyzer SAP Memory Analyzer: Basic Steps and Features Walk-through SAP AG 2007, Memory Analysis with SAP Memory Analyzer / 1 Basic Steps with SAP Memory Analyzer (1) Get Heap
More informationLecture Notes: Unleashing MAYHEM on Binary Code
Lecture Notes: Unleashing MAYHEM on Binary Code Rui Zhang February 22, 2017 1 Finding Exploitable Bugs 1.1 Main Challenge in Exploit Generation Exploring enough of the state space of an application to
More informationIntroduction. Chapter 1:
Introduction Chapter 1: SYS-ED/Computer Education Techniques, Inc. Ch 1: 1 SYS-ED/Computer Education Techniques, Inc. 1:1 Objectives You will learn: New features of. Interface to COBOL and JAVA. Object-oriented
More informationSynchronization. CS61, Lecture 18. Prof. Stephen Chong November 3, 2011
Synchronization CS61, Lecture 18 Prof. Stephen Chong November 3, 2011 Announcements Assignment 5 Tell us your group by Sunday Nov 6 Due Thursday Nov 17 Talks of interest in next two days Towards Predictable,
More informationVirtual Memory. Overview: Virtual Memory. Virtual address space of a process. Virtual Memory. Demand Paging
TDDB68 Concurrent programming and operating systems Overview: Virtual Memory Virtual Memory [SGG7/8] Chapter 9 Background Demand Paging Page Replacement Allocation of Frames Thrashing and Data Access Locality
More informationIntel Threading Tools
Intel Threading Tools Paul Petersen, Intel -1- INFORMATION IN THIS DOCUMENT IS PROVIDED IN CONNECTION WITH INTEL PRODUCTS. EXCEPT AS PROVIDED IN INTEL'S TERMS AND CONDITIONS OF SALE FOR SUCH PRODUCTS,
More informationHeap Management. Heap Allocation
Heap Management Heap Allocation A very flexible storage allocation mechanism is heap allocation. Any number of data objects can be allocated and freed in a memory pool, called a heap. Heap allocation is
More informationBugs in Deployed Software
Bell: Bit-Encoding Online Memory Leak Detection Michael D. Bond Kathryn S. McKinley University of Texas at Austin Bugs in Deployed Software Humans rely on software for critical tasks Bugs are costly &
More informationWhich Configuration Option Should I Change?
Which Configuration Option Should I Change? Sai Zhang Michael D. Ernst Department of Computer Science & Engineering University of Washington, USA {szhang, mernst}@cs.washington.edu ABSTRACT Modern software
More informationEconomies of Scale in Hacking Dave Aitel Immunity
Economies of Scale in Hacking Dave Aitel Immunity Ekoparty, 2008 (Argentina) 10/01/08 1 Demand Side/Supply Side Economies of Scale Networked increase in value High barrier of entry Cheaper as you get bigger
More informationAdvanced Java Concepts Unit 2: Linked Lists.
Advanced Java Concepts Unit 2: Linked Lists. The List interface defines the structure of a linear collection. Here are some of its methods. boolean add( E element ) Appends the element to the end of the
More informationPerformance Case Study
Performance Case Study @Fabian_Frank Yahoo! Search, Engineer Youthmedia.eu, Volunteer A Dynamic Website self-contained App self-contained App self-contained App node v0.4.x multi-core
More informationHi everyone. Starting this week I'm going to make a couple tweaks to how section is run. The first thing is that I'm going to go over all the slides
Hi everyone. Starting this week I'm going to make a couple tweaks to how section is run. The first thing is that I'm going to go over all the slides for both problems first, and let you guys code them
More informationNew Algorithms for Attack Planning
New Algorithms for Attack Planning Carlos Sarraute Core Security Technologies and Ph.D. program in Informatics Engineering, ITBA FRHACK Sept 7/8, 2009 Brief presentation My company: Core Security Technologies
More informationMemory Allocation, Page Replacement and Working Sets
Memory Allocation, Page Replacement and Working Sets 1. PROJECT: Many people want to combine projects for two classes or independent studies Have to have at least 3 people total on the project, at least
More informationHeapy a memory profiler and debugger for Python
Heapy a memory profiler and debugger for Python Sverker Nilsson sverker.is@home.se June 2, 2006 Goal Make a tool for the Python programming language Support memory debugging and optimization Provide data
More informationCMSC 330: Organization of Programming Languages
CMSC 330: Organization of Programming Languages Memory Management and Garbage Collection CMSC 330 Spring 2017 1 Memory Attributes Memory to store data in programming languages has the following lifecycle
More informationCSE 544 Principles of Database Management Systems
CSE 544 Principles of Database Management Systems Alvin Cheung Fall 2015 Lecture 5 - DBMS Architecture and Indexing 1 Announcements HW1 is due next Thursday How is it going? Projects: Proposals are due
More informationSAP Memory Analyzer: Multi-Gigabyte Java Heap Dumps Are Nothing to Fear Now
SAP Memory Analyzer: Multi-Gigabyte Java Heap Dumps Are Nothing to Fear Now Applies to: Java development in general Summary SAP has developed a tool for Java memory analysis which is helpful to all Java
More informationReal-Time Garbage Collection Panel JTRES 2007
Real-Time Garbage Collection Panel JTRES 2007 Bertrand Delsart, Sun Sean Foley, IBM Kelvin Nilsen, Aonix Sven Robertz, Lund Univ Fridtjof Siebert, aicas Feedback from our customers Is it fast enough to
More informationDiagnostics in Testing and Performance Engineering
Diagnostics in Testing and Performance Engineering This document talks about importance of diagnostics in application testing and performance engineering space. Here are some of the diagnostics best practices
More informationTesting Objectives. Successful testing: discovers previously unknown errors
Testing Objectives Informal view: Testing: a process of executing software with the intent of finding errors Good testing: a high probability of finding as-yetundiscovered errors Successful testing: discovers
More information1 Performance Optimization in Java/J2EE
1 Performance Optimization in Java/J2EE 1.1 Java Server Technology (J2EE) Fundamentals 1.1.1 Overview To reduce costs and fast-track enterprise application design and development, the Java 2 Platform,
More informationDistributed Algorithms 6.046J, Spring, 2015 Part 2. Nancy Lynch
Distributed Algorithms 6.046J, Spring, 2015 Part 2 Nancy Lynch 1 This Week Synchronous distributed algorithms: Leader Election Maximal Independent Set Breadth-First Spanning Trees Shortest Paths Trees
More informationDell PowerEdge R730xd Servers with Samsung SM1715 NVMe Drives Powers the Aerospike Fraud Prevention Benchmark
Dell PowerEdge R730xd Servers with Samsung SM1715 NVMe Drives Powers the Aerospike Fraud Prevention Benchmark Testing validation report prepared under contract with Dell Introduction As innovation drives
More informationChapter 1 GETTING STARTED. SYS-ED/ Computer Education Techniques, Inc.
Chapter 1 GETTING STARTED SYS-ED/ Computer Education Techniques, Inc. Objectives You will learn: Java platform. Applets and applications. Java programming language: facilities and foundation. Memory management
More informationTo Kill a Monolith: Slaying the Demons of a Monolith with Node.js Microservices on CloudFoundry. Tony Erwin,
To Kill a Monolith: Slaying the Demons of a Monolith with Node.js Microservices on CloudFoundry Tony Erwin, aerwin@us.ibm.com Agenda Origins of the Bluemix UI Demons of the Monolith Slaying Demons with
More informationChapter 8. Operating System Support. Yonsei University
Chapter 8 Operating System Support Contents Operating System Overview Scheduling Memory Management Pentium II and PowerPC Memory Management 8-2 OS Objectives & Functions OS is a program that Manages the
More informationCS61C : Machine Structures
inst.eecs.berkeley.edu/~cs61c/su06 CS61C : Machine Structures Lecture #23: VM I 2006-08-08 CS 61C L23 VM I (1) Andy Carle Outline Cache Review Virtual Memory CS 61C L23 VM I (2) Improving Miss Penalty
More informationFast and Lock-Free Concurrent Priority Queues for Multi-Thread Systems
Fast and Lock-Free Concurrent Priority Queues for Multi-Thread Systems Håkan Sundell Philippas Tsigas Outline Synchronization Methods Priority Queues Concurrent Priority Queues Lock-Free Algorithm: Problems
More informationmalloc(), calloc(), realloc(), and free()
1 next CITS2002 CITS2002 schedule Dynamic data structures Initially, we focused on scalar and array variables, whose size is known at compile-time. More recently, we've focused on arrays of values, whose
More informationMozart System Limitations for Version (draft)
Mozart System Limitations for Version 1.3.0 (draft) Peter Van Roy and Seif Haridi April 28, 2004 In der Beschränkung zeigt sich erst der Meister. Within limitations the Master is first revealed. Johann
More informationWeek 12: Priority queues Heaps and heap operations
Week 12: Priority queues Heaps and heap operations Comp 271 Spring, 2012 Mr. Weisert The queues we studied in week 6 were FIFO Many real-world situations consider other criteria for choosing which object
More informationCOMP 530: Operating Systems File Systems: Fundamentals
File Systems: Fundamentals Don Porter Portions courtesy Emmett Witchel 1 Files What is a file? A named collection of related information recorded on secondary storage (e.g., disks) File attributes Name,
More informationI J C S I E International Science Press
Vol. 5, No. 2, December 2014, pp. 53-56 I J C S I E International Science Press Tolerating Memory Leaks at Runtime JITENDER SINGH YADAV, MOHIT YADAV, KIRTI AZAD AND JANPREET SINGH JOLLY CSE B-tech 4th
More informationFS Consistency & Journaling
FS Consistency & Journaling Nima Honarmand (Based on slides by Prof. Andrea Arpaci-Dusseau) Why Is Consistency Challenging? File system may perform several disk writes to serve a single request Caching
More informationTypes II. Hwansoo Han
Types II Hwansoo Han Arrays Most common and important composite data types Homogeneous elements, unlike records Fortran77 requires element type be scalar Elements can be any type (Fortran90, etc.) A mapping
More informationVMem. By Stewart Lynch.
VMem By Stewart Lynch. 1 Contents Introduction... 3 Overview... 4 Getting started... 6 Fragmentation... 7 Virtual Regions... 8 The FSA... 9 Biasing... 10 The Coalesce allocator... 11 Skewing indices...
More informationJava Concurrency in practice Chapter 9 GUI Applications
Java Concurrency in practice Chapter 9 GUI Applications INF329 Spring 2007 Presented by Stian and Eirik 1 Chapter 9 GUI Applications GUI applications have their own peculiar threading issues To maintain
More information16 Sharing Main Memory Segmentation and Paging
Operating Systems 64 16 Sharing Main Memory Segmentation and Paging Readings for this topic: Anderson/Dahlin Chapter 8 9; Siberschatz/Galvin Chapter 8 9 Simple uniprogramming with a single segment per
More informationChapter 9: Virtual Memory
Chapter 9: Virtual Memory Silberschatz, Galvin and Gagne 2013 Chapter 9: Virtual Memory Background Demand Paging Copy-on-Write Page Replacement Allocation of Frames Thrashing Memory-Mapped Files Allocating
More informationCS162 Operating Systems and Systems Programming Lecture 14. Caching (Finished), Demand Paging
CS162 Operating Systems and Systems Programming Lecture 14 Caching (Finished), Demand Paging October 11 th, 2017 Neeraja J. Yadwadkar http://cs162.eecs.berkeley.edu Recall: Caching Concept Cache: a repository
More informationCSE 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
More information