Multiprocessing: Difference between revisions
No edit summary |
|||
| Line 9: | Line 9: | ||
In [[Flynn's taxonomy]], multiprocessors as defined above are [[Multiple instruction, multiple data|MIMD]] machines.<ref name="Giladi2008"/><ref name="Shiva2005">{{cite book |author=Sajjan G. Shiva |title=Advanced Computer Architectures |url=https://books.google.com/books?id=DhdCwk5AhbEC&pg=PA221 |date=20 September 2005 |publisher=CRC Press |isbn=978-0-8493-3758-1 |page=221}}</ref> As the term "multiprocessor" normally refers to tightly coupled systems in which all processors share memory, multiprocessors are not the entire class of MIMD machines, which also contains [[message passing]] multicomputer systems.<ref name="Giladi2008">{{cite book |author=Ran Giladi |title=Network Processors: Architecture, Programming, and Implementation |url=https://books.google.com/books?id=_7aH_4axpwAC&pg=PA293 |year=2008 |publisher=Morgan Kaufmann |isbn=978-0-08-091959-1 |page=293}}</ref> |
In [[Flynn's taxonomy]], multiprocessors as defined above are [[Multiple instruction, multiple data|MIMD]] machines.<ref name="Giladi2008"/><ref name="Shiva2005">{{cite book |author=Sajjan G. Shiva |title=Advanced Computer Architectures |url=https://books.google.com/books?id=DhdCwk5AhbEC&pg=PA221 |date=20 September 2005 |publisher=CRC Press |isbn=978-0-8493-3758-1 |page=221}}</ref> As the term "multiprocessor" normally refers to tightly coupled systems in which all processors share memory, multiprocessors are not the entire class of MIMD machines, which also contains [[message passing]] multicomputer systems.<ref name="Giladi2008">{{cite book |author=Ran Giladi |title=Network Processors: Architecture, Programming, and Implementation |url=https://books.google.com/books?id=_7aH_4axpwAC&pg=PA293 |year=2008 |publisher=Morgan Kaufmann |isbn=978-0-08-091959-1 |page=293}}</ref> |
||
| ⚫ | |||
| ⚫ | Merging data from multiple [[Thread (computing)|threads]] or [[Process (computing)|processes]] |
||
== Key topics == |
== Key topics == |
||
| Line 62: | Line 58: | ||
Loosely coupled systems have the ability to run different operating systems or OS versions on different systems. |
Loosely coupled systems have the ability to run different operating systems or OS versions on different systems. |
||
| ⚫ | |||
| ⚫ | Merging data from multiple [[Thread (computing)|threads]] or [[Process (computing)|processes]] may incur significant overhead due to [[conflict resolution]], [[data consistency]], versioning, and synchronization. <ref>{{Cite book |title=Concurrent Programming: Algorithms, Principles, and Foundations |publisher=Springer |isbn=978-3642320262}}</ref> |
||
==See also== |
==See also== |
||
Latest revision as of 05:24, 24 November 2024
 | This article needs additional citations for verification. (February 2014) |
Multiprocessing is the use of two or more central processing units (CPUs) within a single computer system.[1][2] The term also refers to the ability of a system to support more than one processor or the ability to allocate tasks between them. There are many variations on this basic theme, and the definition of multiprocessing can vary with context, mostly as a function of how CPUs are defined (multiple cores on one die, multiple dies in one package, multiple packages in one system unit, etc.).
According to some on-line dictionaries, a multiprocessor is a computer system having two or more processing units (multiple processors) each sharing main memory and peripherals, in order to simultaneously process programs.[3][4] A 2009 textbook defined multiprocessor system similarly, but noting that the processors may share "some or all of the system’s memory and I/O facilities"; it also gave tightly coupled system as a synonymous term.[5]
At the operating system level, multiprocessing is sometimes used to refer to the execution of multiple concurrent processes in a system, with each process running on a separate CPU or core, as opposed to a single process at any one instant.[6][7] When used with this definition, multiprocessing is sometimes contrasted with multitasking, which may use just a single processor but switch it in time slices between tasks (i.e. a time-sharing system). Multiprocessing however means true parallel execution of multiple processes using more than one processor.[7] Multiprocessing doesn't necessarily mean that a single process or task uses more than one processor simultaneously; the term parallel processing is generally used to denote that scenario.[6] Other authors prefer to refer to the operating system techniques as multiprogramming and reserve the term multiprocessing for the hardware aspect of having more than one processor.[2][8] The remainder of this article discusses multiprocessing only in this hardware sense.
In Flynn's taxonomy, multiprocessors as defined above are MIMD machines.[9][10] As the term "multiprocessor" normally refers to tightly coupled systems in which all processors share memory, multiprocessors are not the entire class of MIMD machines, which also contains message passing multicomputer systems.[9]
Key topics
[edit]Processor symmetry
[edit]In a multiprocessing system, all CPUs may be equal, or some may be reserved for special purposes. A combination of hardware and operating system software design considerations determine the symmetry (or lack thereof) in a given system. For example, hardware or software considerations may require that only one particular CPU respond to all hardware interrupts, whereas all other work in the system may be distributed equally among CPUs; or execution of kernel-mode code may be restricted to only one particular CPU, whereas user-mode code may be executed in any combination of processors. Multiprocessing systems are often easier to design if such restrictions are imposed, but they tend to be less efficient than systems in which all CPUs are utilized.
Systems that treat all CPUs equally are called symmetric multiprocessing (SMP) systems. In systems where all CPUs are not equal, system resources may be divided in a number of ways, including asymmetric multiprocessing (ASMP), non-uniform memory access (NUMA) multiprocessing, and clustered multiprocessing.
Master/slave multiprocessor system
[edit]In a master/slave multiprocessor system, the master CPU is in control of the computer and the slave CPU(s) performs assigned tasks. The CPUs can be completely different in terms of speed and architecture. Some (or all) of the CPUs can share a common bus, each can also have a private bus (for private resources), or they may be isolated except for a common communications pathway. Likewise, the CPUs can share common RAM and/or have private RAM that the other processor(s) cannot access. The roles of master and slave can change from one CPU to another.
Two early examples of a mainframe master/slave multiprocessor are the Bull Gamma 60 and the Burroughs B5000.[11]
An early example of a master/slave multiprocessor system of microprocessors is the Tandy/Radio Shack TRS-80 Model 16 desktop computer which came out in February 1982 and ran the multi-user/multi-tasking Xenix operating system, Microsoft's version of UNIX (called TRS-XENIX). The Model 16 has two microprocessors: an 8-bit Zilog Z80 CPU running at 4 MHz, and a 16-bit Motorola 68000 CPU running at 6 MHz. When the system is booted, the Z-80 is the master and the Xenix boot process initializes the slave 68000, and then transfers control to the 68000, whereupon the CPUs change roles and the Z-80 becomes a slave processor responsible for all I/O operations including disk, communications, printer and network, as well as the keyboard and integrated monitor, while the operating system and applications run on the 68000 CPU. The Z-80 can be used to do other tasks.
The earlier TRS-80 Model II, which was released in 1979, could also be considered a multiprocessor system as it had both a Z-80 CPU and an Intel 8021[12] microcontroller in the keyboard. The 8021 made the Model II the first desktop computer system with a separate detachable lightweight keyboard connected with by a single thin flexible wire, and likely the first keyboard to use a dedicated microcontroller, both attributes that would later be copied years later by Apple and IBM.
Instruction and data streams
[edit]In multiprocessing, the processors can be used to execute a single sequence of instructions in multiple contexts (single instruction, multiple data or SIMD, often used in vector processing), multiple sequences of instructions in a single context (multiple instruction, single data or MISD, used for redundancy in fail-safe systems and sometimes applied to describe pipelined processors or hyper-threading), or multiple sequences of instructions in multiple contexts (multiple instruction, multiple data or MIMD).
Processor coupling
[edit]Tightly coupled multiprocessor system
[edit]Tightly coupled multiprocessor systems contain multiple CPUs that are connected at the bus level. These CPUs may have access to a central shared memory (SMP or UMA), or may participate in a memory hierarchy with both local and shared memory (SM)(NUMA). The IBM p690 Regatta is an example of a high end SMP system. Intel Xeon processors dominated the multiprocessor market for business PCs and were the only major x86 option until the release of AMD's Opteron range of processors in 2004. Both ranges of processors had their own onboard cache but provided access to shared memory; the Xeon processors via a common pipe and the Opteron processors via independent pathways to the system RAM.
Chip multiprocessors, also known as multi-core computing, involves more than one processor placed on a single chip and can be thought of the most extreme form of tightly coupled multiprocessing. Mainframe systems with multiple processors are often tightly coupled.
Loosely coupled multiprocessor system
[edit]Loosely coupled multiprocessor systems (often referred to as clusters) are based on multiple standalone relatively low processor count commodity computers interconnected via a high speed communication system (Gigabit Ethernet is common). A Linux Beowulf cluster is an example of a loosely coupled system.
Tightly coupled systems perform better and are physically smaller than loosely coupled systems, but have historically required greater initial investments and may depreciate rapidly; nodes in a loosely coupled system are usually inexpensive commodity computers and can be recycled as independent machines upon retirement from the cluster.
Power consumption is also a consideration. Tightly coupled systems tend to be much more energy-efficient than clusters. This is because a considerable reduction in power consumption can be realized by designing components to work together from the beginning in tightly coupled systems, whereas loosely coupled systems use components that were not necessarily intended specifically for use in such systems.
Loosely coupled systems have the ability to run different operating systems or OS versions on different systems.
Disadvantages
[edit]Merging data from multiple threads or processes may incur significant overhead due to conflict resolution, data consistency, versioning, and synchronization. [13]
See also
[edit]- Multiprocessor system architecture
- Symmetric multiprocessing
- Asymmetric multiprocessing
- Multi-core processor
- BMDFM – Binary Modular Dataflow Machine, a SMP MIMD runtime environment
- Software lockout
- OpenHMPP
References
[edit]- ^ Raj Rajagopal (1999). Introduction to Microsoft Windows NT Cluster Server: Programming and Administration. CRC Press. p. 4. ISBN 978-1-4200-7548-9.
- ^ a b Mike Ebbers; John Kettner; Wayne O'Brien; Bill Ogden (2012). Introduction to the New Mainframe: z/OS Basics. IBM. p. 96. ISBN 978-0-7384-3534-3.
- ^ "Multiprocessor dictionary definition - multiprocessor defined". www.yourdictionary.com. Archived from the original on 16 March 2018. Retrieved 16 March 2018.
- ^ "multiprocessor". Archived from the original on 16 March 2018. Retrieved 16 March 2018 – via The Free Dictionary.
- ^ Irv Englander (2009). The architecture of Computer Hardware and Systems Software. An Information Technology Approach (4th ed.). Wiley. p. 265. ISBN 978-0471715429.
- ^ a b Deborah Morley; Charles Parker (13 February 2012). Understanding Computers: Today and Tomorrow, Comprehensive. Cengage Learning. p. 183. ISBN 978-1-133-19024-0.
- ^ a b Shibu K. V. Introduction to Embedded Systems. Tata McGraw-Hill Education. p. 402. ISBN 978-0-07-014589-4.
- ^ Ashok Arora (2006). Foundations of Computer Science. Laxmi Publications. p. 149. ISBN 978-81-7008-971-1.
- ^ a b Ran Giladi (2008). Network Processors: Architecture, Programming, and Implementation. Morgan Kaufmann. p. 293. ISBN 978-0-08-091959-1.
- ^ Sajjan G. Shiva (20 September 2005). Advanced Computer Architectures. CRC Press. p. 221. ISBN 978-0-8493-3758-1.
- ^ The Operational Characteristics of the Processors for the Burroughs B5000 (PDF). Revision A. Burroughs. 1963. 5000-21005A. Archived (PDF) from the original on 30 May 2023. Retrieved 27 June 2023.
- ^ TRS-80 Model II Technical Reference Manual. Radio Shack. 1980. p. 135.
- ^ Concurrent Programming: Algorithms, Principles, and Foundations. Springer. ISBN 978-3642320262.
| General | |
|---|---|
| Levels | |
| Multithreading | |
| Theory | |
| Elements | |
| Coordination | |
| Programming | |
| Hardware | |
| APIs | |
| Problems | |
