<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">477074502</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/BF02900858</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/BF02900858</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="3">
   <subfield code="a">An introduction to the PMESC parallel programming paradigm and library for task parallel computation</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[S. Crivelli, E. Jessup]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">Task-parallel problems are difficult to implement efficiently in parallel because they are asynchronous and unpredictable. The difficulties are compounded on distributedmemory computers where interprocessor communication can impose a substantial overhead. A few languages and libraries have been proposed that are specifically designed to support this kind of computation. However, one big challenge still remains: to make those tools understood and used by scientists. engineers, and others who want to exploit the power of parallel computers without spending much effort in mastering those tools. The PMESC programming paradigm and library presented here are designed to make programming on distributed-memory computers easy to understand and to make efficient parallel code easy to produce. The paradigm provides a methodology for structuring task-parallel problems that allows the separation of different phases in the computation. The library provides support for those phases that are application-independent allowing the users to concentrate on the applicationspecific oues.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer, 1996</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Crivelli</subfield>
   <subfield code="D">S.</subfield>
   <subfield code="u">Department of Computer Science, University of Colorado, 80309-0430, Boulder, CO, USA</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Jessup</subfield>
   <subfield code="D">E.</subfield>
   <subfield code="u">Department of Computer Science, University of Colorado, 80309-0430, Boulder, CO, USA</subfield>
   <subfield code="4">aut</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), 386-390</subfield>
   <subfield code="x">1007-1202</subfield>
   <subfield code="q">1:3-4&lt;386</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/BF02900858</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/BF02900858</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">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Crivelli</subfield>
   <subfield code="D">S.</subfield>
   <subfield code="u">Department of Computer Science, University of Colorado, 80309-0430, Boulder, CO, USA</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Jessup</subfield>
   <subfield code="D">E.</subfield>
   <subfield code="u">Department of Computer Science, University of Colorado, 80309-0430, Boulder, CO, USA</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), 386-390</subfield>
   <subfield code="x">1007-1202</subfield>
   <subfield code="q">1:3-4&lt;386</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>
