A parallel unification machine

A parallel unification machine

A parallel unification machine (PUM) that speeds up the unification algorithm is proposed. The PUM partitions unification into a match step and a consistency-check step, conducts these two steps concurrently, and takes advantage of the match parallelism. The machine architecture, algorithms, data fo...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE MICRO 1990-08, Vol.10 (4), p.21-33
Hauptverfasser: Sibai, F.N., Watson, K.L., Lu, M.
Format: Artikel
Sprache:eng
Schlagworte:
Application software
Artificial intelligence
Expert systems
Image databases
Logic programming
Magnetic heads
Natural languages
Runtime
Spatial databases
Speech
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 33
container_issue 4
container_start_page 21
container_title IEEE MICRO
container_volume 10
creator Sibai, F.N.
Watson, K.L.
Lu, M.
description A parallel unification machine (PUM) that speeds up the unification algorithm is proposed. The PUM partitions unification into a match step and a consistency-check step, conducts these two steps concurrently, and takes advantage of the match parallelism. The machine architecture, algorithms, data formats, and processor organization are described. The machine has been simulated at the register-transfer level with the ISPS computer description language. The simulated performance is compared with that of two serial unification coprocessors. Significant speedup is observed.< >
doi_str_mv 10.1109/40.57728
format Article
fullrecord <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_57728</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>57728</ieee_id><sourcerecordid>28836884</sourcerecordid><originalsourceid>FETCH-LOGICAL-c274t-3dc7ae422e6e71d89e9961830714064e981ad2cd704582add712f327b1588bf53</originalsourceid><addsrcrecordid>eNo90DtLxEAUBeBBFIyrYGsjqcQm6713JplJuSy-YMFG62F2coMjeZlJCv-9qxGrU5yPUxwhLhHWiFDeKVjnWpM5EgmWUmcKlTwWCZCmDLWkU3EW4wcA5AQmEdebdHCjaxpu0rkLdfBuCn2Xts6_h47PxUntmsgXf7kSbw_3r9unbPfy-Lzd7DJPWk2ZrLx2rIi4YI2VKbksCzQSNCooFJcGXUW-0qByQ66qNFItSe8xN2Zf53IlbpbdYew_Z46TbUP03DSu436OloyRhTHqAG8X6Mc-xpFrO4yhdeOXRbA_B1gF9veAA71aaGDmf7Z0398qUrs</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>28836884</pqid></control><display><type>article</type><title>A parallel unification machine</title><source>IEEE/IET Electronic Library (IEL)</source><creator>Sibai, F.N. ; Watson, K.L. ; Lu, M.</creator><creatorcontrib>Sibai, F.N. ; Watson, K.L. ; Lu, M.</creatorcontrib><description>A parallel unification machine (PUM) that speeds up the unification algorithm is proposed. The PUM partitions unification into a match step and a consistency-check step, conducts these two steps concurrently, and takes advantage of the match parallelism. The machine architecture, algorithms, data formats, and processor organization are described. The machine has been simulated at the register-transfer level with the ISPS computer description language. The simulated performance is compared with that of two serial unification coprocessors. Significant speedup is observed.&lt; &gt;</description><identifier>ISSN: 0272-1732</identifier><identifier>EISSN: 1937-4143</identifier><identifier>DOI: 10.1109/40.57728</identifier><identifier>CODEN: IEMIDZ</identifier><language>eng</language><publisher>IEEE</publisher><subject>Application software ; Artificial intelligence ; Expert systems ; Image databases ; Logic programming ; Magnetic heads ; Natural languages ; Runtime ; Spatial databases ; Speech</subject><ispartof>IEEE MICRO, 1990-08, Vol.10 (4), p.21-33</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c274t-3dc7ae422e6e71d89e9961830714064e981ad2cd704582add712f327b1588bf53</citedby><cites>FETCH-LOGICAL-c274t-3dc7ae422e6e71d89e9961830714064e981ad2cd704582add712f327b1588bf53</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/57728$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/57728$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Sibai, F.N.</creatorcontrib><creatorcontrib>Watson, K.L.</creatorcontrib><creatorcontrib>Lu, M.</creatorcontrib><title>A parallel unification machine</title><title>IEEE MICRO</title><addtitle>MM</addtitle><description>A parallel unification machine (PUM) that speeds up the unification algorithm is proposed. The PUM partitions unification into a match step and a consistency-check step, conducts these two steps concurrently, and takes advantage of the match parallelism. The machine architecture, algorithms, data formats, and processor organization are described. The machine has been simulated at the register-transfer level with the ISPS computer description language. The simulated performance is compared with that of two serial unification coprocessors. Significant speedup is observed.&lt; &gt;</description><subject>Application software</subject><subject>Artificial intelligence</subject><subject>Expert systems</subject><subject>Image databases</subject><subject>Logic programming</subject><subject>Magnetic heads</subject><subject>Natural languages</subject><subject>Runtime</subject><subject>Spatial databases</subject><subject>Speech</subject><issn>0272-1732</issn><issn>1937-4143</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1990</creationdate><recordtype>article</recordtype><recordid>eNo90DtLxEAUBeBBFIyrYGsjqcQm6713JplJuSy-YMFG62F2coMjeZlJCv-9qxGrU5yPUxwhLhHWiFDeKVjnWpM5EgmWUmcKlTwWCZCmDLWkU3EW4wcA5AQmEdebdHCjaxpu0rkLdfBuCn2Xts6_h47PxUntmsgXf7kSbw_3r9unbPfy-Lzd7DJPWk2ZrLx2rIi4YI2VKbksCzQSNCooFJcGXUW-0qByQ66qNFItSe8xN2Zf53IlbpbdYew_Z46TbUP03DSu436OloyRhTHqAG8X6Mc-xpFrO4yhdeOXRbA_B1gF9veAA71aaGDmf7Z0398qUrs</recordid><startdate>19900801</startdate><enddate>19900801</enddate><creator>Sibai, F.N.</creator><creator>Watson, K.L.</creator><creator>Lu, M.</creator><general>IEEE</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19900801</creationdate><title>A parallel unification machine</title><author>Sibai, F.N. ; Watson, K.L. ; Lu, M.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c274t-3dc7ae422e6e71d89e9961830714064e981ad2cd704582add712f327b1588bf53</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1990</creationdate><topic>Application software</topic><topic>Artificial intelligence</topic><topic>Expert systems</topic><topic>Image databases</topic><topic>Logic programming</topic><topic>Magnetic heads</topic><topic>Natural languages</topic><topic>Runtime</topic><topic>Spatial databases</topic><topic>Speech</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Sibai, F.N.</creatorcontrib><creatorcontrib>Watson, K.L.</creatorcontrib><creatorcontrib>Lu, M.</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; Communications 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>IEEE MICRO</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Sibai, F.N.</au><au>Watson, K.L.</au><au>Lu, M.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A parallel unification machine</atitle><jtitle>IEEE MICRO</jtitle><stitle>MM</stitle><date>1990-08-01</date><risdate>1990</risdate><volume>10</volume><issue>4</issue><spage>21</spage><epage>33</epage><pages>21-33</pages><issn>0272-1732</issn><eissn>1937-4143</eissn><coden>IEMIDZ</coden><abstract>A parallel unification machine (PUM) that speeds up the unification algorithm is proposed. The PUM partitions unification into a match step and a consistency-check step, conducts these two steps concurrently, and takes advantage of the match parallelism. The machine architecture, algorithms, data formats, and processor organization are described. The machine has been simulated at the register-transfer level with the ISPS computer description language. The simulated performance is compared with that of two serial unification coprocessors. Significant speedup is observed.&lt; &gt;</abstract><pub>IEEE</pub><doi>10.1109/40.57728</doi><tpages>13</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 0272-1732
ispartof IEEE MICRO, 1990-08, Vol.10 (4), p.21-33
issn 0272-1732
1937-4143
language eng
recordid cdi_ieee_primary_57728
source IEEE/IET Electronic Library (IEL)
subjects Application software
Artificial intelligence
Expert systems
Image databases
Logic programming
Magnetic heads
Natural languages
Runtime
Spatial databases
Speech
title A parallel unification machine
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-03T17%3A21%3A23IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20parallel%20unification%20machine&rft.jtitle=IEEE%20MICRO&rft.au=Sibai,%20F.N.&rft.date=1990-08-01&rft.volume=10&rft.issue=4&rft.spage=21&rft.epage=33&rft.pages=21-33&rft.issn=0272-1732&rft.eissn=1937-4143&rft.coden=IEMIDZ&rft_id=info:doi/10.1109/40.57728&rft_dat=%3Cproquest_RIE%3E28836884%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=28836884&rft_id=info:pmid/&rft_ieee_id=57728&rfr_iscdi=true