What are program-invisible registers, Computer Engineering

Assignment Help:

What are program-invisible registers?

Ans: the local and global descriptor tables are found in the memory system. To access and specify the address of these tables, program invisible registers used. Program invisible registers aren't directly addressed by software so they are given a name. GDTR (global descriptor table register) and IDTR (interrupt descriptor table register) comprises the base addresses of descriptor table and its limit. Limit of each descriptor table is 16 bits as maximum table length is 64 Kbytes. When protected mode operation is desired, address of the global descriptor table and its limit are loaded into GDTR.

 


Related Discussions:- What are program-invisible registers

Describe method overloading, Method overloading is to overload methods usin...

Method overloading is to overload methods using similar class name by writing different parameters. This is known as Method Overloading.

What is compact disk rom, Q. What is Compact Disk ROM? Both audio CD an...

Q. What is Compact Disk ROM? Both audio CD and CD-ROM (compact disk read-only memory) share similar technology. Main difference is that CD-ROM players are more rugged and have

Version control systems, The next major set of tasks to tackle are delete a...

The next major set of tasks to tackle are delete and update. Version control systems typically version updates to a ?le and only store the differences between the ?les. Two system

Explain one two motion selector per subscriber, What is 1 00 line exchang...

What is 1 00 line exchange with one two-motion selector per subscriber. Design: In, Strowger switching system is designed by using one two-motion selector for all subscrib

Explain dynamic server creation briefly, Explain dynamic server creation br...

Explain dynamic server creation briefly. Dynamic Server Creation: If only one server handles one request at a time, each client should wait while the server fulfils the on

Depth-first search is different from breadth-first search, Depth-first sear...

Depth-first search is different from Breadth-first search in the following ways: A depth search traversal method goes to the deepest level of the tree first and then works up w

Gustafsons law, Amdahl's law is suitable for applications where response ti...

Amdahl's law is suitable for applications where response time is critical. On the other hand, there are a lot of applications which need that accuracy of the resultant output shoul

Show select tag and pull down lists, The next type of input is a Pull Down ...

The next type of input is a Pull Down List. With this type you have to employ in place of and it also has a closing tag. This control is used when we have a

What is glitch and what are causes of it, What is glitch? What causes this ...

What is glitch? What causes this (describe with waveform)? How to overcome this? The gated clock‘s corresponding timing diagram demonstrates that it implementation can lead to

Define the don''t care states - simplifying k maps, Define the Don't Care S...

Define the Don't Care States - Simplifying K Maps? The Truth table specifications for a logic function may not to include all possible combinations of the input binary digits for

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