It can interpret the theory of computer architecture at several levels of rising abstraction. At each level, the architecture will be represented by declaring the underlying computational model, the functional specification, and the actual implementation. Therefore, the interpretation covers three elements including the underlying computational model, the level of consideration, ... Read More

Von Neumann’s model is composed of three specific components (or sub-systems) including a central processing unit (CPU), memory, and input/output (I/O) interfaces. The figure defines one of the various possible methods of interconnecting these components.CPU − CPU can be regarded as the soul of the computing system, includes three main ... Read More

There are six basic computational models such as Turing, von Neumann, dataflow, applicative, object-based, predicate logic-based, etc. These models are known as basic models because they can be declared using a basic set of abstractions.A hierarchy of subclasses can be defined for each of the basic models to any extent ... Read More

The theory of a computational model is a higher-level abstraction than the approach of programming language and computer architecture.A programming language can be speculation as a specification device making applicable the system of a computational task whereby a specific computational model is pretended.Computer architecture can be considered upon as a ... Read More

The implementation of global instruction scheduling is a technique called trace scheduling. Trace scheduling was first employed in the Bulldog compiler, developed for the experimental VLIW machine ELI-512 at Yale (Fisher et al, 1984), and subsequently in the Trace scheduling compiler of the commercial TRACE family of VLIW machines (Colwell ... Read More

ILP-compilers have to extract acceptable instruction-level parallelism to make use of available hardware resources properly, specifically EUs. This is not a simple task for extremely parallel ILP-processors, including VLIW machines or highly superscalar processors. In specific, general-purpose programs, including operating systems or application programs, with their small fundamental block sizes ... Read More

Software pipelining is a compile-time scheduling technique that overlaps consecutive loop iterations to disclose operation-level parallelism. A necessary issue with the development of adequate software pipelining algorithms is how to deal with loops with conditional branches.Conditional branches raise the complexity and reduce the performance of software pipelining algorithms by presenting ... Read More

Software pipelining is a compile-time scheduling technique that overlaps subsequent loop iterations to disclose operation-level parallelism. A necessary issue with the development of adequate software pipelining algorithms is how to deal with loops with conditional branches. Conditional branches raise the complexity and reduce the performance of software pipelining algorithms by ... Read More

Loops are an important source of parallelism for ILP-processors. Therefore, the regularity of the control structure can speed up computation. Loop scheduling is a central point of instruction schedulers that have been advanced for highly parallel ILP-processors, including VLIWs.Types of Loop SchedulingThere are two different types of loop scheduling are ... Read More

Basic block scheduling is the clean but least effective code scheduling technique. Therefore, only instructions inside a basic block are acceptable for reordering. As a result, the feasible speed-up is definite by both true data and control dependencies. Basic block schedulers are typically used for slightly and moderately parallel ILP-Processors, ... Read More