Back of the Envelope Estimation

Slides:



Advertisements
Similar presentations
Chapter 3 Process Description and Control
Advertisements

1 Threads CSCE 351: Operating System Kernels Witawas Srisa-an Chapter 4-5.
1/27/2010CSCI 315 Operating Systems Design1 Processes Notice: The slides for this lecture have been largely based on those accompanying an earlier version.
Cs238 CPU Scheduling Dr. Alan R. Davis. CPU Scheduling The objective of multiprogramming is to have some process running at all times, to maximize CPU.
1HW1 Explain the transition “interrupted” and “event wait.” Describe how they are different. NewReadyRunningTerminated Waiting (Blocked) admitted Dispatched.
Midterm Tuesday October 23 Covers Chapters 3 through 6 - Buses, Clocks, Timing, Edge Triggering, Level Triggering - Cache Memory Systems - Internal Memory.
OPERATING SYSTEMS DESIGN AND IMPLEMENTATION Third Edition ANDREW S. TANENBAUM ALBERT S. WOODHULL Yan hao (Wilson) Wu University of the Western.
AN INTRODUCTION TO THE OPERATIONAL ANALYSIS OF QUEUING NETWORK MODELS Peter J. Denning, Jeffrey P. Buzen, The Operational Analysis of Queueing Network.
Lecture 5 Process, Thread and Task September 22, 2015 Kyu Ho Park.
Virtual Machine Monitors: Technology and Trends Jonathan Kaldor CS614 / F07.
Chapter 3: Processes. 3.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts - 7 th Edition, Feb 7, 2006 Process Concept Process – a program.
Chapter 41 Processes Chapter 4. 2 Processes  Multiprogramming operating systems are built around the concept of process (also called task).  A process.
Router Architecture Overview
Chapter 4 Processes. Process: what is it? A program in execution A program in execution usually usually Can also have suspended or waiting processes Can.
Process by Dr. Amin Danial Asham. References Operating System Concepts ABRAHAM SILBERSCHATZ, PETER BAER GALVIN, and GREG GAGNE.
OS, , Part II Processes Department of Computer Engineering, PSUWannarat Suntiamorntut.
The act of Scheduling a process means changing the active PCB pointed to by the CPU. Also called a context switch. A context switch is essentially the.
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition, Chapter 3: Process-Concept.
1 Computer Systems II Introduction to Processes. 2 First Two Major Computer System Evolution Steps Led to the idea of multiprogramming (multiple concurrent.
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition, Chapter 3: Process-Concept.
Structure of a Waiting Line System Queuing theory is the study of waiting lines Four characteristics of a queuing system: –The manner in which customers.
Computer and Operating Systems
Chapter 3: Processes. 3.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts Chapter 3: Processes Process Concept Process Scheduling Operations.
Silberschatz, Galvin and Gagne  Operating System Concepts Chapter 4: Processes Process Concept Process Scheduling Types of shedulars Process.
QUEUING THEORY 1.  - means the number of arrivals per second   - service rate of a device  T - mean service time for each arrival   = ( ) Utilization,
Process Control Management Prepared by: Dhason Operating Systems.
CS 140 Lecture Notes: Virtual Memory
Processes and threads.
Process concept.
Chapter 3: Process Concept
Operating System Concepts
Operating Systems (CS 340 D)
Lecture Topics: 11/1 Processes Process Management
3 | Analyzing Server, Network, and Client Health
Device Drivers, FAT, Queuing Theory, Memory Mapped Files
Intro to Processes CSSE 332 Operating Systems
Software Architecture in Practice
Register Use Policy Conventions
CS 140 Lecture Notes: Virtual Machines
What’s “Inside” a Router?
Process management Information maintained by OS for process management
CS 140 Lecture Notes: Virtual Memory
MODERN OPERATING SYSTEMS Third Edition ANDREW S
Lecture 2: Processes Part 1
Chapter 1: Intro (excerpt)
Queuing Systems Don Sutton.
Introduction What is an operating system bootstrap
More examples How many processes does this piece of code create?
Back of the Envelope Estimation
CS 140 Lecture Notes: Virtual Memory
Operating System Concepts
PROCESS MANAGEMENT Information maintained by OS for process management
Process Description and Control
Chapter 2: Operating-System Structures
Process Description and Control
Process Description and Control
Process Description and Control
Chapter 3: Processes.
Overview Analysis Notation Specific ADTs
Back of the Envelope Estimation
Operating Systems: A Modern Perspective, Chapter 6
Process Description and Control
Outline Chapter 2 (cont) Chapter 3: Processes Virtual machines
Chapter 3: Process Concept
CS 140 Lecture Notes: Virtual Machines
Chapter 2: Operating-System Structures
CS 140 Lecture Notes: Virtual Memory
[Most of the details about queues are left for to read about and work out in Lab 6.] Def. As a data structure, a queue is an ordered collection of data.
Chapter 1: Introduction CSS503 Systems Programming
CSE 332: Data Abstractions Memory Hierarchy
Presentation transcript:

Back of the Envelope Estimation

Principles Work does not compress A bad estimate is better than none. Use Queuing Theory Look at the resources

Quantities Time CPU seconds of processes and functions Code size Instruction path lengths Real time/Response time Support time Back up, batch audits, admin duties

Quantities (cont.) Memory Text, data, bss, stack, heap of a process Shared memory System resources Message queues Buffers System tables

Quantities (cont.) I/O Bandwidth of channels Number of concurret I/O ops Data Size Disk speed

Quantities (cont.) Messages Quantity per unit time Distribution over type, priority, time, etc. Transit time in the system

Estimation

Feedback: Privacy Policy Feedback
Do Not Sell My Personal Information
About project: SlidePlayer Terms of Service

© 2025 SlidePlayer.com. Inc. All rights reserved.