scholarly journals Parallel Hybridization for SAT: An Efficient Combination of Search Space Splitting and Portfolio

2021 ◽  
Vol Volume 34 - 2020 - Special... ◽  
Author(s):  
Rodrigue Konan Tchinda ◽  
Clémentin Tayou Djamegni
Keyword(s):  
Load Balancing ◽  
Search Space ◽  
Sat Solving ◽  
Work Stealing ◽  
Dynamic Work ◽  
Mise En Œuvre ◽  
Hybrid Approaches ◽  
Parallel Hybrid ◽  
International Audience

International audience Search space splitting and portfolio are the two main approaches used in parallel SAT solving. Each of them has its strengths but also, its weaknesses. Decomposition in search space splitting can help improve speedup on satisfiable instances while competition in portfolio increases robustness. Many parallel hybrid approaches have been proposed in the literature but most of them still cope with load balancing issues that are the cause of a non-negligible overhead. In this paper, we describe a new parallel hybridization scheme based on both search space splitting and portfolio that does not require the use of load balancing mechanisms (such as dynamic work stealing). Les deux principales approches utilisées dans la résolution parallèle du problème de satisfiabilité propositionnelle sont DPR (Diviser Pour Régner) et portfolio. Chacune d’elles comporte des forces et des faiblesses. La décomposition dans DPR permet d’améliorer le speedup sur les instancessatisfiables tandis que la compétition dans les portfolios accroit la robustesse. Plusieurs approches hybrides pour la résolution parallèle de SAT ont été présentées dans la littérature mais la plupart d’entre elles souffrent encore des problèmes dus aux mécanismes de rééquilibrage dynamique decharges qui sont à l’origine d’un surcoût non négligeable. Nous décrivons dans ce papier un nouveau schéma d’hybridation parallèle basé sur les deux approches DPR et portfolio ne nécessitant pas la mise en œuvre des mécanismes de rééquilibrage de charges (tels que le vol de tâche).

scholarly journals Appsgate, a Programmable Domestic Eco-system: Learning from "Living in it"

2018 ◽  
Vol Volume 7, Number 1 (Research articles) ◽  
Author(s):  
Joëlle Coutaz ◽  
James L. Crowley
Keyword(s):  
Real World ◽  
Real Life ◽  
End Users ◽  
Team Members ◽  
Mise En Œuvre ◽  
Person Perspective ◽  
Nous Montrons ◽  
International Audience ◽  
Living Labs ◽  
First Person Perspective

International audience We present an experience with the development and evaluation of AppsGate, an ecosystem for the home that can be programmed by end-users. We show the benefits from using the homes of the project team members as real-life living-labs. In particular, we discuss the first person perspective experience as an effective way to conduct longitudinal experiments in real world settings. We conclude that a programmable habitat is desirable provided that attention cost is minimized Cet article présente un retour d’expérience avec la mise en oeuvre et l’évaluation d’AppsGate, un écosystème domestique programmable par l’habitant. Nous montrons l’apport de l’utilisation des domiciles de membres du projet tout au long du processus de développement, et notamment l’intérêt de « vivre avec » comme technique d’expérimentation longitudinale

scholarly journals Selection of search strategies for solving 3-SAT problems

2014 ◽  
Vol 24 (2) ◽  
pp. 283-297
Author(s):  
Andrzej Pułka
Keyword(s):  
Electronic System ◽  
Search Space ◽  
Commonsense Reasoning ◽  
Sat Solving ◽  
Multiple Variable ◽  
Pruning Algorithms ◽  
System Verification ◽  
Satisfiability Checking ◽  
Search Space Pruning ◽  
Selection Of

Abstract The paper concerns the problem of Boolean satisfiability checking, which is recognized as one of the most important issues in the field of modern digital electronic system verification and design. The paper analyzes different strategies and scenarios of the proving process, and presents a modified and extended version of the author’s FUDASAT algorithm. The original FUDASAT methodology is an intuitive approach that employs a commonsense reasoning methodology. The main objective of the work is to investigate the SAT-solving process and try to formulate a set of rules controlling the reasoning process of the FUDASAT inference engine. In comparison with the author’s previous works, the paper introduces new mechanisms: hypergraph analysis, multiple variable assignments and search space pruning algorithms. The approach considers only 3-SAT class functions, although a generalization of the method is discussed as well. The presented approach has been tested on various benchmarks and compared with the original pure FUDASAT algorithm as well as with other algorithms known from the literature. Finally, the benefits of the proposed SAT solving technique are summarized.

scholarly journals GWS—A Collaborative Load-Balancing Algorithm for Internet-of-Things

Sensors ◽  
2018 ◽  
Vol 18 (8) ◽  
pp. 2479 ◽  
Author(s):  
Hongyu Xiao ◽  
Zhenjiang Zhang ◽  
Zhangbing Zhou
Keyword(s):  
Load Balancing ◽  
Scheduling Algorithm ◽  
Fog Computing ◽  
Nash Bargaining Solution ◽  
Nash Bargaining ◽  
Bargaining Solution ◽  
Time Sharing ◽  
Work Stealing ◽  
The Game Theory ◽  
Load Balancing Algorithm

This paper firstly replaces the first-come-first-service (FCFS) mechanism with the time-sharing (TS) mechanism in fog computing nodes (FCNs). Then a collaborative load-balancing algorithm for the TS mechanism is proposed for FCNs. The algorithm is a variant of a work-stealing scheduling algorithm, and is based on the Nash bargaining solution (NBS) for a cooperative game between FCNs. Pareto optimality is achieved through the collaborative working of FCNs to improve the performance of every FCN. Lastly the simulation results demonstrate that the game-theory based work-stealing algorithm (GWS) outperforms the classical work-stealing algorithm (CWS).

scholarly journals SURVEY: EFFICIENT HYBRID ALGOR ITHMS OF CRYPTOGRAPHY

2020 ◽  
Vol 2 (4) ◽  
pp. 1-16
Author(s):  
Mays M. HOOBI
Keyword(s):  
Data Exchange ◽  
Search Space ◽  
Research Unit ◽  
Data Encryption ◽  
Digital Data ◽  
Secret Data ◽  
Data Encryption Standard ◽  
Hybrid Approaches ◽  
Private And Public ◽  
Secure Transmission

Day after day, the digital data sizes undergo rapid increases over Internet, it is significant; the data shouldn’t be accessed by the unauthorized users. The attackers attempt at accessing those sensitive part of the data. There is a necessity for the prevention of the unauthorized access of the data and guarantee the secure data exchange. A variety of the cryptographic approaches have been used for the conversion of the secret data of the users into secure ciphertext formats. The cryptographic methods have been based on, private and public keys. The researchers have worked on the efficient and secure transmission of data and presented a variety of the cryptographic approaches. For the efficient and secure transmission of the data over networks, there is a necessity of using hybrid approaches of encryption. In this article, various encryption methods are reviewed such as Rijndael, Number Theory Research Unit, Data Encryption Standard, 3 Data Encryption Standard, Elliptic Curve Cryptography, Rivest–Shamir–Adleman, Optimal Asymmetric Encryption Padding, Diffie-Hellman, HiSea, Improved Caesar, Digital Signature, and Advance Encryption Standard. Keywords: Brute Force Attack, Cryptography, Digital Data, Hybrid Encryption, Search Space.

Sign in / Sign up

Export Citation Format

Share Document