<?xml version='1.0' encoding='utf-8'?>
<eprints xmlns='http://eprints.org/ep2/data/2.0'>
  <eprint id='https://bordar.bournemouth.ac.uk/id/eprint/166'>
    <eprintid>166</eprintid>
    <rev_number>30</rev_number>
    <documents>
      <document id='https://bordar.bournemouth.ac.uk/id/document/443'>
        <docid>443</docid>
        <rev_number>2</rev_number>
        <files>
          <file id='https://bordar.bournemouth.ac.uk/id/file/1906'>
            <fileid>1906</fileid>
            <datasetid>document</datasetid>
            <objectid>443</objectid>
            <filename>Experiments_data.zip</filename>
            <mime_type>application/zip</mime_type>
            <hash>287e464a9cf9fc2d1c3cc654880a4c6e</hash>
            <hash_type>MD5</hash_type>
            <filesize>19874569</filesize>
            <mtime>2021-06-01 11:10:24</mtime>
            <url>https://bordar.bournemouth.ac.uk/166/1/Experiments_data.zip</url>
          </file>
        </files>
        <eprintid>166</eprintid>
        <pos>1</pos>
        <placement>1</placement>
        <mime_type>application/zip</mime_type>
        <format>archive</format>
        <formatdesc>This file includes the results from experiments as well as source codes for the project.</formatdesc>
        <language>en</language>
        <security>public</security>
        <license>cc_by_nd_4</license>
        <main>Experiments_data.zip</main>
        <content>full_archive</content>
      </document>
      <document id='https://bordar.bournemouth.ac.uk/id/document/444'>
        <docid>444</docid>
        <rev_number>2</rev_number>
        <files>
          <file id='https://bordar.bournemouth.ac.uk/id/file/1908'>
            <fileid>1908</fileid>
            <datasetid>document</datasetid>
            <objectid>444</objectid>
            <filename>README.txt</filename>
            <mime_type>text/plain</mime_type>
            <hash>5bcb14c70a8f6a568ee6a1c9f9b108d7</hash>
            <hash_type>MD5</hash_type>
            <filesize>1916</filesize>
            <mtime>2021-06-01 11:11:01</mtime>
            <url>https://bordar.bournemouth.ac.uk/166/2/README.txt</url>
          </file>
        </files>
        <eprintid>166</eprintid>
        <pos>2</pos>
        <placement>2</placement>
        <mime_type>text/plain</mime_type>
        <format>text</format>
        <language>en</language>
        <security>public</security>
        <license>cc_by_nd_4</license>
        <main>README.txt</main>
        <content>full_archive</content>
      </document>
      <document id='https://bordar.bournemouth.ac.uk/id/document/445'>
        <docid>445</docid>
        <rev_number>1</rev_number>
        <files>
          <file id='https://bordar.bournemouth.ac.uk/id/file/1919'>
            <fileid>1919</fileid>
            <datasetid>document</datasetid>
            <objectid>445</objectid>
            <filename>indexcodes.txt</filename>
            <mime_type>text/plain</mime_type>
            <hash>2609bdd5d89c5799b8fb233fb52cd715</hash>
            <hash_type>MD5</hash_type>
            <filesize>1018</filesize>
            <mtime>2021-06-01 12:19:44</mtime>
            <url>https://bordar.bournemouth.ac.uk/166/3/indexcodes.txt</url>
          </file>
        </files>
        <eprintid>166</eprintid>
        <pos>3</pos>
        <placement>3</placement>
        <mime_type>text/plain</mime_type>
        <format>other</format>
        <formatdesc>Generate index codes conversion from text to indexcodes</formatdesc>
        <language>en</language>
        <security>public</security>
        <main>indexcodes.txt</main>
        <relation>
          <item>
            <type>http://eprints.org/relation/isVersionOf</type>
            <uri>https://bordar.bournemouth.ac.uk/id/document/444</uri>
          </item>
          <item>
            <type>http://eprints.org/relation/isVolatileVersionOf</type>
            <uri>https://bordar.bournemouth.ac.uk/id/document/444</uri>
          </item>
          <item>
            <type>http://eprints.org/relation/isIndexCodesVersionOf</type>
            <uri>https://bordar.bournemouth.ac.uk/id/document/444</uri>
          </item>
        </relation>
      </document>
    </documents>
    <eprint_status>archive</eprint_status>
    <userid>7335</userid>
    <dir>disk0/00/00/01/66</dir>
    <datestamp>2021-11-01 10:32:23</datestamp>
    <lastmod>2021-11-03 15:50:00</lastmod>
    <status_changed>2021-11-01 10:32:23</status_changed>
    <type>data_collection</type>
    <metadata_visibility>show</metadata_visibility>
    <creators>
      <item>
        <name>
          <family>Hamzeh</family>
          <given>Hamed</given>
        </name>
        <id>s5077150@bournemouth.ac.uk</id>
      </item>
    </creators>
    <title>Fair resource allocation algorithms (MLF-DRS, FFMRA, H-FFFMRA): The output and source codes for the experiments</title>
    <ispublished>pub</ispublished>
    <divisions>
      <item>facsci</item>
    </divisions>
    <keywords>allocation, data, fairness, resource, workload</keywords>
    <abstract>In this thesis, we have used randomly generated workloads to evaluate the performance of proposed fair resource allocation algorithms (MLF-DRS, FFMRA, H-FFFMRA). The produced workloads have been directly fed into the simulation environment, considering different metrics such as resource allocation, utilization, and fairness. A sample CSV file has been provided that illustrates how the raw data generated by the mathematical models look (workload_0). This is a sample generated workload based on a single task with various resource demands in time-series experiments. The generated workload is used to determine allocation with respect to other tasks, submitted to the system.</abstract>
    <date>2021-11-01</date>
    <date_type>published</date_type>
    <publisher>Bournemouth University</publisher>
    <id_number>10.18746/bmth.data.00000166</id_number>
    <data_type>Other</data_type>
    <contact_email>bordar@bournemouth.ac.uk</contact_email>
    <contact_details>
      <role>Student</role>
      <name>
        <family>Hamzeh</family>
        <given>Hamed</given>
      </name>
      <id>s5077150@bournemouth.ac.uk</id>
    </contact_details>
    <related_res_rich>
      <item>
        <title>Fairness for resource allocation in cloud computing</title>
        <res_type>thesis</res_type>
        <url>http://eprints.bournemouth.ac.uk/35652/</url>
        <status>submitted</status>
        <pub>Bournemouth University</pub>
      </item>
      <item>
        <title>H-FFMRA: A Multi Resource Fully Fair Resources Allocation Algorithm in Heterogeneous Cloud Computing</title>
        <res_type>pub</res_type>
        <id>10.1109/COMPSAC51774.2021.00172</id>
        <id_type>DOI</id_type>
        <url>https://ieeexplore.ieee.org/document/9529581</url>
        <status>pub</status>
        <pub>IEEE</pub>
      </item>
    </related_res_rich>
    <data_prep_note>The input data for the experiments has been produces during the simulation time. The outputs have been provided in a zip file for different metrics such as resource allocation, utilisation and fairness.</data_prep_note>
    <collection_method>The data has been produced during the experiments and using the CloudSim simulation framework. We have used randomly generated workloads and Google traces, including only 1% of the data that have been fed directly into the simulation environment. The link for the data set has been provided in the readme.txt file. The output data have been carefully gathered through time-series experiments.</collection_method>
    <collection_date>
      <date_from>2018-02-01</date_from>
      <date_to>2020-07</date_to>
    </collection_date>
  </eprint>
</eprints>
