{"updated":"2025-01-22T19:15:34.388041+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00025888","sets":["1164:1867:1906:1909"]},"path":["1909"],"owner":"1","recid":"25888","title":["通信時間を削減するためのタスク複製の手法"],"pubdate":{"attribute_name":"公開日","attribute_value":"1999-03-04"},"_buckets":{"deposit":"c4835fd8-5e76-4b09-8320-9a33174dfcdc"},"_deposit":{"id":"25888","pid":{"type":"depid","value":"25888","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"通信時間を削減するためのタスク複製の手法","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"通信時間を削減するためのタスク複製の手法"},{"subitem_title":"Task Duplication Techniques for Reducing Communication Delays","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1999-03-04","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"名古屋工業大学知能情報システム学科"},{"subitem_text_value":"名古屋工業大学情報処理教育センター"},{"subitem_text_value":"名古屋工業大学知能情報システム学科"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Intelligence and Computer Science, Nagoya Institute of Technology","subitem_text_language":"en"},{"subitem_text_value":"Educational Center for information processing, Nagoya Institute of Technology","subitem_text_language":"en"},{"subitem_text_value":"Department of Intelligence and Computer Science, Nagoya Institute of Technology","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/25888/files/IPSJ-OS98080004.pdf"},"date":[{"dateType":"Available","dateValue":"2001-03-04"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-OS98080004.pdf","filesize":[{"value":"625.2 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"11"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"69bb8e06-8efe-4cc4-b0b3-bfe74459c5e7","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1999 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"高木, 秀樹"},{"creatorName":"李, 鼎超"},{"creatorName":"石井, 直宏"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Hideki, Takagi","creatorNameLang":"en"},{"creatorName":"Dingchao, Li","creatorNameLang":"en"},{"creatorName":"Naohiro, Ishii","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10444176","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"本稿では，並列プログラムを分散メモリ並列アーキテクチャ上にスケジューリングする際に発生する通信遅延を削減するためのタスク複製の手法を提案する．提案する手法において，タスク複製による通信コストの減少を定量的に分析し，選ばれたタスクを複製すべきかどうかの条件を導く．本手法をよく知られているいくつかのスケジューリングアルゴリズムに対して実装し評価を行ない，その有用性を確認した．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"This work discusses how to use task duplication to reduce communication delays for assigning parallel programs onto distributed memory multiprocessors. Through an instantaneous performance gain analysis, we establish the conditions under which our task replication policy is beneficial. Experimental study shows that incorporating the proposed strategies in several well-known priority-based scheduling algorithms Dose improve their performance with very low computational Costs.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"24","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告システムソフトウェアとオペレーティング・システム（OS）"}],"bibliographicPageStart":"19","bibliographicIssueDates":{"bibliographicIssueDate":"1999-03-04","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"21(1998-OS-080)","bibliographicVolumeNumber":"1999"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-18T22:56:39.079994+00:00","id":25888,"links":{}}