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": "477bbe17-f149-4410-a30c-2a7948698b04"}, "_deposit": {"id": "3812", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "3812"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/3812", "sets": ["user-ucsy"]}, "communities": ["ucsy"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "Simulation System for Performance Analysis of Scheduling Algorithm with Uniprocessor", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "Multiprogramming is used to improve the efficiency of the micro-processor. That is when the currently running process is blocked due to waiting for an I/O event, another process may be scheduled to run. At this moment, the issue of scheduling is involved, deciding which process should be executed by the processor, because usually more than one process may be ready for being scheduled.This paper presents performance analysis for different scheduling algorithms for multi-programming in uniprocessor environment Performance analysis is based on average turn-around time, average waiting time and average ratio or turn-around time to service time. Performance analysis shows that RR requires more waiting time and therefore , increase more turn-around time and turn- around to service time ratio. On the other hand,Short Process Next (SPN),Shortest Remaining Time (SRT) and Highest Response Ratio Next (HRRN) algorithms perform the best."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value_mlt": [{"interim": "Uniprocessor Scheduling"}, {"interim": "Scheduling algorithms"}, {"interim": "multiprogramming"}, {"interim": "performance analysis"}]}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2019-07-31"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "54130.pdf", "filesize": [{"value": "229 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 229000.0, "url": {"url": "https://meral.edu.mm/record/3812/files/54130.pdf"}, "version_id": "16f4f7c1-0866-4ec4-9db8-2d6f63a5c4e8"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_issue": "", "subitem_journal_title": "Fourth Local Conference on Parallel and Soft Computing", "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": "Wai, Khin San"}, {"subitem_authors_fullname": "Htun, Moe Sanda"}]}]}, "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": "2009-12-30"}, "item_1583159847033": {"attribute_name": "Identifier", "attribute_value": "http://onlineresource.ucsy.edu.mm/handle/123456789/1540"}, "item_title": "Simulation System for Performance Analysis of Scheduling Algorithm with Uniprocessor", "item_type_id": "21", "owner": "1", "path": ["1597824273898"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000003812", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2019-07-31"}, "publish_date": "2019-07-31", "publish_status": "0", "recid": "3812", "relation": {}, "relation_version_is_last": true, "title": ["Simulation System for Performance Analysis of Scheduling Algorithm with Uniprocessor"], "weko_shared_id": -1}
  1. University of Computer Studies, Yangon
  2. Conferences

Simulation System for Performance Analysis of Scheduling Algorithm with Uniprocessor

http://hdl.handle.net/20.500.12678/0000003812
http://hdl.handle.net/20.500.12678/0000003812
c7004f04-aa90-41cd-80c4-2b6602cfee4d
477bbe17-f149-4410-a30c-2a7948698b04
None
Preview
Name / File License Actions
54130.pdf 54130.pdf (229 Kb)
Publication type
Article
Upload type
Publication
Title
Title Simulation System for Performance Analysis of Scheduling Algorithm with Uniprocessor
Language en
Publication date 2009-12-30
Authors
Wai, Khin San
Htun, Moe Sanda
Description
Multiprogramming is used to improve the efficiency of the micro-processor. That is when the currently running process is blocked due to waiting for an I/O event, another process may be scheduled to run. At this moment, the issue of scheduling is involved, deciding which process should be executed by the processor, because usually more than one process may be ready for being scheduled.This paper presents performance analysis for different scheduling algorithms for multi-programming in uniprocessor environment Performance analysis is based on average turn-around time, average waiting time and average ratio or turn-around time to service time. Performance analysis shows that RR requires more waiting time and therefore , increase more turn-around time and turn- around to service time ratio. On the other hand,Short Process Next (SPN),Shortest Remaining Time (SRT) and Highest Response Ratio Next (HRRN) algorithms perform the best.
Keywords
Uniprocessor Scheduling, Scheduling algorithms, multiprogramming, performance analysis
Identifier http://onlineresource.ucsy.edu.mm/handle/123456789/1540
Journal articles
Fourth Local Conference on Parallel and Soft Computing
Conference papers
Books/reports/chapters
Thesis/dissertations
Back
0
0
views
downloads
See details
Views Downloads

Versions

Ver.1 2020-09-01 13:34:20.093669
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