scholarly journals Applying Prolog to develop distributed systems

2010 ◽  
Vol 10 (4-6) ◽  
pp. 691-707 ◽  
Author(s):  
NUNO P. LOPES ◽  
JUAN A. NAVARRO ◽  
ANDREY RYBALCHENKO ◽  
ATUL SINGH
Keyword(s):  
Distributed Systems ◽  
Control Mechanism ◽  
Hash Table ◽  
Distributed Hash Table ◽  
Programming System ◽  
Byzantine Fault Tolerance ◽  
Distributed Software ◽  
Software Model ◽  
Programming Techniques ◽  
Table Data

AbstractDevelopment of distributed systems is a difficult task. Declarative programming techniques hold a promising potential for effectively supporting programmer in this challenge. While Datalog-based languages have been actively explored for programming distributed systems, Prolog received relatively little attention in this application area so far. In this paper we present a Prolog-based programming system, called DAHL, for the declarative development of distributed systems. DAHL extends Prolog with an event-driven control mechanism and built-in networking procedures. Our experimental evaluation using a distributed hash-table data structure, a protocol for achieving Byzantine fault tolerance, and a distributed software model checker—all implemented in DAHL—indicates the viability of the approach.

scholarly journals OLB: A Nature Inspired Approach for Load Balancing in Cloud Computing

2015 ◽  
Vol 15 (4) ◽  
pp. 138-148 ◽  
Author(s):  
B. Mallikarjuna ◽  
P. Venkata Krishna
Keyword(s):  
Resource Allocation ◽  
Cloud Computing ◽  
Distributed Systems ◽  
Load Balancing ◽  
Virtual Machines ◽  
Simulation Analysis ◽  
Hash Table ◽  
Distributed Hash Table ◽  
Efficient Resource

Abstract Load balancing is treated as one of the important mechanisms for efficient resource allocation in cloud computing. In future there will appear a necessity of fully autonomic distributed systems to address the load balancing issues. With reference to this, we proposed a load balancing mechanism called Osmosis Load Balancing (OLB). OLB works on the principle of osmosis to reschedule the tasks in virtual machines. The solution is based on the Distributed Hash Table (DHT) with a chord overlay mechanism. The Chord overlay is used for managing bio inspired agents and status of the cloud. By simulation analysis, the proposed algorithm has shown better performance in different scenarios, both in heterogeneous and homogeneous clouds.

Token Based Mutual Exclusion in Peer-to-Peer Systems

2012 ◽  
pp. 214-228 ◽  
Author(s):  
Mayank Singh ◽  
Shashikala Tapaswi
Keyword(s):  
Distributed Systems ◽  
Message Passing ◽  
Mutual Exclusion ◽  
Hash Table ◽  
Peer To Peer ◽  
Distributed Hash Table ◽  
Shared Resources ◽  
Peer To Peer Systems ◽  
Mutual Exclusion Algorithm ◽  
Message Overhead

Mutual exclusion is one of the well-studied fundamental primitives in distributed systems, and a number of vital solutions have been proposed to achieve the same. However, the emerging Peer to Peer systems bring forward several challenges to protect consistent and concurrent access to shared resources, as classical peer-to-peer systems, like Napster, Gnutella, et cetera, have been mainly used for sharing files with read only permission. In this chapter, the authors propose a quorum based mutual exclusion algorithm that can be used over any Peer to Peer Distributed Hash Table (DHT). The proposed approach can be seen as extension to traditional Sigma protocol for mutual exclusion in Peer to Peer systems. The basic idea is to reduce message overhead with use of smart nodes present in each quorum set and message passing between the current owners of resource with next resource requester nodes.

NVESTIGATION OF THE EFFICIENCY OF DISTRIBUTED INFORMATION SYSTEMS BASED ON THE PROCESSING OF LARGE AMOUNTS OF DATA

2019 ◽  
Author(s):  
Mykhajlo Klymash ◽  
Olena Hordiichuk — Bublivska ◽  
Ihor Tchaikovskyi ◽  
Oksana Urikova
Keyword(s):  
Distributed Systems ◽  
Large Data ◽  
Large Data Sets ◽  
Data Sets ◽  
Data Decomposition ◽  
Distributed Information ◽  
Software Model ◽  
Computing Performance ◽  
Mapreduce Model ◽  
Singular Data

In this article investigated the features of processing large arrays of information for distributed systems. A method of singular data decomposition is used to reduce the amount of data processed, eliminating redundancy. Dependencies of com­putational efficiency on distributed systems were obtained using the MPI messa­ging protocol and MapReduce node interaction software model. Were analyzed the effici­ency of the application of each technology for the processing of different sizes of data: Non — distributed systems are inefficient for large volumes of information due to low computing performance. It is proposed to use distributed systems that use the method of singular data decomposition, which will reduce the amount of information processed. The study of systems using the MPI protocol and MapReduce model obtained the dependence of the duration calculations time on the number of processes, which testify to the expediency of using distributed computing when processing large data sets. It is also found that distributed systems using MapReduce model work much more efficiently than MPI, especially with large amounts of data. MPI makes it possible to perform calculations more efficiently for small amounts of information. When increased the data sets, advisable to use the Map Reduce model.

scholarly journals Agent-Based Coordinated Control of Power Electronic Converters in a Microgrid

Electronics ◽  
2021 ◽  
Vol 10 (9) ◽  
pp. 1031
Author(s):  
Maryam Nasri ◽  
Herbert L. Ginn ◽  
Mehrdad Moallem
Keyword(s):  
Hash Table ◽  
Power Sharing ◽  
Distributed Hash Table ◽  
Power Electronic ◽  
Power Electronic Converters ◽  
Agent Based ◽  
Development Framework ◽  
Study Results ◽  
Set Up ◽  
Microgrid Control

This paper presents the implementation of an agent-based architecture suitable for the coordination of power electronic converters in stand-alone microgrids. To this end, a publish-subscribe agent architecture was utilized as a distributed microgrid control platform. Over a distributed hash table (DHT) searching overlay, the publish-subscribe architecture was identified based on a numerical analysis as a scalable agent-based technology for the distributed real-time coordination of power converters in microgrids. The developed framework was set up to deploy power-sharing distributed optimization algorithms while keeping a deterministic time period of a few tens of milliseconds for a system with tens of converters and when multiple events might happen concurrently. Several agents participate in supervisory control to regulate optimum power-sharing for the converters. To test the design, a notional shipboard system, including several converters, was used as a case study. Results of implementing the agent-based publish-subscribe control system using the Java Agent Development Framework (JADE) are presented.

Improved Blockchain Commodity Traceability System Using Distributed Hash Table

2020 ◽  
Author(s):  
Wu Junhui ◽  
Wu Tuolei ◽  
Wu Yusheng ◽  
Chen Jie ◽  
Lin Kaiyan ◽  
...  
Keyword(s):  
Hash Table ◽  
Distributed Hash Table ◽  
Traceability System

scholarly journals The Management Strategy of Metadata in Large-scale Network Storage System

2018 ◽  
Vol 228 ◽  
pp. 01011
Author(s):  
Haifeng Zhong ◽  
Jianying Xiong
Keyword(s):  
Large Scale ◽  
Storage System ◽  
Hash Table ◽  
Distributed Hash Table ◽  
Distributed Data ◽  
Mass Storage ◽  
Large Scale Network ◽  
Network Storage System ◽  
Mass Storage System ◽  
Scale Network

The wan Internet storage system based on Distributed Hash Table uses fully distributed data and metadata management, and constructs an extensible and efficient mass storage system for the application based on Internet. However, such systems work in highly dynamic environments, and the frequent entry and exit of nodes will lead to huge communication costs. Therefore, this paper proposes a new hierarchical metadata routing management mechanism based on DHT, which makes full use of the node stabilization point to reduce the maintenance overhead of the overlay. Analysis shows that the algorithm can effectively improve efficiency and enhance stability.

Fully Distributed Indexing over a Distributed Hash Table

2017 ◽  
pp. 308-318
Author(s):  
Simon Désaulniers ◽  
Adrien Béraud ◽  
Alexandre Blondin Massé ◽  
Nicolas Reynaud
Keyword(s):  
Hash Table ◽  
Distributed Hash Table ◽  
Distributed Indexing
Sign in / Sign up

Export Citation Format

Share Document