Code density and smaller faster programs, Computer Engineering

Assignment Help:

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.


Related Discussions:- Code density and smaller faster programs

Explain asymmetric cryptographyand its components, Explain Asymmetric crypt...

Explain Asymmetric cryptographyand its components. Asymmetric or public-key cryptography be different from conventional cryptography in which key material is bound to a single

Functions in first-order logic sentences, Functions in first-order logic se...

Functions in first-order logic sentences - artificial intelligence: Functions may be thought of as special predicates, where we think of all but 1 of the arguments as input and

Networking, Nyquist''s sampling theorem says "if you have a signal that is ...

Nyquist''s sampling theorem says "if you have a signal that is perfectly band limited to a bandwidth of f0 then you can collect all the information there is in that signal by sampl

Explain about RISC pipelining, Q. Explain about RISC PIPELINING? Instru...

Q. Explain about RISC PIPELINING? Instruction pipelining is frequently used to increase performance. Let's consider this in context of RISC architecture. In case of RISC machin

What is automated information system, What is automated information system ...

What is automated information system Using this automated information system affords below benefits to the company and customers: -  System can be linked into websites to g

#project, how to build PVR set-top box using raspberry

how to build PVR set-top box using raspberry

Design a nand-to-and gate network, Use as few gates as possible, design a N...

Use as few gates as possible, design a NAND-to-AND gate network that realize the following Boolean algebra expression. A'BC'D + ABC'D' + A'B'CD' + AB'C'D'

Search-based tools, The search-based tools initially identify the problem a...

The search-based tools initially identify the problem and after that appropriately give advice on how to correct it. AT Expert from Cray Research is one of the tools being used

Explain high level data link control, Explain High Level Data Link Control....

Explain High Level Data Link Control. HDLC - it is High Level Data Link Control: Protocol Overall explanation: Layer 2 of the OSI model is the data link layer. One of the

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