




























































































Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
Lecture notes on Operating Systems for B.Tech II Year – I Sem (R18) (2019-2020) at Malla Reddy College of Engineering & Technology. It covers topics such as OS fundamentals, process and thread handling, memory management, and inter-process communication. The document also discusses the objectives of an OS, its functions, and types of systems such as multiprocessor and clustered systems.
Typology: Exercises
1 / 133
This page cannot be seen from the preview
Don't miss anything!
Recognized under 2(f) and 12 (B) of UGC ACT 1956 (Affiliated to JNTUH, Hyderabad, Approved by AICTE - Accredited by NBA & NAAC – ‘A’ Grade - ISO 9001:2015 Certified) Maisammaguda, Dhulapally (Post Via. Hakimpet), Secunderabad – 500100, Telangana State, India
II Year B. Tech CSE ‐ I Sem L T/P/D C 3 - /-/- 3 (R18A0504) OPERATING SYSTEMS OBJECTIVES: To learn the fundamentals of Operating Systems. To learn the mechanisms of OS to handle processes and threads and their communication To learn the mechanisms involved in memory management in contemporary OS To gain knowledge on distributed operating system concepts that includes architecture, Mutual exclusion algorithms, deadlock detection algorithms and agreement protocols To know the components and management aspects of concurrency management UNIT-I Introduction: Concept of Operating Systems, Generations of Operating systems, Types of Operating Systems, OS Services, System Calls, Structure of an OS - Layered, Monolithic, Microkernel Operating Systems, Concept of Virtual Machine. Case study on UNIX and WINDOWS Operating System. Processes: Definition, Process Relationship, Different states of a Process, Process State transitions, Process Control Block (PCB), Context switching Thread: Definition, Various states, Benefits of threads, Types of threads, Concept of Multithreads. UNIT-II Process Scheduling : Foundation and Scheduling objectives, Types of Schedulers, Scheduling criteria: CPU utilization, Throughput, Turnaround Time, Waiting Time, Response Time; Scheduling algorithms: Pre-emptive and Non pre-emptive, FCFS, SJF, RR; Multiprocessor scheduling: Real Time scheduling: RM and EDF. Inter-process Communication: Critical Section, Race Conditions, Mutual Exclusion,Hardware Solution, Strict Alternation, Peterson’s Solution, The Producer/Consumer Problem, Semaphores, Event Counters, Monitors, Message Passing, Classical IPC Problems: Reader’s & Writer Problem, Dinning Philosopher Problem etc. UNIT-III Memory Management: Basic concept, Logical and Physical address map, Memory allocation: Contiguous Memory allocation – Fixed and variable partition–Internal and External fragmentation and Compaction; Paging: Principle of operation – Page allocation – Hardware support for paging, protection and sharing, Disadvantages of paging. Virtual Memory : Basics of Virtual Memory – Hardware and control structures – Locality of reference, Page fault , Working Set , Dirty page/Dirty bit – Demand paging, Page Replacement algorithms: Optimal, First in First Out (FIFO), Second Chance (SC), Not recently used (NRU) and Least Recently used (LRU).
Introduction Operating System concepts 1 - 11 Types of Operating Systems 11 - 18 Operating services, System Calls 18 - 25 Structure of OS, Virtual machines 26 - 31 Process Concepts 32 - 34 Thread Concepts 34 - 38 II Process Scheduling Process Scheduling concepts 39 -^40 Pre-emptive and Non pre-emptive scheduling algorithms
Multiprocessor scheduling 48 - 49 Real time scheduling 49 - 52 Inter-process Communication Critical Section problem 52 - 57 Classical IPC Problems 57 - 65 III Memory Management^66 -^82 Virtual Memory 82 - 89 IV File System Management 90 - 105 I/O Hardware 105 - 110 V Deadlocks 111 - 119 Mass Storage Structure^120 -^129
Operating System Introduction: Operating Systems Objectives and functions, Computer System Architecture, OS Structure, OS Operations, Evolution of Operating Systems - Simple Batch, Multi programmed, time shared, Personal Computer, Parallel, Distributed Systems, Real-Time Systems, Special - Purpose Systems, Operating System services, user OS Interface, System Calls, Types of System Calls, System Programs, Operating System Design and Implementation, OS Structure, Virtual machines
Operating system performs the following functions:
Computer System Architecture Computer system can be divided into four components (^) H a r d w a r e – provides basic computing resources CPU, memory, I/O devices, (^) Oper at ing system Controls and coordinates use of hardware among various applications and users Application programs – define the ways in which the system resources are used to solve the computing problems of the users Word processors, compilers, web browsers, database systems, video games Users People, machines, other computers Four Components of a Computer System Computer architecture means construction/design of a computer. A computer system may be organized in different ways. Some computer systems have single processor and others have multiprocessors. So based on the processors used in computer systems, they are categorized into the following systems.
For example, different processors in the system can communicate with each other. Similarly, an I/O can be processed on any processor. However, I/O must be controlled to ensure that the data reaches the appropriate processor. Because all the processors share the same memory, so the input data given to the processors and their results must be separately controlled. Today all modern operating systems including Windows and Linux provide support for SMP. It must be noted that in the same computer system, the asymmetric multiprocessing and symmetric multiprocessing technique can be used through different operating systems. A Dual-Core Design
machine is running the application. The hot-standby host machine does nothing. It only monitors the active server. If the server fails, the hot-standby machine becomes the active server. (ii). Symmetric Clustered System: In symmetric clustered system, multiple hosts (machines) run the applications. They also monitor each other. This mode is more efficient than asymmetric system, because it uses all the available hardware. This mode is used only if more than one application be available to run. Operating System – Structure Operating System Structure Multiprogramming needed for efficiency Single user cannot keep CPU and I/O devices busy at all times Multiprogramming organizes jobs (code and data) so CPU always has one to Execute A subset of total jobs in system is kept in memory
Operating-system Operations
Personal-Computer Systems(PCs) A personal computer (PC) is a small, relatively inexpensive computer designed for an individual user. In price, personal computers range anywhere from a few hundred dollars to thousands of dollars. All are based on the microprocessor technology that enables manufacturers to put an entire CPU on one chip. At home, the most popular use for personal computers is for playing games. Businesses use personal computers for word processing, accounting, desktop publishing, and for running spreadsheet and database management applications.
Special purpose systems a) Real-Time EmbeddedSystems These devices are found everywhere, from car engines and manufacturing robots to DVDs and microwave ovens. They tend to have very specific tasks. They have little or no user interface, preferring to spend their time monitoring and managing hardware devices, such as automobile engines and robotic arms.