Distributed Parallel Inference on Large Factor Graphs
As computer clusters become more common and the size of the problems encountered in the field of AI grows, there is an increasing demand for efficient parallel inference algorithms. We consider the problem of parallel inference on large factor graphs in the distributed memory setting of computer clu...
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Gonzalez, Joseph E Low, Yucheng Guestrin, Carlos E O'Hallaron, David |
| description | As computer clusters become more common and the size of the problems
encountered in the field of AI grows, there is an increasing demand for
efficient parallel inference algorithms. We consider the problem of parallel
inference on large factor graphs in the distributed memory setting of computer
clusters. We develop a new efficient parallel inference algorithm, DBRSplash,
which incorporates over-segmented graph partitioning, belief residual
scheduling, and uniform work Splash operations. We empirically evaluate the
DBRSplash algorithm on a 120 processor cluster and demonstrate linear to
super-linear performance gains on large factor graph models. |
| doi_str_mv | 10.48550/arxiv.1205.2645 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1205_2645</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1205_2645</sourcerecordid><originalsourceid>FETCH-LOGICAL-a655-b732f5a5e93841770c824c9c14c7b8c55d872eb9974dd43dd5226b9f9b77fdf93</originalsourceid><addsrcrecordid>eNotzrFOwzAQgGEvHVDLzoT8AgmJ7YvtsWppqRQJhu7R2T7TSGlaXQKCt0cFpn_79QnxUFelcQDVE_JX_1nWqoJSNQbuBGz7aeY-fMyU5BsyDgMN8jBmYhojycsoW-R3kjuM84XlnvF6mlZikXGY6P6_S3HcPR83L0X7uj9s1m2BDUARrFYZEMhrZ2prq-iUiT7WJtrgIkByVlHw3pqUjE4JlGqCzz5Ym1P2eike_7a_7O7K_Rn5u7vxuxtf_wDzyT7X</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Distributed Parallel Inference on Large Factor Graphs</title><source>arXiv.org</source><creator>Gonzalez, Joseph E ; Low, Yucheng ; Guestrin, Carlos E ; O'Hallaron, David</creator><creatorcontrib>Gonzalez, Joseph E ; Low, Yucheng ; Guestrin, Carlos E ; O'Hallaron, David</creatorcontrib><description>As computer clusters become more common and the size of the problems
encountered in the field of AI grows, there is an increasing demand for
efficient parallel inference algorithms. We consider the problem of parallel
inference on large factor graphs in the distributed memory setting of computer
clusters. We develop a new efficient parallel inference algorithm, DBRSplash,
which incorporates over-segmented graph partitioning, belief residual
scheduling, and uniform work Splash operations. We empirically evaluate the
DBRSplash algorithm on a 120 processor cluster and demonstrate linear to
super-linear performance gains on large factor graph models.</description><identifier>DOI: 10.48550/arxiv.1205.2645</identifier><language>eng</language><subject>Computer Science - Artificial Intelligence ; Computer Science - Distributed, Parallel, and Cluster Computing</subject><creationdate>2012-05</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</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>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1205.2645$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1205.2645$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Gonzalez, Joseph E</creatorcontrib><creatorcontrib>Low, Yucheng</creatorcontrib><creatorcontrib>Guestrin, Carlos E</creatorcontrib><creatorcontrib>O'Hallaron, David</creatorcontrib><title>Distributed Parallel Inference on Large Factor Graphs</title><description>As computer clusters become more common and the size of the problems
encountered in the field of AI grows, there is an increasing demand for
efficient parallel inference algorithms. We consider the problem of parallel
inference on large factor graphs in the distributed memory setting of computer
clusters. We develop a new efficient parallel inference algorithm, DBRSplash,
which incorporates over-segmented graph partitioning, belief residual
scheduling, and uniform work Splash operations. We empirically evaluate the
DBRSplash algorithm on a 120 processor cluster and demonstrate linear to
super-linear performance gains on large factor graph models.</description><subject>Computer Science - Artificial Intelligence</subject><subject>Computer Science - Distributed, Parallel, and Cluster Computing</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2012</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzrFOwzAQgGEvHVDLzoT8AgmJ7YvtsWppqRQJhu7R2T7TSGlaXQKCt0cFpn_79QnxUFelcQDVE_JX_1nWqoJSNQbuBGz7aeY-fMyU5BsyDgMN8jBmYhojycsoW-R3kjuM84XlnvF6mlZikXGY6P6_S3HcPR83L0X7uj9s1m2BDUARrFYZEMhrZ2prq-iUiT7WJtrgIkByVlHw3pqUjE4JlGqCzz5Ym1P2eike_7a_7O7K_Rn5u7vxuxtf_wDzyT7X</recordid><startdate>20120509</startdate><enddate>20120509</enddate><creator>Gonzalez, Joseph E</creator><creator>Low, Yucheng</creator><creator>Guestrin, Carlos E</creator><creator>O'Hallaron, David</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20120509</creationdate><title>Distributed Parallel Inference on Large Factor Graphs</title><author>Gonzalez, Joseph E ; Low, Yucheng ; Guestrin, Carlos E ; O'Hallaron, David</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a655-b732f5a5e93841770c824c9c14c7b8c55d872eb9974dd43dd5226b9f9b77fdf93</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Computer Science - Artificial Intelligence</topic><topic>Computer Science - Distributed, Parallel, and Cluster Computing</topic><toplevel>online_resources</toplevel><creatorcontrib>Gonzalez, Joseph E</creatorcontrib><creatorcontrib>Low, Yucheng</creatorcontrib><creatorcontrib>Guestrin, Carlos E</creatorcontrib><creatorcontrib>O'Hallaron, David</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Gonzalez, Joseph E</au><au>Low, Yucheng</au><au>Guestrin, Carlos E</au><au>O'Hallaron, David</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Distributed Parallel Inference on Large Factor Graphs</atitle><date>2012-05-09</date><risdate>2012</risdate><abstract>As computer clusters become more common and the size of the problems
encountered in the field of AI grows, there is an increasing demand for
efficient parallel inference algorithms. We consider the problem of parallel
inference on large factor graphs in the distributed memory setting of computer
clusters. We develop a new efficient parallel inference algorithm, DBRSplash,
which incorporates over-segmented graph partitioning, belief residual
scheduling, and uniform work Splash operations. We empirically evaluate the
DBRSplash algorithm on a 120 processor cluster and demonstrate linear to
super-linear performance gains on large factor graph models.</abstract><doi>10.48550/arxiv.1205.2645</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.1205.2645 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_1205_2645 |
| source | arXiv.org |
| subjects | Computer Science - Artificial Intelligence Computer Science - Distributed, Parallel, and Cluster Computing |
| title | Distributed Parallel Inference on Large Factor Graphs |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T07%3A37%3A32IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Distributed%20Parallel%20Inference%20on%20Large%20Factor%20Graphs&rft.au=Gonzalez,%20Joseph%20E&rft.date=2012-05-09&rft_id=info:doi/10.48550/arxiv.1205.2645&rft_dat=%3Carxiv_GOX%3E1205_2645%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |