Essay: Great Ideas in Computer Architecture

Essay details:

  • Subject area(s): Information technology essays
  • Reading time: 3 minutes
  • Price: Free download
  • Published on: March 6, 2016
  • File format: Text
  • Number of pages: 2
  • Great Ideas in Computer Architecture
    0.0 rating based on 12,345 ratings
    Overall rating: 0 out of 5 based on 0 reviews.

Text preview of this essay:

This page of the essay has 851 words. Download the full version above.

Application of the following great ideas has accounted for much of the tremendous growth in computing capabilities over the past 50 years.They are
1. Design for Moore’s law
2. Use abstraction to simplify design
3. Make the common case fast
4. Performance via parallelism
5. Performance via pipelining
6. Performance via prediction
7. Hierarchy of memories
8. Dependability via redundancy
1. Design for Moore’s law
The one constant for computer designer is rapid change, which is driven largely by Moore’s Law.
It states that integrated circuit resources double every 18—24 months. Moore’s Law resulted from a prediction in 1965 of such growth in IC capacity made by Gordon Moore, one of the founders of Intel.
As computer designs can take years, the resources available per chip can easily double or quadruple between the start and finish of the project.
Like a skeet shooter, computer architects must anticipate where the technology will be and when the design finishes, rather than design from where it starts.
We use an “up and to the right” Moore’s Law graph to represent designing for rapid change.
2. Use abstraction to simplify design
Both computer architects and programmers had to invent techniques to make themselves more productive, as otherwise the design time would lengthen dramatically as resources grow as per by Moore’s Law.
A major productivity technique for hardware and software is to use abstractions to represent the design at different levels of representation; lower-level details are hidden to offer a simpler model at higher levels.
We’ll use the abstract painting icon to represent this second method.
3. Make the common case fast
Making the common case fast will tend to enhance performance better than optimizing the rare case.
Ironically, the common case is often simpler than the rare case and hence it is often easier to enhance.
This common sense advice implies that you know what the common case is, which is only possible with careful experimentation and measurement.
We use a sports car as the icon for making the common case fast, as the most common trip has one or two passengers and it’s surely easier to make a fast sports car than a fast mini van.
4. Performance via parallelism
Since the dawn of computing, computer architects have offered designs that get more performance by performing operations in parallel.
We’ll see many examples of parallelism in this subject.
We use multiple jet engines of a plane as our icon for parallel performance.
5. Performance via pipelining
In computers, a pipeline is the continuous and somewhat overlapped movement of instruction to the processor or in the arithmetic steps taken by the processor to perform an instruction. Pipelining is the use of a pipeline.
For example, before fire engines, a “bucket brigade” would respond to a fire, which many Cowboy movies show in response to a dastardly act by the villain.
Our pipeline icon is a sequence of pipes, with each section representing one stage of the pipeline.
6. Performance via prediction
Following the saying that it can be better to ask for forgiveness than to ask for permission, the next great idea is prediction.
In some cases it can be faster on average to guess and start working rather than wait until you know for sure, assuming that the mechanism to recover from a misprediction is not too expensive and your prediction is relatively accurate.
The fortune-teller’s crystal ball is an example for prediction icon.
7. Hierarchy of memories
Programmers want memory to be fast, large, and cheap, as memory speed often shapes performance, capacity limits the size of problems that can be solved, and the cost of memory today is often the majority of computer cost.
Architects have found that they can address these conflicting demands with a hierarchy of memories, with the fastest, smallest, and most expensive memory per bit at the top of the hierarchy and the slowest, largest, and cheapest per bit at the bottom.
Caches give the programmer the illusion that main memory is nearly as fast as the top of the hierarchy and nearly as big and cheap as the bottom of the hierarchy.
We use a layered triangle icon to represent the memory hierarchy.
The shape indicates speed, cost, and size. Which is closer to the top, faster and more expensive per bit of the memory and wider the base of the layer.
8. Dependability via redundancy
Computers not only need to be fast but also they need to be dependable.
Since any physical device can fail, we make systems dependable by including redundant components that can take over when a failure occurs and also to help detect failures.
We use the tractor-trailer as our icon, since the dual tyres on each side of its rear axels allow the truck to continue driving even when one tire fails. (Presumably, the truck driver heads immediately to a repair facility so the flat tire can be fixed, thereby restoring redundancy!)

About Essay Sauce

Essay Sauce is the free student essay website for college and university students. We've got thousands of real essay examples for you to use as inspiration for your own work, all free to access and download.

...(download the rest of the essay above)

About this essay:

This essay was submitted to us by a student in order to help you with your studies.

If you use part of this page in your own work, you need to provide a citation, as follows:

Essay Sauce, Great Ideas in Computer Architecture. Available from:<> [Accessed 25-05-20].

Review this essay:

Please note that the above text is only a preview of this essay.

Review Title
Review Content

Latest reviews: