Parallel architecture Flashcards

1
Q

Moore’s Law

A

Empirical observation that the number of transistors on a chip doubles every 18 to 24 months

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Parallelism by Pipelining

A

Processor works on different steps of instructions at the same time.
Output of one step is input for the next
I

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What is MISD

A

Multiple Input, Single Data: There are multiple processing elements each of which has a private program memory, but there is only one common acces to a single global data memory. In each step, each processing element obtains the same data element from the data memory and loads an instruction from its private program memory.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

what is SISD

A

Single Instruction, Single Data: There is one processing element which has acces to a single program and data storage. In each step the processing element loads an instruction and the corresponding data and executes the instruction. The result is stored back in the data storage. Von Neumann architecture

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

degree of parallelism

A

The number of pipeline stages

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What is SIMD

A

Single Instruction, Multiple Data: There are multiple processing elements each of which has a private acces to a (shared or distributed) data memory. In each step, each processing element obtains from the control processor and the same instruction and loads a separate data element through its private data access on which the instruction is performed

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What is MIMD

A

Multiltple Instruction, Multiple Data: There are multiple processing elements each of which has a separate instruction and data access to a (shared or distributed) program and data memory. In each step, each processing element loads a separate instruction and a separate data element, applies the instruction to the data element, and stores a possible result back into the data storage.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

CPU

A

Central Processing unit:
- Fetsch, decode, execute program instructions; fetch data, store results

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Graphics controller

A

Render display images to minotors

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

GPU

A

Graphiscs Processing unit:
-perform complex graphics operations
- can also be used for other tasks

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

CPU vs GPU

A

CPU:
-has several cores
GPU
-has thousands of cores
-SIMD architecture
-especially suitable for parallel proccesing

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What is DMM

A

distributed memory machines. Consist of a number of nodes. Program data are stored in local memory of one or several nodes. All local memory is private and only the local proccesor can acces the local memory directly. When a proccesor need data from the local memory of other nodes to perform local computations, message passing has to be performed via the interconnection network.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What is a node

A

A node is an independent unit, consisting of processor and local memory

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Point-to-point connections

A

A node is connected to a fixed set of other nodes by physical connection. moslty seen in older multicomputers

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

DMA controller

A

direct memory acces to the nodes to control the data transfer between local memory and the I/O controller. Has interconnection network to which nodes can issue a send operation and then continue local operations while the DMA controller executes the send operation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What is SMM

A

Shared Memory Organization, also called globabl memory. Consists of a number of processors or cores, a shared physicall memory and an interconnection newtork to connect the processors with the memory

14
Q

What is a Cache

A

A cache is a small, but fast memory between the processor and main memory. A cache can be used to store data that is often accessed by the processor, thus avoiding expensive main memory acces. The data stored in a cache are always a subset of the data in the main memory.
several level of caches typically used, starting from small and and expensive level 1 cache (L1) over several stages (L2,L3) to the large but slow main memory.

15
Q

What is the diameter of a network

A

The maximum distance between any pair of nodes. Small diameter is desirable to ensure small distances for message tranmission

16
Q

What is the node degree of a network

A

is the maximum degree of a node of the network. The degree of a node n is the number of direct neighbor nodes of n. A small node degree is desirable to reduce the hardware overhead for the nodes

17
Q

What is bisection bandwidth of a network

A

Bisection bandwidith is the minimum number of edges that bust be removed to partition the network into two parts of equal size without any connection between the two parts. for uneven total nodes the size of the parts may differ by 1. A large bisection bandwidth is desirable to obtain large data throughputs

18
Q

What is node and edge connectivity of a network

A

The number of nodes or edges that must fail to disconnect the network. High connectivity value indicates a high reliability of the network.

19
Q

What is DRAM

A

Dynamic Random Access Memory, which the main memory is contructed by.

20
Q

what is SRAM

A

Static Random Acces Memory, which caches are made from.

21
Q

What happens during a cache hit and cache miss

A

After having received a memory acces request from the processor the cachce controller checks wether the memory adress specified belongs to the cache line which is currently sored in the cache. If this is the case a cache hit occurs, and the requested word is deliver to the processor from the cache. If cache line is note sore in cache a cache miss occurs. And the cache line is first copied from main memory into the cache before the requested word is deliver to the processor. The corresponding delay time is called “miss penalty”