An input variable partitioning algorithm for functional decomposition of a system of Boolean functions based on the tabular method

Afshord, Saeid Taghavi; Pottosin, Yuri; Arasteh, Bahman

doi:10.1016/j.dam.2014.12.013

Cited by 7 publications

(1 citation statement)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Additionally, the dynamic nature of the current method is expected to be a topic for future research, as the migration of initial and replica data in a dynamic setting presents unique challenges. Various heuristic/metaheuristics [35][36][37][38][39][40][41][42][43][44][45][46][47][48][49][50] and machine learning methods have been developed and utilized in computer engineering to address a variety of optimization problems [51][52][53][54][55][56][57]; therefore, assessing these methods' effectiveness in the problem of replica placement would be worthwhile.…”

Section: Discussionmentioning

confidence: 99%

Data Replication in Distributed Systems Using Olympiad Optimization Algorithm

Arasteh,

Bouyer,

Ghanbarzadeh

et al. 2023

FU Mech Eng

View full text Add to dashboard Cite

Achieving timely access to data objects is a major challenge in big distributed systems like the Internet of Things (IoT) platforms. Therefore, minimizing the data read and write operation time in distributed systems has elevated to a higher priority for system designers and mechanical engineers. Replication and the appropriate placement of the replicas on the most accessible data servers is a problem of NP-complete optimization. The key objectives of the current study are minimizing the data access time, reducing the quantity of replicas, and improving the data availability. The current paper employs the Olympiad Optimization Algorithm (OOA) as a novel population-based and discrete heuristic algorithm to solve the replica placement problem which is also applicable to other fields such as mechanical and computer engineering design problems. This discrete algorithm was inspired by the learning process of student groups who are preparing for the Olympiad exams. The proposed algorithm, which is divide-and-conquer-based with local and global search strategies, was used in solving the replica placement problem in a standard simulated distributed system. The 'European Union Database' (EUData) was employed to evaluate the proposed algorithm, which contains 28 nodes as servers and a network architecture in the format of a complete graph. It was revealed that the proposed technique reduces data access time by 39% with around six replicas, which is vastly superior to the earlier methods. Moreover, the standard deviation of the results of the algorithm's different executions is approximately 0.0062, which is lower than the other techniques' standard deviation within the same experiments.

show abstract