{"updated":"2025-01-22T19:50:19.583069+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00024616","sets":["1164:1579:1701:1706"]},"path":["1706"],"owner":"1","recid":"24616","title":["粒度を考慮したマルチプロセッサの資源管理"],"pubdate":{"attribute_name":"公開日","attribute_value":"1990-07-18"},"_buckets":{"deposit":"d62e14c3-aacc-4d55-b904-f406ef11b5ee"},"_deposit":{"id":"24616","pid":{"type":"depid","value":"24616","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":"A Multiprocessor Resource Management Scheme which Considers Program Grain Size","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1990-07-18","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"日本アイ・ビー・エム株式会社東京基礎研究所"},{"subitem_text_value":"日本アイ・ビー・エム株式会社東京基礎研究所"},{"subitem_text_value":"日本アイ・ビー・エム株式会社東京基礎研究所"},{"subitem_text_value":"日本アイ・ビー・エム株式会社東京基礎研究所"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"IBM Research, Tokyo Research Laboratory, IBM Japan, Ltd.","subitem_text_language":"en"},{"subitem_text_value":"IBM Research, Tokyo Research Laboratory, IBM Japan, Ltd.","subitem_text_language":"en"},{"subitem_text_value":"IBM Research, Tokyo Research Laboratory, IBM Japan, Ltd.","subitem_text_language":"en"},{"subitem_text_value":"IBM Research, Tokyo Research Laboratory, IBM Japan, Ltd.","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/24616/files/IPSJ-ARC90083018.pdf"},"date":[{"dateType":"Available","dateValue":"1992-07-18"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-ARC90083018.pdf","filesize":[{"value":"1.1 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"16"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"2d279a61-0b4f-494c-a61f-6484b4585c67","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1990 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"森山, 孝男"},{"creatorName":"根岸, 康"},{"creatorName":"渦原, 茂"},{"creatorName":"松本, 尚"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Takao, Moriyama","creatorNameLang":"en"},{"creatorName":"Yasushi, Negishi","creatorNameLang":"en"},{"creatorName":"Shigeru, Uzuhara","creatorNameLang":"en"},{"creatorName":"Takashi, Matsumoto","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10096105","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":"マルチプロセッサ上で、粒度が細かく密に協調並列動作するプログラムの存在を考慮に入れたプロセッサ資源の管理法およびスケジューリングの戦略について検討する。実行コードの生成過程から静的に判断される粒度の情報を利用して、並列動作するプログラムを4種類のカテゴリーに分類する。この分類を利用して管理ならびにスケジューリングを行うため、実プロセッサを割り当てる単位であるプロセスに要求プロセッサ数とモードという属性を付加する。さらに、ユーザとカーネルの2階層のスケジューリング方式で使用できるカーネルによるプリエンプション方式を提案する。この方式はプリエンプションの予告を伴わず、従来の時限爆弾方式よりも優れている。","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"We examine the strategies for scheduling and resource allocation in multiprocessor operating systems, in the presense of fine-grain and tightly-cooperating programs. First, concurrent programs are classified into four categories based on the grain-size data acquired from the code generation phase. Scheduling and resource allocation based on this data requires that two attributes, mode and number processors demanded, be added to a process, the unit to which physical processors are allocated. Also proposed is a kernel preemption mechanism which can be used in a two-level (user/kernel)scheduler. Our mechanism is superior to the previous time-bomb mechanism in that the preemption notification is not necessary.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"108","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告計算機アーキテクチャ（ARC）"}],"bibliographicPageStart":"103","bibliographicIssueDates":{"bibliographicIssueDate":"1990-07-18","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"60(1990-ARC-083)","bibliographicVolumeNumber":"1990"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-18T22:55:42.511361+00:00","id":24616,"links":{}}