Parallel implementation of simulated annealing to reproduce multiple-point statistics

This paper shows an innovative implementation of simulated annealing in the context of parallel computing. Details regarding the use of parallel computing through a cluster of processors, as well as the implementation decisions, are provided. Simulated annealing is presented aiming at the generation...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computers & geosciences 2011-08, Vol.37 (8), p.1110-1121
Hauptverfasser: Peredo, Oscar, Ortiz, Julián M.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 1121
container_issue 8
container_start_page 1110
container_title Computers & geosciences
container_volume 37
creator Peredo, Oscar
Ortiz, Julián M.
description This paper shows an innovative implementation of simulated annealing in the context of parallel computing. Details regarding the use of parallel computing through a cluster of processors, as well as the implementation decisions, are provided. Simulated annealing is presented aiming at the generation of stochastic realizations of categorical variables reproducing multiple-point statistics. The procedure starts with the use of a training image to determine the frequencies of occurrence of particular configurations of nodes and values. These frequencies are used as target statistics that must be matched by the stochastic images generated with the algorithm. The simulation process considers an initial random image of the spatial distribution of the categories. Nodes are perturbed randomly and after each perturbation the mismatch between the target statistics and the current statistics of the image is calculated. The perturbation is accepted if the statistics are closer to the target, or conditionally rejected if not, based on the annealing schedule. The simulation was implemented using parallel processes with C++ and MPI. The message passing scheme was implemented using a speculative computation framework, by which prior to making the decision of acceptance or rejection of a proposed perturbation, processes already start calculating the next possible perturbation at a second level; one as if the perturbation on level one is accepted, and another process as if the proposed perturbation is rejected. Additional levels can start their calculation as well, conditional to the second level processes. Once a process reaches a decision as to whether accept or reject the suggested perturbation, all processes within the branch incompatible with that decision are dropped. This allows a speed up of up to log n ( p+1), where n is the number of categories and p the number of processes simultaneously active. Examples are provided to demonstrate improvements and speed ups that can be achieved.
doi_str_mv 10.1016/j.cageo.2010.10.015
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_919907389</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0098300410003407</els_id><sourcerecordid>919907389</sourcerecordid><originalsourceid>FETCH-LOGICAL-a412t-3e02c179b1c597d37d5dc8814f7b798ab2b9ae91e2c4195465ebcd657f52c4633</originalsourceid><addsrcrecordid>eNp9kE1rGzEURUVoIK6TX5BFZlO6GlcajUajRRfFpB9gaCHxWrzRvDEyGsmR5EL-feTYdNmV4Orcy-MQcs_oilHWfdmvDOwwrBr6nqwoE1dkwXrJa9lT_oEsKFV9zSltb8jHlPaU0qbpxYJs_0AE59BVdj44nNFnyDb4KkxVsvPRQcaxAu8RnPW7Kocq4iGG8WiwKt_ZllZ9CNbnKp2qKVuTbsn1BC7h3eVdku33x-f1z3rz-8ev9bdNDS1rcs2RNoZJNTAjlBy5HMVo-p61kxyk6mFoBgWoGDamZUq0ncDBjJ2QkyhJx_mSfD7vlotejpiynm0y6Bx4DMekFVOKSt6rQvIzaWJIKeKkD9HOEF81o_rkUO_1u0N9cngKi8PS-nTZh2TATRG8selftWlbzjmjhXs4cxMEDbtYmO1TGeqK544LIQvx9Uxg0fHXYtTJWPQGRxvRZD0G-99L3gB3-JKb</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>919907389</pqid></control><display><type>article</type><title>Parallel implementation of simulated annealing to reproduce multiple-point statistics</title><source>ScienceDirect Journals (5 years ago - present)</source><creator>Peredo, Oscar ; Ortiz, Julián M.</creator><creatorcontrib>Peredo, Oscar ; Ortiz, Julián M.</creatorcontrib><description>This paper shows an innovative implementation of simulated annealing in the context of parallel computing. Details regarding the use of parallel computing through a cluster of processors, as well as the implementation decisions, are provided. Simulated annealing is presented aiming at the generation of stochastic realizations of categorical variables reproducing multiple-point statistics. The procedure starts with the use of a training image to determine the frequencies of occurrence of particular configurations of nodes and values. These frequencies are used as target statistics that must be matched by the stochastic images generated with the algorithm. The simulation process considers an initial random image of the spatial distribution of the categories. Nodes are perturbed randomly and after each perturbation the mismatch between the target statistics and the current statistics of the image is calculated. The perturbation is accepted if the statistics are closer to the target, or conditionally rejected if not, based on the annealing schedule. The simulation was implemented using parallel processes with C++ and MPI. The message passing scheme was implemented using a speculative computation framework, by which prior to making the decision of acceptance or rejection of a proposed perturbation, processes already start calculating the next possible perturbation at a second level; one as if the perturbation on level one is accepted, and another process as if the proposed perturbation is rejected. Additional levels can start their calculation as well, conditional to the second level processes. Once a process reaches a decision as to whether accept or reject the suggested perturbation, all processes within the branch incompatible with that decision are dropped. This allows a speed up of up to log n ( p+1), where n is the number of categories and p the number of processes simultaneously active. Examples are provided to demonstrate improvements and speed ups that can be achieved.</description><identifier>ISSN: 0098-3004</identifier><identifier>EISSN: 1873-7803</identifier><identifier>DOI: 10.1016/j.cageo.2010.10.015</identifier><language>eng</language><publisher>Kidlington: Elsevier Ltd</publisher><subject>algorithms ; annealing ; Areal geology ; Areal geology. Maps ; Computer simulation ; computers ; decision making ; Decisions ; Earth sciences ; Earth, ocean, space ; Exact sciences and technology ; Geologic maps, cartography ; Geostatistics ; Mathematical analysis ; Mathematical models ; Multipoint ; Parallel computing ; Perturbation methods ; Simulated annealing ; Speculative computation ; Statistics ; Stochastic simulation</subject><ispartof>Computers &amp; geosciences, 2011-08, Vol.37 (8), p.1110-1121</ispartof><rights>2010 Elsevier Ltd</rights><rights>2015 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-a412t-3e02c179b1c597d37d5dc8814f7b798ab2b9ae91e2c4195465ebcd657f52c4633</citedby><cites>FETCH-LOGICAL-a412t-3e02c179b1c597d37d5dc8814f7b798ab2b9ae91e2c4195465ebcd657f52c4633</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.cageo.2010.10.015$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,778,782,3539,27911,27912,45982</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=24433310$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Peredo, Oscar</creatorcontrib><creatorcontrib>Ortiz, Julián M.</creatorcontrib><title>Parallel implementation of simulated annealing to reproduce multiple-point statistics</title><title>Computers &amp; geosciences</title><description>This paper shows an innovative implementation of simulated annealing in the context of parallel computing. Details regarding the use of parallel computing through a cluster of processors, as well as the implementation decisions, are provided. Simulated annealing is presented aiming at the generation of stochastic realizations of categorical variables reproducing multiple-point statistics. The procedure starts with the use of a training image to determine the frequencies of occurrence of particular configurations of nodes and values. These frequencies are used as target statistics that must be matched by the stochastic images generated with the algorithm. The simulation process considers an initial random image of the spatial distribution of the categories. Nodes are perturbed randomly and after each perturbation the mismatch between the target statistics and the current statistics of the image is calculated. The perturbation is accepted if the statistics are closer to the target, or conditionally rejected if not, based on the annealing schedule. The simulation was implemented using parallel processes with C++ and MPI. The message passing scheme was implemented using a speculative computation framework, by which prior to making the decision of acceptance or rejection of a proposed perturbation, processes already start calculating the next possible perturbation at a second level; one as if the perturbation on level one is accepted, and another process as if the proposed perturbation is rejected. Additional levels can start their calculation as well, conditional to the second level processes. Once a process reaches a decision as to whether accept or reject the suggested perturbation, all processes within the branch incompatible with that decision are dropped. This allows a speed up of up to log n ( p+1), where n is the number of categories and p the number of processes simultaneously active. Examples are provided to demonstrate improvements and speed ups that can be achieved.</description><subject>algorithms</subject><subject>annealing</subject><subject>Areal geology</subject><subject>Areal geology. Maps</subject><subject>Computer simulation</subject><subject>computers</subject><subject>decision making</subject><subject>Decisions</subject><subject>Earth sciences</subject><subject>Earth, ocean, space</subject><subject>Exact sciences and technology</subject><subject>Geologic maps, cartography</subject><subject>Geostatistics</subject><subject>Mathematical analysis</subject><subject>Mathematical models</subject><subject>Multipoint</subject><subject>Parallel computing</subject><subject>Perturbation methods</subject><subject>Simulated annealing</subject><subject>Speculative computation</subject><subject>Statistics</subject><subject>Stochastic simulation</subject><issn>0098-3004</issn><issn>1873-7803</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2011</creationdate><recordtype>article</recordtype><recordid>eNp9kE1rGzEURUVoIK6TX5BFZlO6GlcajUajRRfFpB9gaCHxWrzRvDEyGsmR5EL-feTYdNmV4Orcy-MQcs_oilHWfdmvDOwwrBr6nqwoE1dkwXrJa9lT_oEsKFV9zSltb8jHlPaU0qbpxYJs_0AE59BVdj44nNFnyDb4KkxVsvPRQcaxAu8RnPW7Kocq4iGG8WiwKt_ZllZ9CNbnKp2qKVuTbsn1BC7h3eVdku33x-f1z3rz-8ev9bdNDS1rcs2RNoZJNTAjlBy5HMVo-p61kxyk6mFoBgWoGDamZUq0ncDBjJ2QkyhJx_mSfD7vlotejpiynm0y6Bx4DMekFVOKSt6rQvIzaWJIKeKkD9HOEF81o_rkUO_1u0N9cngKi8PS-nTZh2TATRG8selftWlbzjmjhXs4cxMEDbtYmO1TGeqK544LIQvx9Uxg0fHXYtTJWPQGRxvRZD0G-99L3gB3-JKb</recordid><startdate>20110801</startdate><enddate>20110801</enddate><creator>Peredo, Oscar</creator><creator>Ortiz, Julián M.</creator><general>Elsevier Ltd</general><general>Elsevier</general><scope>FBQ</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>FR3</scope><scope>H8D</scope><scope>JQ2</scope><scope>KR7</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20110801</creationdate><title>Parallel implementation of simulated annealing to reproduce multiple-point statistics</title><author>Peredo, Oscar ; Ortiz, Julián M.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a412t-3e02c179b1c597d37d5dc8814f7b798ab2b9ae91e2c4195465ebcd657f52c4633</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2011</creationdate><topic>algorithms</topic><topic>annealing</topic><topic>Areal geology</topic><topic>Areal geology. Maps</topic><topic>Computer simulation</topic><topic>computers</topic><topic>decision making</topic><topic>Decisions</topic><topic>Earth sciences</topic><topic>Earth, ocean, space</topic><topic>Exact sciences and technology</topic><topic>Geologic maps, cartography</topic><topic>Geostatistics</topic><topic>Mathematical analysis</topic><topic>Mathematical models</topic><topic>Multipoint</topic><topic>Parallel computing</topic><topic>Perturbation methods</topic><topic>Simulated annealing</topic><topic>Speculative computation</topic><topic>Statistics</topic><topic>Stochastic simulation</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Peredo, Oscar</creatorcontrib><creatorcontrib>Ortiz, Julián M.</creatorcontrib><collection>AGRIS</collection><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>Aerospace Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Civil Engineering Abstracts</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>Computers &amp; geosciences</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Peredo, Oscar</au><au>Ortiz, Julián M.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Parallel implementation of simulated annealing to reproduce multiple-point statistics</atitle><jtitle>Computers &amp; geosciences</jtitle><date>2011-08-01</date><risdate>2011</risdate><volume>37</volume><issue>8</issue><spage>1110</spage><epage>1121</epage><pages>1110-1121</pages><issn>0098-3004</issn><eissn>1873-7803</eissn><abstract>This paper shows an innovative implementation of simulated annealing in the context of parallel computing. Details regarding the use of parallel computing through a cluster of processors, as well as the implementation decisions, are provided. Simulated annealing is presented aiming at the generation of stochastic realizations of categorical variables reproducing multiple-point statistics. The procedure starts with the use of a training image to determine the frequencies of occurrence of particular configurations of nodes and values. These frequencies are used as target statistics that must be matched by the stochastic images generated with the algorithm. The simulation process considers an initial random image of the spatial distribution of the categories. Nodes are perturbed randomly and after each perturbation the mismatch between the target statistics and the current statistics of the image is calculated. The perturbation is accepted if the statistics are closer to the target, or conditionally rejected if not, based on the annealing schedule. The simulation was implemented using parallel processes with C++ and MPI. The message passing scheme was implemented using a speculative computation framework, by which prior to making the decision of acceptance or rejection of a proposed perturbation, processes already start calculating the next possible perturbation at a second level; one as if the perturbation on level one is accepted, and another process as if the proposed perturbation is rejected. Additional levels can start their calculation as well, conditional to the second level processes. Once a process reaches a decision as to whether accept or reject the suggested perturbation, all processes within the branch incompatible with that decision are dropped. This allows a speed up of up to log n ( p+1), where n is the number of categories and p the number of processes simultaneously active. Examples are provided to demonstrate improvements and speed ups that can be achieved.</abstract><cop>Kidlington</cop><pub>Elsevier Ltd</pub><doi>10.1016/j.cageo.2010.10.015</doi><tpages>12</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0098-3004
ispartof Computers & geosciences, 2011-08, Vol.37 (8), p.1110-1121
issn 0098-3004
1873-7803
language eng
recordid cdi_proquest_miscellaneous_919907389
source ScienceDirect Journals (5 years ago - present)
subjects algorithms
annealing
Areal geology
Areal geology. Maps
Computer simulation
computers
decision making
Decisions
Earth sciences
Earth, ocean, space
Exact sciences and technology
Geologic maps, cartography
Geostatistics
Mathematical analysis
Mathematical models
Multipoint
Parallel computing
Perturbation methods
Simulated annealing
Speculative computation
Statistics
Stochastic simulation
title Parallel implementation of simulated annealing to reproduce multiple-point statistics
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-15T13%3A11%3A29IST&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%20implementation%20of%20simulated%20annealing%20to%20reproduce%20multiple-point%20statistics&rft.jtitle=Computers%20&%20geosciences&rft.au=Peredo,%20Oscar&rft.date=2011-08-01&rft.volume=37&rft.issue=8&rft.spage=1110&rft.epage=1121&rft.pages=1110-1121&rft.issn=0098-3004&rft.eissn=1873-7803&rft_id=info:doi/10.1016/j.cageo.2010.10.015&rft_dat=%3Cproquest_cross%3E919907389%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=919907389&rft_id=info:pmid/&rft_els_id=S0098300410003407&rfr_iscdi=true