CMPS 4883 – Parallel Algorithms – Chapter 1 Vocabulary
Due:
For each term, write a clear and complete definition. DO NOT cut-and-paste from any online or print source.
All work MUST be written in your own words! All discussions must be in the context of this course – parallel
algorithms & processing. Must be typewritten. Single spacing, ½ inch margins, font size 12 or 14. May print
on both sides of paper.
[Intro., Sect 1.1] – Due
1. Multicore processor
2. Patterns
3. Vector processing
4. Efficiency
5. Scalable
6. Bottleneck
7. Overhead
8. Serialization
9. Deterministic
10. Serial trap
[Sect. 1.2] Due
1. Complexity (of an algorithm)
2. Span (of an algorithm)
3. Critical path
4. Shared memory
5. Locality
6. Amdahl’s Law
7. Reduction
8. Broadcast
9. Load balancing
10. Granularity
[Sect 1.3] Due
1. Moore’s Law
2. Clock rate
3. Instruction Level Parallelism
4. Superscalar
5. Pipelining
6. Latency
7. Bandwidth
8. Throughput
9. Benchmark
10. Serial Trap