{"_buckets": {"deposit": "273ede1e-9212-4fcc-b69d-e53479af9fb2"}, "_deposit": {"created_by": 1, "id": "863", "owners": [1], "pid": {"revision_id": 0, "type": "depid", "value": "863"}, "status": "published"}, "_oai": {"id": "oai:ir.soken.ac.jp:00000863", "sets": ["19"]}, "author_link": ["0", "0", "0"], "item_1_biblio_info_21": {"attribute_name": "書誌情報（ソート用）", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2007-03-23", "bibliographicIssueDateType": "Issued"}, "bibliographic_titles": [{}]}]}, "item_1_creator_2": {"attribute_name": "著者名", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "BANDITWATTANAWONG, Thepparit"}], "nameIdentifiers": [{"nameIdentifier": "0", "nameIdentifierScheme": "WEKO"}]}]}, "item_1_creator_3": {"attribute_name": "フリガナ", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "ゼパリット, バンディトワッタナウォング"}], "nameIdentifiers": [{"nameIdentifier": "0", "nameIdentifierScheme": "WEKO"}]}]}, "item_1_date_granted_11": {"attribute_name": "学位授与年月日", "attribute_value_mlt": [{"subitem_dategranted": "2007-03-23"}]}, "item_1_degree_grantor_5": {"attribute_name": "学位授与機関", "attribute_value_mlt": [{"subitem_degreegrantor": [{"subitem_degreegrantor_name": "総合研究大学院大学"}]}]}, "item_1_degree_name_6": {"attribute_name": "学位名", "attribute_value_mlt": [{"subitem_degreename": "博士（情報学）"}]}, "item_1_description_1": {"attribute_name": "ID", "attribute_value_mlt": [{"subitem_description": "2007038", "subitem_description_type": "Other"}]}, "item_1_description_12": {"attribute_name": "要旨", "attribute_value_mlt": [{"subitem_description": "In distributed object systems, object-oriented (OO) applications are repli-\u003cbr /\u003ecated from remote servers to client sites to improve performance, scala-\u003cbr /\u003ebility, and availability. This study focuses on fine-grained replications of \u003cbr /\u003edistributed OO applications. Unlike the traditional replication scheme by \u003cbr /\u003ewhich a self-contained application is replicated entirely at once, the fine \u003cbr /\u003egrained replication scheme enables partial and on-demand incremental\u003cbr /\u003ereplications of self-contained applications. \u003cbr /\u003e\u003cbr /\u003eFine-grained replications can be classified into two categories based on \u003cbr /\u003etheir deployment patterns: 1) replicating running applications for local \u003cbr /\u003eaccesses and 2) downloading application programs from persistent repos-\u003cbr /\u003eitories for local executions. Based on the classification, the study has \u003cbr /\u003eproposed a pair of finegrained replication middlewares: one aims for the \u003cbr /\u003efine-grained replications of remote runtime applications, and the other \u003cbr /\u003eaims for the partial and on-demand incremental downloadings of applica- \u003cbr /\u003etion programs. \u003cbr /\u003eIn addition, to exploit the fine-grained replications effectively requires a \u003cbr /\u003eproper means to figure out application portions as the units of replication. \u003cbr /\u003eThe study has proposed object class clustering algorithms to support the \u003cbr /\u003euse of the latter middleware, while showing that object clustering, which \u003cbr /\u003eis used to support the former middleware, can be performed based on \u003cbr /\u003eprogrammer\u0027s application knowledge. \u003cbr /\u003eThe details of the middlewares and the class clustering algorithms are \u003cbr /\u003esummarized individually as follows.\u003cbr /\u003e \u003cbr /\u003eFine-grained replication of runtime application: Replicating re- \u003cbr /\u003emote application objects to user locality is a common technique to reduce \u003cbr /\u003ethe effects of network problem. The traditional replication scheme is not \u003cbr /\u003esuitable for cooperative applications because only part of a shared appli- \u003cbr /\u003ecation rather than a whole application should be replicated. Furthermore, \u003cbr /\u003ethe scheme is not appropriate for mobile computing devices due to their \u003cbr /\u003ecommon constraints of memory spaces. Both problems can be addressed \u003cbr /\u003eby using a finegrained replication scheme by which the portions of a self- \u003cbr /\u003econtained application can be replicated. \u003cbr /\u003eSince most object replication systems exploit the traditional replication \u003cbr /\u003escheme, to fulfil fine-grained replication is an unexperienced task for sev- \u003cbr /\u003eeral application programmers. There exist few middlewares that support \u003cbr /\u003eruntime fine-grained replications of OO applications. All of them aim for \u003cbr /\u003epeer-to-peer applications in which objects that constitute a self-contained \u003cbr /\u003eapplication are decomposed and distributed among peers. Therefore, \u003cbr /\u003epeers that hold master copies of the application objects must always be \u003cbr /\u003ereachable by other peers to replicate the master copies. This is not suitable \u003cbr /\u003efor pervasive collaboration because the servant peers (e.g., mobile users) \u003cbr /\u003ecan get disconnected arbitrarily or be unreachable due to network parti- \u003cbr /\u003etioning. Instead, using dedicated servers to maintain the master copies of \u003cbr /\u003eapplications is more appropriate. Unfortunately, no fine-grained. replica- \u003cbr /\u003etion middleware is designed for a client-server model. \u003cbr /\u003e\u003cbr /\u003eThis dissertation presents SOOM, a Java-based middleware for perva- \u003cbr /\u003esive client-server cooperative applications. SOOM provides fine-grained \u003cbr /\u003ereplication capability for clients in wide-area networks or on the Internet \u003cbr /\u003eand allows clients in local area network to exploit a conventional remote \u003cbr /\u003emethod invocation mechanism in coordination with the fine-grained repli- \u003cbr /\u003ecation. SOOM also supports fine-grained concurrent access control and \u003cbr /\u003eupdate synchronization. To realize the middleware, several challenge re- \u003cbr /\u003esearch probleins have been identified and resolved. \u003cbr /\u003eAn application for cooperative software modeling has been developed to \u003cbr /\u003eassure the practical applicability of SOOM and demonstrate the practi- \u003cbr /\u003ecality of finegrained replication scheme, finegrained consistency mainte \u003cbr /\u003enance, and the coexistence of fine-grained replications and remote method \u003cbr /\u003einvocations in client-server environment. The quantitative properties of \u003cbr /\u003eSOOM were measured through the following empirical evaluations. First, \u003cbr /\u003eexperiments in singleuser and multi-user environments based on different \u003cbr /\u003econsistency protocols indicated the practical throughputs of SOOM-based \u003cbr /\u003eapplication. Second, throughout accessing all member objects of a bench- \u003cbr /\u003emark cluster showed that SOOM-based replication began to outperform \u003cbr /\u003eJava RMI when each object was accessed locally more than twice. Third, \u003cbr /\u003ean experiment using the varied numbers of client processors assured the \u003cbr /\u003escalability of SOOM. Finally, an experiment on the memory space require \u003cbr /\u003ement showed that SOOM could reduce the significant amount of client \u003cbr /\u003ememory space consumption as well as network bandwidth. \u003cbr /\u003e\u003cbr /\u003eFine-grained replication of application program: OO applications \u003cbr /\u003ehave been distributed more and more over the Internet. Deploying an ap- \u003cbr /\u003eplication by retrieving the entire program from a remote repository such \u003cbr /\u003eas HTTP server often encounters extended delay due to network conges- \u003cbr /\u003etion or large program size. Many times system resources, such as network \u003cbr /\u003ebandwidth and client memory space, are also wasted because users do \u003cbr /\u003enot utilize every component of the downloaded applications. Moreover, \u003cbr /\u003edownloading a whole program at once is usually impractical for mobile \u003cbr /\u003ecomputing devices due to their memory space constrains. \u003cbr /\u003eThese problems can be addressed by decomposing a program into groups \u003cbr /\u003eof classes and data resources to be downloaded on demand. \u003cbr /\u003eThis dissertation presents C\u003csup\u003e2\u003c/sup\u003e, a Java-based middleware by which a Java \u003cbr /\u003eapplication can be partially and on-demand incrementally deployed via \u003cbr /\u003eHTTP. The middleware also supports application caching and transpar- \u003cbr /\u003eently automatic updating. \u003cbr /\u003eThe launching delay of an experimented application was found to be re \u003cbr /\u003educed by 83% from that of the traditional whole-at-once application de- \u003cbr /\u003eployment scheme. Total program deployment and execution overhead was \u003cbr /\u003e22% less than that of Java Web Start.\u003cbr /\u003e \u003cbr /\u003eObject class clustering approach: It is typical that only part of whole \u003cbr /\u003eprogram code is necessary for successfu1 execution. Decomposing an OO \u003cbr /\u003eprogram into clusters of closely relevant classes and data resources for \u003cbr /\u003eon-demand incremental loading optimizes the program start-up latency \u003cbr /\u003eand system resource consumption. The lack of systematic yet simple class \u003cbr /\u003eclustering approach prohibits this kind of optimization. \u003cbr /\u003eThis dissertation presents a Java class clustering approach that is capa- \u003cbr /\u003eble of improving both spatial locality and temporal affinity of the opti- \u003cbr /\u003emized programs. The approach provides two clustering algorithms: initial \u003cbr /\u003edelay-centric and intermittent delay-centric ones, to achieve different re \u003cbr /\u003equirements of optimizations.\u003cbr /\u003e \u003cbr /\u003eExperimental results indicated that the algorithms were practically use- \u003cbr /\u003eful to both interactive programs and non-interactive programs. Among \u003cbr /\u003ethe tested Java programs, using the initial delay-centric algorithm and \u003cbr /\u003ethe intermittent delay-centric algorithm improved initial program loading \u003cbr /\u003elatencies on average by 2.9 and 2.2 times respectively faster than the tra- \u003cbr /\u003editional wholeat-once program loading scheme. The intermittent delay- \u003cbr /\u003ecentric algorithm reduced the number of intermittent delays to half of the \u003cbr /\u003einitial delay-centric algorithm. Both algorithms also led to the chances \u003cbr /\u003eto economize on system resources, such as memory spaces and network \u003cbr /\u003ebandwidths. \u003cbr /\u003e", "subitem_description_type": "Other"}]}, "item_1_description_18": {"attribute_name": "フォーマット", "attribute_value_mlt": [{"subitem_description": "application/pdf", "subitem_description_type": "Other"}]}, "item_1_description_7": {"attribute_name": "学位記番号", "attribute_value_mlt": [{"subitem_description": "総研大甲第1053号", "subitem_description_type": "Other"}]}, "item_1_select_14": {"attribute_name": "所蔵", "attribute_value_mlt": [{"subitem_select_item": "有"}]}, "item_1_select_8": {"attribute_name": "研究科", "attribute_value_mlt": [{"subitem_select_item": "複合科学研究科"}]}, "item_1_select_9": {"attribute_name": "専攻", "attribute_value_mlt": [{"subitem_select_item": "17 情報学専攻"}]}, "item_1_text_10": {"attribute_name": "学位授与年度", "attribute_value_mlt": [{"subitem_text_value": "2006"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "BANDITWATTANAWONG, Thepparit", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "0", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2016-02-17"}], "displaytype": "simple", "download_preview_message": "", "file_order": 0, "filename": "甲1053_要旨.pdf", "filesize": [{"value": "337.1 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_11", "mimetype": "application/pdf", "size": 337100.0, "url": {"label": "要旨・審査要旨", "url": "https://ir.soken.ac.jp/record/863/files/甲1053_要旨.pdf"}, "version_id": "f5c50306-ffa6-45c3-ad54-7d337957dc99"}, {"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2016-02-17"}], "displaytype": "simple", "download_preview_message": "", "file_order": 1, "filename": "甲1053_本文.pdf", "filesize": [{"value": "11.0 MB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_11", "mimetype": "application/pdf", "size": 11000000.0, "url": {"label": "本文", "url": "https://ir.soken.ac.jp/record/863/files/甲1053_本文.pdf"}, "version_id": "4b26fe43-8d03-4f53-a082-f20b5571759c"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "thesis", "resourceuri": "http://purl.org/coar/resource_type/c_46ec"}]}, "item_title": "A study on Fine-grained Replications of Distributed Java Applications", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "A study on Fine-grained Replications of Distributed Java Applications"}, {"subitem_title": "A study on Fine-grained Replications of Distributed Java Applications", "subitem_title_language": "en"}]}, "item_type_id": "1", "owner": "1", "path": ["19"], "permalink_uri": "https://ir.soken.ac.jp/records/863", "pubdate": {"attribute_name": "公開日", "attribute_value": "2010-02-22"}, "publish_date": "2010-02-22", "publish_status": "0", "recid": "863", "relation": {}, "relation_version_is_last": true, "title": ["A study on Fine-grained Replications of Distributed Java Applications"], "weko_shared_id": -1}