Parallel SAT Solving on Peer-to-Peer Desktop Grids
Satciety is a distributed parallel satisfiability (SAT) solver which focuses on tackling the domain-specific problems inherent to one of the most challenging environments for parallel computing—Peer-to-Peer Desktop Grids. Satciety efficiently addresses issues related to resource volatility and heter...
Gespeichert in:
Veröffentlicht in: | Journal of grid computing 2010-09, Vol.8 (3), p.443-471 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 471 |
---|---|
container_issue | 3 |
container_start_page | 443 |
container_title | Journal of grid computing |
container_volume | 8 |
creator | Schulz, Sven Blochinger, Wolfgang |
description | Satciety
is a distributed parallel satisfiability (SAT) solver which focuses on tackling the domain-specific problems inherent to one of the most challenging environments for parallel computing—Peer-to-Peer Desktop Grids.
Satciety
efficiently addresses issues related to resource volatility and heterogeneity, limited node and network capabilities, as well as non-uniform communication costs. This is achieved through a sophisticated distributed task pool execution model, problem size reduction through multi-stage SAT formula preprocessing, context-aware memory management, and adaptive topology-aware distributed dynamic learning. Despite the demanding conditions prevailing in Desktop Grids,
Satciety
achieves considerable speedups compared to state-of-the-art sequential SAT solvers. |
doi_str_mv | 10.1007/s10723-010-9160-1 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_926337957</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>926337957</sourcerecordid><originalsourceid>FETCH-LOGICAL-c348t-c3a83356a0ec177d1927b427824601fc35ee904a9b68a8809feeba6eeefcfb863</originalsourceid><addsrcrecordid>eNp1kE9LAzEQxYMoWKsfwNuCB0_RSbKbP8dStQqChdZzyG5ny9btpiZbwW9v6gqC4GXeDPzeY3iEXDK4YQDqNjJQXFBgQA2TQNkRGbFC8XTp_Ph7B6q0EqfkLMYNAC808BHhcxdc22KbLSbLbOHbj6ZbZ77L5oiB9p4eNLvD-Nb7XTYLzSqek5PatREvfnRMXh_ul9NH-vwye5pOnmklct2n6bQQhXSAFVNqxQxXZc6V5rkEVleiQDSQO1NK7bQGUyOWTiJiXdWllmJMrofcXfDve4y93TaxwrZ1Hfp9tIZLIZQpVCKv_pAbvw9des5yXhgltWGQKDZQVfAxBqztLjRbFz4tA3so0Q4l2lSiPZRoWfLwwRMT260x_Cb_b_oC6YZx6A</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2259768910</pqid></control><display><type>article</type><title>Parallel SAT Solving on Peer-to-Peer Desktop Grids</title><source>SpringerLink Journals - AutoHoldings</source><creator>Schulz, Sven ; Blochinger, Wolfgang</creator><creatorcontrib>Schulz, Sven ; Blochinger, Wolfgang</creatorcontrib><description>Satciety
is a distributed parallel satisfiability (SAT) solver which focuses on tackling the domain-specific problems inherent to one of the most challenging environments for parallel computing—Peer-to-Peer Desktop Grids.
Satciety
efficiently addresses issues related to resource volatility and heterogeneity, limited node and network capabilities, as well as non-uniform communication costs. This is achieved through a sophisticated distributed task pool execution model, problem size reduction through multi-stage SAT formula preprocessing, context-aware memory management, and adaptive topology-aware distributed dynamic learning. Despite the demanding conditions prevailing in Desktop Grids,
Satciety
achieves considerable speedups compared to state-of-the-art sequential SAT solvers.</description><identifier>ISSN: 1570-7873</identifier><identifier>EISSN: 1572-9184</identifier><identifier>DOI: 10.1007/s10723-010-9160-1</identifier><language>eng</language><publisher>Dordrecht: Springer Netherlands</publisher><subject>Ambient intelligence ; Computational grids ; Computer Science ; Heterogeneity ; Learning ; Management of Computing and Information Systems ; Memory management ; Preprocessing ; Processor Architectures ; Size reduction ; Solvers ; State of the art ; Tasks ; Topology ; User Interfaces and Human Computer Interaction ; Volatility</subject><ispartof>Journal of grid computing, 2010-09, Vol.8 (3), p.443-471</ispartof><rights>Springer Science+Business Media B.V. 2010</rights><rights>Journal of Grid Computing is a copyright of Springer, (2010). All Rights Reserved.</rights><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c348t-c3a83356a0ec177d1927b427824601fc35ee904a9b68a8809feeba6eeefcfb863</citedby><cites>FETCH-LOGICAL-c348t-c3a83356a0ec177d1927b427824601fc35ee904a9b68a8809feeba6eeefcfb863</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s10723-010-9160-1$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s10723-010-9160-1$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,41488,42557,51319</link.rule.ids></links><search><creatorcontrib>Schulz, Sven</creatorcontrib><creatorcontrib>Blochinger, Wolfgang</creatorcontrib><title>Parallel SAT Solving on Peer-to-Peer Desktop Grids</title><title>Journal of grid computing</title><addtitle>J Grid Computing</addtitle><description>Satciety
is a distributed parallel satisfiability (SAT) solver which focuses on tackling the domain-specific problems inherent to one of the most challenging environments for parallel computing—Peer-to-Peer Desktop Grids.
Satciety
efficiently addresses issues related to resource volatility and heterogeneity, limited node and network capabilities, as well as non-uniform communication costs. This is achieved through a sophisticated distributed task pool execution model, problem size reduction through multi-stage SAT formula preprocessing, context-aware memory management, and adaptive topology-aware distributed dynamic learning. Despite the demanding conditions prevailing in Desktop Grids,
Satciety
achieves considerable speedups compared to state-of-the-art sequential SAT solvers.</description><subject>Ambient intelligence</subject><subject>Computational grids</subject><subject>Computer Science</subject><subject>Heterogeneity</subject><subject>Learning</subject><subject>Management of Computing and Information Systems</subject><subject>Memory management</subject><subject>Preprocessing</subject><subject>Processor Architectures</subject><subject>Size reduction</subject><subject>Solvers</subject><subject>State of the art</subject><subject>Tasks</subject><subject>Topology</subject><subject>User Interfaces and Human Computer Interaction</subject><subject>Volatility</subject><issn>1570-7873</issn><issn>1572-9184</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2010</creationdate><recordtype>article</recordtype><sourceid>AFKRA</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNp1kE9LAzEQxYMoWKsfwNuCB0_RSbKbP8dStQqChdZzyG5ny9btpiZbwW9v6gqC4GXeDPzeY3iEXDK4YQDqNjJQXFBgQA2TQNkRGbFC8XTp_Ph7B6q0EqfkLMYNAC808BHhcxdc22KbLSbLbOHbj6ZbZ77L5oiB9p4eNLvD-Nb7XTYLzSqek5PatREvfnRMXh_ul9NH-vwye5pOnmklct2n6bQQhXSAFVNqxQxXZc6V5rkEVleiQDSQO1NK7bQGUyOWTiJiXdWllmJMrofcXfDve4y93TaxwrZ1Hfp9tIZLIZQpVCKv_pAbvw9des5yXhgltWGQKDZQVfAxBqztLjRbFz4tA3so0Q4l2lSiPZRoWfLwwRMT260x_Cb_b_oC6YZx6A</recordid><startdate>20100901</startdate><enddate>20100901</enddate><creator>Schulz, Sven</creator><creator>Blochinger, Wolfgang</creator><general>Springer Netherlands</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>8FE</scope><scope>8FG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20100901</creationdate><title>Parallel SAT Solving on Peer-to-Peer Desktop Grids</title><author>Schulz, Sven ; Blochinger, Wolfgang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c348t-c3a83356a0ec177d1927b427824601fc35ee904a9b68a8809feeba6eeefcfb863</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Ambient intelligence</topic><topic>Computational grids</topic><topic>Computer Science</topic><topic>Heterogeneity</topic><topic>Learning</topic><topic>Management of Computing and Information Systems</topic><topic>Memory management</topic><topic>Preprocessing</topic><topic>Processor Architectures</topic><topic>Size reduction</topic><topic>Solvers</topic><topic>State of the art</topic><topic>Tasks</topic><topic>Topology</topic><topic>User Interfaces and Human Computer Interaction</topic><topic>Volatility</topic><toplevel>online_resources</toplevel><creatorcontrib>Schulz, Sven</creatorcontrib><creatorcontrib>Blochinger, Wolfgang</creatorcontrib><collection>CrossRef</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</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>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</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>Computer and Information Systems 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>Journal of grid computing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Schulz, Sven</au><au>Blochinger, Wolfgang</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Parallel SAT Solving on Peer-to-Peer Desktop Grids</atitle><jtitle>Journal of grid computing</jtitle><stitle>J Grid Computing</stitle><date>2010-09-01</date><risdate>2010</risdate><volume>8</volume><issue>3</issue><spage>443</spage><epage>471</epage><pages>443-471</pages><issn>1570-7873</issn><eissn>1572-9184</eissn><abstract>Satciety
is a distributed parallel satisfiability (SAT) solver which focuses on tackling the domain-specific problems inherent to one of the most challenging environments for parallel computing—Peer-to-Peer Desktop Grids.
Satciety
efficiently addresses issues related to resource volatility and heterogeneity, limited node and network capabilities, as well as non-uniform communication costs. This is achieved through a sophisticated distributed task pool execution model, problem size reduction through multi-stage SAT formula preprocessing, context-aware memory management, and adaptive topology-aware distributed dynamic learning. Despite the demanding conditions prevailing in Desktop Grids,
Satciety
achieves considerable speedups compared to state-of-the-art sequential SAT solvers.</abstract><cop>Dordrecht</cop><pub>Springer Netherlands</pub><doi>10.1007/s10723-010-9160-1</doi><tpages>29</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1570-7873 |
ispartof | Journal of grid computing, 2010-09, Vol.8 (3), p.443-471 |
issn | 1570-7873 1572-9184 |
language | eng |
recordid | cdi_proquest_miscellaneous_926337957 |
source | SpringerLink Journals - AutoHoldings |
subjects | Ambient intelligence Computational grids Computer Science Heterogeneity Learning Management of Computing and Information Systems Memory management Preprocessing Processor Architectures Size reduction Solvers State of the art Tasks Topology User Interfaces and Human Computer Interaction Volatility |
title | Parallel SAT Solving on Peer-to-Peer Desktop Grids |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-25T02%3A32%3A03IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Parallel%20SAT%20Solving%20on%20Peer-to-Peer%20Desktop%20Grids&rft.jtitle=Journal%20of%20grid%20computing&rft.au=Schulz,%20Sven&rft.date=2010-09-01&rft.volume=8&rft.issue=3&rft.spage=443&rft.epage=471&rft.pages=443-471&rft.issn=1570-7873&rft.eissn=1572-9184&rft_id=info:doi/10.1007/s10723-010-9160-1&rft_dat=%3Cproquest_cross%3E926337957%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2259768910&rft_id=info:pmid/&rfr_iscdi=true |