Scribd
Upload
173 views8 pages

Feng's Classification

Feng's classification system categorizes computer architectures based on their degree of parallelism at the word and bit level. There are four types of classification: Word Serial Bit Serial, Word Serial Bit Parallel, Word Parallel Bit Serial, and Word Parallel Bit Parallel. The maximum degree of parallelism is defined as the number of bits that can be processed in a single time unit. Average parallelism and processor utilization are also discussed.

Uploaded by

Sushil Shakya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
173 views8 pages

Feng's Classification

Feng's classification system categorizes computer architectures based on their degree of parallelism at the word and bit level. There are four types of classification: Word Serial Bit Serial, Word Serial Bit Parallel, Word Parallel Bit Serial, and Word Parallel Bit Parallel. The maximum degree of parallelism is defined as the number of bits that can be processed in a single time unit. Average parallelism and processor utilization are also discussed.

Uploaded by

Sushil Shakya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

Feng’s classification

Introduction

● In 1972, Tse-yun Feng suggested the use of degree of


parallelism to classify various computer architecture.
● It is based on sequential and parallel operations at a bit and
word level.
Maximum degree of parallelism

● The maximum number of binary digits that can be processed within a unit time by a
computer system is called the maximum parallelism degree P.
● If a processor is processing P bits in unit time, then P is called the maximum degree
of parallelism.
Average Parallelism and Processor utilization

Let i= 1, 2, 3, ..., T be the different timing instants and P1, P2, ..., PT be the corresponding bits
processed. Then,

Average parallelism,

Pa = (P1 + P2 + ....PT) / T

Processor Utilization,

μ= Pa/P
● In general, Pi ≤ P. We define the utilization rate μ of a computer system within T cycles.

● 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.


Types of classification

According to Feng’s classification, computer architecture can be classified into four.

● Word Serial Bit Serial (WSBS): One bit of one selected word is processed at a time. This
represents serial processing and needs maximum processing time.

● Word Serial Bit Parallel (WSBP): It is found in most existing computers and has been called
as Word Slice processing because one word of n bit is processed at a time. All bits of a selected
word are processed at a time. Bit parallel means all bits of a word.
● Word Parallel Bit Serial (WPBS): It has been called bit slice processing because m-bit slice
is processed at a time. Word parallel signifies selection of all words. It can be considered as
one bit from all words are processed at a time.

● Word Parallel Bit Parallel (WPBP): It is known as fully parallel processing in which an
array on n x m bits is processes at one time. Maximum parallelism is achieved here.
Limitations

● It fails to project the concurrency in pipeline processors, as degree of parallelism


doesn't account for concurrency handle by pipe-lined design

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy