Preventing Interrupt Overload Presented by Jiyong Park Seoul National University, Korea 2005. 2. 22. John Regehr, Usit Duogsaa, School of Computing, University.

Slides:



Advertisements
Similar presentations
9.4 Page Replacement What if there is no free frame?
Advertisements

Scheduling Criteria CPU utilization – keep the CPU as busy as possible (from 0% to 100%) Throughput – # of processes that complete their execution per.
Tutorial 3 - Linux Interrupt Handling -
Lecture Objectives: 1)Explain the limitations of flash memory. 2)Define wear leveling. 3)Define the term IO Transaction 4)Define the terms synchronous.
EEE 243B Applied Computer Programming Timing considerations.
ECE 526 – Network Processing Systems Design Software-based Protocol Processing Chapter 7: D. E. Comer.
1 School of Computing Science Simon Fraser University CMPT 300: Operating Systems I Dr. Mohamed Hefeeda.
1 Soft Timers: Efficient Microsecond Software Timer Support For Network Processing Mohit Aron and Peter Druschel Rice University Presented By Jonathan.
OPERATING SYSTEM OVERVIEW
Review: Operating System Manages all system resources ALU Memory I/O Files Objectives: Security Efficiency Convenience.
Tiny OS Optimistic Lightweight Interrupt Handler Simon Yau Alan Shieh
Lock Inference for Systems Software John Regehr Alastair Reid University of Utah March 17, 2003.
Processes 1 CS502 Spring 2006 Processes Week 2 – CS 502.
Eliminating Receive Livelock in an Interrupt-driven Kernel Jeffrey C. Mogul K. K. Ramakrishnan AT&T Bell Laboratories
Supporting Time-sensitive Application on a Commodity OS By Ashvin Goel, Luca Abeni, Charles Krasic, Jim Snow, Jonathan Walpole Presenter: Shuping Tien.
1 Last Class: Introduction Operating system = interface between user & architecture Importance of OS OS history: Change is only constant User-level Applications.
Evaluating System Performance in Gigabit Networks King Fahd University of Petroleum and Minerals (KFUPM) INFORMATION AND COMPUTER SCIENCE DEPARTMENT Dr.
Fall 2001CS 4471 Chapter 2: Performance CS 447 Jason Bakos.
Timers and Interrupts Shivendu Bhushan Summer Camp ‘13.
G Robert Grimm New York University Receiver Livelock.
Interrupt Management In Real-time Systems
Hands-On Microsoft Windows Server 2008 Chapter 11 Server and Network Monitoring.
CH 13 Server and Network Monitoring. Hands-On Microsoft Windows Server Objectives Understand the importance of server monitoring Monitor server.
Windows Server 2008 Chapter 11 Last Update
Introduction to Embedded Systems
MCU: Interrupts and Timers Ganesh Pitchiah. What’s an MCU ?
Sogang University Advanced Computing System Chap 1. Computer Architecture Hyuk-Jun Lee, PhD Dept. of Computer Science and Engineering Sogang University.
1 CS/COE0447 Computer Organization & Assembly Language Chapter 5 part 4 Exceptions.
Operating Systems. Definition An operating system is a collection of programs that manage the resources of the system, and provides a interface between.
Second-Chance Algorithm Basically, it’s a FIFO algorithm When a page has been selected, we inspect its reference bit. If the value is 0, we proceed to.
COMPUTER ORGANIZATIONS CSNB123 NSMS2013 Ver.1Systems and Networking1.
Timer Timer is a device, which counts the input at regular interval (δT) using clock pulses at its input. The counts increment on each pulse and store.
OPERATING SYSTEMS CS 3530 Summer 2014 Systems with Multi-programming Chapter 4.
Timers and Interrupts Anurag Dwivedi. Let Us Revise.
1 Soft Timers: Efficient Microsecond Software Timer Support For Network Processing Mohit Aron and Peter Druschel Rice University Presented By Oindrila.
CH 13 Server and Network Monitoring. Hands-On Microsoft Windows Server Objectives Understand the importance of server monitoring Monitor server.
Concurrency, Processes, and System calls Benefits and issues of concurrency The basic concept of process System calls.
In a multitasking environment : what is a timeslice (quantum)? what is a context switch? When a large number of processes (jobs) are multitasking the actual.
TIMERS AND INTERRUPTS AVI SINGH KEVIN JOSE PIYUSH AWASTHI.
Computer Organization Instruction Set Architecture (ISA) Instruction Set Architecture (ISA), or simply Architecture, of a computer is the.
Chapter 2 Process Management. 2 Objectives After finish this chapter, you will understand: the concept of a process. the process life cycle. process states.
Time Management.  Time management is concerned with OS facilities and services which measure real time.  These services include:  Keeping track of.
Interrupts and Interrupt Handling David Ferry, Chris Gill CSE 522S - Advanced Operating Systems Washington University in St. Louis St. Louis, MO
Interrupt Handler Migration and Direct Interrupt Scheduling for Rapid Scheduling of Interrupt-driven Tasks Reviewer: Kim, Hyukjoong ESLab.
Introduction to Exceptions 1 Introduction to Exceptions ARM Advanced RISC Machines.
Advanced Operating Systems CS6025 Spring 2016 Processes and Threads (Chapter 2)
Configuring pacemaker while 2kms away. Person is travelling in driverless car.
Soft Timers : Efficient Microsecond Software Timer Support for Network Processing - Mohit Aron & Peter Druschel CS533 Winter 2007.
Processes and threads.
OPERATING SYSTEMS CS3502 Fall 2017
The deadline establish a priority among interrupt requests.
Unit OS9: Real-Time and Embedded Systems
Where are being used the OS?
Computer System Overview
Reconfigurable Hardware Scheduler for RTS
CGS 3763 Operating Systems Concepts Spring 2013
Operating systems Process scheduling.
CPU SCHEDULING.
Ongoing Research Jiyong Park
CSE 451: Operating Systems Autumn 2003 Lecture 2 Architectural Support for Operating Systems Hank Levy 596 Allen Center 1.
CSE 451: Operating Systems Autumn 2001 Lecture 2 Architectural Support for Operating Systems Brian Bershad 310 Sieg Hall 1.
Computer System Overview
8253 – PROGRAMMABLE INTERVAL TIMER (PIT). What is a Timer? Timer is a specialized type of device that is used to measure timing intervals. Timers can.
CSE 451: Operating Systems Winter 2003 Lecture 2 Architectural Support for Operating Systems Hank Levy 412 Sieg Hall 1.
A Top-Level View Of Computer Function And Interconnection
Mechanisms for Detecting and Handling Timing Errors
Chapter 3: Processes Process Concept Process Scheduling
COMP3221: Microprocessors and Embedded Systems
Chapter 2: Performance CS 447 Jason Bakos Fall 2001 CS 447.
Chapter 3: Process Management
Presentation transcript:

Preventing Interrupt Overload Presented by Jiyong Park Seoul National University, Korea John Regehr, Usit Duogsaa, School of Computing, University of Utah

2 Summary  Interrupt overload  Too many interrupts that exceed predefined rate.  Solutions for preventing interrupt overload  Strict software scheduler  Bursty software scheduler  Hardware interrupt scheduler interrupt rate processor load for interrupt handling predefined maximum rate

3 Motivation  Interrupt overload can be occur often in embedded systems  Disconnected device (Apollo 11 in 1969)  Unexpected situation (Robot going on downhill)  Malicious peer (too many small packets)

4 Interrupt Handling Model Device pending bit (size 1 queue) enable bit global enable bit CPU interrupt interrupt handler

5 Solution 1: Strict Software Scheduler  Interrupt can not be processed faster than a predefined rate.  Modification to interrupt prologue time interrupt predefined rate pendingdiscard interrupt discard timer interrupt enable = 0 set one-shot timer enable = 1

6 Solution 2: Bursty Software Scheduler  Allows maximum N interrupts within T interval.  Interrupt handler prologue  counter ++;  if counter >= N then enable = off  Timer with period T  counter = 0; enable = on time T N = 3

7 Solution 3: Hardware Scheduler  Implemented on FPGA. Device CPU count = 0 ? down counter count true false reset pending interrupt

8 Evaluation  Overhead of each mechanism  On 4MHz Atmel AVR processor  Overhead: 2 ~ 10%

9 Evaluation  Interrupt handler works 250 cycles

10 Related Work  Receive live-lock, Lazy Receiver Processing  Switch to polling when overload  Early demultiplexing  Network centric  Concentrate on maximizing throughput (no consideration to timely execution of application)  Interrupt Thread  Just delays interrupt overload. Does not prevent it.  Big overhead on very small embedded systems

11 Strong Points  Simple but very effective solution  Modeling the interrupt handler as periodic task (C, T)  The urgent need for preventing interrupt overload is well explained using various examples.  The interrupt scheduler is extended to support multiple interrupt sources.  Hardware solution requires only small amount of transistors (600).

12 Weak Points  Not very much