<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">47707491X</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180405111436.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170330e19961201xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/BF02900862</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/BF02900862</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Roest</subfield>
   <subfield code="D">Mark</subfield>
   <subfield code="u">Parallel Algorithms Group, Delft University of Technology, the Netherlands</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="4">
   <subfield code="a">The effectiveness of cyclic blockwise distribution</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Mark Roest]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">In spite of the wealth of existing data distribution methods, most parallel programming languages support only some form of cyclic blockwise distribution. The main reason why only this single method is supported is that it is relatively simple to implement. However, it is as yet unclear whether cyclic blockwise distribution is sufficiently powerful for a wide class of distribution problems. In this paper the method will be analysed, showing that for a wide range of problems it is indeed sufficient. It will also be shown in which cases cyclic blockwise distribution can be expected to fail. From this analysis, it is possible to formulate practical guidelines to assist programmers in choosing the cycle frequency for cyclic blockwise distribution that leads to an optimal result.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer, 1996</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Wuhan University Journal of Natural Sciences</subfield>
   <subfield code="d">Wuhan University</subfield>
   <subfield code="g">1/3-4(1996-12-01), 410-419</subfield>
   <subfield code="x">1007-1202</subfield>
   <subfield code="q">1:3-4&lt;410</subfield>
   <subfield code="1">1996</subfield>
   <subfield code="2">1</subfield>
   <subfield code="o">11859</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/BF02900862</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/BF02900862</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">100</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Roest</subfield>
   <subfield code="D">Mark</subfield>
   <subfield code="u">Parallel Algorithms Group, Delft University of Technology, the Netherlands</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Wuhan University Journal of Natural Sciences</subfield>
   <subfield code="d">Wuhan University</subfield>
   <subfield code="g">1/3-4(1996-12-01), 410-419</subfield>
   <subfield code="x">1007-1202</subfield>
   <subfield code="q">1:3-4&lt;410</subfield>
   <subfield code="1">1996</subfield>
   <subfield code="2">1</subfield>
   <subfield code="o">11859</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
