{"created":"2023-05-15T15:26:22.484905+00:00","id":14343,"links":{},"metadata":{"_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":["95: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_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_4":{"attribute_name":"著者 所属","attribute_value_mlt":[{"subitem_text_value":"埼玉大学情報機構情報メディア基盤センター学術情報処理研究開発部門"}]},"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":[{},{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2018-01-24"}],"displaytype":"detail","filename":"A1003001.pdf","filesize":[{"value":"923.8 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","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"],"pubdate":{"attribute_name":"公開日","attribute_value":"2008-01-30"},"publish_date":"2008-01-30","publish_status":"0","recid":"14343","relation_version_is_last":true,"title":["An Overlapped Scheduling Method for an Iterative Processing Algorithm with Conditional Operations"],"weko_creator_id":"3","weko_shared_id":-1},"updated":"2023-05-16T12:02:13.153445+00:00"}