A New Reachability Algorithm for Symmetric Multi-processor Architecture

Partitioned BDD-based algorithms have been proposed in the literature to solve the memory explosion problem in BDD-based verification. A naive parallelization of such algorithms is often ineffective as they have less parallelism. In this paper we present a novel parallel reachability approach that l...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Sahoo, Debashis, Jain, Jawahar, Iyer, Subramanian, Dill, David
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Applied sciences Computer science control theory systems Early Communication Exact sciences and technology Idle Processor Order Binary Decision Diagram Partial Communication Reachability Analysis Software Software engineering
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page	38
container_issue
container_start_page	26
container_title
container_volume
creator	Sahoo, Debashis Jain, Jawahar Iyer, Subramanian Dill, David
description	Partitioned BDD-based algorithms have been proposed in the literature to solve the memory explosion problem in BDD-based verification. A naive parallelization of such algorithms is often ineffective as they have less parallelism. In this paper we present a novel parallel reachability approach that lead to a significantly faster verification on a Symmetric Multi-Processing architecture over the existing one-thread, one-CPU approaches. We identify the issues and bottlenecks in parallelizing BDD-based reachability algorithm. We show that in most cases our algorithm achieves good speedup compared to the existing sequential approaches.
doi_str_mv	10.1007/11562948_5
format	Conference Proceeding
fullrecord	<record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_17199277</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>17199277</sourcerecordid><originalsourceid>FETCH-LOGICAL-p218t-9af0493eb38323d764f16b5a5a1a46ad9d3251c308f9c67d5d5411d5e682c8543</originalsourceid><addsrcrecordid>eNpFkDtPwzAcxM1LopQufIIsSCwB__32GFVQkApIPObIcZzWkDSR7Qr125OqSNxyw-_uhkPoCvAtYCzvALggmqmSH6ELyhmmoIWWx2gCAiCnlOkTNNNS7RnRBGt1iiaYYpJryeg5msX4hUdREGN5ghZF9uJ-sjdn7NpUvvVplxXtqg8-rbus6UP2vus6l4K32fO2TT4fQm9djCMpgl375GzaBneJzhrTRjf78yn6fLj_mD_my9fF07xY5gMBlXJtGsw0dRVVlNBaCtaAqLjhBgwTptY1JRwsxarRVsia15wB1NwJRazijE7R9WF3MNGatglmY30sh-A7E3YlSNCaSDnmbg65OKLNyoWy6vvvWAIu90eW_0fSX8J3XxM</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A New Reachability Algorithm for Symmetric Multi-processor Architecture</title><source>Springer Books</source><creator>Sahoo, Debashis ; Jain, Jawahar ; Iyer, Subramanian ; Dill, David</creator><contributor>Tsay, Yih-Kuen ; Peled, Doron A.</contributor><creatorcontrib>Sahoo, Debashis ; Jain, Jawahar ; Iyer, Subramanian ; Dill, David ; Tsay, Yih-Kuen ; Peled, Doron A.</creatorcontrib><description>Partitioned BDD-based algorithms have been proposed in the literature to solve the memory explosion problem in BDD-based verification. A naive parallelization of such algorithms is often ineffective as they have less parallelism. In this paper we present a novel parallel reachability approach that lead to a significantly faster verification on a Symmetric Multi-Processing architecture over the existing one-thread, one-CPU approaches. We identify the issues and bottlenecks in parallelizing BDD-based reachability algorithm. We show that in most cases our algorithm achieves good speedup compared to the existing sequential approaches.</description><edition>1ère éd</edition><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540292098</identifier><identifier>ISBN: 3540292098</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540319697</identifier><identifier>EISBN: 9783540319696</identifier><identifier>DOI: 10.1007/11562948_5</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Early Communication ; Exact sciences and technology ; Idle Processor ; Order Binary Decision Diagram ; Partial Communication ; Reachability Analysis ; Software ; Software engineering</subject><ispartof>Automated Technology for Verification and Analysis, 2005, p.26-38</ispartof><rights>Springer-Verlag Berlin Heidelberg 2005</rights><rights>2005 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11562948_5$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11562948_5$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,775,776,780,785,786,789,4036,4037,27902,38232,41418,42487</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=17199277$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Tsay, Yih-Kuen</contributor><contributor>Peled, Doron A.</contributor><creatorcontrib>Sahoo, Debashis</creatorcontrib><creatorcontrib>Jain, Jawahar</creatorcontrib><creatorcontrib>Iyer, Subramanian</creatorcontrib><creatorcontrib>Dill, David</creatorcontrib><title>A New Reachability Algorithm for Symmetric Multi-processor Architecture</title><title>Automated Technology for Verification and Analysis</title><description>Partitioned BDD-based algorithms have been proposed in the literature to solve the memory explosion problem in BDD-based verification. A naive parallelization of such algorithms is often ineffective as they have less parallelism. In this paper we present a novel parallel reachability approach that lead to a significantly faster verification on a Symmetric Multi-Processing architecture over the existing one-thread, one-CPU approaches. We identify the issues and bottlenecks in parallelizing BDD-based reachability algorithm. We show that in most cases our algorithm achieves good speedup compared to the existing sequential approaches.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Early Communication</subject><subject>Exact sciences and technology</subject><subject>Idle Processor</subject><subject>Order Binary Decision Diagram</subject><subject>Partial Communication</subject><subject>Reachability Analysis</subject><subject>Software</subject><subject>Software engineering</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540292098</isbn><isbn>3540292098</isbn><isbn>3540319697</isbn><isbn>9783540319696</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpFkDtPwzAcxM1LopQufIIsSCwB__32GFVQkApIPObIcZzWkDSR7Qr125OqSNxyw-_uhkPoCvAtYCzvALggmqmSH6ELyhmmoIWWx2gCAiCnlOkTNNNS7RnRBGt1iiaYYpJryeg5msX4hUdREGN5ghZF9uJ-sjdn7NpUvvVplxXtqg8-rbus6UP2vus6l4K32fO2TT4fQm9djCMpgl375GzaBneJzhrTRjf78yn6fLj_mD_my9fF07xY5gMBlXJtGsw0dRVVlNBaCtaAqLjhBgwTptY1JRwsxarRVsia15wB1NwJRazijE7R9WF3MNGatglmY30sh-A7E3YlSNCaSDnmbg65OKLNyoWy6vvvWAIu90eW_0fSX8J3XxM</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Sahoo, Debashis</creator><creator>Jain, Jawahar</creator><creator>Iyer, Subramanian</creator><creator>Dill, David</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2005</creationdate><title>A New Reachability Algorithm for Symmetric Multi-processor Architecture</title><author>Sahoo, Debashis ; Jain, Jawahar ; Iyer, Subramanian ; Dill, David</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p218t-9af0493eb38323d764f16b5a5a1a46ad9d3251c308f9c67d5d5411d5e682c8543</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Early Communication</topic><topic>Exact sciences and technology</topic><topic>Idle Processor</topic><topic>Order Binary Decision Diagram</topic><topic>Partial Communication</topic><topic>Reachability Analysis</topic><topic>Software</topic><topic>Software engineering</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Sahoo, Debashis</creatorcontrib><creatorcontrib>Jain, Jawahar</creatorcontrib><creatorcontrib>Iyer, Subramanian</creatorcontrib><creatorcontrib>Dill, David</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Sahoo, Debashis</au><au>Jain, Jawahar</au><au>Iyer, Subramanian</au><au>Dill, David</au><au>Tsay, Yih-Kuen</au><au>Peled, Doron A.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A New Reachability Algorithm for Symmetric Multi-processor Architecture</atitle><btitle>Automated Technology for Verification and Analysis</btitle><date>2005</date><risdate>2005</risdate><spage>26</spage><epage>38</epage><pages>26-38</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540292098</isbn><isbn>3540292098</isbn><eisbn>3540319697</eisbn><eisbn>9783540319696</eisbn><abstract>Partitioned BDD-based algorithms have been proposed in the literature to solve the memory explosion problem in BDD-based verification. A naive parallelization of such algorithms is often ineffective as they have less parallelism. In this paper we present a novel parallel reachability approach that lead to a significantly faster verification on a Symmetric Multi-Processing architecture over the existing one-thread, one-CPU approaches. We identify the issues and bottlenecks in parallelizing BDD-based reachability algorithm. We show that in most cases our algorithm achieves good speedup compared to the existing sequential approaches.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11562948_5</doi><tpages>13</tpages><edition>1ère éd</edition></addata></record>
fulltext	fulltext
identifier	ISSN: 0302-9743
ispartof	Automated Technology for Verification and Analysis, 2005, p.26-38
issn	0302-9743 1611-3349
language	eng
recordid	cdi_pascalfrancis_primary_17199277
source	Springer Books
subjects	Applied sciences Computer science control theory systems Early Communication Exact sciences and technology Idle Processor Order Binary Decision Diagram Partial Communication Reachability Analysis Software Software engineering
title	A New Reachability Algorithm for Symmetric Multi-processor Architecture
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-08T09%3A47%3A04IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=A%20New%20Reachability%20Algorithm%20for%20Symmetric%20Multi-processor%20Architecture&rft.btitle=Automated%20Technology%20for%20Verification%20and%20Analysis&rft.au=Sahoo,%20Debashis&rft.date=2005&rft.spage=26&rft.epage=38&rft.pages=26-38&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540292098&rft.isbn_list=3540292098&rft_id=info:doi/10.1007/11562948_5&rft_dat=%3Cpascalfrancis_sprin%3E17199277%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540319697&rft.eisbn_list=9783540319696&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true