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 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 fifo page replacement in detail, FIFO page replacement This is...

FIFO page replacement This is the easiest page replacement algorithm. Here the 1 st page toward the inside is the 1 st to leave that is the oldest page leaves. To execute th

Diehard allocator - custom allocators, Allocators can also be used to avoid...

Allocators can also be used to avoid problems with unsafe languages. C and C++ are pervasive, with huge amounts of existing code. They are also memory-unsafe languages, in that the

#title. operation research, What are the features of Operation Research app...

What are the features of Operation Research approach?

Define the dosexecpgm function used in the os/2, Define the DosExecPgm Func...

Define the DosExecPgm Functions used in the OS/2 DosExecPgm (objBuffer, objLen, flags, cmdLine, env, &resultCode, execName) DosExecPgm function is designed to load an execut

Gang scheduling , Gang Scheduling : A set of related process is scheduled ...

Gang Scheduling : A set of related process is scheduled to execute on a set of processors at the similar time, on a 1-to-1 basis. Closely related processes or threads may be sched

Rf, whta is an operating system ? what sorts services are provided by an op...

whta is an operating system ? what sorts services are provided by an operating system ?

Explain process states in the unix system, Process States A total of n...

Process States A total of nine states are acknowledged by the UNIX system. They are like as follow: User running                                                   Executing

State critical section problem, State critical section problem? Discuss thr...

State critical section problem? Discuss three solutions to solve the critical section problem. C-S Problem:- n processes all competing to use some shared data Every

Define lru page replacement algorithm, Define LRU Page Replacement Algorith...

Define LRU Page Replacement Algorithm LRU policy: LRU expands to least currently use. This policy suggests which we re- move a page whose last usage is farthest from current ti

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