检索结果-内蒙古大学图书馆

1st ACS/IEEE International Conference on Computer Systems and Applications

作者： Housni, A Trehel, M Univ Franche Comte F-25000 Besancon France

ISBN: (纸本)0769511651

Sites with the same priority are gathered in the same group. Communication inside a group is organized in a logical rooted tree structure. The tree's root is the site that last held the token. This organization is similar to that of Raymond's algorithm. For its external communications, a group resorts to an external supplementary element: a router. This router manages external communications. The communication protocol between routers is similar to that of Ricart_Agrawala. Priority between routers is carried out by a comparison mechanism. When it receives a permission request from a router having priority, a router temporarily suspends the request execution of its global waiting queue.

关键词： algorithm distributed mutual exclusion rooted tree token priority groups permission

来源：评论

学校读者我要写书评

暂无评论

Ad hoc distributed mutual exclusion algorithm based on token-asking

引用

Journal of Systems Engineering and Electronics 2007年第2期18卷 398-406页

作者： Wang Zheng Liu Xin'song Li Mei'an School of Economic Information Engineering Southwestern Univ. of Finance and Economics Chengdu 610074 P.R.China 8010 R&D Computer Science and Engineering College Univ. of Electronic Science and Technology Chengdu 610054 P.R.China

The solution of distributed mutual exclusion is difficult in Ad hoc networks owing to dynamic topologies and mobility. Based on the analysis of the properties of Ad hoc networks and the disadvantages of the traditional algorithms, an improved Ad hoc system model was given and a novel algorithm was presented as AHDME （Ad Hoc distributed mutual exclusion）; it was based on the token-asking algorithms. It utilized broadcast to search for the token and to decrease the message complexity of multi-hop Ad hoc networks. Lamport＇s timestamp was improved to ensure the time sequence and to prevent nodes from starvation. When compared to traditional algorithms, AHDME does not require the fixed size of request queues and the global system information, which adapts itself to the frequent arrival/departures and the limited computing capability of nodes in Ad hoc networks. Performance analysis and simulation results show that the AHDME algorithm has low message complexity, small space complexity, and short response delay.

关键词： Ad hoc distributed mutual exclusion Token-asking Logical timestamp.

来源：评论

学校读者我要写书评

暂无评论

Using logical rings to solve the distributed mutual exclusion problem with fault tolerance issues

引用

JOURNAL OF SUPERCOMPUTING 2000年第1-2期16卷 117-132页

作者： Makki, K Dell, J Pissinou, N Moh, WM Jia, X Univ SW Louisiana Ctr Telecommun Studies Lafayette LA 70504 USA Univ SW Louisiana Ctr Adv Comp Studies Lafayette LA 70504 USA San Jose State Univ Dept Math & Comp Sci San Jose CA 95192 USA City Univ Hong Kong Dept Comp Sci Hong Kong Hong Kong Peoples R China

In this paper, we investigate distributed mutual exclusion algorithms and delineate the features of a new distributed mutual exclusion algorithm. The basis of the algorithm is the logical ring structure employed in token-based mutual exclusion algorithms. Specifically, there exists dynamic properties of the logical ring that, given certain restrictions regarding message traffic flow, passively give useful information about the location of the token. Effectively, the algorithm demonstrates a type of "intelligent routing" that identifies useful shortcuts in the routing of the token. The result is a reduction in the total number of messages exchanged prior to the execution of the critical section as compared to the algorithm proposed by Fu and Tzeng [3]. Furthermore, the algorithm allows for an increased degree of fairness in a lightly loaded system than that allowed by Fu and Tzeng's algorithm. The paper also addresses failure recovery issues.

关键词： distributed systems distributed mutual exclusion critical section distributed algorithms communication networks

来源：评论

学校读者我要写书评

暂无评论

A New Simulation of distributed mutual exclusion on Neural Networks

A New Simulation of Distributed Mutual Exclusion on Neural N...

引用

2nd IEEE Conference on Innovative Technologies in Intelligent Systems and Industrial Applications

作者： Bayat, Peyman Ahmadi, Ali Kordi, Ali Faculty Jahad Daneshgahi Tarbiat Modres University

ISBN: (纸本)9781424424160

In a distributed system, process synchronization is an important agenda. One of the major duties for process synchronization is mutual exclusion. In new algorithm, opposite the past algorithms fairness happens. This paper presents a new approach of the race models involving distributed mutual exclusion. Further, concrete applications of these models did not involve variability in the accumulator size or were based on a specific distribution. We show that the distributions of time stamp, time action and the other effective parameters predicted by the neural network competitive models can be solved analytically this problem that be happens in the critical sections. The model can be manipulated and simulated to predict the effects of reward on Hamming and Hopfield's models curves and speed-accuracy decomposition. In other hand, the major contribution of this paper is the implementation of a learning rule that enables networks based on a race model to learn stimulus-response associations. The model described here can be seen as a reduction of information system and is compatible with a priority learning system. Also, we will consider the non-linear behavior of the competitive models and as a result use this property in distributed systems. Finally, it is possible to use the neural networks as a distributed system pattern, to optimization of fault tolerance, reliability and accessibility related to mutual exclusion and critical section. Thus in the new approach fault tolerance will ascend and centralize and distributed algorithms can use this and based algorithm will be more reliable.

关键词： distributed mutual exclusion Neural networks Competition Simulation

来源：评论

学校读者我要写书评

暂无评论

An Efficient Permission-Cum-Cluster Based distributed mutual exclusion Algorithm for Mobile Adhoc Networks 3

An Efficient Permission-Cum-Cluster Based Distributed Mutual...

引用

International Conference Parallel distributed Grid Computing

作者： Anchal Saini, Poonam Krishna, C. Rama NITTTR Dept CSE Chandigarh India PEC Univ Technol Dept CSE Chandigarh India

ISBN: (纸本)9781479976836

mutual exclusion (Mutex) is a major coordination problem in distributed systems. To handle Mutex, the corresponding solutions are mainly classified into permission-based, token-based and quorum-based protocols. Mobile Adhoc Networks referred as MANETs introduce new obstacles for designing algorithms that help in solving distributed mutual exclusion problem. To our knowledge, few algorithms have been proposed in the literature which follows token-based or permission-based approach. In this paper, we propose an efficient permission-cum-cluster based distributed mutual exclusion algorithm for mobile adhoc networks. The significant motivation for our algorithm is to ensure that every node should transmit the lowest number of effective messages in the underlying network. Moreover, it will lead to reduced communication delay in order to retrieve the required permissions. We observed that the proposed algorithm outperforms the Mobile_ RA algorithm in performance parameters such as synchronization delay, response time as well as message complexity. The results have been substantiated by simulation experiments.

关键词： distributed mutual exclusion Layered Architecture Clustering Mobile Adhoc Networks

来源：评论

学校读者我要写书评

暂无评论

A prioritized distributed mutual exclusion algorithm balancing priority inversions and response time

A prioritized distributed mutual exclusion algorithm balanci...

引用

42nd Annual International Conference on Parallel Processing (ICPP)

作者： Lejeune, Jonathan Arantes, Luciana Sopena, Julien Sens, Pierre CNRS LIP6 UPMC 4 Pl Jussieu F-75252 Paris 05 France

ISBN: (纸本)9780769551173

distributed priority-based mutual exclusion algorithms may present starvation for low priority requests if the shared resource is continuously asked by high priority requests. To address this problem, several existing algorithms dynamically increment the priority of pending low-priority requests. The drawback of this approach is that it may lead to a great number of priority inversions, i.e., a pending request p is satisfied before another one whose priority is higher than p's. One solution to reduce this number, as we have proposed in [7], is to both postpone priority increments and prevent low priorities from increasing too fast. However, in this case, the response time of low priorities may considerably increase. Therefore, in this article, we propose a new algorithm, denoted "Awareness", which aims at reducing the maximum response time whereas the number of priority violations remains low. To this end, a global view of pending requests of the system is necessary. Performance evaluation results confirm that our new algorithm provides a good tradeoff between response time and number of priority inversions.

关键词： distributed mutual exclusion priorities

来源：评论

学校读者我要写书评

暂无评论

A reliable optimization on distributed mutual exclusion algorithm

A reliable optimization on distributed mutual exclusion algo...

引用

2nd International Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities

作者： Challenger, Moharram Bayat, Peyman Meybodi, M. R. IAU Dept Comp Engn Shabestar Iran AUT Dept Comp Engn Shabestar Iran

ISBN: (纸本)1424401054

This paper presents a reliable decentralized mutual exclusion algorithm for distributed systems in which processes communicate by a synchronous message passing. When any failure happens in system, the algorithm protects the distributed system against any crash. It also makes possible the recovery of lost data in system. It requires between (N-1) and 2(N-1) messages per critical section access, where N is the number of processes in the system. The exact message complexity can be expressed as a order function of clients in computation. The algorithm does not introduce any other overhead over Lamport's and Ricart-Agrawala's algorithms, which require 3(N-1) and 2(N-1) messages per critical section access, respectively.

关键词： distributed mutual exclusion DMX or DME reliability process concurrency synchronization and fault tolerance

来源：评论

学校读者我要写书评

暂无评论

The Average Message Complexity Analysis for Different distributed mutual exclusion Site-tolerant Ways

引用

International Conference on Engineering Materials, Energy, Management and Control

作者： Li, MeiAn Li, Wei Ma, Dong Inner Mongolia Agr Univ Coll Comp & Informat Engn Hohhot Peoples R China

ISBN: (纸本)9783037850022

Many schemes have been proposed to implementation the distributed mutual exclusion. All those algorithms or schemes can be dived into two types based on the fault-tolerant operation. To any type algorithm, the size of the intersection of any two quorums will impact the number of average messages exchanged per Critical Section (CS) execution importantly if the sites are not always operational. In this paper, Basing on the discussions about the average messages in different cases of different algorithms, we get the average messages in the two types algorithm have the same monotony properties to k. and when N and k are all constants, the average messages functions are monotony descend to p. The average messages are more when k=1 than k=N if p is small enough. The minimum of the average messages is M = 3-root N When p=1.

关键词： Average message complexity distributed mutual exclusion site-tolerant

来源：评论

学校读者我要写书评

暂无评论

Formalization of the necessary and sufficient connectivity conditions to the distributed mutual exclusion problem in dynamic networks

Formalization of the necessary and sufficient connectivity c...

引用

10th IEEE International Symposium on Network Computing and Applications (NCA)

作者： Floriano, Paulo Goldman, Alfredo Arantes, Luciana Univ Sao Paulo Inst Math & Stat R Matao BR-1010 Sao Paulo Brazil Univ Paris 06 CNRS INRIA LIP 6 F-75005 Paris France

ISBN: (纸本)9780769544892

Nowadays there exist many networks with dynamic characteristics (e.g. MANETs, DTNs, opportunistic networks, etc.). Our aim is thus to determine the necessary and sufficient connectivity conditions which allow the correct execution of some distributed algorithms on top of them. To this end, we use a framework proposed by Casteigts et al. [1] that exploits the evolving graphs theory, which models the topology of the network as well as the graph relabeling approach, which abstracts communication. In particular, we provide necessary and sufficient conditions for two important distributed problems: mutual exclusion and K-mutual exclusion.

关键词： distributed mutual exclusion distributed algorithms Dynamic Networks Evolving Graphs Heuristic algorithms K-mutual exclusion Network topology Peer to peer computing Protocols Safety Topology abstracts communication computer networks connectivity conditions distributed algorithms distributed algorithms distributed mutual exclusion problem distributed problems dynamic networks graph relabeling approach graph theory graphs theory network topology telecommunication network topology

来源：评论

学校读者我要写书评

暂无评论

A distributed mutual exclusion algorithm for mobile ad-hoc networks

A distributed mutual exclusion algorithm for mobile ad-hoc n...

引用

7th IEEE International Symposium on Computers and Communications

作者： Baldoni, R Virgillito, A Petrassi, R Univ Roma La Sapienza Dipartimento Informat & Sistemist I-00198 Rome Italy

ISBN: (纸本)0769516718

A distributed mutual exclusion algorithm based on token exchange and well suited for mobile ad-hoc networks is presented along with a simulation study. The algorithm is based onto a dynamic logical ring and combines the best from the two families of token based algorithms (i.e., token-asking and circulating token) in order to get a number of messages exchanged per CS access (the main performance index for such algorithms) that tends to optimal values under heavy request load (i.e., two application messages each CS access). We present a simulation study, that (i) confirms this optimality and (ii) shows that, in a mobile ad-hoc network, an effective reduction in the number of hops per application message can be achieved by using a specific policy to build on-the-fly the logical ring.

关键词： token-based algorithms distributed synchronization distributed mutual exclusion

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：