TP020975 - Antonin LAPICHE. Contents Introduction 1 Process Control Management 2 Deadlock Management 3 Memory Management 4.

Slides:



Advertisements
Similar presentations
1 Concurrency: Deadlock and Starvation Chapter 6.
Advertisements

Chapter 5 Deadlocks. Contents What is deadlock? What is deadlock? Characterization Characterization Resource allocation graph Resource allocation graph.
Chapter 6 Concurrency: Deadlock and Starvation Operating Systems: Internals and Design Principles, 6/E William Stallings Patricia Roy Manatee Community.
1 Concurrency: Deadlock and Starvation Chapter 6.
Deadlock Prevention, Avoidance, and Detection
ICS Principles of Operating Systems Lectures 8 and 9 - Deadlocks Prof. Dmitri V. Kalashnikov dvk ics.uci.edu Slides © Prof. Nalini Venkatasubramanian.
Lecture 6 :Deadlocks. Deadlock Permanent blocking of a set of processes that either compete for system resources or communicate with each other Involves.
Concurrency: Deadlock and Starvation Chapter 6. Deadlock Permanent blocking of a set of processes that either compete for system resources or communicate.
Chapter 6 Concurrency: Deadlock and Starvation Operating Systems: Internals and Design Principles, 6/E William Stallings Patricia Roy Manatee Community.
Deadlock Prevention, Avoidance, and Detection.  The Deadlock problem The Deadlock problem  Conditions for deadlocks Conditions for deadlocks  Graph-theoretic.
Overview Assignment 8: hints Assignment 7: solution Deadlocks
Concurrency: Deadlock and Starvation Chapter 6. Deadlock Permanent blocking of a set of processes that either compete for system resources or communicate.
Lecture 7: Deadlock     Necessary Conditions for Deadlock     Deadlock Prevention - Havender's Linear Ordering Deadlock Avoidance Deadlock Detection &
DEADLOCK. Contents  Principles of deadlock  Deadlock prevention  Deadlock detection.
Deadlocks, Message Passing Brief refresh from last week Tore Larsen Oct
U NIVERSITY OF M ASSACHUSETTS A MHERST Department of Computer Science Computer Systems Principles Deadlock Emery Berger and Mark Corner University of Massachusetts.
Chapter 3 Deadlocks TOPICS Resource Deadlocks The ostrich algorithm
MODERN OPERATING SYSTEMS Third Edition ANDREW S. TANENBAUM Chapter 6 Deadlocks Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All.
Deadlock CSCI 444/544 Operating Systems Fall 2008.
02/18/2008CSCI 315 Operating Systems Design1 Deadlock Notice: The slides for this lecture have been largely based on those accompanying the textbook Operating.
The ‘deadlock’ conditions Reviewing some key points concerning the potential for ‘deadlock’ in an operating system.
CPSC 4650 Operating Systems Chapter 6 Deadlock and Starvation
1 Concurrency: Deadlock and Starvation Chapter 6.
Chapter 7: Deadlocks. 7.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts Bridge Crossing Example Traffic only in one direction. Each section.
Chapter 6 Deadlocks Resources Introduction Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved
CH 3 Deadlock When 2 (or more) processes remain blocked forever!
Deadlock Questions answered in this lecture: What are the four necessary conditions for deadlock? How can deadlock be prevented? How can deadlock be avoided?
1 Deadlocks Chapter Resource 3.2. Introduction to deadlocks 3.3. The ostrich algorithm 3.4. Deadlock detection and recovery 3.5. Deadlock avoidance.
1 Deadlocks Chapter Resource 3.2. Introduction to deadlocks 3.4. Deadlock detection and recovery 3.5. Deadlock avoidance 3.6. Deadlock prevention.
1 Deadlocks 2 Resources Examples of computer resources –printers –tape drives –tables Processes need access to resources in reasonable order Suppose.
1 Deadlocks Chapter Resource 3.2. Introduction to deadlocks 3.3. The ostrich algorithm 3.4. Deadlock detection and recovery 3.5. Deadlock avoidance.
1 Deadlocks Chapter 3. 2 Resources Examples of computer resources –printers –tape drives –tables Processes need access to resources in reasonable order.
Operating Systems 软件学院 高海昌 Operating Systems Gao Haichang, Software School, Xidian University 22 Contents  1. Introduction** 
Chapter VI Deadlocks Jehan-François Pâris
This Time - Deadlock Definition Conditions for deadlocks
Deadlock Operating Systems: Internals and Design Principles.
Deadlock cs550 Operating Systems David Monismith.
Deadlocks. Deadlock handling Deadlock prevention Deadlock avoidance Deadlock detection Deadlock recovery.
Chapter 7: Deadlocks. 7.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts - 7 th Edition, Feb 14, 2005 Chapter 7: Deadlocks The Deadlock.
Deadlocks Dec 11, 2007 CPE Operating Systems
Chapter 6 Concurrency: Deadlock and Starvation Operating Systems: Internals and Design Principles, 6/E William Stallings.
Proving Correctness and Measuring Performance CET306 Harry R. Erwin University of Sunderland.
Deadlock. Chapter 7: Deadlocks The Deadlock Problem System Model Deadlock Characterization Methods for Handling Deadlocks Deadlock Prevention Deadlock.
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition Chapter 6: Deadlocks.
Deadlocks 12/02/2015. What is a deadlock ? System has a finite set of resources. Resource can have one or more instances. Processes compete for resources.
CH 3 Deadlock When 2 (or more) processes remain blocked forever!
Deadlock Operating Systems (CC2011NI) -Mr. Pranoy Man Pradhan.
Chapter 6 Concurrency: Deadlock and Starvation Operating Systems: Internals and Design Principles, 6/E William Stallings Patricia Roy Manatee Community.
Auburn University COMP 3500 Introduction to Operating Systems Resource Allocation Graphs Handling Deadlocks Dr. Xiao.
MODERN OPERATING SYSTEMS Third Edition ANDREW S
Deadlocks (part II) Deadlock avoidance – (not reasonable)
CS703 - Advanced Operating Systems
Chapter 7 Deadlock.
Lecture 19: Deadlock: Conditions, Detection and Avoidance
Chapter 7: Deadlocks.
Deadlock avoidance Deadlock detection Resource Allocation Graphs
Chapter 7: Deadlocks.
Deadlocks Definition A set of processes is in a Deadlock state when every process in the set is waiting for an event that can only be caused by another.
DPNM Lab. Dept. of CSE, POSTECH
Review: Readers-Writers Problem
MODERN OPERATING SYSTEMS Third Edition ANDREW S
DEADLOCK.
CSE 451: Operating Systems Autumn 2010 Module 9 Deadlock
Lecture 19: Deadlock: Conditions, Detection and Avoidance
Jehan-François Pâris Chapter VI Deadlocks Jehan-François Pâris
Deadlock Prevention & Avoidance
Deadlock A deadlock situation on a resource can arise if and only if all of the following conditions hold simultaneously in a system: Mutual exclusion.
Deadlock Prevention & Avoidance
Chapter 8: Deadlocks Deadlock Characterization
MODERN OPERATING SYSTEMS Third Edition ANDREW S
Presentation transcript:

TP Antonin LAPICHE

Contents Introduction 1 Process Control Management 2 Deadlock Management 3 Memory Management 4

Introduction  Android is a Linux (latest release) based operating system  It’s an open source operating system mainly developed for smartphones

Process Control Management : CFS ProcessTime(ns)PriorityFair Clock(ns)T = 16 ns P11015, n = 3 P242 P323 1 FC ↔↔↔↔↔↔↔↔↔↔↔↔↔↔↔ P1 P2P3P2P1P2P3P1 P2P3P1P3 0,005,338,8911,2612,8413,8914,6015,0615,3815,5815,7215,8215,8815,9215,9516 ns

Deadlock Management : Prevention A A B B 1 2 Deadlock Process Resource Process holds Resource Process requires Resource  Hold and Wait: Processes already holding resources (or not) may require new resources or may require several resources.  Circular Wait: Two or more processes form a circular chain where each process waits for a resource that the next process in the chain holds.  Mutual Exclusion: Resource can only be used by one process at a time.  No preemption: Resource can’t be released by any other thing that the holding process  Hold and Wait: Processes already holding resources (or not) may require new resources or may require several resources.  Circular Wait: Two or more processes form a circular chain where each process waits for a resource that the next process in the chain holds.  Mutual Exclusion: Resource can only be used by one process at a time.  No preemption: Resource can’t be released by any other thing that the holding process

Memory Management : Clock Time RequestsCADBEBABCD 0AAAAAEEEEED 1BBBBBBBBBBB 2CCCCCCCAAAA 3DDDDDDDDDCC Page faults A1E1E1E1E1E1D 1BX50B1B0B1B1B0B 1C0C0C1A1A1A0A 1D0D0D0D0D1C0C