首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   22篇
  完全免费   10篇
  自动化技术   32篇
  2019年   1篇
  2018年   1篇
  2016年   2篇
  2015年   1篇
  2013年   1篇
  2012年   1篇
  2011年   1篇
  2010年   1篇
  2009年   1篇
  2008年   1篇
  2007年   3篇
  2006年   1篇
  2005年   2篇
  2004年   1篇
  2002年   1篇
  2001年   1篇
  1999年   1篇
  1998年   1篇
  1995年   1篇
  1994年   2篇
  1993年   1篇
  1992年   1篇
  1991年   2篇
  1987年   1篇
  1986年   1篇
  1985年   1篇
排序方式: 共有32条查询结果,搜索用时 156 毫秒
1.
利用模块化设计的思想,首先为分布式数据库系统中各事务的每一种操作(读锁、写锁、解锁)构造一个基本的加权Petri网模型,并给出了加权Petri网共享合成的概念、然后利用共享合成技术,动态地构造各站点的加权Petri网模型,以适应系统的动态变化.此外,本文利用Petri网的化简技术,极大地简化了各站点的Petri网模型,之后利用同步合成技术构造出整个系统的Petri网模型,较好地解决了Petri网的可达性分析中可能出现的状态“爆炸”问题.最后给出了判断整个系统是否出现死锁的充分必要条件.  相似文献
2.
对于避免死锁的安全算法的改进   总被引:4,自引:1,他引:3  
周兵 《微机发展》2001,11(3):1-3
在每种资源只有一个个体的情况下,本文给出了一种避免死销的安全算法。该算法是对现有的一种安全算法的改进,改进后的算法被命名为触网式安全算法,该算法把以前算法的运算级次从n^2(n表示系统中进程的数目)降低为n,从而大大地节省了检测开锁。  相似文献
3.
This paper attempts a comprehensive study of deadlock detection in distributed database systems. First, the two predominant deadlock models in these systems and the four different distributed deadlock detection approaches are discussed. Afterwards, a new deadlock detection algorithm is presented. The algorithm is based on dynamically creating deadlock detection agents (DDAs), each being responsible for detecting deadlocks in one connected component of the global wait-for-graph (WFG). The DDA scheme is a “self-tuning” system: after an initial warm-up phase, dedicated DDAs will be formed for “centers of locality”, i.e., parts of the system where many conflicts occur. A dynamic shift in locality of the distributed system will be responded to by automatically creating new DDAs while the obsolete ones terminate. In this paper, we also compare the most competitive representative of each class of algorithms suitable for distributed database systems based on a simulation model, and point out their relative strengths and weaknesses. The extensive experiments we carried out indicate that our newly proposed deadlock detection algorithm outperforms the other algorithms in the vast majority of configurations and workloads and, in contrast to all other algorithms, is very robust with respect to differing load and access profiles. Received December 4, 1997 / Accepted February 2, 1999  相似文献
4.
This article presents an algorithm for detecting deadlocks in concurrent finite-state systems without incurring most of the state explosion due to the modeling of concurrency by interleaving. For systems that have a high level of concurrency, our algorithm can be much more efficient than the classical exploration of the whole state space. Finally, we show that our algorithm can also be used for verifying arbitrary safety properties.  相似文献
5.
基于等待图模型的死锁检测新算法   总被引:1,自引:0,他引:1  
本文提出了一种在等待图中检测回路的线性时间算法,它通过搜索回边来判定等待图中回路的存在性。  相似文献
6.
Strong stable properties in distributed systems   总被引:1,自引:0,他引:1  
Summary A stable property in a distributed system is a global property which once true, remains true forever. This paper refines this notion by formally introducing the concept ofstrong stable properties. A strong stable property has the nice property that it can be correctly evaluated on the consistent part of uncoordinated snapshots. Termination and deadlock are shown to be strong stable properties, whereas distributed garbage is not. We also show how to derive a simple generic algorithm for the detection of a strong stable property. The generic algorithm is illustrated by two examples: termination detection and deadlock detection. Incidentally the paper presents a very simple algorithm for termination detection. Andre Schiper has been a professor of Computer Science at EPFL (Federal Institute of Technology in Lausanne, Switzerland) since 1985, leading the Operating Systems laboratory. He graduated in Physics from the Federal Institute of technology in Zürich and received his Ph.D. in Computer Science from EPFL in 1980. In 1981–82 he spent one year at the University of Rennes, France. From 1983 to 1985, he was professor at the Engineering School in Yverdon, Switzerland. Between 1989 and 1991 André Schiper was head of the Department of Computer Science of EPFL, and during the academic year 1992–93 he was on sabbatical leave at Cornell University, Ithaca (NY). His research interests are in the areas of operating systems, distributed and fault-tolerant distributed systems, and parallelism. He is currently involved in the European Esprit project BROADCAST whose objective is the design and implementation of large scale distributed computing systems. Alain Sandoz graduated in Mathematics from the University of Neuchâtel, Switzerland, in 1984 and in Computer Science from the Federal Institute of Technology in Lausanne, Switzerland, in 1988. He received his Ph.D. in Computer Science from the Federal Institute of Technology in Lausanne in 1992. His dissertation was concerned with modelling causal relationships between transactions in distributed and replicated database systems. From 1992 to 1994 he was involved in research on fault-tolerant and large scale distributed computing systems. He is currently working on the development of information systems for the Swiss government.  相似文献
7.
分布式移动代理系统的异步死锁检测   总被引:1,自引:0,他引:1       下载免费PDF全文
移动代理技术在为分布式应用提供全新的网络计算方式的同时也产生了传统分布式计算领域所没有的新的交互模式和执行模式。传统分布式计算的处理方法如并发控制和死锁检测方法不再适用于客户和服务提供者都可在网络中随处移动的移动代理系统。通过移动代理来建模长寿事务,并根据移动代理的特点提出了一种异步分布式死锁检测和解除算法。它将事务代理的执行与死锁检测机制分离,用专门的代理负责死锁检测的初始化、检测和消除等工作。死锁的检测通过创建若干检测代理,使其在各个站点间移动来收集资源请求和分配信息,并据此构造全局等待图;通过分析和探测全局等待图中是否存在圈来完成。算法具有独立于网络的拓扑结构,死锁的检测和事务代理的执行异步操作,不对代理的移动性施加任何限制等特点。  相似文献
8.
死锁检测工具的能力分析与综合应用   总被引:1,自引:0,他引:1       下载免费PDF全文
并发软件运行的不确定性使得死锁检测十分困难。现有的工作集中在使用分析、验证或测试的单一途径来检测死锁。通过分析现有工具的死锁检测能力,提出了综合使用工具的死锁检测方法。同时根据分析、验证和测试途径的不同特点,给出了评估工具检测结果的度量方法。实验结果显示了该方法的有效性。  相似文献
9.
Deadlock detection is an important service that the run-time system of a parallel environment should provide. In parallel programs deadlock can occur when the different processes are waiting for various events, as opposed to concurrent systems, where deadlock occurs when processes wait for resources held by other processes. Therefore classical deadlock detection techniques such as checking for cycles in the wait-for graph are unapplicable. An alternative algorithm that checks whether all the processes are blocked is presented. This algorithm deals with situations in which the state transition from blocked to unblocked is indirect, as may happen when busy-waiting is used.  相似文献
10.
死锁是操作系统、数据库系统以及通信网络中经常出现的现象.分析了使用资源分配图和进程等待图完成死锁检测的不足,提出了资源等待图的概念,并给出了基于资源等待图进行死锁检测的方法,该算法能够完成当资源类含有多个实例时的死锁检测.  相似文献
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号