<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">445327286</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180317142725.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170323e20111201xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s10723-011-9196-x</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s10723-011-9196-x</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">Double Auction-based Scheduling of Scientific Applications in Distributed Grid and Cloud Environments</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Radu Prodan, Marek Wieczorek, Hamid Fard]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">Economy models have long been considered as a promising complement to the classical distributed resource management not only due of their dynamic and decentralized nature, but also because the concept of financial valuation of resources and services is an inherent part of any such model. In its broadest sense, scheduling of scientific applications in distributed Grid and Cloud environments can be regarded as a market-based negotiation between a scheduling service optimizing user-centric objectives (execution time, budget), and a resource manager optimizing provider-centric metrics (resource utilization, income, job throughput). In this paper, we propose a new instantiation of the negotiation protocol between the scheduler and resource manager using a market-based Continuous Double Auction (CDA) model. We analyze different scheduling strategies that can be applied and identify general strategic patterns that can lead to a fast and cheap work ow execution. In the experimental study, we demonstrate that under certain circumstances one can benefit by applying an aggressive scheduling strategy.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer Science+Business Media B.V., 2011</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Distributed Grid/Cloud computing</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Scheduling</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Resource management</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Market model</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Double auctions</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Prodan</subfield>
   <subfield code="D">Radu</subfield>
   <subfield code="u">Institute of Computer Science, University of Innsbruck, Technikerstraße 21a, 6020, Innsbruck, Austria</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Wieczorek</subfield>
   <subfield code="D">Marek</subfield>
   <subfield code="u">Google Poland Ltd., Rynek Główny 12, 31-042, Kraków, Poland</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Fard</subfield>
   <subfield code="D">Hamid</subfield>
   <subfield code="u">Institute of Computer Science, University of Innsbruck, Technikerstraße 21a, 6020, Innsbruck, Austria</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Journal of Grid Computing</subfield>
   <subfield code="d">Springer Netherlands</subfield>
   <subfield code="g">9/4(2011-12-01), 531-548</subfield>
   <subfield code="x">1570-7873</subfield>
   <subfield code="q">9:4&lt;531</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">9</subfield>
   <subfield code="o">10723</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s10723-011-9196-x</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/s10723-011-9196-x</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">Prodan</subfield>
   <subfield code="D">Radu</subfield>
   <subfield code="u">Institute of Computer Science, University of Innsbruck, Technikerstraße 21a, 6020, Innsbruck, Austria</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">Wieczorek</subfield>
   <subfield code="D">Marek</subfield>
   <subfield code="u">Google Poland Ltd., Rynek Główny 12, 31-042, Kraków, Poland</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">Fard</subfield>
   <subfield code="D">Hamid</subfield>
   <subfield code="u">Institute of Computer Science, University of Innsbruck, Technikerstraße 21a, 6020, Innsbruck, Austria</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">Journal of Grid Computing</subfield>
   <subfield code="d">Springer Netherlands</subfield>
   <subfield code="g">9/4(2011-12-01), 531-548</subfield>
   <subfield code="x">1570-7873</subfield>
   <subfield code="q">9:4&lt;531</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">9</subfield>
   <subfield code="o">10723</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>
