Anda di halaman 1dari 10

# Fengs Classification

## of Computer Architectures Presented By : OM PRAKASH MAHATO Roll no:- 069/MSCSKE/659

Introduction
As We know, there are three classification of computer architectures which are: 1) Flynns Classification (1966): is based on the multiplicity of instruction stream and data stream in a computer system. 2) Fengs Classification (1972): is based on serial versus parallel processing. 3) Handlers Classification (1977): is determined by the degree of parallelism and pipelining in various subsystem levels.

Fengs Classification
Feng (1972) has proposed the use of degree of parallelism to classify various computer architectures. The maximum number of binary digits(bits) that can be processed within a unit time by a computer system is called maximum degree of parallelism P. Let us Pi be the number of bits that can be processed within the ith processor cycle. Consider processor cycles indexed by i=1,2,3,T. The average degree of parallelism, Pa is given by

In general, PiP. We define the utilization rate of a computer system within T cycles is If the computing power is fully utilized (or the parallelism is fully exploited), we have Pi=P for all I and =1 for 100 percent utilization. The utilization rate depends on the application program being executed.

Based on the Fengs scheme, we sequential and parallel operations at bit and word levels to produce the following classification: 1)Word Serial and Bit Serial (WSBS): Called Bit Serial Processing because one bit is processed at a time. Slow Was done first generation Computers 2) Word Parallel and Bit Serial (WPBS): Called bit Slice processing because number of bit-slices (words having 1 bit) is processing at time. 3)Word Serial and Bit Parallel (WSBP): Called word-Slice processing because one word of number of bits is processed at a time. 4) Word Parallel and Bit Parallel (WPBP): Is known as Fully Parallel Processing (or Simply parallel processing) in which an array of bits is processed at a time. The fastest processing mode among four. The maximum degree of parallelism P is given by the product of the number of bits in a word(n) and number of words in parallel(m). P= m.n Some of the commercial machines are classified as in following figure 1.7.

In above diagram, x axis represents the word length and y axis represents the number of words processed in parallel. A machine is placed at a point in the space defined by these (x,y) coordinates.
The maximum degree of parallelism is given by the area of the rectangle formed by the origin and the point representing the machine. For example: Cray I has of area 64 where as IBM 370/168 has an area of 32. A more Examples are tabulated in following slide.

## Limitation of Fengs Classification

Fengs Scheme Fails to project the concurrency in pipeline processors.

References
Advanced Computer Architecture & Computing By S.S.Jadhav, Revised Edition 2009, Technical Publication Pune. Parallel Computing By Moreshwar R. Bhujade , New AGE international Publishers.

THANK YOU!