ΕΛΠ 605: Προχωρηµένη Αρχιτεκτονική Υπολογιστών. Εργαστήριο Αρ. 4. Linux Monitoring Utilities (perf,top,mpstat ps, free) and gdb dissasembler, gnuplot

Size: px
Start display at page:

Download "ΕΛΠ 605: Προχωρηµένη Αρχιτεκτονική Υπολογιστών. Εργαστήριο Αρ. 4. Linux Monitoring Utilities (perf,top,mpstat ps, free) and gdb dissasembler, gnuplot"

Transcription

1 ΕΛΠ 605: Προχωρηµένη Αρχιτεκτονική Υπολογιστών Εργαστήριο Αρ. 4 Linux Monitoring Utilities (perf,top,mpstat ps, free) and gdb dissasembler, gnuplot Lecturer: Zacharias Hadjilambrou Σελ. 1

2 Realtime monitoring of: top CPU and memory utilization for each process Total CPU utilization average and per core Total Memory utilization (used and free) Useful Command switches: top d 1 #set the update interval to 1 second //the default is 3 seconds top b #run in batch mode, top will run until killed, useful for saving top output in a file top H # instruct top to show individual threads top u username # show processes of a specific user only Zacharias Hadjilambrou Σελ. 2

3 top 103ws1:/home/research/zhadji01/EPL605labs>taskset -c 0./matrix_serial_ver1 &> /dev/null & 103ws1:/home/research/zhadji01/EPL605labs>top CPU utilization explanation: us (user time) sy (system time) ni (processes that run at higher priority) id (idle time) wa (cpu waiting for I/O), hi si (hardware and software interrupts handling) User zhadji01 is running matrix_serial_v and xioann02 runs firefox, total main memory is 8GB ( KB) matrix_serial_v consumes 99.7% CPU time and 0.1% of total memory Average CPU utilization is 27.3% and the CPU has four cores this means that ~one core is fully utilized Press key 1 to view CPU utilization per core Indeed Core0 is fully utilized at 100%, matrix_serial_v runs at core0 as instructed by taskset Zacharias Hadjilambrou Σελ. 3

4 top H to view threads of multithreaded programs 103ws1:/home/research/zhadji01/EPL605labs>./simpleParallelProgram & 103ws1:/home/research/zhadji01/EPL605labs>top 400% CPU utilization means it uses 4 cores top H to view threads 103ws1:/home/research/zhadji01/EPL605labs>top H Each thread has ~100% cpu utilization meaning it utilizes fully one core Zacharias Hadjilambrou Σελ. 4

5 top useful keys in interactive mode Press 1 to view per core utilization Press Shift+p to sort process from higher CPU utilization to lower Press d to change the update delay Press u to view specific user Zacharias Hadjilambrou Σελ. 5

6 Htop htop ( an interactive system-monitor process-viewer Σελ. 6

7 Gives a snapshot of all processes ps command 103ws1:/home/research/zhadji01/EPL605labs>ps aux 103ws1:/home/research/zhadji01/EPL605labs>ps ef ps -elf # information about threads Zacharias Hadjilambrou Σελ. 7

8 mpstat A good tool to view CPU utilization mpstat -P ALL 2 1 # -P ALL show all cores # 2 1 show two reports with one second interval between them Zacharias Hadjilambrou Σελ. 8

9 free Tool to view memory utilization free g # -g to view in gigabyte Zacharias Hadjilambrou Σελ. 9

10 perf: Linux profiling with performance counters Performance counters are CPU hardware registers that count hardware events such as instructions executed, cache-misses suffered, or branches mispredicted. perf provides rich generalized abstractions over hardware specific capabilities. Among others, it provides per task, per CPU and per-workload counters, sampling on top of these and source code event annotation. Perf gives you visibility where the Hotspots of your program are. Σελ. 10

11 Intel Core Performance Monitor Unit (PMU) Limited number of hardware counters (8 counters per core on the above example) Time multiplexing is performed when selected events > hardware counters. An estimation of actual account is given e.g. user wants to measure instructions and cycles but only one counter is available, perf will measure half of the time the instructions and half of the time the cycles. The measured instructions and cycles will be multiplied by 2 to give an estimation of the actual total instructions and cycles Zacharias Hadjilambrou Σελ. 11

12 Perf Events >perf list List of pre-defined events (to be used in -e): cpu-cycles OR cycles instructions cache-references cache-misses branch-instructions OR branches branch-misses bus-cycles stalled-cycles-frontend OR idle-cycles-frontend stalled-cycles-backend OR idle-cycles-backend ref-cycles [Hardware event] [Hardware event] [Hardware event] [Hardware event] [Hardware event] [Hardware event] [Hardware event] [Hardware event] [Hardware event] [Hardware event] cpu-clock task-clock page-faults OR faults context-switches OR cs cpu-migrations OR migrations minor-faults major-faults alignment-faults emulation-faults [Software event] [Software event] [Software event] [Software event] [Software event] [Software event] [Software event] [Software event] [Software event] L1-dcache-loads [Hardware cache event] L1-dcache-load-misses [Hardware cache event] L1-dcache-stores [Hardware cache event] L1-dcache-store-misses [Hardware cache event] L1-dcache-prefetches [Hardware cache event] Σελ. 12

13 Measuring multiple events perf stat -e instructions,cycles matrix_serial_ver1 Performance counter stats for './matrix_serial_ver1': 34,058,795,490 instructions # 2.67 insn per cycle 12,762,609,265 cycles seconds time elapsed To measure more than one event, after -e provide a comma-separated list : perf stat -e cycles,instructions,cache-misses./matrix_serial_ver1 To save the output to a file use o switch perf stat o tmp -e cycles,instructions,cache-misses./matrix_serial_ver1 cat tmp Performance counter stats for './matrix_serial_ver1': 34,058,795,490 instructions # 2.67 insn per cycle 12,762,609,265 cycles seconds time elapsed Zacharias Hadjilambrou Σελ. 13

14 Attach to already running process To attach to running process p (-t to attach to thread)./matrix_serial_ver1 & perf stat -e instructions,cycles -p $! & ##$! Is the Pid of last launced process or do perf stat -e instructions,cycles p `pgrep matrix_serial` & pkill -SIGINT perf # send signal interrupt to perf to make perf print statistics Performance counter stats for './matrix_serial_ver1': 34,058,795,490 instructions # 2.67 insn per cycle 12,762,609,265 cycles seconds time elapsed perf stat -e instructions,cycles -p $! sleep 1 # perf will run only for 1 second in this case pkill SIGINT is not required Zacharias Hadjilambrou Σελ. 14

15 Select event level (user, kernel etc) Zacharias Hadjilambrou Σελ. 15

16 System wide collection xg3:/home/root_desktop>./run_npb.sh./npb3.3/npb3.3-omp/bin/ sp.c.x 32 &> /dev/null & ## we started a multithreaded workload that uses 32 cores, each core runs at 3GHz ##To sum the instructions and cycles executed by all cores perf stat -e instructions,cycles -a sleep 1 Performance counter stats for 'system wide': 34,812,562,418 instructions # 0.36 insn per cycle 95,655,967,640 cycles //Each core at 3GHz should have 3Billion cycles in 1seconds, multiply by 32 ~96Billion seconds time elapsed 0.36 instructions per cycle (IPC) is indicative of single thread performance To measure the actual IPC of all cores do perf stat -e instructions,cycles -A -C 0-31 sleep 1 -A disables statistics aggregation C defines which core statistics to print Zacharias Hadjilambrou Σελ. 16

17 Per core stats The actual CPU IPC is ~0.33 * 32 =10.56 Per core and system wide collection required root access, or administrator allowing global perf collections (set /proc/sys/kernel/perf_event_paranoid to -1) Zacharias Hadjilambrou Σελ. 17

18 Perf top Shows realtime the most hot function Zacharias Hadjilambrou Σελ. 18

19 Matrix Multiplication Examples Σελ. 19

20 Matrix Multiplication Examples Σελ. 20

21 Matrix Multiplication Examples Σελ. 21

22 gcc Optimizations and Branch Prediction Σελ. 22

23 gcc Optimizations and Branch Prediction Σελ. 23

24 Perf annotate Σελ. 24

25 >perf annotate Σελ. 25

26 Assembly >gcc S main.c >vi main.s >gcc main.s -o main.s.out Σελ. 26

27 >objdump d main.out >hexdump C main.out Σελ. 27

28 gdb gcc -ggdb main.c -o main.out bash gdb main.out b main (breakpoint at main) r (run) disassemble s s (step) bt (Backtrace) set disassemble-next-line on Σελ. 28

29 gdb Disassemble next line setenv SHELL /bin/bash gdb a.out GNU gdb (GDB) Red Hat Enterprise Linux ( el6).. (gdb) b main (gdb) set disassemble-next-line on (gdb) s (gdb) r Starting program: /home/faculty/petrosp/epl370/fall2012/labs/epl370lab5/a.out Breakpoint 1, main () at gprof-prog1.c:49 49 init( x ); => 0x bc <main+11>: 48 8d fe ff ff lea -0x1a0(%rbp),%rax 0x c3 <main+18>: c7 mov %rax,%rdi 0x c6 <main+21>: e8 f9 fe ff ff callq 0x4004c4 <init> Missing separate debuginfos, use: debuginfo-install glibc el6_3.4.x86_64 (gdb) s init (x=0x7fffffffdf90) at gprof-prog1.c:8 8 for ( i = 0; i < 100; i++ ) { => 0x cc <init+8>: c7 45 fc movl $0x0,-0x4(%rbp) 0x d3 <init+15>: eb 16 jmp 0x4004eb <init+39> (gdb) Σελ. 29

30 gcc -ggdb main.c -o main.out bash gdb main.out b main r layout asm ctrl-x 2 s Σελ. 30

31 GNUPlot (log in to cs6472 or any other machine that has gnuplot, and run gnuplot) plot "data.txt" using 1:2 title 'Column 2', "data.txt" using 1:3 title 'Column 3' plot "data.txt" using 1:2 title 'Column 2' gnuplot> set term png (will produce.png output) gnuplot> set output "printme.png" (output to any filename you use) gnuplot> replot Σελ. 31

ECE 571 Advanced Microprocessor-Based Design Lecture 2

ECE 571 Advanced Microprocessor-Based Design Lecture 2 ECE 571 Advanced Microprocessor-Based Design Lecture 2 Vince Weaver http://www.eece.maine.edu/ vweaver vincent.weaver@maine.edu 4 September 2014 Announcements HW#1 delayed until Tuesday 1 Hardware Performance

More information

ECE 571 Advanced Microprocessor-Based Design Lecture 2

ECE 571 Advanced Microprocessor-Based Design Lecture 2 ECE 571 Advanced Microprocessor-Based Design Lecture 2 Vince Weaver http://www.eece.maine.edu/~vweaver vincent.weaver@maine.edu 21 January 2016 Announcements HW#1 will be posted tomorrow I am handing out

More information

ECE 471 Embedded Systems Lecture 23

ECE 471 Embedded Systems Lecture 23 ECE 471 Embedded Systems Lecture 23 Vince Weaver http://www.eece.maine.edu/~vweaver vincent.weaver@maine.edu 1 December 2015 Don t forget projects Announcements HW8, HW9, and HW10 grades were sent out.

More information

Processors, Performance, and Profiling

Processors, Performance, and Profiling Processors, Performance, and Profiling Architecture 101: 5-Stage Pipeline Fetch Decode Execute Memory Write-Back Registers PC FP ALU Memory Architecture 101 1. Fetch instruction from memory. 2. Decode

More information

PERF performance-counter for Odroid XU3/XU4

PERF performance-counter for Odroid XU3/XU4 2017/12/07 21:49 1/6 PERF performance-counter for Odroid XU3/XU4 PERF performance-counter for Odroid XU3/XU4 Linux hardware performance measurement using counters, trace-points, software performance counters,

More information

ECE 571 Advanced Microprocessor-Based Design Lecture 10

ECE 571 Advanced Microprocessor-Based Design Lecture 10 ECE 571 Advanced Microprocessor-Based Design Lecture 10 Vince Weaver http://web.eece.maine.edu/~vweaver vincent.weaver@maine.edu 22 February 2018 Announcements HW#5 will be posted, caches Midterm: Thursday

More information

Profiling: Understand Your Application

Profiling: Understand Your Application Profiling: Understand Your Application Michal Merta michal.merta@vsb.cz 1st of March 2018 Agenda Hardware events based sampling Some fundamental bottlenecks Overview of profiling tools perf tools Intel

More information

HPC Lab. Session 4: Profiler. Sebastian Rettenberger, Chaulio Ferreira, Michael Bader. November 9, 2015

HPC Lab. Session 4: Profiler. Sebastian Rettenberger, Chaulio Ferreira, Michael Bader. November 9, 2015 HPC Lab Session 4: Profiler Sebastian Rettenberger, Chaulio Ferreira, Michael Bader November 9, 2015 Session 4: Profiler, November 9, 2015 1 Profiler Profiling allows you to learn where your program spent

More information

Processes. System tasks Campus-Booster ID : **XXXXX. Copyright SUPINFO. All rights reserved

Processes. System tasks Campus-Booster ID : **XXXXX.  Copyright SUPINFO. All rights reserved Processes System tasks Campus-Booster ID : **XXXXX www.supinfo.com Copyright SUPINFO. All rights reserved Processes Your trainer Presenter s Name Title: **Enter title or job role. Accomplishments: **What

More information

ECE 471 Embedded Systems Lecture 23

ECE 471 Embedded Systems Lecture 23 ECE 471 Embedded Systems Lecture 23 Vince Weaver http://www.eece.maine.edu/ vweaver vincent.weaver@maine.edu 2 December 2014 Announcements Project 1 HW9 Example of disatrous code. Why write good code?

More information

EE382M 15: Assignment 2

EE382M 15: Assignment 2 EE382M 15: Assignment 2 Professor: Lizy K. John TA: Jee Ho Ryoo Department of Electrical and Computer Engineering University of Texas, Austin Due: 11:59PM September 28, 2014 1. Introduction The goal of

More information

top - 14:43:26 up 25 days, 3:46, 50 users, load average: 0.04, 0.05, 0.01 Tasks: 1326 total, 1 running, 1319 sleeping, 2 stopped, 4 zombie Cpu(s): 0.0%us, 0.1%sy, 0.0%ni, 99.9%id, 0.0%wa, 0.0%hi, 0.0%si,

More information

Section 1: Tools. Contents CS162. January 19, Make More details about Make Git Commands to know... 3

Section 1: Tools. Contents CS162. January 19, Make More details about Make Git Commands to know... 3 CS162 January 19, 2017 Contents 1 Make 2 1.1 More details about Make.................................... 2 2 Git 3 2.1 Commands to know....................................... 3 3 GDB: The GNU Debugger

More information

Evaluating Performance Via Profiling

Evaluating Performance Via Profiling Performance Engineering of Software Systems September 21, 2010 Massachusetts Institute of Technology 6.172 Professors Saman Amarasinghe and Charles E. Leiserson Handout 6 Profiling Project 2-1 Evaluating

More information

CS3210: Multiprocessors and Locking

CS3210: Multiprocessors and Locking CS3210: Multiprocessors and Locking Kyle Harrigan 1 / 33 Administrivia Lab 3 (Part A), due Feb 24 Lab 3 (Part B), due Mar 3 Drop Date approaching (Mar 15) Team Proposal (3-5 min/team) - Mar 7 2 / 33 Summary

More information

Profiling and Workflow

Profiling and Workflow Profiling and Workflow Preben N. Olsen University of Oslo and Simula Research Laboratory preben@simula.no September 13, 2013 1 / 34 Agenda 1 Introduction What? Why? How? 2 Profiling Tracing Performance

More information

Compilation, Disassembly, and Profiling (in Linux)

Compilation, Disassembly, and Profiling (in Linux) Compilation, Disassembly, and Profiling (in Linux) CS 485: Systems Programming Spring 2016 Instructor: Neil Moore 1 Turning C into Object Code Code in files p1.c p2.c Compile with command: gcc O1 p1.c

More information

Intro x86 Part 3: Linux Tools & Analysis

Intro x86 Part 3: Linux Tools & Analysis Intro x86 Part 3: Linux Tools & Analysis Xeno Kovah 2009/2010 xkovah at gmail Approved for Public Release: 10-3348. Distribution Unlimited All materials is licensed under a Creative Commons Share Alike

More information

Perf with the Linux Kernel. Copyright Kevin Dankwardt

Perf with the Linux Kernel. Copyright Kevin Dankwardt Perf with the Linux Kernel perf commands annotate annotate source code with profile info kmem kernel memory profiling kvm profile guests list list kinds of events lock analyze lock events record save profile

More information

Machine-level Representation of Programs. Jin-Soo Kim Computer Systems Laboratory Sungkyunkwan University

Machine-level Representation of Programs. Jin-Soo Kim Computer Systems Laboratory Sungkyunkwan University Machine-level Representation of Programs Jin-Soo Kim (jinsookim@skku.edu) Computer Systems Laboratory Sungkyunkwan University http://csl.skku.edu Program? 짬뽕라면 준비시간 :10 분, 조리시간 :10 분 재료라면 1개, 스프 1봉지, 오징어

More information

CS 537: Introduction to Operating Systems Fall 2015: Midterm Exam #1

CS 537: Introduction to Operating Systems Fall 2015: Midterm Exam #1 CS 537: Introduction to Operating Systems Fall 2015: Midterm Exam #1 This exam is closed book, closed notes. All cell phones must be turned off. No calculators may be used. You have two hours to complete

More information

Computer Systems Architecture I. CSE 560M Lecture 3 Prof. Patrick Crowley

Computer Systems Architecture I. CSE 560M Lecture 3 Prof. Patrick Crowley Computer Systems Architecture I CSE 560M Lecture 3 Prof. Patrick Crowley Plan for Today Announcements Readings are extremely important! No class meeting next Monday Questions Commentaries A few remaining

More information

Kernel perf tool user guide

Kernel perf tool user guide Kernel perf tool user guide 2017-10-16 Reversion Record Date Rev Change Description Author 2017-10-16 V0.1 Inital Zhang Yongchang 1 / 10 catalog 1 PURPOSE...4 2 TERMINOLOGY...4 3 ENVIRONMENT...4 3.1 HARDWARE

More information

Efficient and Large Scale Program Flow Tracing in Linux. Alexander Shishkin, Intel

Efficient and Large Scale Program Flow Tracing in Linux. Alexander Shishkin, Intel Efficient and Large Scale Program Flow Tracing in Linux Alexander Shishkin, Intel 16.09.2013 Overview Program flow tracing - What is it? - What is it good for? Intel Processor Trace - Features / capabilities

More information

Instruction Set Architectures

Instruction Set Architectures Instruction Set Architectures ISAs Brief history of processors and architectures C, assembly, machine code Assembly basics: registers, operands, move instructions 1 What should the HW/SW interface contain?

More information

Debugging and Profiling

Debugging and Profiling Debugging and Profiling Dr. Axel Kohlmeyer Senior Scientific Computing Expert Information and Telecommunication Section The Abdus Salam International Centre for Theoretical Physics http://sites.google.com/site/akohlmey/

More information

Performance Profiling

Performance Profiling Performance Profiling Minsoo Ryu Real-Time Computing and Communications Lab. Hanyang University msryu@hanyang.ac.kr Outline History Understanding Profiling Understanding Performance Understanding Performance

More information

Practical 5. Linux Commands: Working with Files

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

More information

OS lpr. www. nfsd gcc emacs ls 1/27/09. Process Management. CS 537 Lecture 3: Processes. Example OS in operation. Why Processes? Simplicity + Speed

OS lpr. www. nfsd gcc emacs ls 1/27/09. Process Management. CS 537 Lecture 3: Processes. Example OS in operation. Why Processes? Simplicity + Speed Process Management CS 537 Lecture 3: Processes Michael Swift This lecture begins a series of topics on processes, threads, and synchronization Today: processes and process management what are the OS units

More information

Compila(on, Disassembly, and Profiling

Compila(on, Disassembly, and Profiling Compila(on, Disassembly, and Profiling (in Linux) CS 485: Systems Programming Fall 2015 Instructor: James Griffioen 1 Recall the compila(on process/steps 2 Turning C into Object Code Code in files p1.c

More information

XDS560 Trace. Technology Showcase. Daniel Rinkes Texas Instruments

XDS560 Trace. Technology Showcase. Daniel Rinkes Texas Instruments XDS560 Trace Technology Showcase Daniel Rinkes Texas Instruments Agenda AET / XDS560 Trace Overview Interrupt Profiling Statistical Profiling Thread Aware Profiling Thread Aware Dynamic Call Graph Agenda

More information

Instruction Set Architectures

Instruction Set Architectures Instruction Set Architectures! ISAs! Brief history of processors and architectures! C, assembly, machine code! Assembly basics: registers, operands, move instructions 1 What should the HW/SW interface

More information

Managing Processes Process: A running program

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

More information

Measuring the impacts of the Preempt-RT patch

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

More information

Performance Tuning VTune Performance Analyzer

Performance Tuning VTune Performance Analyzer Performance Tuning VTune Performance Analyzer Paul Petersen, Intel Sept 9, 2005 Copyright 2005 Intel Corporation Performance Tuning Overview Methodology Benchmarking Timing VTune Counter Monitor Call Graph

More information

U Reverse Engineering

U Reverse Engineering U23 2016 - Reverse Engineering Andy andy@koeln.ccc.de November 15, 2016 Introduction Static program analysis Dynamic program analysis Tools strings objdump IDA Hopper gdb Live Reversing Exercises Section

More information

System administration

System administration System administration Packages and probes Douglas Temple duggles@netsoc.tcd.ie For DU Internet Society [Netsoc] 5 th December, 2016 Tonight s outline Package managers for RHEL/Debian What to do with multiple

More information

Module I: Measuring Program Performance

Module I: Measuring Program Performance Performance Programming: Theory, Practice and Case Studies Module I: Measuring Program Performance 9 Outline 10 Measuring methodology and guidelines Measurement tools Timing Tools Profiling Tools Process

More information

ECE 454 Computer Systems Programming Measuring and profiling

ECE 454 Computer Systems Programming Measuring and profiling ECE 454 Computer Systems Programming Measuring and profiling Ding Yuan ECE Dept., University of Toronto http://www.eecg.toronto.edu/~yuan It is a capital mistake to theorize before one has data. Insensibly

More information

EECS 213 Introduction to Computer Systems Dinda, Spring Homework 3. Memory and Cache

EECS 213 Introduction to Computer Systems Dinda, Spring Homework 3. Memory and Cache Homework 3 Memory and Cache 1. Reorder the fields in this structure so that the structure will (a) consume the most space and (b) consume the least space on an IA32 machine on Linux. struct foo { double

More information

Process. Heechul Yun. Disclaimer: some slides are adopted from the book authors slides with permission 1

Process. Heechul Yun. Disclaimer: some slides are adopted from the book authors slides with permission 1 Process Heechul Yun Disclaimer: some slides are adopted from the book authors slides with permission 1 Recap OS services Resource (CPU, memory) allocation, filesystem, communication, protection, security,

More information

Scheduling the Intel Core i7

Scheduling the Intel Core i7 Third Year Project Report University of Manchester SCHOOL OF COMPUTER SCIENCE Scheduling the Intel Core i7 Ibrahim Alsuheabani Degree Programme: BSc Software Engineering Supervisor: Prof. Alasdair Rawsthorne

More information

Writing high performance code. CS448h Nov. 3, 2015

Writing high performance code. CS448h Nov. 3, 2015 Writing high performance code CS448h Nov. 3, 2015 Overview Is it slow? Where is it slow? How slow is it? Why is it slow? deciding when to optimize identifying bottlenecks estimating potential reasons for

More information

ANALYSIS OF A PARALLEL LEXICAL-TREE-BASED SPEECH DECODER FOR MULTI-CORE PROCESSORS

ANALYSIS OF A PARALLEL LEXICAL-TREE-BASED SPEECH DECODER FOR MULTI-CORE PROCESSORS 17th European Signal Processing Conference (EUSIPCO 2009) Glasgow, Scotland, August 24-28, 2009 ANALYSIS OF A PARALLEL LEXICAL-TREE-BASED SPEECH DECODER FOR MULTI-CORE PROCESSORS Naveen Parihar Dept. of

More information

Checking Resource Usage in Fedora (Linux)

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

More information

Prof. Thomas Sterling

Prof. Thomas Sterling High Performance Computing: Concepts, Methods & Means Performance Measurement 1 Prof. Thomas Sterling Department of Computer Science Louisiana i State t University it February 13 th, 2007 News Alert! Intel

More information

Mental models for modern program tuning

Mental models for modern program tuning Mental models for modern program tuning Andi Kleen Intel Corporation Jun 2016 How can we see program performance? VS High level Important to get the common ants fast Army of ants Preliminary optimization

More information

Process. Heechul Yun. Disclaimer: some slides are adopted from the book authors slides with permission

Process. Heechul Yun. Disclaimer: some slides are adopted from the book authors slides with permission Process Heechul Yun Disclaimer: some slides are adopted from the book authors slides with permission 1 Recap OS services Resource (CPU, memory) allocation, filesystem, communication, protection, security,

More information

CMSC 313 Lecture 08 Project 2 Questions Recap Indexed Addressing Examples Some i386 string instructions A Bigger Example: Escape Sequence Project

CMSC 313 Lecture 08 Project 2 Questions Recap Indexed Addressing Examples Some i386 string instructions A Bigger Example: Escape Sequence Project CMSC 313 Lecture 08 Project 2 Questions Recap Indexed Addressing Examples Some i386 string instructions A Bigger Example: Escape Sequence Project UMBC, CMSC313, Richard Chang CMSC 313,

More information

CS631 - Advanced Programming in the UNIX Environment. UNIX development tools

CS631 - Advanced Programming in the UNIX Environment. UNIX development tools CS631 - Advanced Programming in the UNIX Environment Slide 1 CS631 - Advanced Programming in the UNIX Environment UNIX development tools Department of Computer Science Stevens Institute of Technology Jan

More information

Lab 7 Linux Debugging. EECS 448: Software Engineering I Mark Calnon October 17, 2011

Lab 7 Linux Debugging. EECS 448: Software Engineering I Mark Calnon October 17, 2011 Lab 7 Linux Debugging EECS 448: Software Engineering I Mark Calnon October 17, 2011 GDB Getting Started To start gdb from the command line, first browse to the directory containing the core dump to debug

More information

CS 310: Memory Hierarchy and B-Trees

CS 310: Memory Hierarchy and B-Trees CS 310: Memory Hierarchy and B-Trees Chris Kauffman Week 14-1 Matrix Sum Given an M by N matrix X, sum its elements M rows, N columns Sum R given X, M, N sum = 0 for i=0 to M-1{ for j=0 to N-1 { sum +=

More information

CPSC 457 OPERATING SYSTEMS MIDTERM EXAM

CPSC 457 OPERATING SYSTEMS MIDTERM EXAM CPSC 457 OPERATING SYSTEMS MIDTERM EXAM Department of Computer Science University of Calgary Professor: Carey Williamson March 9, 2010 This is a CLOSED BOOK exam. Textbooks, notes, laptops, calculators,

More information

High Performance Computing

High Performance Computing High Performance Computing CS701 and IS860 Basavaraj Talawar basavaraj@nitk.edu.in Course Syllabus Definition, RISC ISA, RISC Pipeline, Performance Quantification Instruction Level Parallelism Pipeline

More information

Question No: 1 In capacity planning exercises, which tools assist in listing and identifying processes of interest? (Choose TWO correct answers.

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

More information

www nfsd emacs lpr Process Management CS 537 Lecture 4: Processes Example OS in operation Why Processes? Simplicity + Speed

www nfsd emacs lpr Process Management CS 537 Lecture 4: Processes Example OS in operation Why Processes? Simplicity + Speed Process Management CS 537 Lecture 4: Processes Michael Swift This lecture begins a series of topics on processes, threads, and synchronization Today: processes and process management what are the OS units

More information

CS3350B Computer Architecture CPU Performance and Profiling

CS3350B Computer Architecture CPU Performance and Profiling CS3350B Computer Architecture CPU Performance and Profiling Marc Moreno Maza http://www.csd.uwo.ca/~moreno/cs3350_moreno/index.html Department of Computer Science University of Western Ontario, Canada

More information

Buffer Overflow Attack

Buffer Overflow Attack Buffer Overflow Attack What every applicant for the hacker should know about the foundation of buffer overflow attacks By (Dalgona@wowhacker.org) Email: zinwon@gmail.com 2005 9 5 Abstract Buffer overflow.

More information

Linux System Administration

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

More information

SNMP MIBs and Traps Supported

SNMP MIBs and Traps Supported This section describes the MIBs available on your system. When you access your MIB data you will expose additional MIBs not listed in this section. The additional MIBs you expose through the process are

More information

Computer Organization & Assembly Language Programming (CSE 2312)

Computer Organization & Assembly Language Programming (CSE 2312) Computer Organization & Assembly Language Programming (CSE 2312) Lecture 15: Running ARM Programs in QEMU and Debugging with gdb Taylor Johnson Announcements and Outline Homework 5 due Thursday Midterm

More information

Most of the work is done in the context of the process rather than handled separately by the kernel

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

More information

Process States. Controlling processes. Process states. PID and PPID UID and EUID GID and EGID Niceness Control terminal. Runnable. Sleeping.

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

More information

Generic Cycle Accounting GOODA. Generic Optimization Data Analyzer

Generic Cycle Accounting GOODA. Generic Optimization Data Analyzer Generic Cycle Accounting GOODA Generic Optimization Data Analyzer What is Gooda Open sourced PMU analysis tool Processes perf.data file created with "perf record" Intrinsically incorporates hierarchical

More information

CS356: Discussion #5 Debugging with GDB. Marco Paolieri

CS356: Discussion #5 Debugging with GDB. Marco Paolieri CS356: Discussion #5 Debugging with GDB Marco Paolieri (paolieri@usc.edu) Schedule: Exams and Assignments Week 1: Binary Representation HW0. Week 2: Integer Operations Week 3: Floating-Point Operations

More information

CS 152 Computer Architecture and Engineering

CS 152 Computer Architecture and Engineering CS 152 Computer Architecture and Engineering Lecture 19 Advanced Processors III 2006-11-2 John Lazzaro (www.cs.berkeley.edu/~lazzaro) TAs: Udam Saini and Jue Sun www-inst.eecs.berkeley.edu/~cs152/ 1 Last

More information

Sperimentazioni I LINUX commands tutorial - Part II

Sperimentazioni I LINUX commands tutorial - Part II Sperimentazioni I LINUX commands tutorial - Part II A. Garfagnini, M. Mazzocco Università degli studi di Padova 24 Ottobre 2012 Streams and I/O Redirection Pipelines Create, monitor and kill processes

More information

CSCE 212H, Spring 2008 Lab Assignment 3: Assembly Language Assigned: Feb. 7, Due: Feb. 14, 11:59PM

CSCE 212H, Spring 2008 Lab Assignment 3: Assembly Language Assigned: Feb. 7, Due: Feb. 14, 11:59PM CSCE 212H, Spring 2008 Lab Assignment 3: Assembly Language Assigned: Feb. 7, Due: Feb. 14, 11:59PM February 7, 2008 1 Overview The purpose of this assignment is to introduce you to the assembly language

More information

07 - Processes and Jobs

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

More information

MACHINE-LEVEL PROGRAMMING I: BASICS COMPUTER ARCHITECTURE AND ORGANIZATION

MACHINE-LEVEL PROGRAMMING I: BASICS COMPUTER ARCHITECTURE AND ORGANIZATION MACHINE-LEVEL PROGRAMMING I: BASICS COMPUTER ARCHITECTURE AND ORGANIZATION Today: Machine Programming I: Basics History of Intel processors and architectures C, assembly, machine code Assembly Basics:

More information

SGI Altix Getting Correct Code Reiner Vogelsang SGI GmbH

SGI Altix Getting Correct Code Reiner Vogelsang SGI GmbH SGI Altix Getting Correct Code Reiner Vogelsang SGI GmbH reiner@sgi.com Module Objectives After completing the module, you will able to Find caveats and hidden errors in application codes Handle debuggers

More information

CS/COE 0449 term 2174 Lab 5: gdb

CS/COE 0449 term 2174 Lab 5: gdb CS/COE 0449 term 2174 Lab 5: gdb What is a debugger? A debugger is a program that helps you find logical mistakes in your programs by running them in a controlled way. Undoubtedly by this point in your

More information

The Unix Shell & Shell Scripts

The Unix Shell & Shell Scripts The Unix Shell & Shell Scripts You should do steps 1 to 7 before going to the lab. Use the Linux system you installed in the previous lab. In the lab do step 8, the TA may give you additional exercises

More information

Intel VTune Amplifier XE

Intel VTune Amplifier XE Intel VTune Amplifier XE Vladimir Tsymbal Performance, Analysis and Threading Lab 1 Agenda Intel VTune Amplifier XE Overview Features Data collectors Analysis types Key Concepts Collecting performance

More information

Agenda Process Concept Process Scheduling Operations on Processes Interprocess Communication 3.2

Agenda Process Concept Process Scheduling Operations on Processes Interprocess Communication 3.2 Lecture 3: Processes Agenda Process Concept Process Scheduling Operations on Processes Interprocess Communication 3.2 Process in General 3.3 Process Concept Process is an active program in execution; process

More information

Programs. Program: Set of commands stored in a file Stored on disk Starting a program creates a process static Process: Program loaded in RAM dynamic

Programs. Program: Set of commands stored in a file Stored on disk Starting a program creates a process static Process: Program loaded in RAM dynamic Programs Program: Set of commands stored in a file Stored on disk Starting a program creates a process static Process: Program loaded in RAM dynamic Types of Processes 1. User process: Process started

More information

CS , Spring 2002 Exam 2

CS , Spring 2002 Exam 2 Full Name: CS 15-213, Spring 2002 Exam 2 March 28, 2002 Instructions: Make sure that your exam is not missing any sheets, then write your full name and Andrew login ID on the front. Write your answers

More information

Outline Background Jaluna-1 Presentation Jaluna-2 Presentation Overview Use Cases Architecture Features Copyright Jaluna SA. All rights reserved

Outline Background Jaluna-1 Presentation Jaluna-2 Presentation Overview Use Cases Architecture Features Copyright Jaluna SA. All rights reserved C5 Micro-Kernel: Real-Time Services for Embedded and Linux Systems Copyright 2003- Jaluna SA. All rights reserved. JL/TR-03-31.0.1 1 Outline Background Jaluna-1 Presentation Jaluna-2 Presentation Overview

More information

Jackson Marusarz Intel Corporation

Jackson Marusarz Intel Corporation Jackson Marusarz Intel Corporation Intel VTune Amplifier Quick Introduction Get the Data You Need Hotspot (Statistical call tree), Call counts (Statistical) Thread Profiling Concurrency and Lock & Waits

More information

CS377P Programming for Performance Leveraging the Compiler for Performance

CS377P Programming for Performance Leveraging the Compiler for Performance CS377P Programming for Performance Leveraging the Compiler for Performance Sreepathi Pai UTCS October 5, 2015 Outline 1 Compiler Performance 2 Compiler Internals 3 Domain-specific Languages (DSLs) Outline

More information

PROCESSES. Jo, Heeseung

PROCESSES. Jo, Heeseung PROCESSES Jo, Heeseung TODAY'S TOPICS What is the process? How to implement processes? Inter-Process Communication (IPC) 2 WHAT IS THE PROCESS? Program? vs. Process? vs. Processor? 3 PROCESS CONCEPT (1)

More information

Processes. Jo, Heeseung

Processes. Jo, Heeseung Processes Jo, Heeseung Today's Topics What is the process? How to implement processes? Inter-Process Communication (IPC) 2 What Is The Process? Program? vs. Process? vs. Processor? 3 Process Concept (1)

More information

CS3210: Virtual memory. Taesoo Kim w/ minor updates K. Harrigan

CS3210: Virtual memory. Taesoo Kim w/ minor updates K. Harrigan 1 CS3210: Virtual memory Taesoo Kim w/ minor updates K. Harrigan 2 Administrivia Lab2? Lab3 is out! (Oct 4) Quiz #1. Lab1-3, Ch 0-3, Appendix A/B We will provide more information on Thursday (Oct 6) Time

More information

mp2 Warmup Instructions (Updated 1/25/2016 by Ron Cheung for using VMs)

mp2 Warmup Instructions (Updated 1/25/2016 by Ron Cheung for using VMs) mp2 Warmup Instructions (Updated 1/25/2016 by Ron Cheung for using VMs) Study the lecture notes on the tools and instruction set. Then follow along with this document. Make sure everything works for you

More information

Section 9: Cache, Clock Algorithm, Banker s Algorithm and Demand Paging

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.........................................

More information

OS lpr. www. nfsd gcc emacs ls 9/18/11. Process Management. CS 537 Lecture 4: Processes. The Process. Why Processes? Simplicity + Speed

OS lpr. www. nfsd gcc emacs ls 9/18/11. Process Management. CS 537 Lecture 4: Processes. The Process. Why Processes? Simplicity + Speed Process Management CS 537 Lecture 4: Processes Today: processes and process management what are the OS units of execution? how are they represented inside the OS? how is the CPU scheduled across processes?

More information

System Debug. This material exempt per Department of Commerce license exception TSU Xilinx, Inc. All Rights Reserved

System Debug. This material exempt per Department of Commerce license exception TSU Xilinx, Inc. All Rights Reserved System Debug This material exempt per Department of Commerce license exception TSU Objectives After completing this module, you will be able to: Describe GNU Debugger (GDB) functionality Describe Xilinx

More information

Use Dynamic Analysis Tools on Linux

Use Dynamic Analysis Tools on Linux Use Dynamic Analysis Tools on Linux FTF-SDS-F0407 Gene Fortanely Freescale Software Engineer Catalin Udma A P R. 2 0 1 4 Software Engineer, Digital Networking TM External Use Session Introduction This

More information

Recitation: Bomb Lab. September 17 th 2018

Recitation: Bomb Lab. September 17 th 2018 15-213 Recitation: Bomb Lab September 17 th 2018 Agenda Logistics - Bomb Lab Overview - Introduction to GDB - GDB and Assembly Tips What is Bomb Lab? An exercise in reading x86-64 assembly code. A chance

More information

C152 Laboratory Exercise 5

C152 Laboratory Exercise 5 C152 Laboratory Exercise 5 Professor: Krste Asanovic TA: Scott Beamer Department of Electrical Engineering & Computer Science University of California, Berkeley April 7, 2009 1 Introduction and goals The

More information

Quality in the Data Center: Data Collection and Analysis

Quality in the Data Center: Data Collection and Analysis Quality in the Data Center: Data Collection and Analysis Kingsum Chow, Chief Scientist Alibaba Systems Software Hardware Co-Optimization PNSQC 2017.10.07 3:45pm-5:20pm Acknowledged: Chengdong Li and Wanyi

More information

Parallelizing Lattice Boltzmann Methods with OpenMP

Parallelizing Lattice Boltzmann Methods with OpenMP Parallelizing Lattice Boltzmann Methods with OpenMP July 2012 Table of Contents 1 Introduction 2 3 4 Table of Contents 1 Introduction 2 3 4 2D flow with a circular obstacle Infrastructure Intel Manycore

More information

Optimize Data Structures and Memory Access Patterns to Improve Data Locality

Optimize Data Structures and Memory Access Patterns to Improve Data Locality Optimize Data Structures and Memory Access Patterns to Improve Data Locality Abstract Cache is one of the most important resources

More information

ECE 498 Linux Assembly Language Lecture 1

ECE 498 Linux Assembly Language Lecture 1 ECE 498 Linux Assembly Language Lecture 1 Vince Weaver http://www.eece.maine.edu/ vweaver vincent.weaver@maine.edu 13 November 2012 Assembly Language: What s it good for? Understanding at a low-level what

More information

CS 261 Fall Machine and Assembly Code. Data Movement and Arithmetic. Mike Lam, Professor

CS 261 Fall Machine and Assembly Code. Data Movement and Arithmetic. Mike Lam, Professor CS 261 Fall 2018 0000000100000f50 55 48 89 e5 48 83 ec 10 48 8d 3d 3b 00 00 00 c7 0000000100000f60 45 fc 00 00 00 00 b0 00 e8 0d 00 00 00 31 c9 89 0000000100000f70 45 f8 89 c8 48 83 c4 10 5d c3 Mike Lam,

More information

Operating Systems Lab 1 (Users, Groups, and Security)

Operating Systems Lab 1 (Users, Groups, and Security) Operating Systems Lab 1 (Users, Groups, and Security) Overview This chapter covers the most common commands related to users, groups, and security. It will also discuss topics like account creation/deletion,

More information

Mid Term from Feb-2005 to Nov 2012 CS604- Operating System

Mid Term from Feb-2005 to Nov 2012 CS604- Operating System Mid Term from Feb-2005 to Nov 2012 CS604- Operating System Latest Solved from Mid term Papers Resource Person Hina 1-The problem with priority scheduling algorithm is. Deadlock Starvation (Page# 84) Aging

More information

CSE 141 Summer 2016 Homework 2

CSE 141 Summer 2016 Homework 2 CSE 141 Summer 2016 Homework 2 PID: Name: 1. A matrix multiplication program can spend 10% of its execution time in reading inputs from a disk, 10% of its execution time in parsing and creating arrays

More information

Last Time: Floating Point. Intel x86 Processors. Lecture 4: Machine Basics Computer Architecture and Systems Programming ( )

Last Time: Floating Point. Intel x86 Processors. Lecture 4: Machine Basics Computer Architecture and Systems Programming ( ) Last Time: Floating Point Lecture : Machine Basics Computer Architecture and Systems Programming (252-0061-00) Timothy Roscoe Herbstsemester 2012 Fractional binary numbers IEEE floating point standard:

More information

CS377P Programming for Performance Single Thread Performance In-order Pipelines

CS377P Programming for Performance Single Thread Performance In-order Pipelines CS377P Programming for Performance Single Thread Performance In-order Pipelines Sreepathi Pai UTCS September 9, 2015 Outline 1 Introduction 2 Pipeline Preliminaries 3 The Inorder Pipeline and Performance

More information