WEKO3
アイテム
{"_buckets": {"deposit": "788202eb-ba44-45ae-8e96-3180fe34bd4d"}, "_deposit": {"id": "13141", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "13141"}, "status": "published"}, "_oai": {"id": "oai:nagoya.repo.nii.ac.jp:00013141", "sets": ["314"]}, "author_link": ["41388", "41389", "41390"], "item_10_biblio_info_6": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2009-07-01", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "7", "bibliographicPageEnd": "1420", "bibliographicPageStart": "1412", "bibliographicVolumeNumber": "E92-D", "bibliographic_titles": [{"bibliographic_title": "IEICE transactions on information and systems", "bibliographic_titleLang": "en"}]}]}, "item_10_description_4": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "A task that suspends itself to wait for an I/O completion or to wait for an event from another node in distributed environments is called an I/O blocking task. Conventional hard real-time scheduling theories use framework of rate monotonic analysis (RMA) to schedule such I/O blocking tasks. However, most of them are pessimistic. In this paper, we propose effective algorithms that can schedule a task set which has I/O blocking tasks under dynamic priority assignment. We present a new critical instant theorem for the multi-frame task set under dynamic priority assignment. The schedulability is analyzed under the new critical instant theorem. For the schedulability analysis, this paper presents saturation summation which is used to calculate the maximum interference function (MIF). With saturation summation, the schedulability of a task set having I/O blocking tasks can be analyzed more accurately. We propose an algorithm which is called Frame Laxity Monotonic Scheduling (FLMS). A genetic algorithm (GA) is also applied. From our experiments, we can conclude that FLMS can significantly reduce the calculation time, and GA can improve task schedulability ratio more than is possible with FLMS.", "subitem_description_language": "en", "subitem_description_type": "Abstract"}]}, "item_10_identifier_60": {"attribute_name": "URI", "attribute_value_mlt": [{"subitem_identifier_type": "URI", "subitem_identifier_uri": "http://www.ieice.org/jpn/trans_online/index.html"}, {"subitem_identifier_type": "HDL", "subitem_identifier_uri": "http://hdl.handle.net/2237/15036"}]}, "item_10_publisher_32": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "Institute of Electronics, Information and Communication Engineers", "subitem_publisher_language": "en"}]}, "item_10_relation_43": {"attribute_name": "関連情報", "attribute_value_mlt": [{"subitem_relation_type": "isVersionOf", "subitem_relation_type_id": {"subitem_relation_type_id_text": "http://www.ieice.org/jpn/trans_online/index.html", "subitem_relation_type_select": "URI"}}]}, "item_10_rights_12": {"attribute_name": "権利", "attribute_value_mlt": [{"subitem_rights": "Copyright (C) 2009 IEICE", "subitem_rights_language": "en"}]}, "item_10_select_15": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_select_item": "publisher"}]}, "item_10_source_id_7": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "0916-8532", "subitem_source_identifier_type": "PISSN"}]}, "item_1615787544753": {"attribute_name": "出版タイプ", "attribute_value_mlt": [{"subitem_version_resource": "http://purl.org/coar/version/c_970fb48d4fbd8a85", "subitem_version_type": "VoR"}]}, "item_access_right": {"attribute_name": "アクセス権", "attribute_value_mlt": [{"subitem_access_right": "open access", "subitem_access_right_uri": "http://purl.org/coar/access_right/c_abf2"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "DING, Shan", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "41388", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "TOMIYAMA, Hiroyuki", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "41389", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "TAKADA, Hiroaki", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "41390", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2018-02-20"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "243.pdf", "filesize": [{"value": "442.9 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_note", "mimetype": "application/pdf", "size": 442900.0, "url": {"label": "243.pdf", "objectType": "fulltext", "url": "https://nagoya.repo.nii.ac.jp/record/13141/files/243.pdf"}, "version_id": "4e1f77dd-d82c-4037-bb61-0933e1e870ba"}]}, "item_keyword": {"attribute_name": "キーワード", "attribute_value_mlt": [{"subitem_subject": "I/O blocking", "subitem_subject_scheme": "Other"}, {"subitem_subject": "multi-frame task model", "subitem_subject_scheme": "Other"}, {"subitem_subject": "schedulability analysis", "subitem_subject_scheme": "Other"}, {"subitem_subject": "laxity", "subitem_subject_scheme": "Other"}, {"subitem_subject": "genetic algorithm", "subitem_subject_scheme": "Other"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "journal article", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "Effective Scheduling Algorithms for I/O Blocking with a Multi-Frame Task Model", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "Effective Scheduling Algorithms for I/O Blocking with a Multi-Frame Task Model", "subitem_title_language": "en"}]}, "item_type_id": "10", "owner": "1", "path": ["314"], "permalink_uri": "http://hdl.handle.net/2237/15036", "pubdate": {"attribute_name": "PubDate", "attribute_value": "2011-07-05"}, "publish_date": "2011-07-05", "publish_status": "0", "recid": "13141", "relation": {}, "relation_version_is_last": true, "title": ["Effective Scheduling Algorithms for I/O Blocking with a Multi-Frame Task Model"], "weko_shared_id": -1}
Effective Scheduling Algorithms for I/O Blocking with a Multi-Frame Task Model
http://hdl.handle.net/2237/15036
http://hdl.handle.net/2237/15036d9237e8b-ab20-4200-a362-ca6de2f377ae
名前 / ファイル | ライセンス | アクション |
---|---|---|
243.pdf (442.9 kB)
|
|
Item type | 学術雑誌論文 / Journal Article(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2011-07-05 | |||||
タイトル | ||||||
タイトル | Effective Scheduling Algorithms for I/O Blocking with a Multi-Frame Task Model | |||||
言語 | en | |||||
著者 |
DING, Shan
× DING, Shan× TOMIYAMA, Hiroyuki× TAKADA, Hiroaki |
|||||
アクセス権 | ||||||
アクセス権 | open access | |||||
アクセス権URI | http://purl.org/coar/access_right/c_abf2 | |||||
権利 | ||||||
言語 | en | |||||
権利情報 | Copyright (C) 2009 IEICE | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | I/O blocking | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | multi-frame task model | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | schedulability analysis | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | laxity | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | genetic algorithm | |||||
抄録 | ||||||
内容記述 | A task that suspends itself to wait for an I/O completion or to wait for an event from another node in distributed environments is called an I/O blocking task. Conventional hard real-time scheduling theories use framework of rate monotonic analysis (RMA) to schedule such I/O blocking tasks. However, most of them are pessimistic. In this paper, we propose effective algorithms that can schedule a task set which has I/O blocking tasks under dynamic priority assignment. We present a new critical instant theorem for the multi-frame task set under dynamic priority assignment. The schedulability is analyzed under the new critical instant theorem. For the schedulability analysis, this paper presents saturation summation which is used to calculate the maximum interference function (MIF). With saturation summation, the schedulability of a task set having I/O blocking tasks can be analyzed more accurately. We propose an algorithm which is called Frame Laxity Monotonic Scheduling (FLMS). A genetic algorithm (GA) is also applied. From our experiments, we can conclude that FLMS can significantly reduce the calculation time, and GA can improve task schedulability ratio more than is possible with FLMS. | |||||
言語 | en | |||||
内容記述タイプ | Abstract | |||||
出版者 | ||||||
言語 | en | |||||
出版者 | Institute of Electronics, Information and Communication Engineers | |||||
言語 | ||||||
言語 | eng | |||||
資源タイプ | ||||||
資源タイプresource | http://purl.org/coar/resource_type/c_6501 | |||||
タイプ | journal article | |||||
出版タイプ | ||||||
出版タイプ | VoR | |||||
出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |||||
関連情報 | ||||||
関連タイプ | isVersionOf | |||||
識別子タイプ | URI | |||||
関連識別子 | http://www.ieice.org/jpn/trans_online/index.html | |||||
ISSN | ||||||
収録物識別子タイプ | PISSN | |||||
収録物識別子 | 0916-8532 | |||||
書誌情報 |
en : IEICE transactions on information and systems 巻 E92-D, 号 7, p. 1412-1420, 発行日 2009-07-01 |
|||||
著者版フラグ | ||||||
値 | publisher | |||||
URI | ||||||
識別子 | http://www.ieice.org/jpn/trans_online/index.html | |||||
識別子タイプ | URI | |||||
URI | ||||||
識別子 | http://hdl.handle.net/2237/15036 | |||||
識別子タイプ | HDL |