Log in
Language:

MERAL Myanmar Education Research and Learning Portal

  • Top
  • Universities
  • Ranking
To
lat lon distance
To

Field does not validate



Index Link

Index Tree

Please input email address.

WEKO

One fine body…

WEKO

One fine body…

Item

{"_buckets": {"deposit": "ffa783a5-d2b0-4b33-a0a8-6ab395a3adc2"}, "_deposit": {"id": "4523", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "4523"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/4523", "sets": ["1597824273898", "user-ucsy"]}, "communities": ["ucsy"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "Working Set Prediction using LRU cache with Splay Tree Algorithm in Live VM Migration", "subitem_1551255648112": "en_US"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "Live virtual machine (VM) migrationprovides great benefits for load balancing,power management, fault tolerance and othersystem maintenance issues in modern datacenters. VM live migration basically consists oftransferring its memory pages from a sourceserver to a destination server. The amount oftransferred memory pages affected the downtimeand application performance of virtualmachines. In pre-copy approach in live VMmigration, total migration time is prolonged thesignificant amount of transferred data during thewhole migration process. In this paper, wepropose a working set prediction algorithmwhich combine LRU (Least Recently Used) cachewith splay tree algorithm. Deploying splay treealgorithm with LRU, the proposed algorithmpredict the memory pages of the most recentprocess and define as the working set. Applyingthe proposed algorithm, we can reduce theamount of transferred memory pages duringmigration process by transferring the workingset in last round. Experiment demonstrates thatcompared with XEN’s default pre-copy basedmigration algorithm, the proposed algorithm canreduce 23.67% of the total transferred memorypages during migration process."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value_mlt": [{"interim": "Least Recently Used (LRU)"}, {"interim": "Total Migration Time"}, {"interim": "Pre-copy based live migration"}, {"interim": "Virtual Machine"}]}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2019-11-15"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "10104.pdf", "filesize": [{"value": "740 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 740000.0, "url": {"url": "https://meral.edu.mm/record/4523/files/10104.pdf"}, "version_id": "dd9379d9-fae3-44d7-9c39-bc42bba26687"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_issue": "", "subitem_journal_title": "Tenth International Conference On Computer Applications (ICCA 2012)", "subitem_pages": "", "subitem_volume": ""}]}, "item_1583103147082": {"attribute_name": "Conference papers", "attribute_value_mlt": [{"subitem_acronym": "", "subitem_c_date": "", "subitem_conference_title": "", "subitem_part": "", "subitem_place": "", "subitem_session": "", "subitem_website": ""}]}, "item_1583103211336": {"attribute_name": "Books/reports/chapters", "attribute_value_mlt": [{"subitem_book_title": "", "subitem_isbn": "", "subitem_pages": "", "subitem_place": "", "subitem_publisher": ""}]}, "item_1583103233624": {"attribute_name": "Thesis/dissertations", "attribute_value_mlt": [{"subitem_awarding_university": "", "subitem_supervisor(s)": [{"subitem_supervisor": ""}]}]}, "item_1583105942107": {"attribute_name": "Authors", "attribute_value_mlt": [{"subitem_authors": [{"subitem_authors_fullname": "Zaw, Ei Phyu"}, {"subitem_authors_fullname": "Thein, Ni Lar"}]}]}, "item_1583108359239": {"attribute_name": "Upload type", "attribute_value_mlt": [{"interim": "Publication"}]}, "item_1583108428133": {"attribute_name": "Publication type", "attribute_value_mlt": [{"interim": "Article"}]}, "item_1583159729339": {"attribute_name": "Publication date", "attribute_value": "2012-02-28"}, "item_1583159847033": {"attribute_name": "Identifier", "attribute_value": "http://onlineresource.ucsy.edu.mm/handle/123456789/2448"}, "item_title": "Working Set Prediction using LRU cache with Splay Tree Algorithm in Live VM Migration", "item_type_id": "21", "owner": "1", "path": ["1597824273898"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000004523", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2019-11-15"}, "publish_date": "2019-11-15", "publish_status": "0", "recid": "4523", "relation": {}, "relation_version_is_last": true, "title": ["Working Set Prediction using LRU cache with Splay Tree Algorithm in Live VM Migration"], "weko_shared_id": -1}
  1. University of Computer Studies, Yangon
  2. Conferences

Working Set Prediction using LRU cache with Splay Tree Algorithm in Live VM Migration

http://hdl.handle.net/20.500.12678/0000004523
http://hdl.handle.net/20.500.12678/0000004523
53f9f65a-3813-4004-b5d7-54ec13b5e853
ffa783a5-d2b0-4b33-a0a8-6ab395a3adc2
None
Preview
Name / File License Actions
10104.pdf 10104.pdf (740 Kb)
Publication type
Article
Upload type
Publication
Title
Title Working Set Prediction using LRU cache with Splay Tree Algorithm in Live VM Migration
Language en_US
Publication date 2012-02-28
Authors
Zaw, Ei Phyu
Thein, Ni Lar
Description
Live virtual machine (VM) migrationprovides great benefits for load balancing,power management, fault tolerance and othersystem maintenance issues in modern datacenters. VM live migration basically consists oftransferring its memory pages from a sourceserver to a destination server. The amount oftransferred memory pages affected the downtimeand application performance of virtualmachines. In pre-copy approach in live VMmigration, total migration time is prolonged thesignificant amount of transferred data during thewhole migration process. In this paper, wepropose a working set prediction algorithmwhich combine LRU (Least Recently Used) cachewith splay tree algorithm. Deploying splay treealgorithm with LRU, the proposed algorithmpredict the memory pages of the most recentprocess and define as the working set. Applyingthe proposed algorithm, we can reduce theamount of transferred memory pages duringmigration process by transferring the workingset in last round. Experiment demonstrates thatcompared with XEN’s default pre-copy basedmigration algorithm, the proposed algorithm canreduce 23.67% of the total transferred memorypages during migration process.
Keywords
Least Recently Used (LRU), Total Migration Time, Pre-copy based live migration, Virtual Machine
Identifier http://onlineresource.ucsy.edu.mm/handle/123456789/2448
Journal articles
Tenth International Conference On Computer Applications (ICCA 2012)
Conference papers
Books/reports/chapters
Thesis/dissertations
Back
0
0
views
downloads
See details
Views Downloads

Versions

Ver.1 2020-09-01 15:01:36.415606
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Export

OAI-PMH
  • OAI-PMH DublinCore
Other Formats
  • JSON

Confirm


Back to MERAL


Back to MERAL