{"created":"2023-07-27T06:24:49.471171+00:00","id":7886,"links":{},"metadata":{"_buckets":{"deposit":"6149426b-e4f8-44ec-8b09-b3c13749c410"},"_deposit":{"created_by":3,"id":"7886","owners":[3],"pid":{"revision_id":0,"type":"depid","value":"7886"},"status":"published"},"_oai":{"id":"oai:kanazawa-u.repo.nii.ac.jp:00007886","sets":["934:935:936"]},"author_link":["10816","187","10817"],"item_8_biblio_info_8":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"1993-09-27","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicPageEnd":"106","bibliographicPageStart":"105","bibliographicVolumeNumber":"479","bibliographic_titles":[{"bibliographic_title":"全国大会講演論文集"}]}]},"item_8_description_21":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"マルチプロセッサシステムにおけるタスク割当てに対する戦略に,スケジューリング問題の応用として取り扱う方法がある.しかしながら,CP法,CP/MISF法,DF/IHS法などのアルゴリズムではプロセッサ間の通信時間を取り扱うことができない.本論文では,プロセッサ間の通信時間を考慮したタスク割当法を提案し,従来方式との比較を行いその有効性を示す.","subitem_description_type":"Abstract"}]},"item_8_description_5":{"attribute_name":"提供者所属","attribute_value_mlt":[{"subitem_description":"金沢大学理工研究域電子情報学系","subitem_description_type":"Other"}]},"item_8_publisher_17":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会"}]},"item_8_relation_28":{"attribute_name":"関連URI","attribute_value_mlt":[{"subitem_relation_type_id":{"subitem_relation_type_id_text":"http://ci.nii.ac.jp/naid/110002884357/","subitem_relation_type_select":"URI"}},{"subitem_relation_type_id":{"subitem_relation_type_id_text":"http://www.ipsj.or.jp/","subitem_relation_type_select":"URI"}}]},"item_8_rights_23":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"利用は著作権の範囲内に限られる"}]},"item_8_version_type_25":{"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":"小林, 真也"}],"nameIdentifiers":[{},{}]},{"creatorNames":[{"creatorName":"木村, 春彦"}],"nameIdentifiers":[{},{},{}]},{"creatorNames":[{"creatorName":"武部, 幹"}],"nameIdentifiers":[{},{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2017-10-03"}],"displaytype":"detail","filename":"TE-PR-KIMURA-H-105.pdf","filesize":[{"value":"198.2 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"TE-PR-KIMURA-H-105.pdf","url":"https://kanazawa-u.repo.nii.ac.jp/record/7886/files/TE-PR-KIMURA-H-105.pdf"},"version_id":"51a9dd2d-a5cc-4f8a-9bfb-935e27192c14"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"conference paper","resourceuri":"http://purl.org/coar/resource_type/c_5794"}]},"item_title":"通信量を考慮したタスクスケジューリング法の提案と評価","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"通信量を考慮したタスクスケジューリング法の提案と評価"},{"subitem_title":"Proposal and Evaluation of Scheduling Method Considering Communication Delay","subitem_title_language":"en"}]},"item_type_id":"8","owner":"3","path":["936"],"pubdate":{"attribute_name":"公開日","attribute_value":"2017-10-03"},"publish_date":"2017-10-03","publish_status":"0","recid":"7886","relation_version_is_last":true,"title":["通信量を考慮したタスクスケジューリング法の提案と評価"],"weko_creator_id":"3","weko_shared_id":-1},"updated":"2023-07-28T02:17:57.411353+00:00"}