Comparing the optimal performance of different MIMD multiprocessor architectures
| Document type: | Conference Papers |
|---|---|
| Peer reviewed: | Yes |
| Author(s): | Lars Lundberg, Håkan Lennerstad |
| Title: | Comparing the optimal performance of different MIMD multiprocessor architectures |
| Conference name: | 12th International Parallel Processing Symposium |
| Year: | 1998 |
| Pagination: | xxv+809, 498-502 |
| ISBN: | 0818684046 |
| Publisher: | IEEE Comput. Soc |
| City: | Orlando, FL, USA |
| ISI number: | 000073316800077 |
| Organization: | Blekinge Institute of Technology |
| Department: | Dept. of Computer Science and Business Administration (Institutionen för datavetenskap och ekonomi) Dept. of Computer Science and Business Administration S-372 25 Ronneby +46 455 780 00 http://www.ide.hk-r.se/ |
| Authors e-mail: | lars.lundberg@ide.hk-r.se |
| Language: | English |
| Abstract: | We compare the performance of systems consisting of one large cluster containing q processors with systems where processors are grouped into k clusters containing u processors each. A parallel program, consisting of n processes, is executed on this system. Processes may be relocated between the processors in a cluster. They may,however not be relocated from one cluster to another. The performance criterion is the completion time of the parallel program. We present two functions: g(n,k,u,q) and G(k,u,q). Provided that we can find optimal or near optimal schedules,these functions put optimal upper bounds on the gain of using one cluster containing q processors compared to using k clusters containing u processors each. The function g(n,k,u,q) is valid for programs with n processes, whereas G(k,u,q) only depends on the two multiprocessor architectures. By evaluating g(n,k,u,q) and G(k,u,q) we show that the gain of increasing the cluster size from 1 to 2 and from 2 to 4 is relatively large. However, the gain of using clusters larger than 4 is very limited. |
| Subject: | Computer Science\Computersystems Computer Science\Distributed Computing Mathematics\Discrete Mathematics |
| Keywords: | multiprocessing systems, parallel architectures, parallel programming, performance evaluation, processor scheduling |
