Lovely

Professional
University

TERM PAPER
ADVANCE COMPUTER
ARCHITECTURE

Submitted To: - Submitted By:-

Mr. Sumit Mittu Sahil Gupta
LECTURER B.TECH-M.TECH
LPU RG17M1B49
ACKNOWLEGLEMENT

There are a lot many people to whom I owe my heartiest thanks for their valuable
help, advice and suggestions during compilation of my term paper.

It was quite interesting and challenging working on my term paper. The difficulties I
came across during this report were made easy and solvable by those who guided me.

With deep gratitude I would like to acknowledge the guidance and encouragement
given to me by my teacher and guide Mr. Sumit Mittu. His guidance has been
inspiring and ever encouraging. His encouragement has been there with us at every
step that we have taken to fulfill the present work.

SAHIL GUPTA
INTRODUCTION

The processors in the system are linked to a memory which is globally available with
a hardware or software means. The memory coherence is maintained by operating
system usually.

The shared memory model is efficiently understood than the distributed memory
model if we compare the two from a programmer’s thought. All the memory
coherence is taken care of by the operating system and is not at all taken care by the
written program which is quite advantageous. But on the contrary the drawbacks are
that beyond thirty-two processors the scalability is difficult, and of course there is
lesser flexibility in shared memory model than the distributed memory model.

The distinctive feature of shared memory systems is that no matter about the number
of memory blocks are used in them and number of memory blocks connections to the
processors and address spaces of these memory blocks are unified into a global
address space which is completely visible to all processors of the shared memory
system. If we issue a certain memory address by any processor it will have an access
to the same memory block location. According to the physical organization of the
logically shared memory, there are two main types of shared memory system that
could be distinguished as physically and distributed shared memory systems.

If we consider an eg. of shared memory (multiprocessors): UMA (Uniform Memory

Access), COMA (Cached Only Memory Access) and NUMA (Non-Uniform Memory
Access).

MIMD MACHINES

There is the execution of several instruction streams in parallel on different nature of

data. The difference with the multi-processor SISD machines is this that the
instructions and data are in relation due to the reason that they represent different parts
of the same task that is to be executed. So, there may be many sub-tasks that may be
running in MIMD systems in parallel just to lessen the time to solution for main task
execution. There is a large variety of MIMD systems and chiefly in this class the
Flynn taxonomy proves to be not at all fully appropriate for the systems classification.
The systems like a four-processor NEC SX-6 and a thousand processor IBM p690
show a very different behaviour and both fall in this class.
SHARED MEMORY SYSTEMS

The same address space is shared by all the CPUs in the shared memory systems. The
user is not at all concerned about where the data is stored because there is single
accessibility to all the CPUs equally. Shared memory systems can be both SIMD and
MIMD. Single-CPU vector processors are an example of SIMD, while the multi-CPU
models of these machines are MIMD. The two subclasses sometimes can be referred
to as SM-SIMD and SM-MIMD.

ADVANTAGES

1.No need to partition data or program, uniprocessor programming techniques can be

adapted.

2.There is an efficient communication between processor.

DISADVANTAGES

1.Synchronization in accessibility to share data in the memory is needed.

Synchronizing constructs like conditional critical regions, semaphores, monitors result
in non-deterministic behavior which can lead programming errors that are difficult to
discover.

2.Lack of scalability due to The memory contention problem causes lack of

scalability.