Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Q. Code Density and Smaller Faster Programs?
Memory was very expensive in older computer. So there was a need of less memory utilization, which is it was cost effective to have smaller compact programs. So it was opined that instruction set must be more complex so that programs are smaller. But increased complexity of instruction sets had resulted ininstruction sets and addressing modes needing more bits to represent them. It is said that code compaction is significanthowever cost of 10 percent more memory is often far less than cost of reducing code by 10 percent out of CPU architecture innovations.
Smaller programs are beneficialsince they need smaller RAM space. Though today memory is very cheap and this potential benefit today isn't so compelling. More significant small programs must enhance performance. How? Fewer instructions mean fewer instruction bytes to be fetched.
Though problem with this reasoning is that it isn't certain that a CISC program will be smaller than corresponding RISC program. In several cases CISC program represented in symbolic machine language may be smaller however the number of bits of machine code program might not be noticeably smaller. This might result from reason that in RISC we employ register addressing and less instruction that require fewer bits in general. Additionally the compilers on CISCs frequently favour simpler instructions so that conciseness of complex instruction rarely comes into play.
It speeds execution of distributed applications. It runs on dissimilar platforms. It time independent. No loss for msg delivery i.e. guarantee delivery.
1. What factors should be considered when selecting a digital encoder (line codes)? Briefly mention five of those factors. Use sketches and additional text to describe the followin
What is a Multiplexer Tree? Ans Multiplexer Tree: The largest available MUX IC is 16 to 1. Meeting the larger input requires there must be a provision to expand this. It
how to breadboARD THE 4 BIT COMPARATOR
Hardware Support for paging
Explain pointers We can have a pointer pointing to a structure just the same way a pointer pointing to an int, such pointers are called as structure pointers
a program to find the area under the curve y = f(x) between x = a and x = b, integrate y = f(x) between the limits of a and b. The area under a curve between two points can be foun
State the advantages of Bespoke Software - specifically designed for application and hence more efficient and will only contain the features wanted; as it will be devoid of
Acting Rationally: "Al" Capone was finally convicted for tax evasion. Were the police reacting on rationally?? To solve this puzzle, we must first look at how the performance
The year is 2199. For many generations, the robotic Cyleth have faithfully served humanity. However, under the direction of the computerized superintelligence Skyweb, they have tur
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd