|
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. 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 The degree of parallelism (DOP) is a metric which indicates how many operations can be or are being simultaneously executed by a computer. It is used as an indicator of the complexity of algorithms, and is especially useful for describing the perfo .... 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, Processor utilization Processor utilization \mu is defined as \mu = \frac The maximum degre ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Degree Of Parallelism
The degree of parallelism (DOP) is a metric which indicates how many operations can be or are being simultaneously executed by a computer. It is used as an indicator of the complexity of algorithm In mathematics and computer science, an algorithm () is a finite sequence of rigorous instructions, typically used to solve a class of specific problems or to perform a computation. Algorithms are used as specifications for performing ...s, and is especially useful for describing the performance of parallel programs and multi-processor systems. A program running on a parallel computer may utilize different numbers of processors at different times. For each time period, the number of processors used to execute a program is defined as the degree of parallelism. The plot of the DOP as a function of time for a given program is called the parallelism profile. See also * Optical Multi-Tree with Shuffle Exchange References Instruction processing Parallel computing {{ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computer Architecture
In computer engineering, computer architecture is a description of the structure of a computer system made from component parts. It can sometimes be a high-level description that ignores details of the implementation. At a more detailed level, the description may include the instruction set architecture design, microarchitecture design, logic design, and implementation. History The first documented computer architecture was in the correspondence between Charles Babbage and Ada Lovelace, describing the analytical engine. When building the computer Z1 (computer), Z1 in 1936, Konrad Zuse described in two patent applications for his future projects that machine instructions could be stored in the same storage used for data, i.e., the Stored-program computer, stored-program concept. Two other early and important examples are: * John von Neumann's 1945 paper, First Draft of a Report on the EDVAC, which described an organization of logical elements; and *Alan M. Turing, Alan Turing's mo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Wolfgang Händler
Wolfgang Händler (11 December 1920 in Potsdam – 19 February 1998) was a German mathematician, pioneering computer scientist and professor at Leibniz University Hannover (''Lehrstuhl für elektronische Rechenanlagen'') and University of Erlangen–Nuremberg (''Institut für Mathematische Maschinen und Datenverarbeitung'') known for his work on automata theory, parallel computing, artificial intelligence, man-machine interfaces and computer graphics. * ''Händler diagram'' (aka ''Mn graph'', , , , , ') (1958) See also * Händler's minimization graph * Telefunken * BESK * * * SUPRENUM (Supercomputer for Numerical Application) * (ECS) ** Feng's classification ** Flynn's taxonomy * Alwin Walther * * * Arthur Burks * Konrad Zuse References Further reading * * * * * * * * * * * External links * http://www.universitaetssammlungen.de/person/670 * Author profile in the database Zentralblatt MATH, zbMATH 1920 births 1998 deaths 20th-century German mathe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Flynn's Taxonomy
Flynn's taxonomy is a classification of computer architectures, proposed by Michael J. Flynn in 1966 and extended in 1972. The classification system has stuck, and it has been used as a tool in design of modern processors and their functionalities. Since the rise of multiprocessing central processing units (CPUs), a multiprogramming context has evolved as an extension of the classification system. Vector processing, covered by Duncan's taxonomy, is missing from Flynn's work because the Cray-1 was released in 1977: Flynn's second paper was published in 1972. Classifications The four initial classifications defined by Flynn are based upon the number of concurrent instruction (or control) streams and data streams available in the architecture. Flynn later defined three additional sub-categories of SIMD in 1972. Single instruction stream, single data stream (SISD) A sequential computer which exploits no parallelism in either the instruction or data streams. Single control unit ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
