Very long instruction word architecture, Computer Engineering

Assignment Help:

Superscalar architecture was designed to increase the speed of the scalar processor. But it has been realized it's not easy to apply. Subsequent are a number of problems faced in the superscalar architecture:

• It is needed that extra hardware should be given for hardware parallelism like decoder and arithmetic units, instruction registers etc.

• Scheduling of instructions dynamically to diminish the pipeline delays and to keep all processing units busy is very hard.

Another option to increase speed of processor is to use a series of instructions having no dependency and might need various resources so avoiding resource conflicts. The concept is to unite these independent instructions in a compact long word integrating many operations to be executed concurrently. So this architecture is known as "very long instruction word (VLIW) architecture". Actually long instruction expressions carry the opcode of various instructions that are dispatched to several functional units of the processor. In this manner all the operations to be implemented concurrently by the functional units are synchronized in a VLIW instruction. The size of VLIW instruction word may be in hundreds of bits. VLIW instructions should be formed by compacting small instruction words of conventional program. The job of compaction in VLIW is completed by compiler. The processor should have the enough resources to implement all the operations in VLIW word concurrently.


Related Discussions:- Very long instruction word architecture

Analysis of algorithms, Analysis of Algorithms For this task, each stu...

Analysis of Algorithms For this task, each student should do two things: An empirical analysis of the runtime and comparisons made for all algorithms as a function of input si

Rules for minimisation using k maps, 1) All squares containing a 1 must be ...

1) All squares containing a 1 must be grouped. 2) The largest possible groups must be formed. 3) Groups can overlap if this allows larger groups to be formed. 4) Groups mu

Existential introduction, Existential Introduction: Now if we have any...

Existential Introduction: Now if we have any sentence as, A, and variable, v, that does not occur in A, so then for any ground term, g, such occurs in A, than we can turn A in

How address resolution is performed with table lookup, How address resoluti...

How address resolution is performed with table lookup? Explain with the help of a suitable example. The approach of table lookup to address resolution needs a data structure wh

Solve the assignment of finite automata, Solve the assignment of NFA-- Fini...

Solve the assignment of NFA-- Finite Automata and Formal Language Project Description: I have an assignment on Finite Automata and Formal Languages ( Nondeterministic Fini

State a simple pull transaction, a. Explain the future of mobile commerce i...

a. Explain the future of mobile commerce in world? b. 'Push and Pull' are two ways of transferring information to and from a phone, through WAP. Now, with the help of diagram, s

Implication connective - modus ponens rule, Implication connective - Modus ...

Implication connective - Modus ponens rule: We notice that this is a trivial example, so it highlights how we use truth tables: as the first line is the only one when both abo

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