Feng's classification

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.[1]

About Degree of Parallelism

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.[2]

Average Degree of Parallelism

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 

     Processor Utilization, μ= Pa/P

The maximum degree of parallelism depends on the structure of the Arithmetic and Logic Unit. Higher degree of parallelism indicates a highly parallel ALU or processing element. Average parallelism depends on both the hardware and the software. Higher average parallelism can be achieved through concurrent programs.[3]

Types of Classification

According to Feng’s classification, computer architecture can be classified into four. The classification is based on the way contents stored in memory are processed. The contents can be either data or instructions.[3]

  1. Word Serial Bit Serial (WSBS)
  2. Word Serial Bit Parallel (WSBP)
  3. Word Parallel Bit Serial (WPBS)
  4. Word Parallel Bit Parallel (WPBP)

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)

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 processes 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 of Feng's Classification

It fails to project the concurrency in pipeline processors, as degree of parallelism doesn't account for concurrency handle by pipe-lined design.

See also

References

  1. ↑ Fahad Layth Malallah. "Parallel Processing" (PDF). Retrieved 5 October 2016.
  2. ↑ Salih, Mariam A. Salih. "Architectural Classification" (PDF). Retrieved 5 October 2016.
  3. 1 2 Bhupal, Jagadale Amol. "Classification, fleng's and Handler's" (PDF). Retrieved 5 October 2016.
This article is issued from Wikipedia - version of the 11/19/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.