A performance bound analysis of multistage Combining networks using a probabilistic model

Byung Chang Kang, Kyung Ho Lee, Richard Kain

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

Combining networks have been suggested to improve the performance of shared memory MIMD computer systems, which can be seriously degraded when many processors access a shared variable at virtually the same time. Although it has been claimed that combining improves performance, the performance improvement has not been fully analyzed because of the complicated nature of combining networks. In this paper we introduce a probabilistic model to evaluate the performance of combining networks quantitatively. Using the probabilistic approach, we show a performance bound of multistage networks that use 2x2 combining switches. The bounds of performance improvement, in terms of network bandwidth and delay gain, are presented. We also discuss the effect of changing the combining queue size on the performance of combining networks.

Original languageEnglish
Title of host publicationICS 1991 - Proceedings of the 5th International Conference on Supercomputing
EditorsEdward S. Davidson, Friedel Hossfield
PublisherAssociation for Computing Machinery
Pages448-457
Number of pages10
ISBN (Print)0897914341, 9780897914345
Publication statusPublished - 1991 Jun 1
Externally publishedYes
Event5th International Conference on Supercomputing, ICS 1991 - Cologne, Germany
Duration: 1991 Jun 171991 Jun 21

Other

Other5th International Conference on Supercomputing, ICS 1991
CountryGermany
CityCologne
Period91/6/1791/6/21

Fingerprint

Computer systems
Switches
Bandwidth
Data storage equipment
Statistical Models

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Kang, B. C., Lee, K. H., & Kain, R. (1991). A performance bound analysis of multistage Combining networks using a probabilistic model. In E. S. Davidson, & F. Hossfield (Eds.), ICS 1991 - Proceedings of the 5th International Conference on Supercomputing (pp. 448-457). Association for Computing Machinery.

A performance bound analysis of multistage Combining networks using a probabilistic model. / Kang, Byung Chang; Lee, Kyung Ho; Kain, Richard.

ICS 1991 - Proceedings of the 5th International Conference on Supercomputing. ed. / Edward S. Davidson; Friedel Hossfield. Association for Computing Machinery, 1991. p. 448-457.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kang, BC, Lee, KH & Kain, R 1991, A performance bound analysis of multistage Combining networks using a probabilistic model. in ES Davidson & F Hossfield (eds), ICS 1991 - Proceedings of the 5th International Conference on Supercomputing. Association for Computing Machinery, pp. 448-457, 5th International Conference on Supercomputing, ICS 1991, Cologne, Germany, 91/6/17.
Kang BC, Lee KH, Kain R. A performance bound analysis of multistage Combining networks using a probabilistic model. In Davidson ES, Hossfield F, editors, ICS 1991 - Proceedings of the 5th International Conference on Supercomputing. Association for Computing Machinery. 1991. p. 448-457
Kang, Byung Chang ; Lee, Kyung Ho ; Kain, Richard. / A performance bound analysis of multistage Combining networks using a probabilistic model. ICS 1991 - Proceedings of the 5th International Conference on Supercomputing. editor / Edward S. Davidson ; Friedel Hossfield. Association for Computing Machinery, 1991. pp. 448-457
@inproceedings{88749c4afb5c4383b0ab856d7e8c5feb,
title = "A performance bound analysis of multistage Combining networks using a probabilistic model",
abstract = "Combining networks have been suggested to improve the performance of shared memory MIMD computer systems, which can be seriously degraded when many processors access a shared variable at virtually the same time. Although it has been claimed that combining improves performance, the performance improvement has not been fully analyzed because of the complicated nature of combining networks. In this paper we introduce a probabilistic model to evaluate the performance of combining networks quantitatively. Using the probabilistic approach, we show a performance bound of multistage networks that use 2x2 combining switches. The bounds of performance improvement, in terms of network bandwidth and delay gain, are presented. We also discuss the effect of changing the combining queue size on the performance of combining networks.",
author = "Kang, {Byung Chang} and Lee, {Kyung Ho} and Richard Kain",
year = "1991",
month = "6",
day = "1",
language = "English",
isbn = "0897914341",
pages = "448--457",
editor = "Davidson, {Edward S.} and Friedel Hossfield",
booktitle = "ICS 1991 - Proceedings of the 5th International Conference on Supercomputing",
publisher = "Association for Computing Machinery",

}

TY - GEN

T1 - A performance bound analysis of multistage Combining networks using a probabilistic model

AU - Kang, Byung Chang

AU - Lee, Kyung Ho

AU - Kain, Richard

PY - 1991/6/1

Y1 - 1991/6/1

N2 - Combining networks have been suggested to improve the performance of shared memory MIMD computer systems, which can be seriously degraded when many processors access a shared variable at virtually the same time. Although it has been claimed that combining improves performance, the performance improvement has not been fully analyzed because of the complicated nature of combining networks. In this paper we introduce a probabilistic model to evaluate the performance of combining networks quantitatively. Using the probabilistic approach, we show a performance bound of multistage networks that use 2x2 combining switches. The bounds of performance improvement, in terms of network bandwidth and delay gain, are presented. We also discuss the effect of changing the combining queue size on the performance of combining networks.

AB - Combining networks have been suggested to improve the performance of shared memory MIMD computer systems, which can be seriously degraded when many processors access a shared variable at virtually the same time. Although it has been claimed that combining improves performance, the performance improvement has not been fully analyzed because of the complicated nature of combining networks. In this paper we introduce a probabilistic model to evaluate the performance of combining networks quantitatively. Using the probabilistic approach, we show a performance bound of multistage networks that use 2x2 combining switches. The bounds of performance improvement, in terms of network bandwidth and delay gain, are presented. We also discuss the effect of changing the combining queue size on the performance of combining networks.

UR - http://www.scopus.com/inward/record.url?scp=84941870773&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84941870773&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84941870773

SN - 0897914341

SN - 9780897914345

SP - 448

EP - 457

BT - ICS 1991 - Proceedings of the 5th International Conference on Supercomputing

A2 - Davidson, Edward S.

A2 - Hossfield, Friedel

PB - Association for Computing Machinery

ER -