Mathematics Questions (Need No Plagurism)
CISC 600 Scientific Computing - Homework 5
Please format your document name: LastName_Homework5
Submission Deadline: Oct. 30th, 2018
Points: 100
Requirement This is an individual assignment that covers the content of Chapter 8 and Chapter 9. Please
answer following questions. Some of questions are open questions. Please provide your insights
and each response is up to 1000 words.
1. What is a Mathematical Programming problem? Please give an example (10 points)
2. How to distinguish local optimal and global optimal? (10 points)
3. Please illustrate Golden-Section search with an example. (20 points)
4. Please illustrate Parabolic Interpolation? (10 points)
5. Given the below program M, please draw the corresponding DFG (data flow graph). (20 points)
D[0]=20; D[-1]=30;
For (i= 1 to N)
{ A[i]=D[i-2]+1011;
B[i]=A[i]*2;
C[i]=A[i]-1107;
D[i]=A[i]+8
E[i]=B[i]+C[i]+D[i];
}
6. If we have five processors P1, P2, P3, P4, and P5 available, run program M above 1000 times,
(1) How much is the total execution cycles without retiming? (10 points) (2) Using retiming, what is the minimum total execution time we can achieve? (10 points) (3) Please draw the schedule maps step by step to explain. (10 points)