Suppose that there is a data structure which consists of N^2 elements. At the be

Question

Suppose that there is a data structure which consists of N^2 elements. At the beginning, each element in the data structure is initialized by a constant "x" (Figure 1). If we need to update the contents of the data structure as shown in the figure below (Figure 2) using a SIMD computer, answer the following questions: (a) What is the best achievable algorithm complexity? (b) How many processors are necessary to achieve the best algorithm complexity? (c) Describe how you got the solutions for the above two question.

Explanation / Answer

A. time complexity ,space complexity

B number of processors are to achieve the best algorithm complexity.P< N processors by letting each processor excuted multiple units of work

c set of rules to be followed in calculation or other problem solving operation especially by a computer is done by algorithm.

solving problem in a finite number of steps as for finding the greatest common divisor to algorithm

Related Questions

Navigate

• Browse (All)
• Browse S
• Subjects

---

---

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