<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">475789555</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180406123708.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170329e20000501xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1023/A:1019119401309</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1023/A:1019119401309</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="4">
   <subfield code="a">The Shuffled Mesh: a flexible and efficient model for parallel computing</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[G. Bongiovanni, G.A. De Biase, A. Massini, A. Monti]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">In this work an efficient model for parallel computing, called Shuffled Mesh (SM), is introduced. This bounded degree model has the mesh as subgraph and it is based on the union of mesh and shuffle‐exchange topologies. It is shown that an N‐processor SM combines the features of mesh, shuffle‐exchange, hypercubic networks, mesh of trees and hypercube, and is able to support all the algorithms designed for such topologies with constant or logarithmic time performance degradation. Finally, it is proved that the VLSI layout of a SM is the same as of a shuffle exchange of the same size.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Kluwer Academic Publishers, 2000</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Bongiovanni</subfield>
   <subfield code="D">G.</subfield>
   <subfield code="u">Dipartimento di Scienze dell'Informazione, Università di Roma la Sapienza, Via Salaria 113, 00198, Roma, Italy</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">De Biase</subfield>
   <subfield code="D">G.A.</subfield>
   <subfield code="u">Dipartimento di Scienze dell'Informazione, Università di Roma la Sapienza, Via Salaria 113, 00198, Roma, Italy</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Massini</subfield>
   <subfield code="D">A.</subfield>
   <subfield code="u">Dipartimento di Scienze dell'Informazione, Università di Roma la Sapienza, Via Salaria 113, 00198, Roma, Italy</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Monti</subfield>
   <subfield code="D">A.</subfield>
   <subfield code="u">Dipartimento di Scienze dell'Informazione, Università di Roma la Sapienza, Via Salaria 113, 00198, Roma, Italy</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Telecommunication Systems</subfield>
   <subfield code="d">Kluwer Academic Publishers</subfield>
   <subfield code="g">13/1(2000-05-01), 21-27</subfield>
   <subfield code="x">1018-4864</subfield>
   <subfield code="q">13:1&lt;21</subfield>
   <subfield code="1">2000</subfield>
   <subfield code="2">13</subfield>
   <subfield code="o">11235</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1023/A:1019119401309</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.1023/A:1019119401309</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">Bongiovanni</subfield>
   <subfield code="D">G.</subfield>
   <subfield code="u">Dipartimento di Scienze dell'Informazione, Università di Roma la Sapienza, Via Salaria 113, 00198, Roma, Italy</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">De Biase</subfield>
   <subfield code="D">G.A.</subfield>
   <subfield code="u">Dipartimento di Scienze dell'Informazione, Università di Roma la Sapienza, Via Salaria 113, 00198, Roma, Italy</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">Massini</subfield>
   <subfield code="D">A.</subfield>
   <subfield code="u">Dipartimento di Scienze dell'Informazione, Università di Roma la Sapienza, Via Salaria 113, 00198, Roma, Italy</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">Monti</subfield>
   <subfield code="D">A.</subfield>
   <subfield code="u">Dipartimento di Scienze dell'Informazione, Università di Roma la Sapienza, Via Salaria 113, 00198, Roma, Italy</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">Telecommunication Systems</subfield>
   <subfield code="d">Kluwer Academic Publishers</subfield>
   <subfield code="g">13/1(2000-05-01), 21-27</subfield>
   <subfield code="x">1018-4864</subfield>
   <subfield code="q">13:1&lt;21</subfield>
   <subfield code="1">2000</subfield>
   <subfield code="2">13</subfield>
   <subfield code="o">11235</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>
