On resource discovery in distributed systems with mobile hosts

1996 ◽  
Author(s):  
Daniel O. Awduche ◽  
Arthur Gaylord ◽  
Aura Ganz
Keyword(s):  
Distributed Systems ◽  
Resource Discovery ◽  
Mobile Hosts

Dynamic Knowledge Discovery in Open, Distributed and Multi-Ontology Systems

2006 ◽  
pp. 226-258 ◽  
Author(s):  
Silvana Castano ◽  
Alfio Ferrara ◽  
Stefano Montanelli
Keyword(s):  
Distributed Systems ◽  
Knowledge Discovery ◽  
Resource Discovery ◽  
Peer To Peer ◽  
Information Resources ◽  
Information Resource ◽  
Peer To Peer Networks ◽  
Open Distributed Systems ◽  
Ontology Metadata ◽  
Share Information

In open distributed systems like peer-to-peer networks and Grids, many independent peers, possibly spanned across multiple organizations, need to share information resources (e.g., data, documents, services) provided by other nodes. By dynamic knowledge discovery we mean the capability of each node of finding knowledge in the system about information resources that, at a given moment, best match the requirements of a request for given target resource(s). The chapter will focus on describing models and techniques for ontology metadata management and ontology-based dynamic knowledge discovery in open distributed systems, by describing the architecture of a toolkit for information resource discovery and sharing developed in the Helios peer-based system.

scholarly journals CHALLENGES OF INFLUENCE DYNAMIC AND INTERACTIVE EVENTS ON RESOURCE DISCOVERY FUNCTIONALITY OUTSIDE OF DISTRIBUTED EXASCALE SYSTEMS

2020 ◽  
Vol 3 (2) ◽  
pp. 164-180
Author(s):  
◽  
Ehsan Mousavi Khaneghah ◽  
Araz R. Aliev ◽  
Keyword(s):  
Resource Allocation ◽  
Distributed Systems ◽  
Distributed System ◽  
Resource Discovery ◽  
Discovery Process ◽  
Dynamic Nature ◽  
Interactive Nature ◽  
Access Rights ◽  
Computational Element

The resource discovery in Exascale systems should support the occurrence of dynamic nature in each stakeholder's elements in the resource discovery process. The occurrence of dynamic and interactive nature in the accountable computational element creates challenges in executing the activities related to resource discovery, such as the continuation of the response to the request, granting access rights, and the resource allocation to the process. In the case of a lack of management and dynamic and interactive event control in the accountable computational element, the process of activities related to the resource discovery will fail. In this paper, we first examine the concept function of resource discovery in the accountable computational element. Then, to analyze the effects of occurrence, dynamic, and interactive event effects on resource discovery function in the accountable computational element are discussed. The purpose of this paper is to analyze the use of the traditional resource discovery in the Exascale distributed systems and investigate the factors that should be considered in the function of resource discovery management to have the possibility of application in the Exascale distributed system.

scholarly journals Effectual Non-Intrusive Minimum-Process Synchronous Checkpointing Protocol for Mobile Distributed Systems

2021 ◽  
pp. 325-331
Author(s):  
Raman Kumar ◽  
Er Jyoti Arora
Keyword(s):  
Distributed Systems ◽  
Communication Complexity ◽  
Optimization Technique ◽  
Mobile Systems ◽  
Global State ◽  
Mobile Nodes ◽  
Computing Systems ◽  
Mobile Hosts ◽  
Minimum Number ◽  
The Cost

While dealing with Mobile Distributed systems, we come across some issues like: mobility, low bandwidth of wireless channels and dearth of stable storage on mobile nodes, disconnections, inadequate battery power and high failure rate of mobile nodes. Minimum-process coordinated checkpointing is considered an attractive methodology to introduce fault tolerance in mobile systems transparently. In this paper, we propose a non-blocking coordinated global state compilation algorithm for mobile computing systems, which requires only a minimum number of processes to take permanent recovery points. We reduce the communication complexity as compared to the Cao-Singhal algorithm [4], while keeping the number of useless recovery points unchanged. Finally, the paper presents an optimization technique, which significantly reduces the number of useless recovery points at the cost of minor increase in the communication complexity. In coordinated global state compilation, if a single process fails to take its tentative recovery point; all the recovery point effort is aborted. We try to reduce this effort by taking soft recovery points in the first phase at Mobile Hosts.

Sign in / Sign up

Export Citation Format

Share Document