Assume that a computation comprises k + 1 distinct tasks. In order to prepare a program for the desired computation, each of these tasks has been written as a function in the C language. The k + 1 functions are labeled T0(), T1(),..., Tk(). Each function requires τ time units to execute. Due to data dependencies, functions T1() to Tk() must be executed after function T0(). There are no data dependencies among the functions T1() to Tk().
(a) Using the given functions, write a C program that executes on a single processor.
(b) Write an equivalent C program that executes on k processors.
(c) Derive an expression for the ideal speedup for the program in part (b) relative to the program in part (a).