





Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
Feng's classification of computer architectures based on degree of parallelism and utilization rate. The concept of maximum degree of parallelism, average degree of parallelism, and utilization rate. It also covers different classifications based on word and bit count, including word serial and bit serial (wsbs), word parallel and bit serial (wpbs), word serial and bit parallel (wsbp), and word parallel and bit parallel (wpbp). The document also mentions the limitations of feng's classification and provides references for further reading.
Typology: Exams
1 / 9
This page cannot be seen from the preview
Don't miss anything!
Flynn’s Classification (1966): is based on the multiplicity of instruction stream and data stream in a computer system.
Feng’s Classification (1972): is based on serial versus parallel processing.
Handler’s Classification (1977): is determined by the degree of parallelism and pipelining in various subsystem levels.
Classification based on sequential and parallel operation at bit and word levels :
Word Serial and Bit Serial (WSBS): also called as Bit Serial Processing (1 bit is processed at time); slow
Word Parallel and Bit Serial (WPBS): also called as Slice processing (m bit slice at a time)
Word Serial and Bit Parallel (WSBP): also called as word slice processing (1 word of n bit at time)
Word Parallel and Bit Parallel (WPBP): also known as fully parallel processing; fastest
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 (^4)
word length (n) 5
(1, 1)
(*, 1)
(1, *)
(*, *)
Handler’s schema allow pipeline to be specific...