1 / 35

Exploring Operating Systems: Types, Interrupt Handling, and Mutual Exclusion Techniques

This chapter delves into the fundamental types of operating systems: single-user, multiuser, and real-time systems. It provides insights on memory mapping in the Pep/7 system, the role of interrupts, and various service routines connected to specific instructions. The section also discusses semaphore operations and mutual exclusion mechanisms, including Peterson’s algorithm. With diagrams illustrating state transitions and resource allocation graphs, this content serves as a comprehensive guide for understanding the intricacies of operating systems and concurrent processes.

nitza
Télécharger la présentation

Exploring Operating Systems: Types, Interrupt Handling, and Mutual Exclusion Techniques

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Chapter 08

  2. Three types of operating systems • Single-user • Multiuser • Real-time

  3. A memory map of the Pep/7 system

  4. Operating system RAM

  5. The Pep/7 Loader • SP := Mem[7FFA] • PC := Mem[7FFC]

  6. The Pep/7 Loader (Cont’d) • Please click on the following link Programs\c08l02.gif to view the appropriate program.

  7. A Pep/7 interrupt

  8. An interrupt triggered by the instruction F1003B

  9. The RTI instruction

  10. The stack addresses of the copies of the CPU registers

  11. The entry and exit points of the interrupt service routine

  12. The finite state machine in the DECI interrupt handler

  13. The interrupt service routine for the DECI instruction • Please click on the following link Programs\c08l04.gif to view the appropriate program.

  14. The interrupt service routine for the DECO instruction • Please click on the following link Programs\c08l05.gif to view the appropriate program.

  15. The interrupt service routine for the HEXO instruction • Please click on the following link Programs\c08l06.gif to view the appropriate program.

  16. The addressing mode decoder for storing an operand to memory • Please click on the following link Programs\c08l07.gif to view the appropriate program.

  17. The addressing mode decoder for loading from memory • Please click on the following link Programs\c08l08.gif to view the appropriate program.

  18. The print subroutine and machine vectors

  19. Two common asynchronous interupts • Time outs • I/O completions

  20. A queue of process control blocks

  21. The state transition diagram for a job in an operating system

  22. Block diagram of a multiprocessing system

  23. The increase in performance by adding processors in a multiprocessing system

  24. Concurrent processes at two levels of abstraction

  25. The general form of critical section programs

  26. An attempt at programming mutual exclusion

  27. Another attempt at programming mutual exclusion

  28. Peterson’s algorithm for mutual exclusion

  29. The three operations on a semaphore • Init (s) • Wait (s) • Signal (s)

  30. The three operations on a semaphore (Cont’d)

  31. The state transition diagram for a job in an operating system that provides a semaphore

  32. Critical sections with semaphore

  33. A resource allocation graph with a deadlock cycle

  34. A resource allocation graph with a cycle but with no deadlock

  35. A resource allocation graph with no cycle and, therefore, no deadlock

More Related