Suppose a Program Segment Consists of a Purely Sequential Part

question 2

Essay

Suppose a program segment consists of a purely sequential part which takes 25 cycles to execute, and an iterated loop which takes 100 cycles per iteration. Assume the loop iterations are independent, and cannot be further parallelized. If the loop is to be executed 100 times, what is the maximum speedup possible using an infinite number of processors (compared to a single processor)?

---

Definitions:

Janitorial Department

A division within an organization dedicated to the maintenance and cleaning of buildings and facilities.

Allocated Based on Space

The distribution of resources or costs among departments or projects according to the physical area they occupy or require.

Personnel Department Cost

Expenses related to the operation of a human resources department, including salaries, training, and benefits administration.

Step-Down Method

An accounting method used to allocate the costs of service departments to producing departments and other service departments in a sequence.