Dataset Open Access

Autonomic Provisioning and Application Mapping on Spot Cloud Resources

Dubois, Daniel J.; Casale, Giuliano


MARC21 XML Export

<?xml version='1.0' encoding='UTF-8'?>
<record xmlns="http://www.loc.gov/MARC21/slim">
  <leader>00000nmm##2200000uu#4500</leader>
  <controlfield tag="005">20200124192514.0</controlfield>
  <controlfield tag="001">20281</controlfield>
  <datafield tag="711" ind1=" " ind2=" ">
    <subfield code="d">September 21-25, 2015</subfield>
    <subfield code="g">ICCAC '15</subfield>
    <subfield code="a">2015 IEEE INTERNATIONAL CONFERENCE ON CLOUD AND AUTONOMIC COMPUTING</subfield>
    <subfield code="c">Cambridge, MA, USA</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">Imperial College London</subfield>
    <subfield code="a">Casale, Giuliano</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="s">372332</subfield>
    <subfield code="z">md5:8d1172fc6b94b4246411640d6d9ba0bf</subfield>
    <subfield code="u">https://zenodo.org/record/20281/files/dubois-iccac15-results.zip</subfield>
  </datafield>
  <datafield tag="542" ind1=" " ind2=" ">
    <subfield code="l">open</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="y">Conference website</subfield>
    <subfield code="u">http://www.autonomic-conference.org</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2015-09-21</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="p">openaire_data</subfield>
    <subfield code="o">oai:zenodo.org:20281</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="u">Imperial College London</subfield>
    <subfield code="a">Dubois, Daniel J.</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">Autonomic Provisioning and Application Mapping on Spot Cloud Resources</subfield>
  </datafield>
  <datafield tag="536" ind1=" " ind2=" ">
    <subfield code="c">629982</subfield>
    <subfield code="a">Self-organizing Performance Prediction and Optimization for Large-scale Software Systems</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="u">https://creativecommons.org/licenses/by/4.0/legalcode</subfield>
    <subfield code="a">Creative Commons Attribution 4.0 International</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="7">
    <subfield code="a">cc-by</subfield>
    <subfield code="2">opendefinition.org</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">&lt;p&gt;1. Attached files:&amp;nbsp;&amp;nbsp; &amp;nbsp;&amp;nbsp;&amp;nbsp; &amp;nbsp;&lt;/p&gt;

&lt;p&gt;500_100_fmincon_0.95_1.mat&amp;nbsp;&amp;nbsp; &amp;nbsp;&lt;br /&gt;
Experiment with 500 users, 100ms max response time, 95% availability, exact algorithm.&lt;/p&gt;

&lt;p&gt;500_100_heuristic_0.95_1.mat&lt;br /&gt;
Experiment with 500 users, 100ms max response time, 95% availability, our algorithm.&lt;/p&gt;

&lt;p&gt;2000_70_fmincon_0.95_1.mat&lt;br /&gt;
Experiment with 2000 users, 70ms max response time, 95% availability, exact algorithm.&lt;/p&gt;

&lt;p&gt;2000_70_heuristic_0.95_1.mat&lt;br /&gt;
Experiment with 2000 users, 70ms max response time, 95% availability, our algorithm.&lt;/p&gt;

&lt;p&gt;2000_100_fmincon_0.9_1.mat&lt;br /&gt;
Experiment with 2000 users, 100ms max response time, 90% availability, exact algorithm.&lt;/p&gt;

&lt;p&gt;2000_100_heuristic_0.9_1.mat &amp;nbsp; &amp;nbsp;&lt;br /&gt;
Experiment with 2000 users, 100ms max response time, 90% availability, our algorithm.&lt;/p&gt;

&lt;p&gt;2000_100_fmincon_0.95_1.mat &amp;nbsp; &amp;nbsp;&amp;nbsp;&lt;br /&gt;
Experiment with 2000 users, 100ms max response time, 95% availability, exact algorithm.&lt;/p&gt;

&lt;p&gt;2000_100_heuristic_0.95_1.mat &amp;nbsp;&amp;nbsp;&lt;br /&gt;
Experiment with 2000 users, 100ms max response time, 95% availability, our algorithm.&lt;/p&gt;

&lt;p&gt;2000_100_fmincon_0.999_1.mat &amp;nbsp; &amp;nbsp;&lt;br /&gt;
Experiment with 2000 users, 100ms max response time, 99.9% availability, exact algorithm.&lt;/p&gt;

&lt;p&gt;2000_100_heuristic_0.999_1.mat &amp;nbsp;&lt;br /&gt;
Experiment with 2000 users, 100ms max response time, 99.9% availability, our algorithm.&lt;/p&gt;

&lt;p&gt;2000_300_fmincon_0.95_1.mat &amp;nbsp; &amp;nbsp;&amp;nbsp;&lt;br /&gt;
Experiment with 2000 users, 300ms max response time, 95% availability, exact algorithm.&lt;/p&gt;

&lt;p&gt;2000_300_heuristic_0.95_1.mat&amp;nbsp;&lt;br /&gt;
Experiment with 2000 users, 300ms max response time, 95% availability, our algorithm.&lt;/p&gt;

&lt;p&gt;10000_100_fmincon_0.95_1.mat &amp;nbsp; &amp;nbsp;&lt;br /&gt;
Experiment with 10000 users, 100ms max response time, 95% availability, exact algorithm.&lt;/p&gt;

&lt;p&gt;10000_100_heuristic_0.95_1.mat &amp;nbsp;&lt;br /&gt;
Experiment with 10000 users, 100ms max response time, 95% availability, our algorithm.&lt;/p&gt;

&lt;p&gt;2. Data format:&lt;/p&gt;

&lt;p&gt;MATLAB data format, can be load from MATLAB using the following command:&lt;/p&gt;

&lt;p&gt;results = load(filename);&lt;/p&gt;

&lt;p&gt;results is defined as a structure with the following fields:&lt;/p&gt;

&lt;p&gt;results.cost&lt;br /&gt;
&amp;nbsp;&amp;nbsp; &amp;nbsp;Type:&amp;nbsp;&amp;nbsp; &amp;nbsp;scalar, positive real number.&lt;br /&gt;
&amp;nbsp;&amp;nbsp; &amp;nbsp;Desc:&amp;nbsp;&amp;nbsp; &amp;nbsp;hourly cost in US dollars.&lt;/p&gt;

&lt;p&gt;&amp;nbsp;&amp;nbsp; &amp;nbsp;&amp;nbsp;&amp;nbsp; &amp;nbsp;&lt;br /&gt;
results.time&lt;br /&gt;
&amp;nbsp;&amp;nbsp; &amp;nbsp;Type:&amp;nbsp;&amp;nbsp; &amp;nbsp;scalar, positive real number.&lt;br /&gt;
&amp;nbsp;&amp;nbsp; &amp;nbsp;Desc:&amp;nbsp;&amp;nbsp; &amp;nbsp;total time (in seconds) needed by the algorithm to compute the solution.&lt;/p&gt;

&lt;p&gt;results.evaluations&lt;br /&gt;
&amp;nbsp;&amp;nbsp; &amp;nbsp;Type:&amp;nbsp;&amp;nbsp; &amp;nbsp;scalar, positive integer number.&lt;br /&gt;
&amp;nbsp;&amp;nbsp; &amp;nbsp;Desc:&amp;nbsp;&amp;nbsp; &amp;nbsp;number of constraints evaluations needed by the algorithm to compute the&amp;nbsp;&lt;br /&gt;
&amp;nbsp;&amp;nbsp; &amp;nbsp;&amp;nbsp;&amp;nbsp; &amp;nbsp;solution.&lt;/p&gt;

&lt;p&gt;&lt;br /&gt;
results.d&lt;br /&gt;
&amp;nbsp;&amp;nbsp; &amp;nbsp;Type:&amp;nbsp;&amp;nbsp; &amp;nbsp;matrix, non negative positive real number.&amp;nbsp;&lt;br /&gt;
&amp;nbsp;&amp;nbsp; &amp;nbsp;Desc:&amp;nbsp;&amp;nbsp; &amp;nbsp;association matrix between rented resources (columns) and application&amp;nbsp;&lt;br /&gt;
&amp;nbsp;&amp;nbsp; &amp;nbsp;&amp;nbsp;&amp;nbsp; &amp;nbsp;components (rows). The sum of all the elements of this matrix is equal to&lt;br /&gt;
&amp;nbsp;&amp;nbsp; &amp;nbsp;&amp;nbsp;&amp;nbsp; &amp;nbsp;the ECUs used by the application.&lt;/p&gt;</subfield>
  </datafield>
  <datafield tag="773" ind1=" " ind2=" ">
    <subfield code="n">handle</subfield>
    <subfield code="i">isSupplementTo</subfield>
    <subfield code="a">10044/1/25102</subfield>
  </datafield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.5281/zenodo.20281</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">dataset</subfield>
  </datafield>
</record>
144
22
views
downloads
All versions This version
Views 144144
Downloads 2222
Data volume 8.2 MB8.2 MB
Unique views 130130
Unique downloads 2222

Share

Cite as