Explain the os/2 operating system, Operating System

Assignment Help:

Explain the OS/2 Operating System

Like NetWare, OS/2 manage resources at three levels, as shown in Figure 4.5 Resources may be maintained at the session, process, and thread level. Session is the topmost level of the OS/2hierarchy and manages virtual devices such as screen, keyboard, and mouse. Most commonly, one application runs per session. The process contains the applications resources such a memory, semaphores, files, pipes,  and others. Processes may create child processes or threads.  Each process created contains one thread (the Main Thread) just as is the case with Windows NT. With OS/2, the only contextual data owned by a thread is a stack and a user-defined data area.

OS/2 allows the application developer to store per-thread information via the DosGetInfoBlocks( ) call. The DosGetInfoBlocks functional call returns a pointer to a Thread Information Block(TIB).In the TIB , a 4-byte user-defined field, is available to the programmer. As with NetWare, this field may be used as a pointer or an index to per-thread data items.

Is summery, application architects must evaluate each target operating system and its capabilities for variable scoping. Obvious design and architecture modifications may be required for each operating system port. If threads or thread scoping are not available to the application developer, an index into a client structure must be passed as a parameter to be used for thread scope data access. This index will need to be passed to each and every function in the thread accessing the data items on a per-client basis. Proper architecture of data item access may ease excessive recording during an application port. Indexes passed to functions, for example, may be used for every OS, whether thread scoping is available or not.


Related Discussions:- Explain the os/2 operating system

Explain about time sharing systems, Q. Explain about Time Sharing Systems? ...

Q. Explain about Time Sharing Systems? Time Sharing Systems Multi-programmed batched systems provide an environment where various system resources (for illustration CP

Write a note on deadlocks, Write a note on deadlocks. The proper defini...

Write a note on deadlocks. The proper definition of deadlock A set of processes is deadlocked if every process in the set is waiting for an event that only a proces

Action taken by the operating system when a page fault occur, Q. Under what...

Q. Under what conditions do page faults occur? Explain the actions taken by the operating system when a page fault occurs. Answer: A page fault take places when an access to

Discuss distributed file system caching, Problem: (a) Discuss Distribut...

Problem: (a) Discuss Distributed File System Caching. (Your discussion should include the goal and architecture of distributed file system caching and the various possible c

Explain the main functions of an operating system, Question: a) What sp...

Question: a) What special measures must be taken to ensure the reliability, availability, and security of electronic commerce and digital business process? b) What are the c

What the different paging techniques, The different paging techniques are ...

The different paging techniques are 1. Multilevel paging or hierarchical paging method: In definite cases the page table may consist up to 1 million entries. This would be

Define i/o and cpu bursts, Define I/O and CPU Bursts   Applications typ...

Define I/O and CPU Bursts   Applications typically to through cycle of CPU bursts and Input/output bursts. Since the CPU sits idle during I/O operations, efficiency is improved

How many cubic feet of storage space would require, Q. Presume that we agr...

Q. Presume that we agree that 1 kilobyte is 1,024 bytes 1 megabyte is 1,0242 bytes and 1 gigabyte is 1,0243 bytes. This progression carries on through terabytes, petabytes, and ex

What is banker''s algorithm, What is banker's algorithm? Banker's algor...

What is banker's algorithm? Banker's algorithm is a deadlock avoidance algorithm that is applicable to a resource-allocation system with multiple examples of each resource type

Disk scheduling algorithms-first come, FCFS (First Come, First Served) Per...

FCFS (First Come, First Served) Perform operations in order requested No reordering of work queue No starvation every demand is serviced Poor performance

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