Explain segmentation hardware?, Operating System

Assignment Help:

Explain segmentation hardware?

We define an completion to map two-dimensional user-defined addresses into one-dimensional physical addresses. This mapping is affected by means of segment table. Every entry in the segment table has a segment base and a segment limit. The segment base holds the starting address where the segment resides in memory, where the segment limit specifies the length of the segment.

A logical address consists of two parts that are a segment number's, and an offset into that segment d. The segment number is utilized as an index to the table. The offset d of the logical address should be between 0 and the segment limit. The segment table is fundamentally an array of base-limit register pairs.

 


Related Discussions:- Explain segmentation hardware?

Explain about deadlocks, Q. Explain about Deadlocks? Deadlocks for (...

Q. Explain about Deadlocks? Deadlocks for (int i = 0; i // first find a thread that can finish for (int j = 0; j if (!finish[j]) { boolean temp = true; for

Explain what type of group scope you will use, Question: (a) The actual...

Question: (a) The actual use and scope groups depend on the mode in which a domain is running. There are two domain modes in which you can run a Windows 2000 domain. List and d

Explain the architecting for processes, Explain the Architecting For Proces...

Explain the Architecting For Processes Processes are very important to the server application developer, as they may be used to increase responsiveness, deduction time, and tur

Deadlock resoloution technique, justify the role played by the operating sy...

justify the role played by the operating system in managing the process to avoid deadlock

necessary conditions for a deadlock , Q) a. Given that the first three nec...

Q) a. Given that the first three necessary conditions for a deadlock are in place, comment on the feasibility of the following strategy. All processes are given  unique priorities.

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

Describe the possible rmi invocation semantics, Question: (a) Briefly d...

Question: (a) Briefly discuss and describe the possible RMI invocation semantics. (b) (i) What is data marshaling? (ii) Explain the role of a remote object reference dur

Explain chaining to handle collision, Explain Chaining to Handle Collision ...

Explain Chaining to Handle Collision Chaining:  One easy scheme is to chain all collisions in lists attached to the suitable slot. This permits an unlimited number of collision

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