Performance Analysis
|
|
|
- Jacob Rice
- 5 years ago
- Views:
Transcription
1 Performance Analysis
2 Help! My system is slow! slow.pdf
3 What you can do to improve performance Memory size has a major influence on performance Correct the problems of usage Load balance appliance Organize the system s hard disks and filesystems Monitoring your networks
4 Factors that affect Performance Four major resources CPU Time Memory Hard disk I/O bandwidth Network I/O bandwidth Where is the real bottleneck Not CPU, hard disk bandwidth it is!! When memory is not enough, system will do swap, so memory and disk bandwidth are the major suspects
5 Analyzing CPU usage (1) Three information of CPU Overall utilization Help to identify whether the CPU resource is the system bottleneck Load average Per-process consumption Identify specific process s CPU utilization
6 Analyzing CPU usage (2) vmstat command Report kernel statistics about process, memory, cpu,.. Usage: % vmstat c 2 w 1 us: user time High us means high computation sy: system time High sy means process are making lots of system call or performing I/O id: cpu idle us and sy time should half-half Monitoring interval should not be too small tytsai@u3:/var/log> vmstat c 2 w 5 procs memory page disks faults cpu r b w avm fre flt re pi po fr sr da0 da1 in sy cs us sy id
7 Analyzing CPU usage (3) faults (average per second over last 5 seconds) in: device interrupt per interval sy: system calls per interval cs: cpu context switch rate Nothing to do Server tytsai@u3:/var/log> vmstat c 2 w 5 procs memory page disks faults cpu r b w avm fre flt re pi po fr sr da0 da1 in sy cs us sy id High load, busy http server tytsai@ccbsd3:~> vmstat c 5 w 5 procs memory page disk faults cpu r b w avm fre flt re pi po fr sr ad0 in sy cs us sy id
8 Analyzing CPU usage (4) Load average The average number of runnable processes Including processes waiting for disk or network I/O uptime command Show how long system has been running and the load average of the system over the last 1, 5, and 15 minutes Usage: % uptime {tytsai@mgate2}~> uptime 8:22AM up 6 days, 22:13, 2 users, load averages: 0.06, 0.02, 0.00
9 Analyzing CPU usage (5) top command Display and update information about the top cpu processes ps command Show process status renice command renice n increment p pid renice u daemon root p 32
10 Analyzing memory usage (1) When memory is not enough Memory page has to be swapped out to the disk block LRU (Least Recently Used) algorithm Bad situation desperation swapping Kernel forcibly swaps out runnable process Extreme memory shortage Two numbers that quantify memory activity Total amount of active virtual memory Tell you the total demand for memory Page rate suggest the proportion of actively used memory
11 Analyzing memory usage (2) To see amount of swap space in use pstat s or swapinfo -k (FreeBSD) swapon s (Linux) swap l (Solaris) pstat command % pstat -s csduty[~] -chiahung- pstat -s Device 1K-blocks Used Avail Capacity /dev/label/swap % /dev/label/swap % Total %
12 Analyzing memory usage (3) vmstat command procs r: in run queue b: blocked for resource w: runnable or short sleeper but swapped memory avm: active virtual pages fre: size of the free list page (averaged each five seconds, given in units per second) flt: total number of page faults pi: pages paged in po: pages paged out 50 page-out cause about 1 seconds latency fr: pages freed per second csws1[~] -chiahung- vmstat -c 3 -w 5 procs memory page disks r b w avm fre flt re pi po fr sr da0 da M 1196M M 1196M M 1196M
13 Analyzing disk I/O iostat command Report I/O statistics Usage: iostat w 1 c 5 tin/tout: characters read from /write to terminal KB/t: kilobytes per transfer tps: transfers per second MB/s: megabytes per second FreeBSD:~ -lwhsu- iostat da0 -w 1 tty da0 cpu tin tout KB/t tps MB/s us ni sy in id
![Analyzing network The four most common uses of netstat Monitoring the status of network connections netstat a Inspecting interface configuration information netstat i derek[~] -chiahung- netstat I](/docs-images/92/110828649/images/14-1.jpg "Name Mtu Network Address Ipkts Ierrs Opkts Oerrs Coll bge0 1500 140.113.240.0 derek 225673")
14 Analyzing network The four most common uses of netstat Monitoring the status of network connections netstat a Inspecting interface configuration information netstat i derek[~] -chiahung- netstat I Name Mtu Network Address Ipkts Ierrs Opkts Oerrs Coll bge derek bge lo your-net localhost Examining the routing table netstat r n Viewing operational statistics for network protocols
15 systat display system statistics /0 /1 /2 /3 /4 /5 /6 /7 /8 /9 /10 Load Average Interface Traffic Peak Total lo0 in KB/s KB/s MB out KB/s KB/s MB systat -ifstat em0 in KB/s KB/s GB out KB/s KB/s GB 22 users Load Dec 28 21:41 systat -vmstat Mem:KB REAL VIRTUAL VN PAGER SWAP PAGER Tot Share Tot Share Free in out in out Act count 3 All k pages 3 Proc: Interrupts r p d s w Csw Trp Sys Int Sof Flt 631 cow total k k zfod atkbd0 1 ozfod 51 atapci %Sys 0.3%Intr 2.5%User 0.0%Nice 91.3%Idle %ozfod 778 ahc0 irq24 daefr ahc1 irq25 ===> 764 prcfr 2000 cpu0: time 29 dtbuf totfr 876 em0 irq256 Namei Name-cache Dir-cache desvn react 4 em1 irq257 Calls hits % hits % numvn pdwak 2000 cpu1: time frevn pdpgs 2000 cpu2: time intrn 2000 cpu3: time Disks ad4 ad6 ad8 ad10 da0 pass wire 2000 cpu5: time KB/t act 2000 cpu7: time tps inact 2000 cpu4: time MB/s cache 2000 cpu6: time %busy free buf
16 *stat commands lucky7:/bin -lwhsu- ls -al {,/usr}{/bin,/sbin}/*stat -r-xr-xr-x 1 root wheel Jan 2 18:52 /sbin/ipfstat* -r-xr-xr-x 1 root wheel Jan 2 18:52 /sbin/kldstat* -r-xr-sr-x 1 root kmem Jan 2 18:53 /usr/bin/btsockstat* -r-xr-sr-x 1 root kmem Jan 2 18:53 /usr/bin/fstat* -r-xr-sr-x 1 root kmem Jan 2 18:53 /usr/bin/netstat* -r-xr-xr-x 1 root wheel Jan 2 18:53 /usr/bin/nfsstat* -r-xr-xr-x 1 root wheel Jan 2 18:53 /usr/bin/procstat* -r-xr-xr-x 1 root wheel Jan 2 18:53 /usr/bin/sockstat* -r-xr-xr-x 2 root wheel Jan 2 18:53 /usr/bin/stat* -r-xr-xr-x 1 root wheel Jan 2 18:53 /usr/bin/systat* -r-xr-xr-x 1 root wheel Jan 2 18:53 /usr/bin/vmstat* -r-xr-xr-x 1 root wheel Jan 2 18:53 /usr/sbin/gstat* lrwxr-xr-x 1 root wheel - 21 Jan 2 18:53 /usr/sbin/hoststat@ -> /usr/sbin/mailwrapper -r-xr-x--- 1 root wheel Jan 2 18:53 /usr/sbin/ifmcstat* -r-xr-xr-x 1 root wheel Jan 2 18:53 /usr/sbin/iostat* -r-xr-xr-x 1 root wheel Jan 2 18:53 /usr/sbin/pmcstat* -r-xr-xr-x 2 root wheel Jan 2 18:53 /usr/sbin/pstat* lrwxr-xr-x 1 root wheel - 21 Jan 2 18:53 /usr/sbin/purgestat@ -> /usr/sbin/mailwrapper -r-xr-xr-x 1 root wheel Jan 2 18:53 /usr/sbin/slstat*
17 top top m cpu (default) last pid: 61540; load averages: 0.30, 0.31, 0.32 up 17+09:57:18 13:57: processes: 1 running, 241 sleeping CPU states: % user, % nice, % system, % interrupt, % idle Mem: 2195M Active, 7466M Inact, 1574M Wired, 21M Cache, 214M Buf, 619M Free Swap: 2048M Total, 140K Used, 2048M Free PID USERNAME THR PRI NICE SIZE RES STATE C TIME WCPU COMMAND squid M 384M ucond 1 35: % squid bind K 59544K select 1 32: % named root K 3144K select 1 9: % sshd nobody K 14716K select 3 8: % rsync top m io last pid: 9347; load averages: 0.21, 0.29, 0.32 up 17+09:58:20 13:58: processes: 1 running, 242 sleeping CPU states: 0.5% user, 0.0% nice, 1.2% system, 0.0% interrupt, 98.3% idle Mem: 2200M Active, 7484M Inact, 1604M Wired, 25M Cache, 214M Buf, 562M Free Swap: 2048M Total, 140K Used, 2048M Free PID USERNAME VCSW IVCSW READ WRITE FAULT TOTAL PERCENT COMMAND cvsup % cvsupd squid % squid bind % named root % sshd
18 gstat L(q) ops/s r/s kbps ms/r w/s kbps ms/w %busy Name acd da ad ad ad4s ad5s ad ad4s1a ad4s1b ad4s1c ad4s1d ad ad5s1a ad5s1b ad5s1c ad5s1d mirror/gm0s1a
Help! My system is slow!, meetbsd, 2008, Kris Kennaway
Performance is a meaningless concept in isolation It only makes sense to talk about performance of a particular workload, and according to a particular set of metrics The first step is to characterize
Unix Tools and Scripts to Monitor Informix IDS
Unix Tools and Scripts to Monitor Informix IDS Lester Knutsen Advanced DataTools Corporation Background Lester Knutsen has been developing database applications with Informix databases since 1983. He is
Monitoring and Tuning IBM Informix IDS Server. Lester Knutsen
Monitoring and Tuning IBM Informix IDS Server Lester Knutsen Areas to Monitor and Tune CPU Usage How busy are the CPUs? Memory Usage How much memory is being used? Disk Usage What is the disk I/O throughput?
Process States. Controlling processes. Process states. PID and PPID UID and EUID GID and EGID Niceness Control terminal. Runnable. Sleeping.
Controlling processes PID and PPID UID and EUID GID and EGID Niceness Control terminal 1 Process States Process states Runnable The process can be executed Waiting for CPU Sleeping The process is waiting
Staying Out of the Swamp
Staying Out of the Swamp Perforce User Conference 2001 Richard E. Baum Introduction Perforce runs well when given proper resources. CPU requirements are quite small. A server s I/O bandwidth is generally
Technology Overview. Frequently Asked Questions: Routing Protocol Process Memory. Published: Copyright 2014, Juniper Networks, Inc.
Technology Overview Frequently Asked Questions: Routing Protocol Process Memory Published: 2014-01-10 Juniper Networks, Inc. 1194 North Mathilda Avenue Sunnyvale, California 94089 USA 408-745-2000 www.juniper.net
Section 9: Cache, Clock Algorithm, Banker s Algorithm and Demand Paging
Section 9: Cache, Clock Algorithm, Banker s Algorithm and Demand Paging CS162 March 16, 2018 Contents 1 Vocabulary 2 2 Problems 3 2.1 Caching.............................................. 3 2.2 Clock Algorithm.........................................
CIT 470: Advanced Network and System Administration. Topics. What is performance testing? Performance Monitoring
CIT 470: Advanced Network and System Administration Performance Monitoring CIT 470: Advanced Network and System Administration Slide #1 Topics 1. Performance testing 2. Performance tuning. 3. CPU 4. Memory
Solaris Performance: Introduction
Solaris Performance: Introduction Brendan Gregg Sun Microsystems May 2007 # vmstat 1 kthr memory page r b w swap free re mf pi po fr de 0 0 0 4596848 120908 0 3 0 0 0 0 0 0 0 4411920 48652 14 27 0 0 0
Performance Tuning Transaction Processing Systems
Performance Tuning Transaction Processing Systems r. Russ Shermer, CSQA, CSTE Solving the Software Quality Puzzle Page 1 Introduction Motivation & background Comparison of Real-time and Batch Terminology
Chapter 4 Controlling Processes
Chapter 4 Controlling Processes Program to Process Program is dead Just lie on disk grep is a program /usr/bin/grep % file /usr/bin/grep ELF 32-bit LSB executable When you execute it It becomes a process
Exam Name: Aix 5l performance and systems tuning
Exam Code: 000-234 Exam Name: Aix 5l performance and systems tuning Vendor: IBM Version: DEMO Part: A 1: Users complain an AIX server is running slow. Which of the following commands can be run to determine
Checking Resource Usage in Fedora (Linux)
Lab 5C Checking Resource Usage in Fedora (Linux) Objective In this exercise, the student will learn how to check the resources on a Fedora system. This lab covers the following commands: df du top Equipment
Optimizing the Operating System (Unix, Linux) for best Informix Database Performance by Lester Knutsen. Webcast on May 17 at 2:00pm EDT 1
Optimizing the Operating System (Unix, Linux) for best Informix Database Performance by Lester Knutsen Webcast on May 17 at 2:00pm EDT 1 Lester Knutsen Lester Knutsen is President of Advanced DataTools
Performance and Workload Management
Course materials may not be reproduced in whole or in part without the prior written permission of IBM. 5.0 4.1 Performance and Workload Management Unit Objectives After completing this unit, you should
PROCESSES. At least they re not ISO-9001 processes
PROCESSES At least they re not ISO-9001 processes STRUCTURE In Linux, a Process wraps up everything that is needed to know about a running piece of software The meta information not only includes the machine
Practical 5. Linux Commands: Working with Files
Practical 5 Linux Commands: Working with Files 1. Ps The ps command on linux is one of the most basic commands for viewing the processes running on the system. It provides a snapshot of the current processes
A Hitchhiker's guide for performance assessment & benchmarking SAS applications Viraj Kumbhakarna, JPMorgan Chase & Co.
A Hitchhiker's guide for performance assessment & benchmarking SAS applications Viraj Kumbhakarna, JPMorgan Chase & Co., Columbus, OH Abstract Almost every IT department today, needs some kind of an IT
Managing Processes Process: A running program
Managing Processes Process: A running program User Process: The process initiated by a User while logged into a terminal (e.g. grep, find, ls) Daemon Process: These processes are usually initiated on system
Filesystem Performance on FreeBSD
Filesystem Performance on FreeBSD Kris Kennaway kris@freebsd.org BSDCan 2006, Ottawa, May 12 Introduction Filesystem performance has many aspects No single metric for quantifying it I will focus on aspects
Linux System Administration
System Processes Objective At the conclusion of this module, the student will be able to: Describe and define a process Identify a process ID, the parent process and the child process Learn the PID for
Linux Installation. Prepared by: William Zereneh
Linux Installation Prepared by: William Zereneh zereneh@scs.ryerson.ca Introduction 1. System Installation and Customization 2. System Maintenance 3. System Performance and Monitoring 1.Installation and
Question No: 1 In capacity planning exercises, which tools assist in listing and identifying processes of interest? (Choose TWO correct answers.
Volume: 129 Questions Question No: 1 In capacity planning exercises, which tools assist in listing and identifying processes of interest? (Choose TWO correct answers.) A. acpid B. lsof C. pstree D. telinit
NAME top display top CPU processes. SYNOPSIS top [ ] [d delay] [p pid] [q] [c] [C] [S] [s] [i] [n iter] [b]
![NAME top display top CPU processes. SYNOPSIS top [ ] [d delay] [p pid] [q] [c] [C] [S] [s] [i] [n iter] [b]](/thumbs/92/109161204.jpg "NAME top display top CPU processes. SYNOPSIS top [ ] [d delay] [p pid] [q] [c] [C] [S] [s] [i] [n iter] [b]")
NAME top display top CPU processes SYNOPSIS top [ ] [d delay] [p pid] [q] [c] [C] [S] [s] [i] [n iter] [b] DESCRIPTION top provides an ongoing look at processor activity in real time. It displays a listing
Debugging Kernel Problems
Debugging Kernel Problems by Greg Lehey Edition for AsiaBSDCon 2004 Taipei, 13 March 2004 Debugging Kernel Problems by Greg Lehey (grog@freebsd.org) Copyright 1995-2004 Greg Lehey 3 Debugging Kernel Problems
Advanced SUSE Linux Enterprise Server Administration (Course 3038) Chapter 8 Perform a Health Check and Performance Tuning
Advanced SUSE Linux Enterprise Server Administration (Course 3038) Chapter 8 Perform a Health Check and Performance Tuning Objectives Find Performance Bottlenecks Reduce System and Memory Load Optimize
Performance Tuning of the Network Performance Server in Network Node Manager i December 8, 2016
Performance Tuning of the Network Performance Server in Network Node Manager i December 8, 2016 Brought to you by Vivit Network Management SIG Leaders Wendy Wheeler Chris Powers Hosted By Wendy Wheeler
Monitoring Agent for Unix OS Version Reference IBM
Monitoring Agent for Unix OS Version 6.3.5 Reference IBM Monitoring Agent for Unix OS Version 6.3.5 Reference IBM Note Before using this information and the product it supports, read the information in
Performance Objects and Counters for the System
APPENDIXA Performance Objects and for the System May 19, 2009 This appendix provides information on system-related objects and counters. Cisco Tomcat Connector, page 2 Cisco Tomcat JVM, page 4 Cisco Tomcat
Performance Sentry VM Provider Objects April 11, 2012
Introduction This document describes the Performance Sentry VM (Sentry VM) Provider performance data objects defined using the VMware performance groups and counters. This version of Performance Sentry
Chapter 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
Comparison of Solaris, Linux, and FreeBSD Kernels. Similarities and Differences in some major kernel subsystems.
Comparison of Solaris, Linux, and FreeBSD Kernels Similarities and Differences in some major kernel subsystems. Topics Covered Scheduling Memory Management/Paging File Systems Observability Conclusions
Swapping. Operating Systems I. Swapping. Motivation. Paging Implementation. Demand Paging. Active processes use more physical memory than system has
Swapping Active processes use more physical memory than system has Operating Systems I Address Binding can be fixed or relocatable at runtime Swap out P P Virtual Memory OS Backing Store (Swap Space) Main
Linux Performance Tuning
Page 1 of 5 close window Print Linux Performance Tuning Getting the most from your Linux investment February March 2007 by Jaqui Lynch This is the first article in a two-part series. The second installment
First-In-First-Out (FIFO) Algorithm
First-In-First-Out (FIFO) Algorithm Reference string: 7,0,1,2,0,3,0,4,2,3,0,3,0,3,2,1,2,0,1,7,0,1 3 frames (3 pages can be in memory at a time per process) 15 page faults Can vary by reference string:
CSE410 Operating Systems Spring 2018 Project 1: Introduction to Unix/Linux Signals
CSE410 Operating Systems Spring 2018 Project 1: Introduction to Unix/Linux Signals 1 Overview and Background In this exercise you will gain first hand experience with Unix/Linux signals. You will develop
Main Window. June 25, 2017, Beginners SIG Activity Monitor (Part 1 of 2)
Note: This discussion is based on MacOS, 10.12.5 (Sierra). Some illustrations may differ when using other versions of macos or OS X. Credit 1: Activity Monitor Help Credit 2: Use Activity Monitor on your
Table Of Contents 1/13. Table Of Contents
Table Of Contents 1/13 Table Of Contents #1: top - Process Activity Command... 2 Commonly Used Hot Keys... 2 #2: vmstat - System Activity, Hardware and System Information... 3 Display Memory Utilization
5 Solutions. Solution a. no solution provided. b. no solution provided
5 Solutions Solution 5.1 5.1.1 5.1.2 5.1.3 5.1.4 5.1.5 5.1.6 S2 Chapter 5 Solutions Solution 5.2 5.2.1 4 5.2.2 a. I, J b. B[I][0] 5.2.3 a. A[I][J] b. A[J][I] 5.2.4 a. 3596 = 8 800/4 2 8 8/4 + 8000/4 b.
Linux Hardware Management. Linux System Administration COMP2018 Summer 2017
Linux Hardware Management Linux System Administration COMP2018 Summer 2017 Hardware Resources CPU refers to the primary computing resource and is measured in processor cores RAM refers to the volatile
June 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
Memory - Paging. Copyright : University of Illinois CS 241 Staff 1
Memory - Paging Copyright : University of Illinois CS 241 Staff 1 Physical Frame Allocation How do we allocate physical memory across multiple processes? What if Process A needs to evict a page from Process
Princeton University. Computer Science 217: Introduction to Programming Systems. The Memory/Storage Hierarchy and Virtual Memory
Princeton University Computer Science 27: Introduction to Programming Systems The Memory/Storage Hierarchy and Virtual Memory Goals of this Lecture Help you learn about: Locality and caching The memory
ECE 598 Advanced Operating Systems Lecture 14
ECE 598 Advanced Operating Systems Lecture 14 Vince Weaver http://web.eece.maine.edu/~vweaver vincent.weaver@maine.edu 22 March 2018 HW#6 was due. Announcements HW#7 will be posted eventually. Project
Virtual Memory Outline
Virtual Memory Outline Background Demand Paging Copy-on-Write Page Replacement Allocation of Frames Thrashing Memory-Mapped Files Allocating Kernel Memory Other Considerations Operating-System Examples
Memory Management Outline. Operating Systems. Motivation. Paging Implementation. Accessing Invalid Pages. Performance of Demand Paging
Memory Management Outline Operating Systems Processes (done) Memory Management Basic (done) Paging (done) Virtual memory Virtual Memory (Chapter.) Motivation Logical address space larger than physical
Storage Management 1
Storage Management Goals of this Lecture Help you learn about: Locality and caching Typical storage hierarchy Virtual memory How the hardware and OS give applications the illusion of a large, contiguous,
CFLRU:A A Replacement Algorithm for Flash Memory
CFLRU:A A Replacement Algorithm for Flash Memory CASES'06, October 23 25, 2006, Seoul, Korea. Copyright 2006 ACM 1-59593-543-6/06/0010 Yen-Ting Liu Outline Introduction CFLRU Algorithm Simulation Implementation
Debugging Kernel Problems
Debugging Kernel Problems by Greg Lehey Edition for EuroBSDCon 2005 Basel, 25 November 2005 Debugging Kernel Problems by Greg Lehey (grog@freebsd.org, grog@mysql.com, grog@netbsd.org) Copyright 1995-2005
Operating Systems. Introduction & Overview. Outline for today s lecture. Administrivia. ITS 225: Operating Systems. Lecture 1
ITS 225: Operating Systems Operating Systems Lecture 1 Introduction & Overview Jan 15, 2004 Dr. Matthew Dailey Information Technology Program Sirindhorn International Institute of Technology Thammasat
Metbox Training Outline LDM Training Metbox overview Break Metbox hands on training
Metbox Training Outline 1300-1430 LDM Training 1430-1500 Metbox overview 1500-1515 Break 1515-1700 Metbox hands on training Metbox Terms Metbox Hardware and software LDM Data management system GEneral
Swapping. Jin-Soo Kim Computer Systems Laboratory Sungkyunkwan University
Swapping Jin-Soo Kim (jinsookim@skku.edu) Computer Systems Laboratory Sungkyunkwan University http://csl.skku.edu Swapping Support processes when not enough physical memory User program should be independent
Memory Allocation. Copyright : University of Illinois CS 241 Staff 1
Memory Allocation Copyright : University of Illinois CS 241 Staff 1 Allocation of Page Frames Scenario Several physical pages allocated to processes A, B, and C. Process B page faults. Which page should
ECE Lab 8. Logic Design for a Direct-Mapped Cache. To understand the function and design of a direct-mapped memory cache.
ECE 201 - Lab 8 Logic Design for a Direct-Mapped Cache PURPOSE To understand the function and design of a direct-mapped memory cache. EQUIPMENT Simulation Software REQUIREMENTS Electronic copy of your
Persistent Storage - Datastructures and Algorithms
Persistent Storage - Datastructures and Algorithms 1 / 21 L 03: Virtual Memory and Caches 2 / 21 Questions How to access data, when sequential access is too slow? Direct access (random access) file, how
Swapping. Jinkyu Jeong Computer Systems Laboratory Sungkyunkwan University
Swapping Jinkyu Jeong (jinkyu@skku.edu) Computer Systems Laboratory Sungkyunkwan University http://csl.skku.edu EEE0: Introduction to Operating Systems, Fall 07, Jinkyu Jeong (jinkyu@skku.edu) Swapping
System Performance Objects and Counters
APPENDIXA System Performance Objects and This appendix contains the following sections: Cisco Tomcat Connector, page A-2 Cisco Tomcat JVM, page A-3 Cisco Tomcat Web Application, page A-4 Database Change
Memory Management! How the hardware and OS give application pgms:" The illusion of a large contiguous address space" Protection against each other"
Memory Management! Goals of this Lecture! Help you learn about:" The memory hierarchy" Spatial and temporal locality of reference" Caching, at multiple levels" Virtual memory" and thereby " How the hardware
Managing the Analyzer
CHAPTER 4 This chapter, which provides information about managing the Analyzer, contains the following sections: Accessing NetFlow Data Files Explains why data stored on nonlocal file systems can be inaccessible
Availability and Utility of Idle Memory in Workstation Clusters. Anurag Acharya, UC-Santa Barbara Sanjeev Setia, George Mason Univ
Availability and Utility of Idle Memory in Workstation Clusters Anurag Acharya, UC-Santa Barbara Sanjeev Setia, George Mason Univ Motivation Explosive growth in data intensive applications Large-scale
Most of the work is done in the context of the process rather than handled separately by the kernel
Process Control Process Abstraction for a running program Manages program s use of memory, cpu time, and i/o resources Most of the work is done in the context of the process rather than handled separately
minit Felix von Leitner September 2004 minit
minit Felix von Leitner felix-minit@fefe.de September 2004 minit What is this all about? This talk is about a new init program called minit. Several itches needed scratching: 1. Typical Linux distributions
Plot SIZE. How will execution time grow with SIZE? Actual Data. int array[size]; int A = 0;
![Plot SIZE. How will execution time grow with SIZE? Actual Data. int array[size]; int A = 0;](/thumbs/75/72768059.jpg "Plot SIZE. How will execution time grow with SIZE? Actual Data. int array[size]; int A = 0;")
How will execution time grow with SIZE? int array[size]; int A = ; for (int i = ; i < ; i++) { for (int j = ; j < SIZE ; j++) { A += array[j]; } TIME } Plot SIZE Actual Data 45 4 5 5 Series 5 5 4 6 8 Memory
Scaling Internet TV Content Delivery ALEX GUTARIN DIRECTOR OF ENGINEERING, NETFLIX
Scaling Internet TV Content Delivery ALEX GUTARIN DIRECTOR OF ENGINEERING, NETFLIX Inventing Internet TV Available in more than 190 countries 104+ million subscribers Lots of Streaming == Lots of Traffic
Chapter 9: Virtual Memory. Operating System Concepts 9 th Edition
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
Documents. Configuration. Important Dependent Parameters (Approximate) Version 2.3 (Wed, Dec 1, 2010, 1225 hours)
1 of 7 12/2/2010 11:31 AM Version 2.3 (Wed, Dec 1, 2010, 1225 hours) Notation And Abbreviations preliminaries TCP Experiment 2 TCP Experiment 1 Remarks How To Design A TCP Experiment KB (KiloBytes = 1,000
07 - Processes and Jobs
07 - Processes and Jobs CS 2043: Unix Tools and Scripting, Spring 2016 [1] Stephen McDowell February 10th, 2016 Cornell University Table of contents 1. Processes Overview 2. Modifying Processes 3. Jobs
CRAY X1 System Administration UNICOS/mp 2.4 Update
CRAY X1 System Administration UNICOS/mp 2.4 Update Peggy Gazzola Software Product Support Cray, Inc. Cray Proprietary Released 22 March, 2004 UNICOS/mp 2.4 Release Overview (S-2336-24) Emphasis for this
Lessons learnt re-writing a PubSub system. Chandru Mullaparthi - Principal Software Architect at bet365
1 Lessons learnt re-writing a PubSub system Chandru Mullaparthi - Principal Software Architect at bet365 2 About Founded in 2000 Located in Stoke-on-Trent The largest online sports betting company Over
Measuring the impacts of the Preempt-RT patch
Measuring the impacts of the Preempt-RT patch maxime.chevallier@smile.fr October 25, 2017 RT Linux projects Simulation platform : bi-xeon, lots ot RAM 200µs wakeup latency, networking Test bench : Intel
Twitch Plays Pokémon: Twitch s Chat Architecture. John Rizzo Sr Software Engineer
Twitch Plays Pokémon: Twitch s Chat Architecture John Rizzo Sr Software Engineer About Me Twitch Introduction Twitch Introduction Twitch Introduction Over 800k concurrent users Tens of BILLIONS of daily
DAT (cont d) Assume a page size of 256 bytes. physical addresses. Note: Virtual address (page #) is not stored, but is used as an index into the table
Assume a page size of 256 bytes 5 Page table size (determined by size of program) 1 1 0 1 0 0200 00 420B 00 xxxxxx 1183 00 xxxxxx physical addresses Residency Bit (0 page frame is empty) Note: Virtual
Notes based on prof. Morris's lecture on scheduling (6.824, fall'02).
Scheduling Required reading: Eliminating receive livelock Notes based on prof. Morris's lecture on scheduling (6.824, fall'02). Overview What is scheduling? The OS policies and mechanisms to allocates
Virtual Memory COMPSCI 386
Virtual Memory COMPSCI 386 Motivation An instruction to be executed must be in physical memory, but there may not be enough space for all ready processes. Typically the entire program is not needed. Exception
Week 2: Tiina Niklander
Virtual memory Operations and policies Chapters 3.4. 3.6 Week 2: 17.9.2009 Tiina Niklander 1 Policies and methods Fetch policy (Noutopolitiikka) When to load page to memory? Placement policy (Sijoituspolitiikka
DESCRIPTION Dstat is a versatile replacement for vmstat, iostat and ifstat. Dstat overcomes some of the limitations and adds some extra features.
NAME dstat versatile tool for generating system resource statistics SYNOPSIS dstat [ afv] [options..] [delay [count]] DESCRIPTION Dstat is a versatile replacement for vmstat, iostat and ifstat. Dstat overcomes
QuickSpecs. HP Z 10GbE Dual Port Module. Models
Overview Models Part Number: 1Ql49AA Introduction The is a 10GBASE-T adapter utilizing the Intel X722 MAC and X557-AT2 PHY pairing to deliver full line-rate performance, utilizing CAT 6A UTP cabling (or
Measuring Resource Demand on Linux
Measuring Resource Demand on Linux Resource allocation, Goldilocks style Rik van Riel Red Hat, Inc riel@redhat.com Abstract 1 New problems Linux, and other Unix systems, have long had pretty good measurement
File. File System Implementation. File Metadata. File System Implementation. Direct Memory Access Cont. Hardware background: Direct Memory Access
File File System Implementation Operating Systems Hebrew University Spring 2009 Sequence of bytes, with no structure as far as the operating system is concerned. The only operations are to read and write
Chapter 8 Memory Management
Chapter 8 Memory Management Da-Wei Chang CSIE.NCKU Source: Abraham Silberschatz, Peter B. Galvin, and Greg Gagne, "Operating System Concepts", 9th Edition, Wiley. 1 Outline Background Swapping Contiguous
Computer Center, CS, NCTU. Outline. FreeBSD version 9.0-RELEASE 9.1-RC1. Installing FreeBSD. From CD-ROM From USB
FreeBSD huanghs Outline FreeBSD version 9.0-RELEASE 9.1-RC1 Installing FreeBSD From CD-ROM From USB 2 FreeBSD Version 4 FreeBSD Branches/Tags Three parallel development branches: -RELEASE Latest Release
Perform page replacement. (Fig 8.8 [Stal05])
![Perform page replacement. (Fig 8.8 [Stal05])](/thumbs/88/117757561.jpg "Perform page replacement. (Fig 8.8 [Stal05])")
Virtual memory Operations and policies Chapters 3.4. 3.7 1 Policies and methods Fetch policy (Noutopolitiikka) When to load page to memory? Placement policy (Sijoituspolitiikka ) Where to place the new
Reducing CPU usage of a Toro Appliance
Reducing CPU usage of a Toro Appliance Matias E. Vara Larsen matiasevara@gmail.com Who am I? Electronic Engineer from Universidad Nacional de La Plata, Argentina PhD in Computer Science, Universite NiceSophia
Operating System Concepts
Chapter 9: Virtual-Memory Management 9.1 Silberschatz, Galvin and Gagne 2005 Chapter 9: Virtual Memory Background Demand Paging Copy-on-Write Page Replacement Allocation of Frames Thrashing Memory-Mapped
Operating Systems, Fall
Policies and methods Virtual memory Operations and policies Chapters 3.4. 3.6 Week 2: 17.9.2009 Tiina Niklander 1 Fetch policy (Noutopolitiikka) When to load page to memory? Placement policy (Sijoituspolitiikka
CS399 New Beginnings. Jonathan Walpole
CS399 New Beginnings Jonathan Walpole Memory Management Memory Management Memory a linear array of bytes - Holds O.S. and programs (processes) - Each cell (byte) is named by a unique memory address Recall,
Main Memory and the CPU Cache
Main Memory and the CPU Cache CPU cache Unrolled linked lists B Trees Our model of main memory and the cost of CPU operations has been intentionally simplistic The major focus has been on determining
Dirty throttling How much dirty memory is too much?
Dirty throttling How much dirty memory is too much? Wu Fengguang November 4, 2010 Outline writeback basics dirty limits dirty throttling algorithms Wu Fengguang (Intel OTC) dirty
The Virtual Memory Abstraction. Memory Management. Address spaces: Physical and Virtual. Address Translation
The Virtual Memory Abstraction Memory Management Physical Memory Unprotected address space Limited size Shared physical frames Easy to share data Virtual Memory Programs are isolated Arbitrary size All
W517 Monitoring Array System Performance
W517 Monitoring Array System Performance Pre-requisites: None Designed for the Array system administrator, this session will center around troubleshooting system performance. Topics covered will be recommended
Virtualization and Performance
Virtualization and Performance Network Startup Resource Center www.nsrc.org These materials are licensed under the Creative Commons Attribution-NonCommercial 4.0 International license (http://creativecommons.org/licenses/by-nc/4.0/)
Dude, Where s My Memory? Nectarios Daloglou, White Star Software
Dude, Where s My Memory? Nectarios Daloglou, White Star Software nd@wss.com A Few Words about the Speaker Nectar Daloglou; Progress & QAD since 2000. Performed specialized services at more than 60 Progress
Memory management, part 3: outline
Memory management, part 3: outline Segmentation Case studies o MULTICS o x86 (Pentium) o Unix o Linux o Windows 1 Segmentation Several address spaces per process a compiler needs segments for o source
Chapter 8: Virtual Memory. Operating System Concepts Essentials 2 nd Edition
Chapter 8: Virtual Memory Silberschatz, Galvin and Gagne 2013 Chapter 8: Virtual Memory Background Demand Paging Copy-on-Write Page Replacement Allocation of Frames Thrashing Memory-Mapped Files Allocating
Key Point. What are Cache lines
Caching 1 Key Point What are Cache lines Tags Index offset How do we find data in the cache? How do we tell if it s the right data? What decisions do we need to make in designing a cache? What are possible
8: Scheduling. Scheduling. Mark Handley
8: Scheduling Mark Handley Scheduling On a multiprocessing system, more than one process may be available to run. The task of deciding which process to run next is called scheduling, and is performed by
Monitoring and Trouble Shooting on BioHPC
Monitoring and Trouble Shooting on BioHPC [web] [email] portal.biohpc.swmed.edu biohpc-help@utsouthwestern.edu 1 Updated for 2017-03-15 Why Monitoring & Troubleshooting data code Monitoring jobs running
Lecture 16. Today: Start looking into memory hierarchy Cache$! Yay!
Lecture 16 Today: Start looking into memory hierarchy Cache$! Yay! Note: There are no slides labeled Lecture 15. Nothing omitted, just that the numbering got out of sequence somewhere along the way. 1
Page Replacement Algorithms
Page Replacement Algorithms MIN, OPT (optimal) RANDOM evict random page FIFO (first-in, first-out) give every page equal residency LRU (least-recently used) MRU (most-recently used) 1 9.1 Silberschatz,
1. Background. 2. Demand Paging
COSC4740-01 Operating Systems Design, Fall 2001, Byunggu Yu Chapter 10 Virtual Memory 1. Background PROBLEM: The entire process must be loaded into the memory to execute limits the size of a process (it