Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (7)
  • Open Access

    ARTICLE

    Hybrid Graph Partitioning with OLB Approach in Distributed Transactions

    Rajesh Bharati*, Vahida Attar

    Intelligent Automation & Soft Computing, Vol.37, No.1, pp. 763-775, 2023, DOI:10.32604/iasc.2023.035503

    Abstract Online Transaction Processing (OLTP) gets support from data partitioning to achieve better performance and scalability. The primary objective of database and application developers is to provide scalable and reliable database systems. This research presents a novel method for data partitioning and load balancing for scalable transactions. Data is efficiently partitioned using the hybrid graph partitioning method. Optimized load balancing (OLB) approach is applied to calculate the weight factor, average workload, and partition efficiency. The presented approach is appropriate for various online data transaction applications. The quality of the proposed approach is examined using OLTP database benchmark. The performance of the… More >

  • Open Access

    ARTICLE

    Advanced DAG-Based Ranking (ADR) Protocol for Blockchain Scalability

    Tayyaba Noreen1,*, Qiufen Xia1, Muhammad Zeeshan Haider2

    CMC-Computers, Materials & Continua, Vol.75, No.2, pp. 2593-2613, 2023, DOI:10.32604/cmc.2023.036139

    Abstract In the past decade, blockchain has evolved as a promising solution to develop secure distributed ledgers and has gained massive attention. However, current blockchain systems face the problems of limited throughput, poor scalability, and high latency. Due to the failure of consensus algorithms in managing nodes’identities, blockchain technology is considered inappropriate for many applications, e.g., in IoT environments, because of poor scalability. This paper proposes a blockchain consensus mechanism called the Advanced DAG-based Ranking (ADR) protocol to improve blockchain scalability and throughput. The ADR protocol uses the directed acyclic graph ledger, where nodes are placed according to their ranking positions… More >

  • Open Access

    ARTICLE

    Metaheuristics-based Clustering with Routing Technique for Lifetime Maximization in Vehicular Networks

    P. Muthukrishnan*, P. Muthu Kannan

    CMC-Computers, Materials & Continua, Vol.74, No.1, pp. 1107-1122, 2023, DOI:10.32604/cmc.2023.031962

    Abstract Recently, vehicular ad hoc networks (VANETs) finds applicability in different domains such as security, rescue operations, intelligent transportation systems (ITS), etc. VANET has unique features like high mobility, limited mobility patterns, adequate topology modifications, and wireless communication. Despite the benefits of VANET, scalability is a challenging issue which could be addressed by the use of cluster-based routing techniques. It enables the vehicles to perform intercluster communication via chosen CHs and optimal routes. The main drawback of VANET network is the network unsteadiness that results in minimum lifetime. In order to avoid reduced network lifetime in VANET, this paper presents an… More >

  • Open Access

    ARTICLE

    A Perfect Knob to Scale Thread Pool on Runtime

    Faisal Bahadur1,*, Arif Iqbal Umar1, Insaf Ullah2, Fahad Algarni3, Muhammad Asghar Khan2, Samih M. Mostafa4

    CMC-Computers, Materials & Continua, Vol.72, No.1, pp. 1483-1493, 2022, DOI:10.32604/cmc.2022.024936

    Abstract Scalability is one of the utmost nonfunctional requirement of server applications, because it maintains an effective performance parallel to the large fluctuating and sometimes unpredictable workload. In order to achieve scalability, thread pool system (TPS) has been used extensively as a middleware service in server applications. The size of thread pool is the most significant factor, that affects the overall performance of servers. Determining the optimal size of thread pool dynamically on runtime is a challenging problem. The most widely used and simple method to tackle this problem is to keep the size of thread pool equal to the request… More >

  • Open Access

    ARTICLE

    Enhancing Scalability of Image Retrieval Using Visual Fusion of Feature Descriptors

    S. Balammal@Geetha*, R. Muthukkumar, V. Seenivasagam

    Intelligent Automation & Soft Computing, Vol.31, No.3, pp. 1737-1752, 2022, DOI:10.32604/iasc.2022.018822

    Abstract Content-Based Image Retrieval (CBIR) is an approach of retrieving similar images from a large image database. Recently CBIR poses new challenges in semantic categorization of the images. Different feature extraction technique have been proposed to overcome the semantic breach problems, however these methods suffer from several shortcomings. This paper contributes an image retrieval system to extract the local features based on the fusion of scale-invariant feature transform (SIFT) and KAZE. The strength of local feature descriptor SIFT complements global feature descriptor KAZE. SIFT concentrates on the complete region of an image using high fine points of features and KAZE ponders… More >

  • Open Access

    ARTICLE

    Quality of Service Improvement with Optimal Software-Defined Networking Controller and Control Plane Clustering

    Jehad Ali, Byeong-hee Roh*

    CMC-Computers, Materials & Continua, Vol.67, No.1, pp. 849-875, 2021, DOI:10.32604/cmc.2021.014576

    Abstract The controller is indispensable in software-defined networking (SDN). With several features, controllers monitor the network and respond promptly to dynamic changes. Their performance affects the quality-of-service (QoS) in SDN. Every controller supports a set of features. However, the support of the features may be more prominent in one controller. Moreover, a single controller leads to performance, single-point-of-failure (SPOF), and scalability problems. To overcome this, a controller with an optimum feature set must be available for SDN. Furthermore, a cluster of optimum feature set controllers will overcome an SPOF and improve the QoS in SDN. Herein, leveraging an analytical network process… More >

  • Open Access

    ARTICLE

    An Efficient Parallel MLPG Method for Poroelastic Models

    Luca Bergamaschi1,2, ,Ángeles Martínez2, Giorgio Pini2

    CMES-Computer Modeling in Engineering & Sciences, Vol.49, No.3, pp. 191-216, 2009, DOI:10.3970/cmes.2009.049.191

    Abstract A meshless model, based on the Meshless Local Petrov-Galerkin (MLPG) approach, is developed and implemented in parallel for the solution of axi-symmetric poroelastic problems. The parallel code is based on a concurrent construction of the stiffness matrix by the processors and on a parallel preconditioned iterative method of Krylov type for the solution of the resulting linear system. The performance of the code is investigated on a realistic application concerning the prediction of land subsidence above a deep compacting reservoir. The overall code is shown to obtain a very high parallel efficiency (larger than 78% for the solution phase) and… More >

Displaying 1-10 on page 1 of 7. Per Page  

Share Link