Search Results - (( java application using algorithm ) OR ( based replication proposed algorithm ))
Search alternatives:
- proposed algorithm »
- based replication »
- java application »
- using algorithm »
-
1
Adaptive persistence layer for synchronous replication (PLSR) in heterogeneous system
Published 2011“…The PLSR architecture model, workflow and algorithms are described. The PLSR has been developed using Java Programming language. …”
Get full text
Get full text
Thesis -
2
Relationship based replication algorithm for data grid
Published 2014“…The Relationship based Replication algorithm aims to improve the Data Grid performance by reducing the job execution time, bandwidth and storage usage.The RBR was realized using a network simulation (OptorSim) and experiment results revealed that it offers better performance than existing replication algorithms.…”
Get full text
Get full text
Monograph -
3
Online dynamic replication and placement algorithms for cost optimization of online social networks in two-tier multi-cloud
Published 2024“…A simulation using a synthesized workload generated based on a real Facebook statistic dataset shows that the proposed algorithms produce a monetary cost savings of more than 23 compared to the Static Replication and Local Placement (SRLP) algorithm.…”
Get full text
Get full text
Get full text
Article -
4
Online Dynamic Replication and Placement Algorithms for Cost Optimization of Online Social Networks in Two-tier Multi-cloud
Published 2024journal::journal article -
5
An adaptive data replication and placement for efficient data storage of online social networks using two-tier multi-cloud environment
Published 2022“…Two algorithms are proposed to adapt the replication and placement of the data object according to its popularity in the OSN. …”
Get full text
Get full text
Article -
6
Dynamic replication algorithm in data grid: Survey
Published 2008“…A dynamic replication model based on mathematical concepts is proposed. …”
Get full text
Get full text
Get full text
Book Section -
7
Efficient multi-cloud storage using online dynamic replication and placement algorithms for online social networks
Published 2024“…The DTS algorithm establishes the replication and placement of objects using deterministic time slots, while the RTS algorithm is based on randomized time slots. …”
Get full text
Get full text
Article -
8
Dynamic replication aware load blanced scheduling in distributed environment / Said Bakhshad
Published 2018“…The simulation of the proposed algorithm shows promising results and better performance compared to the current state-of-the-art (MDHR) algorithm. …”
Get full text
Get full text
Get full text
Thesis -
9
Efficient Multi-Cloud Storage Using Online Dynamic Replication and Placement Algorithms for Online Social Networks
Published 2024journal::journal article -
10
A framework for implementing asynchronous replication scheme in utility-based computing environment
Published 2016“…This paper addresses a problem on implementing an asynchronous replication scheme in utility-based computing environment. …”
Get full text
Get full text
Conference or Workshop Item -
11
A Framework for Asynchronous Replication Scheme for Utility-based Computing Environment
Published 2015“…This paper addresses a problem on implementing an asynchronous replication scheme in utility-based computing environment. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
12
RSA Encryption & Decryption using JAVA
Published 2006“…References and theories to support the research of 'RSA Encryption/Decryption using Java' have been disclosed in Literature Review section. …”
Get full text
Get full text
Final Year Project -
13
-
14
Improving response time, availability and reliability through asynchronous replication technique in cluster architecture of web server cluster
Published 2010“…This paper proposes an algorithm of data replication scheme based on asynchronous replication in order to improve web server cluster system reliability. …”
Get full text
Get full text
Conference or Workshop Item -
15
Provider independent cryptographic tools
Published 2003Get full text
Get full text
Get full text
Monograph -
16
A cluster-based hybrid replica control protocol for high availability in data grid
Published 2019“…Another proposed algorithm is replica placement algorithm which selects and places only one replica in each cluster. …”
Get full text
Get full text
Thesis -
17
Replica Creation Algorithm for Data Grids
Published 2012“…Current algorithms focus on number of accesses in deciding which file to replicate and where to place them, which ignores resources’ capabilities. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
18
An enhanced ant colony system algorithm for dynamic fault tolerance in grid computing
Published 2020“…The proposed algorithm consists of dynamic evaporation rate, resource fitness-based scheduling process, enhanced pheromone update with trust factor and suspension, and checkpoint-based task reprocessing. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
19
Re-engineering grid-based quorum replication into binary vote assignment on cloud: A scalable approach for strong consistency in cloud databases
Published 2025“…Existing systems such as DynamoDB, FoundationDB, and GeoGauss illustrate different design tradeoffs but face limitations in balancing latency, correctness, and resilience under dynamic workloads. This study proposes the Binary Vote Assignment in Cloud (BVAC), a cloud-native replication algorithm re-engineered from the Binary Vote Assignment on Grid Quorum (BVAGQ). …”
Get full text
Get full text
Get full text
Article -
20
A Novel Wrapper-Based Optimization Algorithm for the Feature Selection and Classification
Published 2023“…Moreover, K-Nearest Neighbor (KNN) classifier was used to evaluate the effectiveness of the features identified by the proposed SCSO algorithm. The performance of the proposed SCSO algorithm was compared with six state-of-the-art and recent wrapper-based optimization algorithms using the validation metrics of classification accuracy, optimum feature size, and computational cost in seconds. …”
Get full text
Get full text
Article
