Logically instantaneous message passing in asynchronous distributed systems

1994 ◽  
Vol 43 (5) ◽  
pp. 513-527 ◽  
Author(s):  
T. Soneoka ◽  
T. Ibaraki
Keyword(s):  
Distributed Systems ◽  
Message Passing

scholarly journals Distributed Singular Value Decomposition Method for Fast Data Processing in Recommendation Systems

Energies ◽  
2021 ◽  
Vol 14 (8) ◽  
pp. 2284
Author(s):  
Krzysztof Przystupa ◽  
Mykola Beshley ◽  
Olena Hordiichuk-Bublivska ◽  
Marian Kyryk ◽  
Halyna Beshley ◽  
...  
Keyword(s):  
Distributed Systems ◽  
Singular Value Decomposition ◽  
Data Processing ◽  
Message Passing ◽  
Message Passing Interface ◽  
Recommendation Systems ◽  
Singular Value ◽  
Singular Value Decomposition Method ◽  
Value Decomposition ◽  
Svd Method

The problem of analyzing a big amount of user data to determine their preferences and, based on these data, to provide recommendations on new products is important. Depending on the correctness and timeliness of the recommendations, significant profits or losses can be obtained. The task of analyzing data on users of services of companies is carried out in special recommendation systems. However, with a large number of users, the data for processing become very big, which causes complexity in the work of recommendation systems. For efficient data analysis in commercial systems, the Singular Value Decomposition (SVD) method can perform intelligent analysis of information. With a large amount of processed information we proposed to use distributed systems. This approach allows reducing time of data processing and recommendations to users. For the experimental study, we implemented the distributed SVD method using Message Passing Interface, Hadoop and Spark technologies and obtained the results of reducing the time of data processing when using distributed systems compared to non-distributed ones.

scholarly journals Defining a general object model of distributed systems entities in Java

2003 ◽  
Vol 16 (2) ◽  
pp. 185-194
Author(s):  
Nenad Jovanovic ◽  
Ranko Popovic ◽  
Zoran Jovanovic
Keyword(s):  
Distributed Systems ◽  
Programming Language ◽  
Message Passing ◽  
Present Model ◽  
Heterogeneous Systems ◽  
Object Model ◽  
Java Programming ◽  
Xml Document ◽  
General Object ◽  
Model Components

This paper deals with modeling and simulation of distributed systems in Java programming language. Distributed systems consist of components which communicate and coordinate their actions by passing messages. Components of distributed systems which define some functionality are entities determined with static attributes. The paper presents general model for modeling in Java environment entities distributed systems communicate using message passing protocol. We described a way to present model components and their functional links in a form of an XML document. A model can be executed as an application and (or) an applet. Presented model can be used for modeling heterogeneous systems.

scholarly journals Gobra: Modular Specification and Verification of Go Programs

2021 ◽  
pp. 367-379
Author(s):  
Felix A. Wolf ◽  
Linard Arquint ◽  
Martin Clochard ◽  
Wytse Oortwijn ◽  
João C. Pereira ◽  
...  
Keyword(s):  
Distributed Systems ◽  
Programming Language ◽  
Message Passing ◽  
Safety Data ◽  
Separation Logic ◽  
Data Race ◽  
Static Verification ◽  
Crash Safety ◽  
Concurrent And Distributed Systems ◽  
Systems Programming

AbstractGo is an increasingly-popular systems programming language targeting, especially, concurrent and distributed systems. Go differentiates itself from other imperative languages by offering structural subtyping and lightweight concurrency through goroutines with message-passing communication. This combination of features poses interesting challenges for static verification, most prominently the combination of a mutable heap and advanced concurrency primitives.We present Gobra, a modular, deductive program verifier for Go that proves memory safety, crash safety, data-race freedom, and user-provided specifications. Gobra is based on separation logic and supports a large subset of Go. Its implementation translates an annotated Go program into the Viper intermediate verification language and uses an existing SMT-based verification backend to compute and discharge proof obligations.

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.

MOBILE AGENT BASED CHECKPOINTING WITH CONCURRENT INITIATIONS

2007 ◽  
Vol 18 (05) ◽  
pp. 1107-1122 ◽  
Author(s):  
PARTHA SARATHI MANDAL ◽  
KRISHNENDU MUKHOPADHYAYA
Keyword(s):  
Distributed Systems ◽  
Mobile Agent ◽  
Mobile Agents ◽  
Message Passing ◽  
Coupled Systems ◽  
Wide Area ◽  
Worst Case ◽  
Attractive Option ◽  
Tightly Coupled ◽  
Average Size

Traditional message passing based checkpointing and rollback recovery algorithms perform well for tightly coupled systems. In wide area distributed systems these algorithms may suffer from large overhead due to message passing delay and network traffic. Mobile agents offer an attractive option for designing checkpointing schemes for wide area distributed systems. Network topology is assumed to be arbitrary. Processes are mobile agent enabled. When a process wants to take a checkpoint, it just creates one mobile agent. Concurrent initiations by multiple processes are allowed. Synchronization and creation of a consistent global state (CGS) for checkpointing is managed by the mobile agent(s). In the worst case, for k concurrent initiations among n processes, checkpointing algorithm requires a total of O(kn) hops by all the mobile agents. A mobile agent carries O(n/k) (on the average) size data.

BOUNDED TIMESTAMPS IN PROCESS NETWORKS

1996 ◽  
Vol 06 (02) ◽  
pp. 259-264 ◽  
Author(s):  
AMBUJ K. SINGH
Keyword(s):  
Distributed Systems ◽  
Message Passing ◽  
Process Networks ◽  
Simple Implementation

Timestamps have been used for designing and analyzing a number of algorithms in distributed systems. The reusability of timestamps is investigated in the setting of a message-passing system and a simple implementation is presented for bounded timestamps.

Sign in / Sign up

Export Citation Format

Share Document