Hybrid algorithms for 3-SAT optimisation using MapReduce on clouds
by Marcos Barreto; Sergio Nesmachnow; Andrei Tchernykh
International Journal of Innovative Computing and Applications (IJICA), Vol. 9, No. 1, 2018

Abstract: This article presents the advances on applying a MapReduce approach for solving optimisation problems using Hadoop on cloud computing systems. The main advantages and limitations of the proposed strategy are presented and commented. A concrete case study is reported, analysing several algorithmic approaches to solve the 3-SAT, a well-known version of the Boolean satisfiability problem. Several variants of the MapReduce 3-SAT solver are designed and evaluated to demonstrate that the collaborative approach is a promising option for solving optimisation problems in the cloud.

Online publication date: Wed, 28-Mar-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Innovative Computing and Applications (IJICA):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com