Conference paper Open Access

Distributed Parallel D8 Up-Slope Area Calculation in Digital Elevation Models

Barnes, Richard; Lehman, Clarence; Mulla, David


MARC21 XML Export

<?xml version='1.0' encoding='UTF-8'?>
<record xmlns="http://www.loc.gov/MARC21/slim">
  <leader>00000nam##2200000uu#4500</leader>
  <datafield tag="041" ind1=" " ind2=" ">
    <subfield code="a">eng</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">D8</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">upslope area</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">digital elevation model</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">DEM</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">parallel computing</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">algorithm</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">flow accumulation</subfield>
  </datafield>
  <controlfield tag="005">20200120153537.0</controlfield>
  <controlfield tag="001">1162392</controlfield>
  <datafield tag="711" ind1=" " ind2=" ">
    <subfield code="d">18-21 July 2011</subfield>
    <subfield code="g">PDPTA</subfield>
    <subfield code="a">International Conference on Parallel and Distributed Processing Techniques and Applications</subfield>
    <subfield code="c">Las Vegas, NV, USA</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">University of Minnesota</subfield>
    <subfield code="a">Lehman, Clarence</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">University of Minnesota</subfield>
    <subfield code="a">Mulla, David</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="s">323983</subfield>
    <subfield code="z">md5:fa7487256a2e36c179a980f99424e6db</subfield>
    <subfield code="u">https://zenodo.org/record/1162392/files/2011_barnes_distributed.pdf</subfield>
  </datafield>
  <datafield tag="542" ind1=" " ind2=" ">
    <subfield code="l">open</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="y">Conference website</subfield>
    <subfield code="u">http://www.world-academy-of-science.org/worldcomp11/ws/conferences/pdpta11.html</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2011-07-21</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="p">openaire</subfield>
    <subfield code="o">oai:zenodo.org:1162392</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="u">University of Minnesota</subfield>
    <subfield code="0">(orcid)0000-0002-0204-6040</subfield>
    <subfield code="a">Barnes, Richard</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">Distributed Parallel D8 Up-Slope Area Calculation in Digital Elevation Models</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="u">https://creativecommons.org/licenses/by/4.0/legalcode</subfield>
    <subfield code="a">Creative Commons Attribution 4.0 International</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="7">
    <subfield code="a">cc-by</subfield>
    <subfield code="2">opendefinition.org</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">&lt;p&gt;This paper presents a parallel algorithm for calculating the eight-directional (D8) up-slope contributing area in digital elevation models (DEMs). In contrast with previous algorithms, which have potentially unbounded inter-node communications, the algorithm presented here realizes strict bounds on the number of inter-node communications. Those bounds in turn allow D8 attributes to be processed for arbitrarily large DEMs on hardware ranging from average desktops to supercomputers. The algorithm can use the OpenMP and MPI parallel computing models, either in combination or separately. It partitions the DEM between slave nodes, calculates an internal up-slope area by replacing information from other slaves with variables representing unknown quantities, passes the results on to a master node which combines all the slaves&amp;#39; data, and passes information back to each slave, which then computes its final result. In this way each slave&amp;#39;s DEM partition is treated as a simple unit in the DEM as a whole and only two communications take place per node.&lt;/p&gt;</subfield>
  </datafield>
  <datafield tag="773" ind1=" " ind2=" ">
    <subfield code="n">arxiv</subfield>
    <subfield code="i">isIdenticalTo</subfield>
    <subfield code="a">arXiv:1605.05773</subfield>
  </datafield>
  <datafield tag="773" ind1=" " ind2=" ">
    <subfield code="n">doi</subfield>
    <subfield code="i">isVersionOf</subfield>
    <subfield code="a">10.5281/zenodo.1162391</subfield>
  </datafield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.5281/zenodo.1162392</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">publication</subfield>
    <subfield code="b">conferencepaper</subfield>
  </datafield>
</record>
77
12
views
downloads
All versions This version
Views 7777
Downloads 1212
Data volume 3.9 MB3.9 MB
Unique views 7676
Unique downloads 1111

Share

Cite as