Operating Systems - Deadlocks and Threads
Learn about deadlocks and threads in computer operating systems with this free online computer OS course.Publisher: NPTEL
CertificationView course modules
Whether or not a deadlock arises in an operating system depends on many different factors. To detect a deadlock, the OS needs to keep track of current resource allocation and current request allocation. This course will teach you the three main ways to handle deadlocks: by detection and recovery, avoidance, or prevention. You will then study the Dining Philosopher’s problem and the role of mutex in deadlocks. You will also learn what semaphore and mutual exclusions are.
You will then look into paralyzation and learn how threads are used within it. Threads are execution entities and light-weight processes, while user threads and kernel threads are two strategies for managing threads. The course will discuss the difference between threads and processes, and describe how threads are created and destroyed. You will study how different operating systems support threads in different ways and learn how a Graphics Processing Unit (GPU) perform thousands of tasks in parallel.
This course on the important concepts of deadlocks and threads is part of a series of Operating Systems courses. This series includes Introduction to Memory Management, Introduction to Operating Systems Processes, Understanding Hardware and Software Interrupts, Introduction to Scheduling, and Introduction to Synchronization. Each course is designed to help you enhance your computer programming skills, so once you have completed this course make sure to check the rest out!
Understanding Deadlocks - Learning Outcomes
Dining Philosophers Problem
Introduction to Deadlocks
Dealing with Deadlocks
Understanding Deadlocks - Lesson Summary
Understanding Threads - Learning Outcomes
Threads - Part I
Threads - Part II
Understanding Threads - Lesson Summary
Having completed this course, you will be able to:
- Explain the dining philosopher's problem.
- Define the role of mutex.
- Explain the concept of semaphores.
- Define what is meant by mutual exclusion.
- List the conditions for resource deadlock.
- Explain how deadlocks are detected.
- Define what is meant by paralysation.
- Explain how threads are used in paralyzation.
- Describe how threads are created and destroyed.
- Distinguish between threads and processes.
- Explain how different operating systems supports threads in different ways.
All Alison courses are free to enrol, study and complete. To successfully complete this Certificate course and become an Alison Graduate, you need to achieve 80% or higher in each course assessment. Once you have completed this Certificate course, you have the option to acquire an official Certificate, which is a great way to share your achievement with the world. Your Alison Certificate is:
Ideal for sharing with potential employers - include it in your CV, professional social media profiles and job applications
An indication of your commitment to continuously learn, upskill and achieve high results
An incentive for you to continue empowering yourself through lifelong learning
Alison offers 3 types of Certificates for completed Certificate courses:
Digital Certificate - a downloadable Certificate in PDF format, immediately available to you when you complete your purchase
Certificate - a physical version of your officially branded and security-marked Certificate, posted to you with FREE shipping
Framed Certificate - a physical version of your officially branded and security-marked Certificate in a stylish frame, posted to you with FREE shipping
All Certificates are available to purchase through the Alison Shop. For more information on purchasing Alison Certificates, please visit our FAQs. If you decide not to purchase your Alison Certificate, you can still demonstrate your achievement by sharing your Learner Record or Learner Achievement Verification, both of which are accessible from your Dashboard. For more details on our Certificate pricing, please visit our Pricing Page.