Explores processor arrays, multiprocessors (shared memory), and multicomputers (distributed memory). Part 2: Practical Implementation Programming Languages (Ch 4): Surveys languages like Fortran 90, C*, Linda, and OCCAM. Mapping and Scheduling (Ch 5):
┌───────────────────────────────┐ │ Flynn's Taxonomy │ └───────────────┬───────────────┘ │ ┌────────────────┴────────────────┐ ▼ ▼ ┌─────────────────────┐ ┌─────────────────────┐ │ Single Instruction │ │ Multiple Instruction│ └──────────┬──────────┘ └──────────┬──────────┘ │ │ ┌───────┴───────┐ ┌───────┴───────┐ ▼ ▼ ▼ ▼ ┌─────┐ ┌─────┐ ┌─────┐ ┌─────┐ │ SISD│ │ SIMD│ │ MISD│ │ MIMD│ └─────┘ └─────┘ └─────┘ └─────┘ Flynn's Taxonomy Parallel Computing Theory And Practice Michael J Quinn Pdf
Quinn explicitly separates the theoretical abstractions used to design algorithms from the actual hardware configurations used to deploy them. This separation ensures that algorithms retain academic utility even as underlying physical hardware evolves. The PRAM Model Explores processor arrays
To solidify these concepts, the text applies theory and hardware architectural designs to fundamental computing challenges: Transitioning from the standard multiprocessors (shared memory)