Performance Performance is about time and the software system’s ability to meet timing requirements.

Slides:



Advertisements
Similar presentations
Computer Systems & Architecture Lesson 2 4. Achieving Qualities.
Advertisements

Real Time Scheduling.
Introduction to Embedded Systems Resource Management - III Lecture 19.
Thread Criticality Predictors for Dynamic Performance, Power, and Resource Management in Chip Multiprocessors Abhishek Bhattacharjee Margaret Martonosi.
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition, Chapter 6: Process Synchronization.
Vakgroep Informatietechnologie – IBCN Software Architecture Prof.Dr.ir. F. Gielen Quality Attributes & Tactics (2) Performance.
REAL-TIME COMMUNICATION ANALYSIS FOR NOCS WITH WORMHOLE SWITCHING Presented by Sina Gholamian, 1 09/11/2011.
INSE - Lectures 19 & 20 SE for Real-Time & SE for Concurrency  Really these are two topics – but rather tangled together.
Chapter 101 Cleaning Policy When should a modified page be written out to disk?  Demand cleaning write page out only when its frame has been selected.
BFS: Brain F*ck Scheduler Jacob Chan. Objectives  Brain F*ck Scheduling  What it is  How it works  Features  Scalability  Limitations  Definition.
Overview of Matchmaking and Scheduling (Mapping) Algorithm
1 Lecture 14: Cache Innovations and DRAM Today: cache access basics and innovations, DRAM (Sections )
OS Spring ’ 04 Scheduling Operating Systems Spring 2004.
1 Exercise a short summary of you so your professor can get to know you better: Name, company, job/role/title, most interesting SE area, any architecting.
1 CSSE 477 – Intro to Performance Steve Chenoweth Friday, 9/2/11 Week 0, Day 2 Right – A close analogy to performance as we mean it – Danica Patrick in.
CS 551-Memory Management1 Learning Objectives Centralized Memory Management -review Simple Memory Model Shared Memory Model Distributed Shared Memory Memory.
Real-Time Kernels and Operating Systems. Operating System: Software that coordinates multiple tasks in processor, including peripheral interfacing Types.
Lecture 12 Synchronization. EECE 411: Design of Distributed Software Applications Summary so far … A distributed system is: a collection of independent.
1 Chapter 13 Embedded Systems Embedded Systems Characteristics of Embedded Operating Systems.
Aggregate Scheduling – Enhancing Throughput in Collective Tasking Systems L. Subramanian Randy H.Katz Michael J. Franklin.
CS Spring 2012 CS 414 – Multimedia Systems Design Lecture 34 – Media Server (Part 3) Klara Nahrstedt Spring 2012.
EMBEDDED SOFTWARE Team victorious Team Victorious.
Load Balancing Dan Priece. What is Load Balancing? Distributed computing with multiple resources Need some way to distribute workload Discreet from the.
Real Time Process Control (Introduction)
1 System Models. 2 Outline Introduction Architectural models Fundamental models Guideline.
© 2009 Matthew J. Sottile, Timothy G. Mattson, and Craig E Rasmussen 1 Concurrency in Programming Languages Matthew J. Sottile Timothy G. Mattson Craig.
A Two-Lock Concurrent Queue Algorithm Maged M. Michael, Michael L. Scott University of Rochester Presented by Hussain Tinwala.
Scalable Web Server on Heterogeneous Cluster CHEN Ge.
Scheduling policies for real- time embedded systems.
Multiprocessor and Real-Time Scheduling Chapter 10.
1 RTOS Design Some of the content of this set of slides is taken from the documentation existing on the FreeRTOS website
Chapter 101 Multiprocessor and Real- Time Scheduling Chapter 10.
Web Search Using Mobile Cores Presented by: Luwa Matthews 0.
By Phani Gowthami Tammineni. Overview This presentation is about the issues in real-time database systems and presents an overview of the state of the.
Real Time Scheduling Telvis Calhoun CSc Outline Introduction Real-Time Scheduling Overview Tasks, Jobs and Schedules Rate/Deadline Monotonic Deferrable.
Prepare by : Ihab shahtout.  Overview  To give an overview of fixed priority schedule  Scheduling and Fixed Priority Scheduling.
Course Title: “Operating System” Chapter No: 04 “Process Scheduling” Course Instructor: ILTAF MEHDI IT Lecturer, MIHE, Kart-i Parwan, Kabul.
OPERATING SYSTEMS CS 3530 Summer 2014 Systems with Multi-programming Chapter 4.
Real-Time systems By Dr. Amin Danial Asham.
Assoc. Prof. Dr. Ahmet Turan ÖZCERİT.  What Operating Systems Do  Computer-System Organization  Computer-System Architecture  Operating-System Structure.
1 Advanced Software Architecture Muhammad Bilal Bashir PhD Scholar (Computer Science) Mohammad Ali Jinnah University.
Martin Kruliš by Martin Kruliš (v1.1)1.
Cloud Computing Lecture 5-6 Muhammad Ahmad Jan.
Introduction to Real-Time Systems
Kernel-Assisted Scheduling and Deadline Support for Software Transactional Memory Walther Maldonado, Patrick Marlier, Pascal Felber, Etienne Rivière University.
Mok & friends. Resource partition for real- time systems (RTAS 2001)
1 Software Architecture in Practice Architectural Design (Again, the amputated version)
Distributed Process Scheduling- Real Time Scheduling Csc8320(Fall 2013)
Soft Timers : Efficient Microsecond Software Timer Support for Network Processing - Mohit Aron & Peter Druschel CS533 Winter 2007.
A Workload-oriented Programming Model for Temporal Isolation with VBS Ana Sokolova Department of Computer Sciences University of Salzburg joint work with.
1 Advanced Software Architecture Muhammad Bilal Bashir PhD Scholar (Computer Science) Mohammad Ali Jinnah University.
Lecture 05 Interoperability, Modifiability, Performance
Performance Metrics and Performance Engineering
SEDA: An Architecture for Scalable, Well-Conditioned Internet Services
Copyright ©: Nahrstedt, Angrave, Abdelzaher
Processes and Threads Processes and their scheduling
Real-time Software Design
Operating Systems CPU Scheduling.
Presented by: Isaac Martin
Lecture 21: Introduction to Process Scheduling
CSCI1600: Embedded and Real Time Software
Lecture 6 – Quality Attributes
Multiprocessor and Real-Time Scheduling
Chapter 6: CPU Scheduling
Lecture 21: Introduction to Process Scheduling
CS703 - Advanced Operating Systems
Lecture 6 – Quality Attributes
Guaranteeing Message Latencies on Controller Area Network (CAN)
CSC Multiprocessor Programming, Spring, 2011
Scheduling of Regular Tasks in Linux
Presentation transcript:

Performance Performance is about time and the software system’s ability to meet timing requirements.

Performance Event arrival patterns: Periodic: events arrive predictably at regular time intervals. Stochastic: events arrive according to some probabilistic distribution. Sporadic: events arrive according to a pattern that is nether periodic nor stochastic. Response measures: Latency: the time between the event arrival and the system’s response. Deadline: for complete processing Throughput: number of transactions that the system can process in a unit time Jitter: allowable variation in latency Miss rate: the number of events that the system is not able to process Response time: Processing time: when the system is working to response by consuming resources Blocked time: when the system is unable to response, because of resource contention Contention for resources Availability of resources Dependency on other computation

Performance Tactics

Control Resource Demand by reducing the number of events processed Manage sample rate: reduce the sampling frequency Limit event response: process events only up to a set maximum rate Prioritize events: impose a priority scheme that ranks all events according to their importance for services Reduce overhead: remove intermediaries to improve latency (conflict with modifiability) Bound execution times: place a limit on how much execution time is used to response to an event Increase resource efficiency: improving the algorithms used in critical areas to decrese latency

Performance Tactics Manage Resources Increase resources: add additional hardware resources Introduce concurrency: do parallel processing when possible and not extra overhead Maintain multiple copies of computations: use multiple/replicated servers Maintain multiple copies of data: use caching and data replication Bound queue size: control the maximum number of queued arrivals and the resources used to process the arrivals. Need to deal with overflow. Schedule resources: understand the characteristics of each resource’s use and choose the scheduling strategy that is compatible with it.