Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Essential Properties of Operating System
1. Batch: Jobs with similar needs are batched together and run through the computer as a group by an operator or automatic job sequencer. Performance is increased by trying to keep I/O devices and CPU busy at all times through buffering, off line operation, spooling and multiprogramming. A Batch system is decent for executing large jobs which need little interaction, it can be submitted as well as picked up latter.
2. Time sharing: Uses CPU s scheduling and multiprogramming to provide economical interactive use of a system. CPU switches rapidly from one user to another it implies that CPU is shared between some interactive users. Rather than having a job defined by spooled card images, every program reads its subsequent control instructions from the terminal and output is typically printed immediately on the screen.
3. Interactive: User is on line with computer system and interacts with it by an interface. It is normally composed of many short transactions where result of the subsequent transaction may be unpredictable. Response time needs to be short because the user submits and waits for result.
4. Real time system: Real time systems are generally dedicated, embedded systems. They normally read from and react to sensor data. System should guarantee response to events within fixed periods of time to make sure correct performance.
5. Distributed: Distributes computation among several physical processors. The processors don't share memory or a clock. Instead each processor has its own local memory. They communicate with each other through various communication lines.
Under what circumstances would a user be better off using a time-sharing system, rather than a personal computer or single-user workstation? When there are some other users, th
Explain Wait for Graph a. Use a resource allocation graph to derive a wait-for graph. b. Wait-for graph acquired by making an edge from p 1 to p 2 iff p 1 is waiting for
For example, by initializing a semaphore to 0, threads can wait for an event to occur, and impose an ordering constraint, similar to a monitor using condition variables, but with m
Example 1. The diagram illustrating the data structures of in-memory VFS objects and on-disk objects and their relationships on slide 24 of the lecture notes OSD.4. This diagram i
Acyclic Graph Directories In this kind of directory structure the shared directories or files can exist in the file system in two or more places at once. A tree structure excl
Hashed page table method A general approach for managing address spaces larger than 32 bits is to use a hashed page table with the hash values being the virtual-page number.
Evicting the most-recently used (MRU) page does very well on LRU's worst case. In general, however, MRU is a bad idea, since many programs exhibit temporal locality in their memory
Processes- Making the System More Responsive and Useful A method by definition build up of a code execution and resource ownership. A process has two main characteristics, code
Explain thread in details
Q. Explain about Input - Output System Management? I/O System Management The module which keeps track of the status of devices is known as I/O traffic controller. Every
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd