{"_buckets": {"deposit": "5eb6e789-1ae9-48f4-9478-ae9d8a2a1ce9"}, "_deposit": {"id": "5244", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "5244"}, "status": "published"}, "_oai": {"id": "oai:nagoya.repo.nii.ac.jp:00005244", "sets": ["314"]}, "author_link": ["13264", "13265", "13266", "13267", "13268"], "item_10_biblio_info_6": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2005-08", "bibliographicIssueDateType": "Issued"}, "bibliographicPageEnd": "52", "bibliographicPageStart": "45", "bibliographic_titles": [{"bibliographic_title": "Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications", "bibliographic_titleLang": "en"}]}]}, "item_10_description_4": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "In recent years, the use of cache memory has been desired in hand real-time systems in order to reduce the memory access time. To enable it, accurate analysis of the worst case execution time considering cache flushes is necessary since the cache may be flushed by preempting tasks in a multitask environment. This paper proposes a method to find the worst-case timing of cache flushes and demonstrates its effectiveness.", "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/6831"}]}, "item_10_publisher_32": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "IEEE", "subitem_publisher_language": "en"}]}, "item_10_relation_11": {"attribute_name": "DOI", "attribute_value_mlt": [{"subitem_relation_type": "isVersionOf", "subitem_relation_type_id": {"subitem_relation_type_id_text": "https://doi.org/10.1109/RTCSA.2005.22", "subitem_relation_type_select": "DOI"}}]}, "item_10_rights_12": {"attribute_name": "権利", "attribute_value_mlt": [{"subitem_rights": "Copyright © 2005 IEEE. Reprinted from (relevant publication info). This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Nagoya University’s products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org.", "subitem_rights_language": "en"}]}, "item_10_select_15": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_select_item": "publisher"}]}, "item_10_text_14": {"attribute_name": "フォーマット", "attribute_value_mlt": [{"subitem_text_value": "application/pdf"}]}, "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": "Miyamoto, Hiroshi", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "13264", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Iiyama, Shinichi", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "13265", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Tomiyama, Hiroyuki", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "13266", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Takada, Hiroaki", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "13267", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Nakashima, Hiroshi", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "13268", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2018-02-19"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "RTCSA_2005_45.pdf", "filesize": [{"value": "3.4 MB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_note", "mimetype": "application/pdf", "size": 3400000.0, "url": {"label": "RTCSA_2005_45.pdf", "objectType": "fulltext", "url": "https://nagoya.repo.nii.ac.jp/record/5244/files/RTCSA_2005_45.pdf"}, "version_id": "f384c6e0-7f24-4bc9-a8db-1e97564833c1"}]}, "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": "An efficient search algorithm of worst-case cache flush timings", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "An efficient search algorithm of worst-case cache flush timings", "subitem_title_language": "en"}]}, "item_type_id": "10", "owner": "1", "path": ["314"], "permalink_uri": "http://hdl.handle.net/2237/6831", "pubdate": {"attribute_name": "PubDate", "attribute_value": "2006-08-09"}, "publish_date": "2006-08-09", "publish_status": "0", "recid": "5244", "relation": {}, "relation_version_is_last": true, "title": ["An efficient search algorithm of worst-case cache flush timings"], "weko_shared_id": -1}