Device Management & Deadlock

Slides:



Advertisements
Similar presentations
Chapter 7: Deadlocks. 7.2 Chapter Objectives To develop a description of deadlocks, which prevent sets of concurrent processes from completing their tasks.
Advertisements

Data Communication and Networks Lecture 0 Administrivia September 9, 2004 Joseph Conron Computer Science Department New York University
Introduction to OS & Computer organization © Prof. Aiman Hanna Department of Computer Science Concordia University Montreal, Canada.
Comp 249 Programming Methodology Chapter 13 Interfaces & Inner Classes Dr. Aiman Hanna Department of Computer Science & Software Engineering Concordia.
Comp 248 Introduction to Programming Chapter 4 & 5 Defining Classes Part C Dr. Aiman Hanna Department of Computer Science & Software Engineering Concordia.
Memory Management & Virtual Memory © Dr. Aiman Hanna Department of Computer Science Concordia University Montreal, Canada.
Chapter 7: Deadlocks. 7.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts - 7 th Edition, Feb 14, 2005 Chapter 7: Deadlocks The Deadlock.
Introduction to OS & Computer organization © Dr. Aiman Hanna Department of Computer Science Concordia University Montreal, Canada.
Comp 248 Introduction to Programming Chapter 6 Arrays Part A Dr. Aiman Hanna Department of Computer Science & Software Engineering Concordia University,
Chapters 3 and 5 Possible questions
Chapter 1 Functions Copyright © 2010 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.
High-level Synchronization
-Type text and adjust font/size To add images:
Editing Instructions To add text: -Insert -Text Box
© 2010 Pearson Education, Inc. All rights reserved
Chapter 9 Power Series Copyright © 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.
Chapter 2 Limits Copyright © 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.
Data Communications and Networking
Sequences and Infinite Series
Virtual Memory Networks and Communication Department.
Comp 249 Programming Methodology
Comp 249 Programming Methodology
Basic Synchronization Principles
Synchronization Memory Management
Chapter 17 Linked Lists.
Chapter 19 Binary Search Trees.
11.7 Motion in Space Copyright © 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.
Chapter 4 Inheritance.
Chapter 14 Graphs and Paths.
Copyright © Aiman Hanna All rights reserved
Breadth-First Search (BFS)
Comp 249 Programming Methodology
Memory Management & Virtual Memory
High-level Synchronization
The Problem You are writing a program that accepts from the command line a number and that number tells the application how many numbers to read from standard.
Synchronization Memory Management
Chapter 10 Datapath Subsystems.
Chapter 7: Deadlocks.
Applications of the Derivative
Copyright © Aiman Hanna All rights reserved
Basic Synchronization Principles
11.8 Length of Curves Copyright © 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.
Chapter 20 Hash Tables.
Copyright © 2011 Pearson Education, Inc
How To Set Up Your Online Science Textbook
Chapter 1 Preliminaries
Searching for Guinea Pig B: Case Study in Online Research
Chapter 1 Functions Copyright © 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.
Chapter 5 Algorithm Analysis.
Copyright © Aiman Hanna All rights reserved
The University of Adelaide, School of Computer Science
Copyright © Aiman Hanna All rights reserved
Basic Synchronization Principles (Continue)
The Facts to Be Explained
Basic Synchronization Principles (Continue)
Alternate Proofs of Selected HO Theorems
Copyright © Aiman Hanna All rights reserved
High-level Synchronization
Introduction: Some Representative Problems
Scheduling & File Management
Circuit Characterization and Performance Estimation
High-level Synchronization (Continue)
The University of Adelaide, School of Computer Science
Chapter 2 Part 1 Data and Expressions.
Chapter 6 Dynamic Programming.
Device Management & Deadlock
Chapter 2 Reference Types.
Chapter 4 Greedy Algorithms.
Copyright © 2011 Pearson Education, Inc
Scheduling & File Management
Presentation transcript:

Device Management & Deadlock Operating Systems Device Management & Deadlock 1) These notes are © Aiman Hanna. All copyrights reserved. For more information please e-mail to: Contact@AimanHanna.com. 2) These notes are also based on: Operating Systems, 3rd edition by Garry Nutts, published by Addison Wesley, ISBN-10: 0201773449 | ISBN-13: 9780201773446 . These notes still totally enforce all copyrights for Nutts/ Addison Wesley. For more information on these rights, please refer to the original publication of the book. 3) VERY IMPORTANT: These notes are neither complete nor sufficient to study for the course. They are merely given so that you can follow the covered subjects. You should NEVER depend solely on these notes for your study. Any use of these notes that results in violation of any of the copyrights indicated above is strictly prohibited. © Dr. Aiman Hanna Department of Computer Science Concordia University Montreal, Canada Data Communications & Computer Networking, by: Aiman Hanna

Optimizing Access to Magnetic Disks FCFS SSTF Scan/Look Circular Scan / Circular Look Homing Instructions

Deadlock Why is Deadlock deadly? Resource Allocation Graph What would a loop in the resource allocation graph indicate? What if there are no loops?

Deadlock Needed Conditions for deadlock to occur Deadlock Prevention Different ideas to violate one of the needed 4 conditions of deadlock and so prevent deadlock Was any of these ideas possible? Deadlock avoidance Deadlock Detection & Handling If none of the above is possible, what can an OS do?

Where is this week coverage in the textbook? Device Management Chapter 5 – Pages 180 through 185 Deadlock: Study form the notes provided in class.  Note: If you did not come to class and did not obtain these notes from me afterwards, then you must read chapter 10 in your textbook as best alternative