1. Chapter 8

2. Vector is a ordered set of scalar data items, all of same type ,stored in memory. Usuallly the vector elements are ordered to have a fixed addressing increment or decrement between successive elements called stride.

3. Vector instruction types

4. Vector –Vector instruction
Vector –Scalar instruction
Vector –memory instruction
Vector reduction instruction
Gather and scatter instructions
Masking instructions

5. Gather ,Scatter and Masking

6. C Access method of memory organization

7. S Access memory organization
Fetch Cycle
Access Cycle
Module 0 M U X
(n-a) High-order
address bits
Single word
Access
Module 1 a
Module m-1
Low-order Address Bits
Data Latch
Read/Write
12:45:15 08:43:19

9. Timing diagram for S- access configuration
Mm-1
Fetch1
Fetch2
Fetch3
Access1
Access2 M1
Fetch1
Fetch2
Fetch3
Access1
Access2 M0
Fetch1
Fetch2
Fetch3
Access1
Access2
m words
m words
Cycle1
Cycle2
Cycle3

10. C/S Access Memory Organization
It is a combination of S access and C access schemes.
The modules are organized in a two-dimensional array.
Application: Multiple pipeline processors.

11. Compound vector operations

13. Vector loops and chaining
Vector loop /Strip-mining :- When a vector has a length greater than that of the vector registers, segmentation of the long vector into a fixed length segment is necessary .This techniques is called strip mining .
A program construct for processing long vector is called vector loop.
Functional unit independence

16. Implementation models