Performance analysis of the simultaneous optical multi-processor exchange bus
The performance of a multi-computer system based on the simultaneous optical multi-processor exchange bus (SOME-Bus) interconnection network is examined using queuing network models under the message-passing and distributed-shared-memory (DSM) paradigms. The SOME-Bus is a low latency, high bandwidth...
Gespeichert in:
Veröffentlicht in: | Parallel computing 2001-07, Vol.27 (8), p.1079-1115 |
---|---|
1. Verfasser: | |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 1115 |
---|---|
container_issue | 8 |
container_start_page | 1079 |
container_title | Parallel computing |
container_volume | 27 |
creator | Katsinis, Constantine |
description | The performance of a multi-computer system based on the simultaneous optical multi-processor exchange bus (SOME-Bus) interconnection network is examined using queuing network models under the message-passing and distributed-shared-memory (DSM) paradigms. The SOME-Bus is a low latency, high bandwidth, fiber-optic interconnection network which directly links arbitrary pairs of processor nodes without contention. It contains a dedicated channel for the data output of each node, eliminating the need for global arbitration and providing bandwidth that scales directly with the number of nodes in the system. Each of
N nodes has an array of receivers, with one receiver dedicated to each node output channel. No node is ever blocked from transmitting by another transmitter or due to contention for shared switching logic. The entire
N-receiver array can be integrated on a single chip at a comparatively minor cost resulting in O(
N) complexity. By supporting multiple simultaneous broadcasts of messages, the SOME-Bus has much more functionality than a crossbar, allowing synchronization phases and cache consistency protocols to complete much faster. Simulation results are presented which validate the theoretical results and compare processor utilization in the SOME-Bus, the crossbar and the torus, with and without synchronization. Compared to these two networks, the SOME-Bus performance is least affected by large message communication times. Even in the presence of frequent synchronization, processor utilization remains practically unaffected while it drops in the other architectures. Although it has a larger number of channels compared to the crossbar and the mesh, the SOME-Bus is much simpler and inexpensive because it is free of complex routing, congestion and blocking. |
doi_str_mv | 10.1016/S0167-8191(01)00071-0 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_26535514</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0167819101000710</els_id><sourcerecordid>26535514</sourcerecordid><originalsourceid>FETCH-LOGICAL-c338t-514591d62f8901df8dc5bb730de7d08cfd945f1718f5ff31b10df08e5a688de3</originalsourceid><addsrcrecordid>eNqFkNtKxDAQhoMouK4-gtAr0YvqzHbTplciiydYUXDvQ5pM3EgPa9KK-_ZmrXgrDDPw88_pY-wU4RIB86vXmIpUYInngBcAUGAKe2yCopilRZbl-2zyZzlkRyG8R1M-FzBhTy_kbecb1WpKVKvqbXAh6WzSrykJrhnqXrXUDVHb9E6rOtlJLt34TlMInU_oS69V-0ZJNYRjdmBVHejkt07Z6u52tXhIl8_3j4ubZaqzTPQpxzkv0eQzK0pAY4XRvKqKDAwVBoS2ppxziwUKy63NsEIwFgRxlQthKJuys3FsvOJjoNDLxgVNdT2eKmc5z3hcEo18NGrfheDJyo13jfJbiSB37OQPO7kDIyHGjp2E2Hc99lF84tORl0E7ioiM86R7aTr3z4RvhlF3iA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>26535514</pqid></control><display><type>article</type><title>Performance analysis of the simultaneous optical multi-processor exchange bus</title><source>Elsevier ScienceDirect Journals</source><creator>Katsinis, Constantine</creator><creatorcontrib>Katsinis, Constantine</creatorcontrib><description>The performance of a multi-computer system based on the simultaneous optical multi-processor exchange bus (SOME-Bus) interconnection network is examined using queuing network models under the message-passing and distributed-shared-memory (DSM) paradigms. The SOME-Bus is a low latency, high bandwidth, fiber-optic interconnection network which directly links arbitrary pairs of processor nodes without contention. It contains a dedicated channel for the data output of each node, eliminating the need for global arbitration and providing bandwidth that scales directly with the number of nodes in the system. Each of
N nodes has an array of receivers, with one receiver dedicated to each node output channel. No node is ever blocked from transmitting by another transmitter or due to contention for shared switching logic. The entire
N-receiver array can be integrated on a single chip at a comparatively minor cost resulting in O(
N) complexity. By supporting multiple simultaneous broadcasts of messages, the SOME-Bus has much more functionality than a crossbar, allowing synchronization phases and cache consistency protocols to complete much faster. Simulation results are presented which validate the theoretical results and compare processor utilization in the SOME-Bus, the crossbar and the torus, with and without synchronization. Compared to these two networks, the SOME-Bus performance is least affected by large message communication times. Even in the presence of frequent synchronization, processor utilization remains practically unaffected while it drops in the other architectures. Although it has a larger number of channels compared to the crossbar and the mesh, the SOME-Bus is much simpler and inexpensive because it is free of complex routing, congestion and blocking.</description><identifier>ISSN: 0167-8191</identifier><identifier>EISSN: 1872-7336</identifier><identifier>DOI: 10.1016/S0167-8191(01)00071-0</identifier><language>eng</language><publisher>Elsevier B.V</publisher><subject>Computer architecture ; Interconnection networks ; Performance analysis</subject><ispartof>Parallel computing, 2001-07, Vol.27 (8), p.1079-1115</ispartof><rights>2001 Elsevier Science B.V.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c338t-514591d62f8901df8dc5bb730de7d08cfd945f1718f5ff31b10df08e5a688de3</citedby><cites>FETCH-LOGICAL-c338t-514591d62f8901df8dc5bb730de7d08cfd945f1718f5ff31b10df08e5a688de3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S0167819101000710$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3537,27903,27904,65309</link.rule.ids></links><search><creatorcontrib>Katsinis, Constantine</creatorcontrib><title>Performance analysis of the simultaneous optical multi-processor exchange bus</title><title>Parallel computing</title><description>The performance of a multi-computer system based on the simultaneous optical multi-processor exchange bus (SOME-Bus) interconnection network is examined using queuing network models under the message-passing and distributed-shared-memory (DSM) paradigms. The SOME-Bus is a low latency, high bandwidth, fiber-optic interconnection network which directly links arbitrary pairs of processor nodes without contention. It contains a dedicated channel for the data output of each node, eliminating the need for global arbitration and providing bandwidth that scales directly with the number of nodes in the system. Each of
N nodes has an array of receivers, with one receiver dedicated to each node output channel. No node is ever blocked from transmitting by another transmitter or due to contention for shared switching logic. The entire
N-receiver array can be integrated on a single chip at a comparatively minor cost resulting in O(
N) complexity. By supporting multiple simultaneous broadcasts of messages, the SOME-Bus has much more functionality than a crossbar, allowing synchronization phases and cache consistency protocols to complete much faster. Simulation results are presented which validate the theoretical results and compare processor utilization in the SOME-Bus, the crossbar and the torus, with and without synchronization. Compared to these two networks, the SOME-Bus performance is least affected by large message communication times. Even in the presence of frequent synchronization, processor utilization remains practically unaffected while it drops in the other architectures. Although it has a larger number of channels compared to the crossbar and the mesh, the SOME-Bus is much simpler and inexpensive because it is free of complex routing, congestion and blocking.</description><subject>Computer architecture</subject><subject>Interconnection networks</subject><subject>Performance analysis</subject><issn>0167-8191</issn><issn>1872-7336</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2001</creationdate><recordtype>article</recordtype><recordid>eNqFkNtKxDAQhoMouK4-gtAr0YvqzHbTplciiydYUXDvQ5pM3EgPa9KK-_ZmrXgrDDPw88_pY-wU4RIB86vXmIpUYInngBcAUGAKe2yCopilRZbl-2zyZzlkRyG8R1M-FzBhTy_kbecb1WpKVKvqbXAh6WzSrykJrhnqXrXUDVHb9E6rOtlJLt34TlMInU_oS69V-0ZJNYRjdmBVHejkt07Z6u52tXhIl8_3j4ubZaqzTPQpxzkv0eQzK0pAY4XRvKqKDAwVBoS2ppxziwUKy63NsEIwFgRxlQthKJuys3FsvOJjoNDLxgVNdT2eKmc5z3hcEo18NGrfheDJyo13jfJbiSB37OQPO7kDIyHGjp2E2Hc99lF84tORl0E7ioiM86R7aTr3z4RvhlF3iA</recordid><startdate>20010701</startdate><enddate>20010701</enddate><creator>Katsinis, Constantine</creator><general>Elsevier B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20010701</creationdate><title>Performance analysis of the simultaneous optical multi-processor exchange bus</title><author>Katsinis, Constantine</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c338t-514591d62f8901df8dc5bb730de7d08cfd945f1718f5ff31b10df08e5a688de3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2001</creationdate><topic>Computer architecture</topic><topic>Interconnection networks</topic><topic>Performance analysis</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Katsinis, Constantine</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Parallel computing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Katsinis, Constantine</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Performance analysis of the simultaneous optical multi-processor exchange bus</atitle><jtitle>Parallel computing</jtitle><date>2001-07-01</date><risdate>2001</risdate><volume>27</volume><issue>8</issue><spage>1079</spage><epage>1115</epage><pages>1079-1115</pages><issn>0167-8191</issn><eissn>1872-7336</eissn><abstract>The performance of a multi-computer system based on the simultaneous optical multi-processor exchange bus (SOME-Bus) interconnection network is examined using queuing network models under the message-passing and distributed-shared-memory (DSM) paradigms. The SOME-Bus is a low latency, high bandwidth, fiber-optic interconnection network which directly links arbitrary pairs of processor nodes without contention. It contains a dedicated channel for the data output of each node, eliminating the need for global arbitration and providing bandwidth that scales directly with the number of nodes in the system. Each of
N nodes has an array of receivers, with one receiver dedicated to each node output channel. No node is ever blocked from transmitting by another transmitter or due to contention for shared switching logic. The entire
N-receiver array can be integrated on a single chip at a comparatively minor cost resulting in O(
N) complexity. By supporting multiple simultaneous broadcasts of messages, the SOME-Bus has much more functionality than a crossbar, allowing synchronization phases and cache consistency protocols to complete much faster. Simulation results are presented which validate the theoretical results and compare processor utilization in the SOME-Bus, the crossbar and the torus, with and without synchronization. Compared to these two networks, the SOME-Bus performance is least affected by large message communication times. Even in the presence of frequent synchronization, processor utilization remains practically unaffected while it drops in the other architectures. Although it has a larger number of channels compared to the crossbar and the mesh, the SOME-Bus is much simpler and inexpensive because it is free of complex routing, congestion and blocking.</abstract><pub>Elsevier B.V</pub><doi>10.1016/S0167-8191(01)00071-0</doi><tpages>37</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0167-8191 |
ispartof | Parallel computing, 2001-07, Vol.27 (8), p.1079-1115 |
issn | 0167-8191 1872-7336 |
language | eng |
recordid | cdi_proquest_miscellaneous_26535514 |
source | Elsevier ScienceDirect Journals |
subjects | Computer architecture Interconnection networks Performance analysis |
title | Performance analysis of the simultaneous optical multi-processor exchange bus |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-28T05%3A20%3A55IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Performance%20analysis%20of%20the%20simultaneous%20optical%20multi-processor%20exchange%20bus&rft.jtitle=Parallel%20computing&rft.au=Katsinis,%20Constantine&rft.date=2001-07-01&rft.volume=27&rft.issue=8&rft.spage=1079&rft.epage=1115&rft.pages=1079-1115&rft.issn=0167-8191&rft.eissn=1872-7336&rft_id=info:doi/10.1016/S0167-8191(01)00071-0&rft_dat=%3Cproquest_cross%3E26535514%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=26535514&rft_id=info:pmid/&rft_els_id=S0167819101000710&rfr_iscdi=true |