Please provide a discussion in a MS WORD Pipelining can overlap the execution of

Question

Please provide a discussion in a MS WORD

Pipelining can overlap the execution of instructions when they are independent of one another. This potential overlap among instructions is called instruction-level parallelism (ILP) since the instructions can be evaluated in parallel. The amount of parallelism available within a basic block is quite small. The average dynamic branch frequency in integer programs was measured to be about fifteen percent, meaning that about seven instructions execute between a pair of branches. Since the instructions are likely to depend upon one another, the amount of overlap we can exploit within a basic block is likely to be very small. To obtain substantial performance enhancements, we must exploit ILP across multiple basic blocks.

The ILP scheduling we covered in this module can be done manually by people for small programs (with only tens of instructions). However in practical applications, we have programs that consist of hundreds of lines of code. Discuss your perspective on how ILP scheduling can be done in these situations. Is there a possibility that this process can be done automatically by the processor itself?

Research this topic and give your findings and opinion.

Explanation / Answer

Expalnation:

In this paper, we present a formal analysis of the constraints of the scheduling problem, and evaluate the structure of the scheduling polytope described by those constraints. Polyhedral theory and duality theory are used to demonstrate that efficient solutions of the scheduling problem can be expected from a carefully formulated integer linear program (ILP). Furthermore, we present an algorithm to lower bound the resource requirement of the time-constrained scheduling problem that enables us to solve the ILP more efficiently. 1 Introduction The scheduling problem in high-level synthesis is concerned with sequencing the operators of a control/data flow graph (cdfg) in correct order. This optimization problem, is specified in two ways: (1) resourceconstrained scheduling (RCS) minimizes the number of control steps when the number of FU's are fixed; (2) time-constrained scheduling (TCS) minimizes the number of resources when the number of control steps is fixed.

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.