The Impact of Cache Coherence Protocols on Parallel Logic Programming Systems
In this paper we use execution-driven simulation of a scalable multiprocessor to evaluate the performance of the Andorra-I parallel logic programming system under invalidate and update-based protocols. We use two versions of Andorra-I. One of them was originally designed for bus-based multiprocessor...
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Buchkapitel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 1299 |
---|---|
container_issue | |
container_start_page | 1285 |
container_title | |
container_volume | 1861 |
creator | de Castro Dutra, Inês Costa, Vítor Santos Bianchini, Ricardo |
description | In this paper we use execution-driven simulation of a scalable multiprocessor to evaluate the performance of the Andorra-I parallel logic programming system under invalidate and update-based protocols. We use two versions of Andorra-I. One of them was originally designed for bus-based multiprocessors, while the other is optimised for scalable architectures. We study a well-known invalidate protocol and two different update-based protocols. Our results show that for our sample logic programs the update-based protocols outperform their invalidate-based counterpart for the original version of Andorra-I. In contrast, the optimised version of Andorra-I benefits the most from the invalidate-based protocol, but a hybrid update-based protocol performs as well as the invalidate protocol in most cases. We conclude that parallel logic programming systems can consistently benefit from hybrid update-based protocols. |
doi_str_mv | 10.1007/3-540-44957-4_86 |
format | Book Chapter |
fullrecord | <record><control><sourceid>proquest_pasca</sourceid><recordid>TN_cdi_pascalfrancis_primary_1381476</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>EBC3071603_92_1304</sourcerecordid><originalsourceid>FETCH-LOGICAL-p268t-4511cec92adb74475ee0ef11e96cd531b821a54247df9fdd7668fc17acb6f36b3</originalsourceid><addsrcrecordid>eNo9UE1v2zAMVbduWNDlvqMPvboTJVm0jkPQjwAZWmDdWZBlOklrW57kHvLvq6TBeCH43uMj-Bj7AfwGOMefsqwUL5UyFZbK1vqCLQ3WMoMnDD-xBWiAUkplPv_nNKJBfskWXHJRGlTyK1ugNoggEL-xZUovPJcUIisW7Pfzjor1MDk_F6ErVs7neRV2FGn0VDzFMAcf-lSEsXhy0fU99cUmbPf-yG2jG4b9uC3-HNJMQ_rOvnSuT7Q89yv29-72efVQbh7v16tfm3ISup5LVQF48ka4tkGlsCLi1AGQ0b6tJDS1AFcpobDtTNe2qHXdeUDnG91J3cgrdv3hO7nkXd9FN_p9slPcDy4eLMgaFOosu_mQpcyMW4q2CeE1WeD2GLGVNidmT3HaY8R5QZ19Y_j3Rmm2dNzwNM75db9z00wxWckRNJfWiHyKK_kO16B48Q</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype><pqid>EBC3071603_92_1304</pqid></control><display><type>book_chapter</type><title>The Impact of Cache Coherence Protocols on Parallel Logic Programming Systems</title><source>Springer Books</source><creator>de Castro Dutra, Inês ; Costa, Vítor Santos ; Bianchini, Ricardo</creator><contributor>Pereira, Luis M ; Stuckey, Peter J ; Lau, Kung-Kiu ; Palamidessi, Catuscia ; Kerber, Manfred ; Lloyd, John ; Sagiv, Yehoshua ; Furbach, Ulrich ; Dahl, Veronica ; Lloyd, John ; Furbach, Ulrich ; Pereira, Luís Moniz ; Kerber, Manfred ; Palamidessi, Catuscia ; Dahl, Veronica ; Lau, Kung-Kiu ; Sagiv, Yehoshua ; Stuckey, Peter J.</contributor><creatorcontrib>de Castro Dutra, Inês ; Costa, Vítor Santos ; Bianchini, Ricardo ; Pereira, Luis M ; Stuckey, Peter J ; Lau, Kung-Kiu ; Palamidessi, Catuscia ; Kerber, Manfred ; Lloyd, John ; Sagiv, Yehoshua ; Furbach, Ulrich ; Dahl, Veronica ; Lloyd, John ; Furbach, Ulrich ; Pereira, Luís Moniz ; Kerber, Manfred ; Palamidessi, Catuscia ; Dahl, Veronica ; Lau, Kung-Kiu ; Sagiv, Yehoshua ; Stuckey, Peter J.</creatorcontrib><description>In this paper we use execution-driven simulation of a scalable multiprocessor to evaluate the performance of the Andorra-I parallel logic programming system under invalidate and update-based protocols. We use two versions of Andorra-I. One of them was originally designed for bus-based multiprocessors, while the other is optimised for scalable architectures. We study a well-known invalidate protocol and two different update-based protocols. Our results show that for our sample logic programs the update-based protocols outperform their invalidate-based counterpart for the original version of Andorra-I. In contrast, the optimised version of Andorra-I benefits the most from the invalidate-based protocol, but a hybrid update-based protocol performs as well as the invalidate protocol in most cases. We conclude that parallel logic programming systems can consistently benefit from hybrid update-based protocols.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540677970</identifier><identifier>ISBN: 3540677976</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540449577</identifier><identifier>EISBN: 3540449574</identifier><identifier>DOI: 10.1007/3-540-44957-4_86</identifier><identifier>OCLC: 769771277</identifier><identifier>LCCallNum: Q334-342</identifier><language>eng</language><publisher>Germany: Springer Berlin / Heidelberg</publisher><subject>Applied sciences ; Artificial intelligence ; cache coherence protocols ; Computer science; control theory; systems ; DSM architectures ; Exact sciences and technology ; Logic programming ; Miscellaneous ; parallelism ; performance evaluation</subject><ispartof>Computational Logic -- CL 2000, 2000, Vol.1861, p.1285-1299</ispartof><rights>Springer-Verlag Berlin Heidelberg 2000</rights><rights>2000 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttps://ebookcentral.proquest.com/covers/3071603-l.jpg</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/3-540-44957-4_86$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/3-540-44957-4_86$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,779,780,784,789,790,793,4050,4051,27925,38255,41442,42511</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=1381476$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Pereira, Luis M</contributor><contributor>Stuckey, Peter J</contributor><contributor>Lau, Kung-Kiu</contributor><contributor>Palamidessi, Catuscia</contributor><contributor>Kerber, Manfred</contributor><contributor>Lloyd, John</contributor><contributor>Sagiv, Yehoshua</contributor><contributor>Furbach, Ulrich</contributor><contributor>Dahl, Veronica</contributor><contributor>Lloyd, John</contributor><contributor>Furbach, Ulrich</contributor><contributor>Pereira, Luís Moniz</contributor><contributor>Kerber, Manfred</contributor><contributor>Palamidessi, Catuscia</contributor><contributor>Dahl, Veronica</contributor><contributor>Lau, Kung-Kiu</contributor><contributor>Sagiv, Yehoshua</contributor><contributor>Stuckey, Peter J.</contributor><creatorcontrib>de Castro Dutra, Inês</creatorcontrib><creatorcontrib>Costa, Vítor Santos</creatorcontrib><creatorcontrib>Bianchini, Ricardo</creatorcontrib><title>The Impact of Cache Coherence Protocols on Parallel Logic Programming Systems</title><title>Computational Logic -- CL 2000</title><description>In this paper we use execution-driven simulation of a scalable multiprocessor to evaluate the performance of the Andorra-I parallel logic programming system under invalidate and update-based protocols. We use two versions of Andorra-I. One of them was originally designed for bus-based multiprocessors, while the other is optimised for scalable architectures. We study a well-known invalidate protocol and two different update-based protocols. Our results show that for our sample logic programs the update-based protocols outperform their invalidate-based counterpart for the original version of Andorra-I. In contrast, the optimised version of Andorra-I benefits the most from the invalidate-based protocol, but a hybrid update-based protocol performs as well as the invalidate protocol in most cases. We conclude that parallel logic programming systems can consistently benefit from hybrid update-based protocols.</description><subject>Applied sciences</subject><subject>Artificial intelligence</subject><subject>cache coherence protocols</subject><subject>Computer science; control theory; systems</subject><subject>DSM architectures</subject><subject>Exact sciences and technology</subject><subject>Logic programming</subject><subject>Miscellaneous</subject><subject>parallelism</subject><subject>performance evaluation</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540677970</isbn><isbn>3540677976</isbn><isbn>9783540449577</isbn><isbn>3540449574</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>2000</creationdate><recordtype>book_chapter</recordtype><recordid>eNo9UE1v2zAMVbduWNDlvqMPvboTJVm0jkPQjwAZWmDdWZBlOklrW57kHvLvq6TBeCH43uMj-Bj7AfwGOMefsqwUL5UyFZbK1vqCLQ3WMoMnDD-xBWiAUkplPv_nNKJBfskWXHJRGlTyK1ugNoggEL-xZUovPJcUIisW7Pfzjor1MDk_F6ErVs7neRV2FGn0VDzFMAcf-lSEsXhy0fU99cUmbPf-yG2jG4b9uC3-HNJMQ_rOvnSuT7Q89yv29-72efVQbh7v16tfm3ISup5LVQF48ka4tkGlsCLi1AGQ0b6tJDS1AFcpobDtTNe2qHXdeUDnG91J3cgrdv3hO7nkXd9FN_p9slPcDy4eLMgaFOosu_mQpcyMW4q2CeE1WeD2GLGVNidmT3HaY8R5QZ19Y_j3Rmm2dNzwNM75db9z00wxWckRNJfWiHyKK_kO16B48Q</recordid><startdate>2000</startdate><enddate>2000</enddate><creator>de Castro Dutra, Inês</creator><creator>Costa, Vítor Santos</creator><creator>Bianchini, Ricardo</creator><general>Springer Berlin / Heidelberg</general><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>FFUUA</scope><scope>IQODW</scope></search><sort><creationdate>2000</creationdate><title>The Impact of Cache Coherence Protocols on Parallel Logic Programming Systems</title><author>de Castro Dutra, Inês ; Costa, Vítor Santos ; Bianchini, Ricardo</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p268t-4511cec92adb74475ee0ef11e96cd531b821a54247df9fdd7668fc17acb6f36b3</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>2000</creationdate><topic>Applied sciences</topic><topic>Artificial intelligence</topic><topic>cache coherence protocols</topic><topic>Computer science; control theory; systems</topic><topic>DSM architectures</topic><topic>Exact sciences and technology</topic><topic>Logic programming</topic><topic>Miscellaneous</topic><topic>parallelism</topic><topic>performance evaluation</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>de Castro Dutra, Inês</creatorcontrib><creatorcontrib>Costa, Vítor Santos</creatorcontrib><creatorcontrib>Bianchini, Ricardo</creatorcontrib><collection>ProQuest Ebook Central - Book Chapters - Demo use only</collection><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>de Castro Dutra, Inês</au><au>Costa, Vítor Santos</au><au>Bianchini, Ricardo</au><au>Pereira, Luis M</au><au>Stuckey, Peter J</au><au>Lau, Kung-Kiu</au><au>Palamidessi, Catuscia</au><au>Kerber, Manfred</au><au>Lloyd, John</au><au>Sagiv, Yehoshua</au><au>Furbach, Ulrich</au><au>Dahl, Veronica</au><au>Lloyd, John</au><au>Furbach, Ulrich</au><au>Pereira, Luís Moniz</au><au>Kerber, Manfred</au><au>Palamidessi, Catuscia</au><au>Dahl, Veronica</au><au>Lau, Kung-Kiu</au><au>Sagiv, Yehoshua</au><au>Stuckey, Peter J.</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>The Impact of Cache Coherence Protocols on Parallel Logic Programming Systems</atitle><btitle>Computational Logic -- CL 2000</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>2000</date><risdate>2000</risdate><volume>1861</volume><spage>1285</spage><epage>1299</epage><pages>1285-1299</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540677970</isbn><isbn>3540677976</isbn><eisbn>9783540449577</eisbn><eisbn>3540449574</eisbn><abstract>In this paper we use execution-driven simulation of a scalable multiprocessor to evaluate the performance of the Andorra-I parallel logic programming system under invalidate and update-based protocols. We use two versions of Andorra-I. One of them was originally designed for bus-based multiprocessors, while the other is optimised for scalable architectures. We study a well-known invalidate protocol and two different update-based protocols. Our results show that for our sample logic programs the update-based protocols outperform their invalidate-based counterpart for the original version of Andorra-I. In contrast, the optimised version of Andorra-I benefits the most from the invalidate-based protocol, but a hybrid update-based protocol performs as well as the invalidate protocol in most cases. We conclude that parallel logic programming systems can consistently benefit from hybrid update-based protocols.</abstract><cop>Germany</cop><pub>Springer Berlin / Heidelberg</pub><doi>10.1007/3-540-44957-4_86</doi><oclcid>769771277</oclcid><tpages>15</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0302-9743 |
ispartof | Computational Logic -- CL 2000, 2000, Vol.1861, p.1285-1299 |
issn | 0302-9743 1611-3349 |
language | eng |
recordid | cdi_pascalfrancis_primary_1381476 |
source | Springer Books |
subjects | Applied sciences Artificial intelligence cache coherence protocols Computer science control theory systems DSM architectures Exact sciences and technology Logic programming Miscellaneous parallelism performance evaluation |
title | The Impact of Cache Coherence Protocols on Parallel Logic Programming Systems |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-21T14%3A43%3A10IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=The%20Impact%20of%20Cache%20Coherence%20Protocols%20on%20Parallel%20Logic%20Programming%20Systems&rft.btitle=Computational%20Logic%20--%20CL%202000&rft.au=de%20Castro%20Dutra,%20In%C3%AAs&rft.date=2000&rft.volume=1861&rft.spage=1285&rft.epage=1299&rft.pages=1285-1299&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540677970&rft.isbn_list=3540677976&rft_id=info:doi/10.1007/3-540-44957-4_86&rft_dat=%3Cproquest_pasca%3EEBC3071603_92_1304%3C/proquest_pasca%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540449577&rft.eisbn_list=3540449574&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=EBC3071603_92_1304&rft_id=info:pmid/&rfr_iscdi=true |