{"created":"2025-02-21T03:39:28.062235+00:00","id":2007038,"links":{},"metadata":{"_buckets":{"deposit":"dbf052bd-5b4c-4db6-9b8f-75b721f0b061"},"_deposit":{"created_by":41,"id":"2007038","owners":[41],"pid":{"revision_id":0,"type":"depid","value":"2007038"},"status":"published"},"_oai":{"id":"oai:hiroshima.repo.nii.ac.jp:02007038","sets":["1730444907710"]},"author_link":[],"item_1617186331708":{"attribute_name":"Title","attribute_value_mlt":[{"subitem_title":"Coterie Join Operation and Tree Structured k-Coteries","subitem_title_language":"en"}]},"item_1617186419668":{"attribute_name":"Creator","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Harada, Takashi","creatorNameLang":"en"}],"familyNames":[{"familyName":"Harada","familyNameLang":"en"}],"givenNames":[{"givenName":"Takashi","givenNameLang":"en"}]},{"creatorNames":[{"creatorName":"Yamashita, Masafumi","creatorNameLang":"en"}],"familyNames":[{"familyName":"Yamashita","familyNameLang":"en"}],"givenNames":[{"givenName":"Masafumi","givenNameLang":"en"}]}]},"item_1617186476635":{"attribute_name":"Access Rights","attribute_value_mlt":[{"subitem_access_right":"open access","subitem_access_right_uri":"http://purl.org/coar/access_right/c_abf2"}]},"item_1617186499011":{"attribute_name":"Rights","attribute_value_mlt":[{"subitem_rights":"(c) 2001 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE."}]},"item_1617186609386":{"attribute_name":"Subject","attribute_value_mlt":[{"subitem_subject":"Availability","subitem_subject_scheme":"Other"},{"subitem_subject":"distributed systems","subitem_subject_scheme":"Other"},{"subitem_subject":"k-coteries","subitem_subject_scheme":"Other"},{"subitem_subject":"k-semicoteries","subitem_subject_scheme":"Other"},{"subitem_subject":"k-mutual exclusion problem","subitem_subject_scheme":"Other"},{"subitem_subject":"message complexity","subitem_subject_scheme":"Other"},{"subitem_subject":"007","subitem_subject_scheme":"NDC"}]},"item_1617186626617":{"attribute_name":"Description","attribute_value_mlt":[{"subitem_description":"The coterie join operation proposed by Neilsen and Mizuno produces, from a k-coterie and a coterie, a new k-coterie. For the coterie join operation, this paper first shows 1) a necessary and sufficient condition to produce a nondominated k-coterie (more accurately, a nondominated k-semicoterie satisfying Nonintersection Property) and 2) a sufficient condition to produce a k-conterie with higher availability. By recursively applying the coterie join operation in such a way that the above conditions hold, we define nondominated k-coteries, called tree structured k-coteries, the availabilities of which are thus expected to be very high. This paper then proposes a new k-mutual exclusion algorithm that effectively uses a tree structured k-coterie, by extending Agrawal and El Abbadi's tree algoriyhm. The number of messages necessary for k processes obeying the algorithm to simultaneously enter the critical section is approximately bounded by k log (n / k) in the best case, where n is the number of processes in the system.","subitem_description_language":"en"}]},"item_1617186643794":{"attribute_name":"Publisher","attribute_value_mlt":[{"subitem_publisher":"IEEE"}]},"item_1617186702042":{"attribute_name":"Language","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_1617186920753":{"attribute_name":"Source Identifier","attribute_value_mlt":[{"subitem_source_identifier":"1045-9219","subitem_source_identifier_type":"ISSN"}]},"item_1617187024783":{"attribute_name":"Page Start","attribute_value_mlt":[{"subitem_start_page":"865"}]},"item_1617187056579":{"attribute_name":"Bibliographic Information","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2001-09","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"9","bibliographicPageEnd":"874","bibliographicPageStart":"865","bibliographicVolumeNumber":"12","bibliographic_titles":[{"bibliographic_title":"IEEE transactions on parallel and distributed systems"},{"bibliographic_title":"IEEE transactions on parallel and distributed systems"}]}]},"item_1617258105262":{"attribute_name":"Resource Type","attribute_value_mlt":[{"resourcetype":"journal article","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_1617265215918":{"attribute_name":"Version Type","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_1617353299429":{"attribute_name":"Relation","attribute_value_mlt":[{"subitem_relation_type_id":{"subitem_relation_type_id_text":"10.1109/71.954617","subitem_relation_type_select":"DOI"}},{"subitem_relation_type_id":{"subitem_relation_type_id_text":"http://dx.doi.org/10.1109/71.954617","subitem_relation_type_select":"DOI"}}]},"item_1617605131499":{"attribute_name":"File","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_access","date":[{"dateType":"Available","dateValue":"2023-03-18"}],"displaytype":"simple","filename":"IEEE_2001_12_9_l0865.pdf","filesize":[{"value":"180.4 KB"}],"mimetype":"application/pdf","url":{"objectType":"fulltext","url":"https://hiroshima.repo.nii.ac.jp/record/2007038/files/IEEE_2001_12_9_l0865.pdf"},"version_id":"c4bd1e42-2521-4baf-8fa8-f46607e7ca1c"}]},"item_1732771732025":{"attribute_name":"旧ID","attribute_value":"14155"},"item_title":"Coterie Join Operation and Tree Structured k-Coteries","item_type_id":"40003","owner":"41","path":["1730444907710"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2023-03-18"},"publish_date":"2023-03-18","publish_status":"0","recid":"2007038","relation_version_is_last":true,"title":["Coterie Join Operation and Tree Structured k-Coteries"],"weko_creator_id":"41","weko_shared_id":-1},"updated":"2025-02-21T09:01:10.970775+00:00"}