There are several different algorithms available to perform a synchronization of multiple processors. Some of them support only shared memory architectures or very fine grained supercomputers. This work gives an overview about all currently known algorithms which are suitable for distributed shared memory architectures and message passing based computer systems (loosely coupled or coarse grained supercomputers). No absolute decision can be made for choosing a barrier algorithm for a machine. Several architectural aspects have to be taken into account. The overview about known barrier algorithms given in this work is mostly targeted to implementors of libraries supporting collective communication (such as MPI).
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa.de:swb:ch1-200500740 |
| Date | 28 June 2005 |
| Creators | Hoefler, Torsten, Mehlan, Torsten, Mietke, Frank, Rehm, Wolfgang |
| Contributors | TU Chemnitz, Fakultät für Informatik |
| Publisher | Universitätsbibliothek Chemnitz |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English |
| Detected Language | English |
| Type | doc-type:workingPaper |
| Format | application/pdf, text/plain, application/zip |
| Relation | dcterms:isPartOf:Chemnitzer Informatik-Berichte ; CSR-04-03 |
Page generated in 0.0015 seconds