Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Enokido, Tomoyaa; * | Duolikun, Dilawaerb | Takizawa, Makotoc
Affiliations: [a] Faculty of Business Administration, Rissho University, 4-2-16, Osaki, Shinagawa-ku, Tokyo, 141-8602, Japan | [b] Department of Advanced Sciences, Faculty of Science and Engineering, Hosei University, 3-7-2, Kajino-cho, Koganei-shi, Tokyo 184-8584, Japan | [c] Research Center for Computing and Multimedia Studies, Hosei University, 3-7-2, Kajino-cho, Koganei-shi, Tokyo 184-8584, Japan
Correspondence: [*] Corresponding author. E-mail: [email protected].
Abstract: In current information systems, a huge number of IoT (Internet of Things) devices are interconnected with various kinds of networks like WiFi and 5G networks. A large volume of data is gathered into servers from a huge number of IoT devices and is manipulated to provide application services. Gathered data is encapsulated along with methods to manipulate the data as an object like a database system. In object-based systems, each application is composed of multiple objects. In addition, each object is replicated on multiple physical servers in order to increase availability, reliability, and performance of an application service. On the other hand, replicas of each object is required to be mutually consistent in presence of multiple transactions. Here, a larger amount of electric energy and computation resources are consumed in physical servers than non-replication approaches to serialize conflicting transactions on multiple replicas. Many algorithms to synchronize conflicting transactions are so far proposed like 2PL (Two-Phase Locking) and TO (Timestamp Ordering). However, the electric energy consumption is not considered. In this paper, an EEQBL-OMM (Energy-Efficient Quorum-Based Locking with Omitting Meaningless Method) protocol is newly proposed to reduce not only the average execution time of each transaction but also the total electric energy consumption of servers by omitting the execution of meaningless methods on replicas of each object. Evaluation results show the total electric energy consumption of servers, the average execution time of each transaction, and the number of aborted instances of transactions in the EEQBL-OMM protocol can be on average reduced to 79%, 62%, and 80% of the ECLBQS (Energy Consumption Laxity-Based Quorum Selection) protocol which is proposed in our previous studies in a homogeneous set of servers, respectively. In addition, the evaluation results show the total electric energy consumption of servers, the average execution time of each transaction, and the number of aborted instances of transactions in the EEQBL-OMM protocol can be on average reduced to 73%, 50%, and 67% of the ECLBQS protocol in a heterogeneous set of servers, respectively. The evaluation results also show at most 48% and 51% of the total number of methods can be omitted as meaningless methods in a homogeneous set and heterogeneous set of servers, respectively, in the EEQBL-OMM protocol.
Keywords: Distributed object-based systems, locking protocols, meaningless methods, green computing, EEQBL-OMM protocol
DOI: 10.3233/JHS-220690
Journal: Journal of High Speed Networks, vol. 28, no. 3, pp. 181-203, 2022
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]