{"id":35474,"updated":"2025-01-22T14:41:16.072393+00:00","links":{},"created":"2025-01-18T23:03:48.296865+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00035474","sets":["1164:2836:2907:2910"]},"path":["2910"],"owner":"1","recid":"35474","title":["書き込み保留を用いた逐次化グラフスケジューリング"],"pubdate":{"attribute_name":"公開日","attribute_value":"1996-07-12"},"_buckets":{"deposit":"0c1f9c8e-6899-4088-9558-65118040a438"},"_deposit":{"id":"35474","pid":{"type":"depid","value":"35474","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 Scheduling Method using Serialization Graph Testing with Write Deferring","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1996-07-12","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":"Depertment of Information and Computer Science, Faculty of Engineering Science Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Depertment of Information and Computer Science, Faculty of Engineering Science Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Depertment of Information and Computer Science, Faculty of Engineering Science Osaka University","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/35474/files/IPSJ-DPS96077009.pdf"},"date":[{"dateType":"Available","dateValue":"1998-07-12"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-DPS96077009.pdf","filesize":[{"value":"581.4 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":"34"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"3856ff8c-0a88-4cdc-abfd-e7a411397571","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1996 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":"Harumasa, Tada","creatorNameLang":"en"},{"creatorName":"Masahiro, Higuchi","creatorNameLang":"en"},{"creatorName":"Mamoru, Fujii","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10116224","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":"Several scheduling algorithms for preserving database consistency are known. It is known that Serialization Graph Teting (SGT) achieves higher concurrency of transactions than other scheduling algorithms. However, it has some drawbacks. First, operations are delayed for a long time to check the serialization graph. Second, executions produced by SGT may be unrecoverable from some failures. On the other hand, under Optimistic Concurrency Control (OCC), all operations are executed immediately. Moreover, OCC produces recoverable executions by deferring substantial write operations using local copies. Therefore, we applied OCC approach to SGT and propose an algorithm which we call Serialization Graph Testing with Write Deferring (SGT-WD). SGT-WD overcomes above drawbacks of SGT. In this paper, we show the basic algorithm and some variant of SGT-WD. We compare SGT-WD with other algorithms, and show that it is more useful than those algorithms.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"54","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告マルチメディア通信と分散処理（DPS）"}],"bibliographicPageStart":"49","bibliographicIssueDates":{"bibliographicIssueDate":"1996-07-12","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"63(1996-DPS-077)","bibliographicVolumeNumber":"1996"}]},"relation_version_is_last":true,"weko_creator_id":"1"}}