Difference between SIMD and MIMD

COIT 20246 1
COIT 20246 ASSIGNMENT SUBMISSION
Due date: Thursday Week 11 (2PM AEST)
Part: Written Assessment
Weighting: 30% of total assessment.
Submission: Electronic (see course website for details)
Please fill in the following details:
Student Name
Student Number
Tutor’s Name
1

COIT 20246 2
COIT 20246
Week 1
The text discusses about different architectures for parallel processing used for
Multiprocessor Machines such as multiple-instruction stream - multiple-data stream
(MIMD), single-instruction stream - multiple-data stream (SIMD) etc. Find and summarise
ONE resource that compares between MIMD and SIMD architectures. The resource, and
your summary, must focus only on MIMD and SIMD architectures.
Title, Link and reference:
Difference between SIMD and MIMD.
https://techdifferences.com/difference-between-simd-and-mimd.htm
Tech differences 2019, Difference between SIMD and MIMD, viewed 16 July 2019,
https://techdifferences.com/difference-between-simd-and-mimd.html
Summary:
Difference between SIMD and MIMD
This article describes Michael Flynn’s classification of computer organizations based on
the number of data and instruction streams. In the article, the major difference is identifies
by their names: Single Instruction Multiple Data Stream and Multiple Instruction Multiple
Data Stream. Computers running on SIMD process single instruction over multiple data
streams while those running on MIMD process multiple instructions over multiple data
streams. I chose this article because it, in a clear way, explains the technologies involved
in each computer organization and maps out the difference between the two, a fact that
makes it a very informative article.
The most important part of the article is that which explains what data streams and
2

COIT 20246 3
instructions streams are in light of parallel processing and computer organization. Such an
understanding is very important for anybody who want to understand the two architectures.
The author describes a data stream as simply set of data made up of input and temporary
results used by instruction stream and arranged sequentially. The instruction set refers to
the sequence of instructions in execution.
The article compares the two architectures based on programming and debugging, memory
requirements, number of decoders, costs and expansion as well as synchronization,
performance and complexity. After comparing the two, the article moves forward to explain
the advantages of each technology, which can be relied on when choosing between the two.
Week 2
The text discusses about one of the common problems that can arise during resource
allocation in operating systems, which is known as deadlock. Find and summarise ONE
resource that describes an algorithm of either deadlock avoidance or deadlock prevention.
The resource, and your summary, must focus on a single algorithm of either deadlock
avoidance or deadlock prevention, NOT both.
Title, Link and Reference:
Banker’s Algorithm Detailed Explanation
https://www.hackerearth.com/blog/developers/dijkstras-bankers-algorithm-detailed-explaination/
3

COIT 20246 4
Mishra, A 2017, Dijkstra’s Bankers’s algorithm detailed explanation, viewed 22 July 2019,
https://www.hackerearth.com/blog/developers/dijkstras-bankers-algorithm-detailed-explaination/
Summary:
Banker’s Algorithm Detailed Explanation
In this article the author, describe banker’s algorithm, which is used to avoid deadlock
occurrences in operating systems. I chose this article particularly because it describes a
deadlock avoidance algorithm that tests the allocation of predetermined maximum possible
resources and checks the state of the system before allocating these resources.
The usefulness of this article is in the clear explanation backed-up by perfect examples.
As a deadlock avoidance algorithm, banker’s algorithm avoid deadlock using three
discrete steps: determine the resource each process could request at a maximum, determine
maximum resource that each can hold and finally determine the availability of each of the
requested resources.
4