ログイン
言語:

WEKO3

  • トップ
  • ランキング
To
lat lon distance
To

Field does not validate



インデックスリンク

インデックスツリー

メールアドレスを入力してください。

WEKO

One fine body…

WEKO

One fine body…

アイテム

{"_buckets": {"deposit": "cf11cbaa-2d0e-4fed-9c1d-95960ec38ae8"}, "_deposit": {"id": "12589", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "12589"}, "status": "published"}, "_oai": {"id": "oai:nagoya.repo.nii.ac.jp:00012589", "sets": ["314"]}, "author_link": ["39605", "39606", "39607"], "item_10_biblio_info_6": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2010", "bibliographicIssueDateType": "Issued"}, "bibliographicPageEnd": "1129", "bibliographicPageStart": "1124", "bibliographic_titles": [{"bibliographic_title": "Design, Automation \u0026 Test in Europe Conference \u0026 Exhibition, 8-12 March 2010", "bibliographic_titleLang": "en"}]}]}, "item_10_description_4": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "Scratch-pad memory has been employed as a partial or entire replacement for cache memory due to its better energy efficiency. In this paper, we propose scratch-pad memory management techniques for priority-based preemptive multi-task systems. Our techniques are applicable to a real-time environment. The three methods which we propose, i.e., spatial, temporal, and hybrid methods, bring about effective usage of the scratch-pad memory space, and achieve energy reduction in the instruction memory subsystems. We formulate each method as an integer programming problem that simultaneously determines (1) partitioning of scratch-pad memory space for the tasks, and (2) allocation of program code to scratch-pad memory space for each task. It is remarkable that periods and priorities of tasks are considered in the formulas. Additionally, we implement an RTOS-hardware cooperative support mechanism for a runtime code allocation to the scratch-pad memory space. We have made the experiments with the fully functional real-time operating system. The experimental results with four task sets have demonstrated the effectiveness of our techniques. Up to 73% energy reduction compared to a standard method was achieved.", "subitem_description_language": "en", "subitem_description_type": "Abstract"}]}, "item_10_identifier_60": {"attribute_name": "URI", "attribute_value_mlt": [{"subitem_identifier_type": "HDL", "subitem_identifier_uri": "http://hdl.handle.net/2237/14473"}, {"subitem_identifier_type": "URI", "subitem_identifier_uri": "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=\u0026arnumber=5456977\u0026isnumber=5456897"}]}, "item_10_publisher_32": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "IEEE", "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://ieeexplore.ieee.org/stamp/stamp.jsp?tp=\u0026arnumber=5456977\u0026isnumber=5456897", "subitem_relation_type_select": "URI"}}]}, "item_10_rights_12": {"attribute_name": "権利", "attribute_value_mlt": [{"subitem_rights": "© 2010 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.", "subitem_rights_language": "en"}]}, "item_10_select_15": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_select_item": "author"}]}, "item_10_source_id_7": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "1530-1591", "subitem_source_identifier_type": "PISSN"}]}, "item_1615787544753": {"attribute_name": "出版タイプ", "attribute_value_mlt": [{"subitem_version_resource": "http://purl.org/coar/version/c_ab4af688f83e57aa", "subitem_version_type": "AM"}]}, "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": "Takase, Hideki", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "39605", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Tomiyama, Hiroyuki", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "39606", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Takada, Hiroaki", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "39607", "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": "1058.pdf", "filesize": [{"value": "365.0 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_note", "mimetype": "application/pdf", "size": 365000.0, "url": {"label": "1058.pdf", "objectType": "fulltext", "url": "https://nagoya.repo.nii.ac.jp/record/12589/files/1058.pdf"}, "version_id": "6fa714a3-838e-4ff8-9c3f-6f3a005302d8"}]}, "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": "Partitioning and Allocation of Scratch-Pad Memory for Priority-Based Preemptive Multi-Task Systems", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "Partitioning and Allocation of Scratch-Pad Memory for Priority-Based Preemptive Multi-Task Systems", "subitem_title_language": "en"}]}, "item_type_id": "10", "owner": "1", "path": ["314"], "permalink_uri": "http://hdl.handle.net/2237/14473", "pubdate": {"attribute_name": "PubDate", "attribute_value": "2011-02-15"}, "publish_date": "2011-02-15", "publish_status": "0", "recid": "12589", "relation": {}, "relation_version_is_last": true, "title": ["Partitioning and Allocation of Scratch-Pad Memory for Priority-Based Preemptive Multi-Task Systems"], "weko_shared_id": -1}
  1. A500 情報学部/情報学研究科・情報文化学部・情報科学研究科
  2. A500a 雑誌掲載論文
  3. 学術雑誌

Partitioning and Allocation of Scratch-Pad Memory for Priority-Based Preemptive Multi-Task Systems

http://hdl.handle.net/2237/14473
http://hdl.handle.net/2237/14473
221ca0b5-f05e-47f7-b25a-e7108c373a0d
名前 / ファイル ライセンス アクション
1058.pdf 1058.pdf (365.0 kB)
Item type 学術雑誌論文 / Journal Article(1)
公開日 2011-02-15
タイトル
タイトル Partitioning and Allocation of Scratch-Pad Memory for Priority-Based Preemptive Multi-Task Systems
言語 en
著者 Takase, Hideki

× Takase, Hideki

WEKO 39605

en Takase, Hideki

Search repository
Tomiyama, Hiroyuki

× Tomiyama, Hiroyuki

WEKO 39606

en Tomiyama, Hiroyuki

Search repository
Takada, Hiroaki

× Takada, Hiroaki

WEKO 39607

en Takada, Hiroaki

Search repository
アクセス権
アクセス権 open access
アクセス権URI http://purl.org/coar/access_right/c_abf2
権利
言語 en
権利情報 © 2010 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
抄録
内容記述 Scratch-pad memory has been employed as a partial or entire replacement for cache memory due to its better energy efficiency. In this paper, we propose scratch-pad memory management techniques for priority-based preemptive multi-task systems. Our techniques are applicable to a real-time environment. The three methods which we propose, i.e., spatial, temporal, and hybrid methods, bring about effective usage of the scratch-pad memory space, and achieve energy reduction in the instruction memory subsystems. We formulate each method as an integer programming problem that simultaneously determines (1) partitioning of scratch-pad memory space for the tasks, and (2) allocation of program code to scratch-pad memory space for each task. It is remarkable that periods and priorities of tasks are considered in the formulas. Additionally, we implement an RTOS-hardware cooperative support mechanism for a runtime code allocation to the scratch-pad memory space. We have made the experiments with the fully functional real-time operating system. The experimental results with four task sets have demonstrated the effectiveness of our techniques. Up to 73% energy reduction compared to a standard method was achieved.
言語 en
内容記述タイプ Abstract
出版者
言語 en
出版者 IEEE
言語
言語 eng
資源タイプ
資源タイプresource http://purl.org/coar/resource_type/c_6501
タイプ journal article
出版タイプ
出版タイプ AM
出版タイプResource http://purl.org/coar/version/c_ab4af688f83e57aa
関連情報
関連タイプ isVersionOf
識別子タイプ URI
関連識別子 http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5456977&isnumber=5456897
ISSN
収録物識別子タイプ PISSN
収録物識別子 1530-1591
書誌情報 en : Design, Automation & Test in Europe Conference & Exhibition, 8-12 March 2010

p. 1124-1129, 発行日 2010
著者版フラグ
値 author
URI
識別子 http://hdl.handle.net/2237/14473
識別子タイプ HDL
URI
識別子 http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5456977&isnumber=5456897
識別子タイプ URI
戻る
0
views
See details
Views

Versions

Ver.1 2021-03-01 18:50:06.719080
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Cite as

エクスポート

OAI-PMH
  • OAI-PMH JPCOAR
  • OAI-PMH DublinCore
  • OAI-PMH DDI
Other Formats
  • JSON
  • BIBTEX

Confirm


Powered by WEKO3


Powered by WEKO3