Q1. Describe the Gustafson’s law for scaled problems.
Q2. describe the sequential consistency models in short.
Q3. The labels in d-dimensional hypercube use d bits. Fixing any k of these bits, illustrate that the nodes whose labels distinct in the remaining d-k bit positions form a (d-k)-dimensional sub-cube composed of 2^{(d-k)} nodes.
Q4. What do you mean by the terms regular and non-regular interconnection networks? Describe with illustrations.
Q5. Illustrate the radius and diameter of a network? Describe giving appropriate illustrations.
Q6. describe the weak consistency models in short.
Q7. State the Speedup and efficiency of the parallel machine.