Essential properties of operating system, Operating System

Assignment Help:

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.


Related Discussions:- Essential properties of operating system

Write about critical regions and monitors, Write about critical regions and...

Write about critical regions and monitors. Critical region definition Monitor definition Implementation of the conditional-region construct Syntax of monitor Monito

Explain file allocation using i nodes, File allocation using I nodes. T...

File allocation using I nodes. This method is used to decrease the size of the table in the above method. Every file will have an I-node list. Allow a file have 15 pointers a

Explain about demand paging, Explain about demand paging? A demand pagi...

Explain about demand paging? A demand paging system is same to a paging system with swapping. Processes reside on secondary memory. When we require executing a process, we chan

LINUX, what is exit status

what is exit status

Why is rotational optimization no longer consequently useful, UNIX systems ...

UNIX systems utilized to use disk-layout optimizations based on the rotation position of disk data however modern implementations including Linux simply optimize for sequential dat

Deadlock prevention-resource allocation graph allocation, Explain Deadlock ...

Explain Deadlock Prevention-Resource allocation graph allocation Resource allocation graph algorithm :  Using this algorithm we are able to actually know if there exists in th

Explain banker''s algorithm, Banker's Algorithm In this analogy ...

Banker's Algorithm In this analogy Customers ≡ processes Units ≡ resources, say, tape drive Ba

Socket, socket based fortune teller sever.your program should create a serv...

socket based fortune teller sever.your program should create a server that listens to a specific port when a client receives a connection the server should respond with a random fo

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

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!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd