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

Define race condition, Define race condition. When various process acce...

Define race condition. When various process access and manipulate similar data concurrently, then the outcome of the execution depends on certain order in which the access take

How can the deadlock be prevented-bankers algorithm, How can the deadlock b...

How can the deadlock be prevented Bankers algorithm : The Resource allocation graph algorithm isn't applicable to a resource allocation system with multiple instances of every

What is a general graph, What is a general graph? A tree structure wher...

What is a general graph? A tree structure where links can go from one branch to a node earlier in the similar branch or other branch, allowing cycles.

Explain about disk scheduling with neat diagram, Explain about disk schedul...

Explain about disk scheduling with neat diagram? FCFS Scheduling SCAN scheduling C-SCAN scheduling SSTF scheduling LOOK Scheduling

Explai basic concepts of demand paging, Basic concepts When a process i...

Basic concepts When a process is to be changed in, the pager guesses which pages will be used before the process is changed out again. Instead of swapping in a entire process,

What are the different files attributes?, What are the different files attr...

What are the different files attributes? File name:-it's the name of the file. It's the name with which the user identifies. Identifiers:-it's created when a file is created

Bag of tasks, The producer-consumermodel above has a standard human analogy...

The producer-consumermodel above has a standard human analogy of an assembly line. Humans have specialized skills, however, whereas threads running the same program do not need to

Describe two segment-replacement algorithms, Q. Segmentation is alike to p...

Q. Segmentation is alike to paging but uses variable-sized "pages". Describe two segment-replacement algorithms based on FIFO and LRU page replacement schemes. Remember that since

Multiprogramming, explain how response time are reduced by allowing time sh...

explain how response time are reduced by allowing time sharing on top of multiprogramming

Single-level page tables, As mentioned above, page tables, are lookup table...

As mentioned above, page tables, are lookup tables mapping a process' virtual pages to physical pages in RAM. How would one implement these page tables? The most straightforward

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