WEKO3
アイテム
{"_buckets": {"deposit": "9006f491-0b7c-47d8-bd47-0aded0196399"}, "_deposit": {"created_by": 3, "id": "14343", "owners": [3], "pid": {"revision_id": 0, "type": "depid", "value": "14343"}, "status": "published"}, "_oai": {"id": "oai:sucra.repo.nii.ac.jp:00014343", "sets": ["242"]}, "author_link": ["18709"], "item_119_biblio_info_8": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "1998", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "3", "bibliographicPageEnd": "438", "bibliographicPageStart": "429", "bibliographicVolumeNumber": "E81-A", "bibliographic_titles": [{"bibliographic_title": "IEICE transactions on fundamentals of electronics, communications and computer sciences"}]}]}, "item_119_date_31": {"attribute_name": "作成日", "attribute_value_mlt": [{"subitem_date_issued_datetime": "2008-01-30", "subitem_date_issued_type": "Created"}]}, "item_119_description_17": {"attribute_name": "関連サイト", "attribute_value_mlt": [{"subitem_description": "http://search.ieice.org/index.html | http://search.ieice.org/index.html", "subitem_description_type": "Other"}]}, "item_119_description_19": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "One of the ways to execute a processing algorithm in high speed is parallel processing on multiple computing resources such as processors and functional units. To identify the minimum number of computing resources, the most important is the scheduling to determine when each operation in the processing algorithm is executed. Among feasible schedules satisfying all the data dependencies in the processing algorithm, an overlapped schedule can achieve the fastest execution speed for an iterative processing algorithm. In the case of processing algorithms with operations which are executed on some conditions, computing resources can be shared by those conditional operations. In this paper, we propose a scheduling method which derives an overlapped schedule where the required number of computing resources is minimized by considering the sharing by conditional operations.", "subitem_description_type": "Abstract"}]}, "item_119_description_21": {"attribute_name": "注記", "attribute_value_mlt": [{"subitem_description": "copyright(c)1998 \nIEICE許諾番号:08RB0009", "subitem_description_type": "Other"}]}, "item_119_description_29": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"subitem_description": "text", "subitem_description_type": "Other"}]}, "item_119_description_30": {"attribute_name": "フォーマット", "attribute_value_mlt": [{"subitem_description": "application/pdf", "subitem_description_type": "Other"}]}, "item_119_publisher_11": {"attribute_name": "出版者名", "attribute_value_mlt": [{"subitem_publisher": "社団法人電子情報通信学会"}]}, "item_119_relation_7": {"attribute_name": "著者 外部リンク", "attribute_value_mlt": [{"subitem_relation_name": [{"subitem_relation_name_text": "http://s-read.saitama-u.ac.jp/researchers/pages/researcher/TfwxTeoe"}], "subitem_relation_type_id": {"subitem_relation_type_id_text": "http://s-read.saitama-u.ac.jp/researchers/pages/researcher/TfwxTeoe", "subitem_relation_type_select": "URI"}}]}, "item_119_source_id_14": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "09168508", "subitem_source_identifier_type": "ISSN"}]}, "item_119_text_27": {"attribute_name": "版", "attribute_value_mlt": [{"subitem_text_value": "[出版社版]"}]}, "item_119_text_3": {"attribute_name": "著者 ローマ字", "attribute_value_mlt": [{"subitem_text_value": "ITO, Kazuhito"}, {"subitem_text_value": "KAWASAKI, Tatsuya"}]}, "item_119_text_32": {"attribute_name": "アイテムID", "attribute_value_mlt": [{"subitem_text_value": "A1003001"}]}, "item_119_text_35": {"attribute_name": "公開日(XooNIps)", "attribute_value_mlt": [{"subitem_text_value": "Jan 30, 2008 09:00:00"}]}, "item_119_text_36": {"attribute_name": "最終更新日(XooNIps)", "attribute_value_mlt": [{"subitem_text_value": "Sep 1, 2009 10:28:28"}]}, "item_119_text_37": {"attribute_name": "更新履歴(XooNIps)", "attribute_value_mlt": [{"subitem_text_value": "Sep 1, 2009 フリーキーワード, 著者 を変更"}, {"subitem_text_value": "Mar 17, 2009 フリーキーワード, キーワード を変更"}, {"subitem_text_value": "Jan 22, 2009 フリーキーワード, インデックス, キーワード を変更"}, {"subitem_text_value": "Oct 7, 2008 フリーキーワード, インデックス, キーワード を変更"}, {"subitem_text_value": "Aug 7, 2008 コメント, フリーキーワード, キーワード を変更"}, {"subitem_text_value": "Feb 27, 2008 フリーキーワード, インデックス, キーワード を変更"}, {"subitem_text_value": "Feb 27, 2008 フリーキーワード, インデックス, キーワード を変更"}, {"subitem_text_value": "Jan 30, 2008 フリーキーワード, インデックス, キーワード を変更"}, {"subitem_text_value": "Jan 30, 2008 フリーキーワード, インデックス, キーワード を変更"}, {"subitem_text_value": "Jan 30, 2008 コメント, ID, フリーキーワード, インデックス, 版, キーワード を変更"}]}, "item_119_text_38": {"attribute_name": "登録者(XooNIps)", "attribute_value_mlt": [{"subitem_text_value": "sucra_jim4"}]}, "item_119_text_39": {"attribute_name": "閲覧数(XooNIps)", "attribute_value_mlt": [{"subitem_text_value": "1899"}]}, "item_119_text_4": {"attribute_name": "著者 所属", "attribute_value_mlt": [{"subitem_text_value": "埼玉大学情報機構情報メディア基盤センター学術情報処理研究開発部門"}]}, "item_119_text_40": {"attribute_name": "ダウンロード数(XooNIps)", "attribute_value_mlt": [{"subitem_text_value": "649"}]}, "item_119_text_41": {"attribute_name": "XooNIps_インデックス", "attribute_value_mlt": [{"subitem_text_value": "sucra_jim4|Public/主題別/総合領域/情報学/ソフトウェア|Public/ジャンル別/学術雑誌論文(国内)/電子情報通信学会|Public/埼玉大学/機構・センター/情報メディア基盤センター"}]}, "item_119_text_42": {"attribute_name": "XooNIps_ITEM_KEY", "attribute_value_mlt": [{"subitem_text_value": "1639"}]}, "item_119_text_5": {"attribute_name": "著者 所属(別言語)", "attribute_value_mlt": [{"subitem_text_value": "The Information Processing Center, Saitama University"}, {"subitem_text_value": "the Department of Electrical and Electronic Systems, Saitama University"}]}, "item_119_text_9": {"attribute_name": "年月次", "attribute_value_mlt": [{"subitem_text_value": "1998-3"}]}, "item_119_version_type_28": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_version_resource": "http://purl.org/coar/version/c_970fb48d4fbd8a85", "subitem_version_type": "VoR"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "伊藤, 和人"}, {"creatorName": "イトウ, カズヒト", "creatorNameLang": "ja-Kana"}], "nameIdentifiers": [{"nameIdentifier": "18709", "nameIdentifierScheme": "WEKO"}, {"nameIdentifier": "TfwxTeoe", "nameIdentifierScheme": "研究者総覧", "nameIdentifierURI": "http://s-read.saitama-u.ac.jp/researchers/pages/researcher/TfwxTeoe"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2018-01-24"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "A1003001.pdf", "filesize": [{"value": "923.8 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 923800.0, "url": {"label": "A1003001.pdf", "url": "https://sucra.repo.nii.ac.jp/record/14343/files/A1003001.pdf"}, "version_id": "d3937a5a-b99e-469e-9aa3-f141af2419c6"}]}, "item_keyword": {"attribute_name": "キーワード", "attribute_value_mlt": [{"subitem_subject": "sheduling", "subitem_subject_scheme": "Other"}, {"subitem_subject": "high-level synthesis", "subitem_subject_scheme": "Other"}, {"subitem_subject": "digital signal processing", "subitem_subject_scheme": "Other"}, {"subitem_subject": "conditional branch", "subitem_subject_scheme": "Other"}, {"subitem_subject": "overlapped schedule", "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": "An Overlapped Scheduling Method for an Iterative Processing Algorithm with Conditional Operations", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "An Overlapped Scheduling Method for an Iterative Processing Algorithm with Conditional Operations"}]}, "item_type_id": "119", "owner": "3", "path": ["242"], "permalink_uri": "https://sucra.repo.nii.ac.jp/records/14343", "pubdate": {"attribute_name": "公開日", "attribute_value": "2008-01-30"}, "publish_date": "2008-01-30", "publish_status": "0", "recid": "14343", "relation": {}, "relation_version_is_last": true, "title": ["An Overlapped Scheduling Method for an Iterative Processing Algorithm with Conditional Operations"], "weko_shared_id": -1}
An Overlapped Scheduling Method for an Iterative Processing Algorithm with Conditional Operations
https://sucra.repo.nii.ac.jp/records/14343
https://sucra.repo.nii.ac.jp/records/14343c40e4448-e9b3-4103-94f5-85f8f5497d5d
名前 / ファイル | ライセンス | アクション |
---|---|---|
A1003001.pdf (923.8 kB)
|
|
Item type | 学術雑誌論文 / Journal Article(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2008-01-30 | |||||
タイトル | ||||||
タイトル | An Overlapped Scheduling Method for an Iterative Processing Algorithm with Conditional Operations | |||||
言語 | ||||||
言語 | eng | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | sheduling | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | high-level synthesis | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | digital signal processing | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | conditional branch | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | overlapped schedule | |||||
資源タイプ | ||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||
資源タイプ | journal article | |||||
著者 |
伊藤, 和人
× 伊藤, 和人 |
|||||
著者 ローマ字 | ||||||
ITO, Kazuhito | ||||||
著者 ローマ字 | ||||||
KAWASAKI, Tatsuya | ||||||
著者 所属 | ||||||
埼玉大学情報機構情報メディア基盤センター学術情報処理研究開発部門 | ||||||
著者 所属(別言語) | ||||||
The Information Processing Center, Saitama University | ||||||
著者 所属(別言語) | ||||||
the Department of Electrical and Electronic Systems, Saitama University | ||||||
書誌情報 |
IEICE transactions on fundamentals of electronics, communications and computer sciences 巻 E81-A, 号 3, p. 429-438, 発行日 1998 |
|||||
年月次 | ||||||
1998-3 | ||||||
出版者名 | ||||||
出版者 | 社団法人電子情報通信学会 | |||||
ISSN | ||||||
収録物識別子タイプ | ISSN | |||||
収録物識別子 | 09168508 | |||||
関連サイト | ||||||
内容記述タイプ | Other | |||||
内容記述 | http://search.ieice.org/index.html | http://search.ieice.org/index.html | |||||
抄録 | ||||||
内容記述タイプ | Abstract | |||||
内容記述 | One of the ways to execute a processing algorithm in high speed is parallel processing on multiple computing resources such as processors and functional units. To identify the minimum number of computing resources, the most important is the scheduling to determine when each operation in the processing algorithm is executed. Among feasible schedules satisfying all the data dependencies in the processing algorithm, an overlapped schedule can achieve the fastest execution speed for an iterative processing algorithm. In the case of processing algorithms with operations which are executed on some conditions, computing resources can be shared by those conditional operations. In this paper, we propose a scheduling method which derives an overlapped schedule where the required number of computing resources is minimized by considering the sharing by conditional operations. | |||||
注記 | ||||||
内容記述タイプ | Other | |||||
内容記述 | copyright(c)1998 IEICE許諾番号:08RB0009 |
|||||
版 | ||||||
[出版社版] | ||||||
著者版フラグ | ||||||
出版タイプ | VoR | |||||
出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |||||
資源タイプ | ||||||
内容記述タイプ | Other | |||||
内容記述 | text | |||||
フォーマット | ||||||
内容記述タイプ | Other | |||||
内容記述 | application/pdf | |||||
作成日 | ||||||
日付 | 2008-01-30 | |||||
日付タイプ | Created | |||||
アイテムID | ||||||
A1003001 |