Device Management & Deadlock

Slides:



Advertisements
Similar presentations
Chapter 7: Deadlocks Adapted by Donghui Zhang from the original version by Silberschatz et al.
Advertisements

Dr. Kalpakis CMSC 621, Advanced Operating Systems. Fall 2003 URL: Basics of Deadlock Theory.
CSE111: Great Ideas in Computer Science Dr. Carl Alphonce 219 Bell Hall Office hours: M-F 11:00-11:
Chapter 7: Deadlocks. 7.2 Chapter Objectives To develop a description of deadlocks, which prevent sets of concurrent processes from completing their tasks.
Modified from Silberschatz, Galvin and Gagne Lecture 13 Chapter 7: Deadlocks.
Chapter 1 Computer Networks and the Internet. Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 1-2.
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
Silberschatz and Galvin  Chapters 3 and 5 Possible questions –Tracing a given program involving fork, exec, semaphores, and share memory –Wring.
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.
Silberschatz, Galvin and Gagne ©2013 Operating System Concepts – 9 th Edition Chapter 7: Deadlocks.
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.
Chapter 1 (PART 2) Operating System Concepts Department of Computer Science Southern Illinois University Edwardsville Spring, 2016 Dr. Hiroshi Fujinoki.
Introduction to OS & Computer organization © Dr. Aiman Hanna Department of Computer Science Concordia University Montreal, Canada.
Copyright © 2006 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill Technology Education Lecture 7 Operating Systems.
Operating Systems Unit VI Deadlocks and Protection Department of Computer Science Engineering and Information Technology.
7.1 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition Chapter 7: Deadlocks The Deadlock Problem System Model Deadlock Characterization.
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition Chapter 6: Deadlocks.
Comp 248 Introduction to Programming Chapter 6 Arrays Part A Dr. Aiman Hanna Department of Computer Science & Software Engineering Concordia University,
Silberschatz, Galvin and Gagne ©2009 Edited by Khoury, 2015 Operating System Concepts – 9 th Edition, Chapter 7: Deadlocks.
Test 2 Preparation. General Information Close book, close notes Review online course notes and read the book. You may work on some exercise problems at.
Chapters 3 and 5 Possible questions
Object Oriented Programming Spring Semester
High-level Synchronization
Data Communications and Networking
Virtual Memory Networks and Communication Department.
Comp 249 Programming Methodology
Basic Synchronization Principles
Device Management & Deadlock
Synchronization Memory Management
Bucket-Sort and Radix-Sort
Copyright © Aiman Hanna All rights reserved
Breadth-First Search (BFS)
Chapter 7: Deadlocks.
Memory Management & Virtual Memory
High-level Synchronization
Synchronization Memory Management
Ordered Maps & Dictionaries
Chapter 7: Deadlocks.
Copyright © Aiman Hanna All rights reserved
Copyright © Aiman Hanna All rights reserved
Basic Synchronization Principles
Copyright © Aiman Hanna All rights reserved
Deadlocks Session - 13.
Copyright © Aiman Hanna All rights reserved
Copyright © Aiman Hanna All rights reserved
The University of Adelaide, School of Computer Science
Linked Lists & Iterators
Copyright © Aiman Hanna All rights reserved
Basic Synchronization Principles (Continue)
Copyright © Aiman Hanna All rights reserved
The University of Adelaide, School of Computer Science
The University of Adelaide, School of Computer Science
Basic Synchronization Principles (Continue)
Copyright © Aiman Hanna All rights reserved
High-level Synchronization
The University of Adelaide, School of Computer Science
The University of Adelaide, School of Computer Science
The University of Adelaide, School of Computer Science
Scheduling & File Management
The University of Adelaide, School of Computer Science
Operating System Concepts
Operating System Concepts
High-level Synchronization (Continue)
The University of Adelaide, School of Computer Science
Chapter 8: Deadlocks Deadlock Characterization
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 System Concepts, 9th edition by Silberschatz/Galvin/Gagne, published by Wiley 2013, ISBN: 978-1-118-06333-0 | ISBN BRV: 978-1-118-12938-8. These notes still totally enforce all copyrights for Silberschatz/Galvin/Gagne & J. Wiley . 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 10: Section 10.1, 10.2, 103, 10.4 & 10.6  Permanently Skip: 10.5, 10.7 & 10.8 Deadlock: Chapter 7 – Entire chapter