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.
Consider a network message transfer among a source S and a destination D by 3 routers R1, R2 and R3 as given below:- S -------- R1 --------- R2 --------- R3 ---
Observing the existing system first hand This involves watching personnel using the existing system to find out precisely how it works. There are a number of disadvantages as
program on multiple queue
Q. Show Basic concepts of permutation? Let us look at the basic concepts of permutation with respect to interconnection network. Let us say the network has set of n input node
Reassembling of IP fragments at the ultimate destination is advantageous. Give reasons. Needing the ultimate destination to reassemble the fragments has two major advantages. F
Distinguish between uniform scaling differential scaling
Q. How can you insert text in dreamweaver? In Dreamweaver, you can type content directly into a layout cell, or you can cut and paste content from another document into a layou
What are the two levels in defining a Match Code? Match Code Object. Match Code Id.
The salient features of hyper threading are: i) Improved support for multi-threaded code, permitting multiple threads to run concurrently. ii) Response time and improved rea
Q.What is Canonical and Standard Forms? An algebraic expression can express in two forms: i) Sum of Products (SOP) for example (A . B¯) + (A¯ . B¯) ii) Produ
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