An implementation of Linda for a NUMA machine

After briefly reviewing the implementation strategies for Linda on shared-memory, distributed-memory, and LAN architectures, we discuss a Linda implementation for the CRAY T3D and CRAY T3E. We identify some significant ways in which the architecture of these machines differs from those listed - in e...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Parallel computing 1998-07, Vol.24 (7), p.1005-1021
1. Verfasser: Carriero, Nicholas
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 1021
container_issue 7
container_start_page 1005
container_title Parallel computing
container_volume 24
creator Carriero, Nicholas
description After briefly reviewing the implementation strategies for Linda on shared-memory, distributed-memory, and LAN architectures, we discuss a Linda implementation for the CRAY T3D and CRAY T3E. We identify some significant ways in which the architecture of these machines differs from those listed - in essence the CRAY T3D and CRAY T3E can be viewed as instances of an architecture somewhere between shared-memory and distributed-memory. As a result, a new implementation strategy was called for. We describe two approaches that we explored and lay out the more effective one in some detail. We conclude with performance data for point-to-point coordination operations that show that our Linda implementation generally outperforms MPI and PVM on the CRAY T3D and is comparable to MPI on the CRAY T3E. This work thus extends a series of results that have demonstrated `high-level' coordination languages, like Linda can be implemented on modern multiprocessors without significantly compromising performance relative to low-level coordination via message passing.
doi_str_mv 10.1016/S0167-8191(98)00040-4
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_26665034</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0167819198000404</els_id><sourcerecordid>26665034</sourcerecordid><originalsourceid>FETCH-LOGICAL-c333t-14b684bebbef8599bb37e6b540256c96e1875774c30afc54b965cf55da8b26213</originalsourceid><addsrcrecordid>eNqFkEtLAzEUhYMoWKs_QZiV6CKaTB6TrKSU-oCqC-06JJkbjMyjJlPBf--0Fbdu7tl853DPQeickmtKqLx5HU-FFdX0UqsrQggnmB-gCVVViSvG5CGa_CHH6CTnjxGSXJEJwrOuiO26gRa6wQ6x74o-FMvY1bYIfSps8bx6mhWt9e-xg1N0FGyT4exXp2h1t3ibP-Dly_3jfLbEnjE2YMqdVNyBcxCU0No5VoF0gpNSSK8ljJ-JquKeERu84E5L4YMQtVWulCVlU3Sxz12n_nMDeTBtzB6axnbQb7IppZSCMD6CYg_61OecIJh1iq1N34YSsx3H7MYx2-ZGK7Mbx2x9t3sfjC2-IiSTfYTOQx0T-MHUffwn4QeDUGmD</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>26665034</pqid></control><display><type>article</type><title>An implementation of Linda for a NUMA machine</title><source>Elsevier ScienceDirect Journals Complete</source><creator>Carriero, Nicholas</creator><creatorcontrib>Carriero, Nicholas</creatorcontrib><description>After briefly reviewing the implementation strategies for Linda on shared-memory, distributed-memory, and LAN architectures, we discuss a Linda implementation for the CRAY T3D and CRAY T3E. We identify some significant ways in which the architecture of these machines differs from those listed - in essence the CRAY T3D and CRAY T3E can be viewed as instances of an architecture somewhere between shared-memory and distributed-memory. As a result, a new implementation strategy was called for. We describe two approaches that we explored and lay out the more effective one in some detail. We conclude with performance data for point-to-point coordination operations that show that our Linda implementation generally outperforms MPI and PVM on the CRAY T3D and is comparable to MPI on the CRAY T3E. This work thus extends a series of results that have demonstrated `high-level' coordination languages, like Linda can be implemented on modern multiprocessors without significantly compromising performance relative to low-level coordination via message passing.</description><identifier>ISSN: 0167-8191</identifier><identifier>EISSN: 1872-7336</identifier><identifier>DOI: 10.1016/S0167-8191(98)00040-4</identifier><language>eng</language><publisher>Elsevier B.V</publisher><subject>Coordination languages ; Linda ; NUMA architecture</subject><ispartof>Parallel computing, 1998-07, Vol.24 (7), p.1005-1021</ispartof><rights>1998 Elsevier Science B.V.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c333t-14b684bebbef8599bb37e6b540256c96e1875774c30afc54b965cf55da8b26213</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/S0167-8191(98)00040-4$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,780,784,3550,27924,27925,45995</link.rule.ids></links><search><creatorcontrib>Carriero, Nicholas</creatorcontrib><title>An implementation of Linda for a NUMA machine</title><title>Parallel computing</title><description>After briefly reviewing the implementation strategies for Linda on shared-memory, distributed-memory, and LAN architectures, we discuss a Linda implementation for the CRAY T3D and CRAY T3E. We identify some significant ways in which the architecture of these machines differs from those listed - in essence the CRAY T3D and CRAY T3E can be viewed as instances of an architecture somewhere between shared-memory and distributed-memory. As a result, a new implementation strategy was called for. We describe two approaches that we explored and lay out the more effective one in some detail. We conclude with performance data for point-to-point coordination operations that show that our Linda implementation generally outperforms MPI and PVM on the CRAY T3D and is comparable to MPI on the CRAY T3E. This work thus extends a series of results that have demonstrated `high-level' coordination languages, like Linda can be implemented on modern multiprocessors without significantly compromising performance relative to low-level coordination via message passing.</description><subject>Coordination languages</subject><subject>Linda</subject><subject>NUMA architecture</subject><issn>0167-8191</issn><issn>1872-7336</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1998</creationdate><recordtype>article</recordtype><recordid>eNqFkEtLAzEUhYMoWKs_QZiV6CKaTB6TrKSU-oCqC-06JJkbjMyjJlPBf--0Fbdu7tl853DPQeickmtKqLx5HU-FFdX0UqsrQggnmB-gCVVViSvG5CGa_CHH6CTnjxGSXJEJwrOuiO26gRa6wQ6x74o-FMvY1bYIfSps8bx6mhWt9e-xg1N0FGyT4exXp2h1t3ibP-Dly_3jfLbEnjE2YMqdVNyBcxCU0No5VoF0gpNSSK8ljJ-JquKeERu84E5L4YMQtVWulCVlU3Sxz12n_nMDeTBtzB6axnbQb7IppZSCMD6CYg_61OecIJh1iq1N34YSsx3H7MYx2-ZGK7Mbx2x9t3sfjC2-IiSTfYTOQx0T-MHUffwn4QeDUGmD</recordid><startdate>19980701</startdate><enddate>19980701</enddate><creator>Carriero, Nicholas</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>19980701</creationdate><title>An implementation of Linda for a NUMA machine</title><author>Carriero, Nicholas</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c333t-14b684bebbef8599bb37e6b540256c96e1875774c30afc54b965cf55da8b26213</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1998</creationdate><topic>Coordination languages</topic><topic>Linda</topic><topic>NUMA architecture</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Carriero, Nicholas</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>Carriero, Nicholas</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An implementation of Linda for a NUMA machine</atitle><jtitle>Parallel computing</jtitle><date>1998-07-01</date><risdate>1998</risdate><volume>24</volume><issue>7</issue><spage>1005</spage><epage>1021</epage><pages>1005-1021</pages><issn>0167-8191</issn><eissn>1872-7336</eissn><abstract>After briefly reviewing the implementation strategies for Linda on shared-memory, distributed-memory, and LAN architectures, we discuss a Linda implementation for the CRAY T3D and CRAY T3E. We identify some significant ways in which the architecture of these machines differs from those listed - in essence the CRAY T3D and CRAY T3E can be viewed as instances of an architecture somewhere between shared-memory and distributed-memory. As a result, a new implementation strategy was called for. We describe two approaches that we explored and lay out the more effective one in some detail. We conclude with performance data for point-to-point coordination operations that show that our Linda implementation generally outperforms MPI and PVM on the CRAY T3D and is comparable to MPI on the CRAY T3E. This work thus extends a series of results that have demonstrated `high-level' coordination languages, like Linda can be implemented on modern multiprocessors without significantly compromising performance relative to low-level coordination via message passing.</abstract><pub>Elsevier B.V</pub><doi>10.1016/S0167-8191(98)00040-4</doi><tpages>17</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0167-8191
ispartof Parallel computing, 1998-07, Vol.24 (7), p.1005-1021
issn 0167-8191
1872-7336
language eng
recordid cdi_proquest_miscellaneous_26665034
source Elsevier ScienceDirect Journals Complete
subjects Coordination languages
Linda
NUMA architecture
title An implementation of Linda for a NUMA machine
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-26T10%3A37%3A16IST&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=An%20implementation%20of%20Linda%20for%20a%20NUMA%20machine&rft.jtitle=Parallel%20computing&rft.au=Carriero,%20Nicholas&rft.date=1998-07-01&rft.volume=24&rft.issue=7&rft.spage=1005&rft.epage=1021&rft.pages=1005-1021&rft.issn=0167-8191&rft.eissn=1872-7336&rft_id=info:doi/10.1016/S0167-8191(98)00040-4&rft_dat=%3Cproquest_cross%3E26665034%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=26665034&rft_id=info:pmid/&rft_els_id=S0167819198000404&rfr_iscdi=true