<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">605516316</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20210128100713.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">210128e20150701xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s00165-014-0321-z</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s00165-014-0321-z</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">Quantified abstract configurations of distributed systems</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Elvira Albert, Jesús Correas, Germán Puebla, Guillermo Román-Díez]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">When reasoning about distributed systems, it is essential to have information about the different kinds of nodes that compose the system, how many instances of each kind exist, and how nodes communicate with other nodes. In this paper we present a static-analysis-based approach which is able to provide information about the questions above. In order to cope with an unbounded number of nodes and an unbounded number of calls among them, the analysis performs an abstraction of the system producing a graph whose nodes may represent (infinitely) many concrete nodes and arcs represent any number of (infinitely) many calls among nodes. The crux of our approach is that the abstraction is enriched with upper bounds inferred by resource analysis that limit the number of concrete instances that the nodes and arcs represent and their resource consumption. The information available in our quantified abstract configurations allows us to define performance indicators which measure the quality of the system. In particular, we present several indicators that assess the level of distribution in the system, the amount of communication among distributed nodes that it requires, and how balanced the load of the distributed nodes that compose the system is. Our performance indicators are given as functions on the input data sizes, and they can be used to automate the comparison of different distributed settings and guide towards finding the optimal configuration.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">British Computer Society, 2014</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Static analysis</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Cost analysis</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Distributed systems</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Albert</subfield>
   <subfield code="D">Elvira</subfield>
   <subfield code="u">Departamento Sistemas Informáticos y Computación (DSIC), Facultad de Informática, Universidad Complutense de Madrid, C/Prof. José García Santesmases, s/n, 28040, Madrid, Spain</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Correas</subfield>
   <subfield code="D">Jesús</subfield>
   <subfield code="u">Departamento Sistemas Informáticos y Computación (DSIC), Facultad de Informática, Universidad Complutense de Madrid, C/Prof. José García Santesmases, s/n, 28040, Madrid, Spain</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Puebla</subfield>
   <subfield code="D">Germán</subfield>
   <subfield code="u">Campus de Montegancedo, 28660, Boadilla del Monte, Madrid, España</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Román-Díez</subfield>
   <subfield code="D">Guillermo</subfield>
   <subfield code="u">Campus de Montegancedo, 28660, Boadilla del Monte, Madrid, España</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Formal Aspects of Computing</subfield>
   <subfield code="d">Springer London</subfield>
   <subfield code="g">27/4(2015-07-01), 665-699</subfield>
   <subfield code="x">0934-5043</subfield>
   <subfield code="q">27:4&lt;665</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">27</subfield>
   <subfield code="o">165</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s00165-014-0321-z</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</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="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="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</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/s00165-014-0321-z</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">Albert</subfield>
   <subfield code="D">Elvira</subfield>
   <subfield code="u">Departamento Sistemas Informáticos y Computación (DSIC), Facultad de Informática, Universidad Complutense de Madrid, C/Prof. José García Santesmases, s/n, 28040, Madrid, Spain</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">Correas</subfield>
   <subfield code="D">Jesús</subfield>
   <subfield code="u">Departamento Sistemas Informáticos y Computación (DSIC), Facultad de Informática, Universidad Complutense de Madrid, C/Prof. José García Santesmases, s/n, 28040, Madrid, Spain</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">Puebla</subfield>
   <subfield code="D">Germán</subfield>
   <subfield code="u">Campus de Montegancedo, 28660, Boadilla del Monte, Madrid, España</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">Román-Díez</subfield>
   <subfield code="D">Guillermo</subfield>
   <subfield code="u">Campus de Montegancedo, 28660, Boadilla del Monte, Madrid, España</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">Formal Aspects of Computing</subfield>
   <subfield code="d">Springer London</subfield>
   <subfield code="g">27/4(2015-07-01), 665-699</subfield>
   <subfield code="x">0934-5043</subfield>
   <subfield code="q">27:4&lt;665</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">27</subfield>
   <subfield code="o">165</subfield>
  </datafield>
 </record>
</collection>
