Architectural mechanisms to support sparse vector processing

We discuss the algorithmic steps involved in common sparse matrix problems, with particular emphasis on linear programming by the revised simplex method. We then propose new architectural mechanisms which are being built into an experimental machine, the Edinburgh Sparse Processor, and which enable...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computer architecture news 1989-06, Vol.17 (3), p.64-71
Hauptverfasser: Ibbett, R. N., Hopkins, T. M., McKinnon, K. I. M.
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 71
container_issue 3
container_start_page 64
container_title Computer architecture news
container_volume 17
creator Ibbett, R. N.
Hopkins, T. M.
McKinnon, K. I. M.
description We discuss the algorithmic steps involved in common sparse matrix problems, with particular emphasis on linear programming by the revised simplex method. We then propose new architectural mechanisms which are being built into an experimental machine, the Edinburgh Sparse Processor, and which enable vector instructions to operate efficiently on sparse vectors stored in compressed form. Finally, we review the use of these new mechanisms on the linear programming problem.
doi_str_mv 10.1145/74926.74933
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_29424873</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>29424873</sourcerecordid><originalsourceid>FETCH-LOGICAL-c673-2c5796614c69df8fcf0834988e478a2c484bcc6c586d307000fa1d776f3553003</originalsourceid><addsrcrecordid>eNotkEtLAzEUhbNQsFZX_oGs3MjUZPIccFOKLyi46T7EO4kdmWnG3BnBf29s3ZzLgY974CPkhrMV51LdG9nUelVSiDOyYFyLSjVaXpBLxE9WuhFsQR7WGfbdFGCas-_pEGDvDx0OSKdEcR7HlCeKo88Y6HehUqZjThAQu8PHFTmPvsdw_X-XZPf0uNu8VNu359fNeltBGalqUKbRmkvQTRtthMiskI21QRrra5BWvgNoUFa3ghnGWPS8NUZHoZRgTCzJ7eltWf6aA05u6BBC3_tDSDO6upG1tEYU8O4EQk6IOUQ35m7w-cdx5v6kuKMUd5QifgHJKlWb</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>29424873</pqid></control><display><type>article</type><title>Architectural mechanisms to support sparse vector processing</title><source>ACM Digital Library Complete</source><creator>Ibbett, R. N. ; Hopkins, T. M. ; McKinnon, K. I. M.</creator><creatorcontrib>Ibbett, R. N. ; Hopkins, T. M. ; McKinnon, K. I. M.</creatorcontrib><description>We discuss the algorithmic steps involved in common sparse matrix problems, with particular emphasis on linear programming by the revised simplex method. We then propose new architectural mechanisms which are being built into an experimental machine, the Edinburgh Sparse Processor, and which enable vector instructions to operate efficiently on sparse vectors stored in compressed form. Finally, we review the use of these new mechanisms on the linear programming problem.</description><identifier>ISSN: 0163-5964</identifier><identifier>DOI: 10.1145/74926.74933</identifier><language>eng</language><ispartof>Computer architecture news, 1989-06, Vol.17 (3), p.64-71</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c673-2c5796614c69df8fcf0834988e478a2c484bcc6c586d307000fa1d776f3553003</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Ibbett, R. N.</creatorcontrib><creatorcontrib>Hopkins, T. M.</creatorcontrib><creatorcontrib>McKinnon, K. I. M.</creatorcontrib><title>Architectural mechanisms to support sparse vector processing</title><title>Computer architecture news</title><description>We discuss the algorithmic steps involved in common sparse matrix problems, with particular emphasis on linear programming by the revised simplex method. We then propose new architectural mechanisms which are being built into an experimental machine, the Edinburgh Sparse Processor, and which enable vector instructions to operate efficiently on sparse vectors stored in compressed form. Finally, we review the use of these new mechanisms on the linear programming problem.</description><issn>0163-5964</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1989</creationdate><recordtype>article</recordtype><recordid>eNotkEtLAzEUhbNQsFZX_oGs3MjUZPIccFOKLyi46T7EO4kdmWnG3BnBf29s3ZzLgY974CPkhrMV51LdG9nUelVSiDOyYFyLSjVaXpBLxE9WuhFsQR7WGfbdFGCas-_pEGDvDx0OSKdEcR7HlCeKo88Y6HehUqZjThAQu8PHFTmPvsdw_X-XZPf0uNu8VNu359fNeltBGalqUKbRmkvQTRtthMiskI21QRrra5BWvgNoUFa3ghnGWPS8NUZHoZRgTCzJ7eltWf6aA05u6BBC3_tDSDO6upG1tEYU8O4EQk6IOUQ35m7w-cdx5v6kuKMUd5QifgHJKlWb</recordid><startdate>198906</startdate><enddate>198906</enddate><creator>Ibbett, R. N.</creator><creator>Hopkins, T. M.</creator><creator>McKinnon, K. I. M.</creator><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>198906</creationdate><title>Architectural mechanisms to support sparse vector processing</title><author>Ibbett, R. N. ; Hopkins, T. M. ; McKinnon, K. I. M.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c673-2c5796614c69df8fcf0834988e478a2c484bcc6c586d307000fa1d776f3553003</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1989</creationdate><toplevel>online_resources</toplevel><creatorcontrib>Ibbett, R. N.</creatorcontrib><creatorcontrib>Hopkins, T. M.</creatorcontrib><creatorcontrib>McKinnon, K. I. M.</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>Computer architecture news</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ibbett, R. N.</au><au>Hopkins, T. M.</au><au>McKinnon, K. I. M.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Architectural mechanisms to support sparse vector processing</atitle><jtitle>Computer architecture news</jtitle><date>1989-06</date><risdate>1989</risdate><volume>17</volume><issue>3</issue><spage>64</spage><epage>71</epage><pages>64-71</pages><issn>0163-5964</issn><abstract>We discuss the algorithmic steps involved in common sparse matrix problems, with particular emphasis on linear programming by the revised simplex method. We then propose new architectural mechanisms which are being built into an experimental machine, the Edinburgh Sparse Processor, and which enable vector instructions to operate efficiently on sparse vectors stored in compressed form. Finally, we review the use of these new mechanisms on the linear programming problem.</abstract><doi>10.1145/74926.74933</doi><tpages>8</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0163-5964
ispartof Computer architecture news, 1989-06, Vol.17 (3), p.64-71
issn 0163-5964
language eng
recordid cdi_proquest_miscellaneous_29424873
source ACM Digital Library Complete
title Architectural mechanisms to support sparse vector processing
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T01%3A44%3A26IST&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=Architectural%20mechanisms%20to%20support%20sparse%20vector%20processing&rft.jtitle=Computer%20architecture%20news&rft.au=Ibbett,%20R.%20N.&rft.date=1989-06&rft.volume=17&rft.issue=3&rft.spage=64&rft.epage=71&rft.pages=64-71&rft.issn=0163-5964&rft_id=info:doi/10.1145/74926.74933&rft_dat=%3Cproquest_cross%3E29424873%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=29424873&rft_id=info:pmid/&rfr_iscdi=true