Parallel Exploration of Directed Acyclic Graphs using the Actor Model

Parallel Exploration of Directed Acyclic Graphs using the Actor Model

In this paper we describe a generic scheme for the parallel exploration of directed acyclic graphs starting from one or more `roots' of the graph. Our scheme is designed for graphs with the following properties, (i) discovering neighbors at any node requires a non-trivial amount of computation,...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2022-12
Hauptverfasser: Prabhu, Rahul, Verma, Amit, Sitharam, Meera
Format: Artikel
Sprache:eng
Schlagworte:
Graph theory
Graphs
Nodes
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Prabhu, Rahul
Verma, Amit
Sitharam, Meera
description In this paper we describe a generic scheme for the parallel exploration of directed acyclic graphs starting from one or more `roots' of the graph. Our scheme is designed for graphs with the following properties, (i) discovering neighbors at any node requires a non-trivial amount of computation, it is not a simple lookup; (ii) once a node is processed, all its neighbors are discovered; (iii) each node can be discovered through multiple paths, but should only be processed once. Several computational problems can be reduced to traversing such graphs, where the goal is to explore the graph and build a traversal roadmap. As a proof of concept for the effectiveness of our scheme at achieving speedup due to parallelism, we implement the scheme for the parallel exploration of assembly landscape using the EASAL methodology.
format Article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2753896962</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2753896962</sourcerecordid><originalsourceid>FETCH-proquest_journals_27538969623</originalsourceid><addsrcrecordid>eNqNyr0KwjAUQOEgCBbtO1xwLtTE9GcUrboIDu4lpKlNuTT1JgV9ezv4AE5n-M6CRVyIXVLsOV-x2Ps-TVOe5VxKEbHqrkghGoTqPaIjFawbwLVwsmR0MA0c9Eej1XAhNXYeJm-HJ4TOzBAcwc01Bjds2Sr0Jv51zbbn6nG8JiO512R8qHs30TBTzXMpijIrMy7-u75KoTqF</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2753896962</pqid></control><display><type>article</type><title>Parallel Exploration of Directed Acyclic Graphs using the Actor Model</title><source>Free E- Journals</source><creator>Prabhu, Rahul ; Verma, Amit ; Sitharam, Meera</creator><creatorcontrib>Prabhu, Rahul ; Verma, Amit ; Sitharam, Meera</creatorcontrib><description>In this paper we describe a generic scheme for the parallel exploration of directed acyclic graphs starting from one or more `roots' of the graph. Our scheme is designed for graphs with the following properties, (i) discovering neighbors at any node requires a non-trivial amount of computation, it is not a simple lookup; (ii) once a node is processed, all its neighbors are discovered; (iii) each node can be discovered through multiple paths, but should only be processed once. Several computational problems can be reduced to traversing such graphs, where the goal is to explore the graph and build a traversal roadmap. As a proof of concept for the effectiveness of our scheme at achieving speedup due to parallelism, we implement the scheme for the parallel exploration of assembly landscape using the EASAL methodology.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Graph theory ; Graphs ; Nodes</subject><ispartof>arXiv.org, 2022-12</ispartof><rights>2022. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>780,784</link.rule.ids></links><search><creatorcontrib>Prabhu, Rahul</creatorcontrib><creatorcontrib>Verma, Amit</creatorcontrib><creatorcontrib>Sitharam, Meera</creatorcontrib><title>Parallel Exploration of Directed Acyclic Graphs using the Actor Model</title><title>arXiv.org</title><description>In this paper we describe a generic scheme for the parallel exploration of directed acyclic graphs starting from one or more `roots' of the graph. Our scheme is designed for graphs with the following properties, (i) discovering neighbors at any node requires a non-trivial amount of computation, it is not a simple lookup; (ii) once a node is processed, all its neighbors are discovered; (iii) each node can be discovered through multiple paths, but should only be processed once. Several computational problems can be reduced to traversing such graphs, where the goal is to explore the graph and build a traversal roadmap. As a proof of concept for the effectiveness of our scheme at achieving speedup due to parallelism, we implement the scheme for the parallel exploration of assembly landscape using the EASAL methodology.</description><subject>Graph theory</subject><subject>Graphs</subject><subject>Nodes</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNqNyr0KwjAUQOEgCBbtO1xwLtTE9GcUrboIDu4lpKlNuTT1JgV9ezv4AE5n-M6CRVyIXVLsOV-x2Ps-TVOe5VxKEbHqrkghGoTqPaIjFawbwLVwsmR0MA0c9Eej1XAhNXYeJm-HJ4TOzBAcwc01Bjds2Sr0Jv51zbbn6nG8JiO512R8qHs30TBTzXMpijIrMy7-u75KoTqF</recordid><startdate>20221210</startdate><enddate>20221210</enddate><creator>Prabhu, Rahul</creator><creator>Verma, Amit</creator><creator>Sitharam, Meera</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20221210</creationdate><title>Parallel Exploration of Directed Acyclic Graphs using the Actor Model</title><author>Prabhu, Rahul ; Verma, Amit ; Sitharam, Meera</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_27538969623</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Graph theory</topic><topic>Graphs</topic><topic>Nodes</topic><toplevel>online_resources</toplevel><creatorcontrib>Prabhu, Rahul</creatorcontrib><creatorcontrib>Verma, Amit</creatorcontrib><creatorcontrib>Sitharam, Meera</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Access via ProQuest (Open Access)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Prabhu, Rahul</au><au>Verma, Amit</au><au>Sitharam, Meera</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Parallel Exploration of Directed Acyclic Graphs using the Actor Model</atitle><jtitle>arXiv.org</jtitle><date>2022-12-10</date><risdate>2022</risdate><eissn>2331-8422</eissn><abstract>In this paper we describe a generic scheme for the parallel exploration of directed acyclic graphs starting from one or more `roots' of the graph. Our scheme is designed for graphs with the following properties, (i) discovering neighbors at any node requires a non-trivial amount of computation, it is not a simple lookup; (ii) once a node is processed, all its neighbors are discovered; (iii) each node can be discovered through multiple paths, but should only be processed once. Several computational problems can be reduced to traversing such graphs, where the goal is to explore the graph and build a traversal roadmap. As a proof of concept for the effectiveness of our scheme at achieving speedup due to parallelism, we implement the scheme for the parallel exploration of assembly landscape using the EASAL methodology.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2022-12
issn 2331-8422
language eng
recordid cdi_proquest_journals_2753896962
source Free E- Journals
subjects Graph theory
Graphs
Nodes
title Parallel Exploration of Directed Acyclic Graphs using the Actor Model
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T18%3A38%3A08IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Parallel%20Exploration%20of%20Directed%20Acyclic%20Graphs%20using%20the%20Actor%20Model&rft.jtitle=arXiv.org&rft.au=Prabhu,%20Rahul&rft.date=2022-12-10&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2753896962%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2753896962&rft_id=info:pmid/&rfr_iscdi=true