全文获取类型
收费全文 | 82篇 |
免费 | 17篇 |
国内免费 | 11篇 |
专业分类
电工技术 | 1篇 |
综合类 | 3篇 |
机械仪表 | 1篇 |
无线电 | 14篇 |
一般工业技术 | 2篇 |
自动化技术 | 89篇 |
出版年
2022年 | 1篇 |
2019年 | 2篇 |
2017年 | 2篇 |
2016年 | 1篇 |
2014年 | 5篇 |
2013年 | 5篇 |
2012年 | 4篇 |
2011年 | 7篇 |
2010年 | 4篇 |
2009年 | 5篇 |
2008年 | 6篇 |
2007年 | 8篇 |
2006年 | 10篇 |
2005年 | 14篇 |
2004年 | 4篇 |
2003年 | 2篇 |
2002年 | 7篇 |
2001年 | 3篇 |
2000年 | 5篇 |
1999年 | 6篇 |
1998年 | 4篇 |
1997年 | 2篇 |
1994年 | 2篇 |
1983年 | 1篇 |
排序方式: 共有110条查询结果,搜索用时 15 毫秒
1.
Marcelo Pereira da Silva Rafael Rodrigues Obelheiro 《International Journal of Parallel, Emergent and Distributed Systems》2017,32(4):348-367
With the ever increasing dependence on computers and networks, many systems are required to be continuously available in order to fulfil their mission. Virtualization technology enables high availability to be offered in a convenient, cost-effective manner: with the encapsulation provided by virtual machines (VMs), entire systems can be replicated transparently in software, obviating the need for expensive fault-tolerant hardware. Remus is a VM replication mechanism for the Xen hypervisor that provides high availability despite crash failures. Replication is performed by checkpointing the VM at fixed intervals. However, there is an antagonism between processing and communication regarding the optimal checkpoint interval: while longer intervals benefit processor-intensive applications, shorter intervals favour network-intensive applications. Thus, any chosen interval may not always be suitable for the hosted applications, limiting Remus usage in many scenarios. This work introduces Adaptive Remus, a proposal for adaptive checkpointing in Remus that dynamically adjusts the replication frequency according to the characteristics of running applications. Experimental results indicate that our proposal improves performance for applications that require both processing and communication, without harming applications that use only one type of resource. 相似文献
2.
提出了一种用于提高软件构件重用能力的构件构造方法。与当前研究中主要以软件实现逻辑表达一项应用用例的功能封装单元相比,该方法以应用功能层面的一类需求范畴为构件的表达目标,将业务用例以可配置的描述内容交由构件进行解释执行。通过提升构件粒度,应用级构件单元以更高的重用能力支持更为广泛的用例集合。基于这一原理设计了构件模型以及相应的构件库扩展和组装机制。通过所建立的构件集合原型,在实际开发案例中的应用验证了该方法的有效性。重用性的度量结果表明,所提方法将软件构件的重用性在特定领域中提高到96.6%~99.4%。 相似文献
3.
Jichiang Tsai 《中国工程学刊》2013,36(6):1113-1118
Abstract Communication‐induced checkpointing (CIC) protocols can be used to prevent the domino effect. Such protocols that belong to the index‐based category have been shown to perform more efficiently. In this paper, some results of comparing index‐based CIC protocols are proposed. First, we prove that comparing several protocols based on the lazy indexing strategy can be simply based on their checkpoint‐inducing conditions. Next, we show that improved indexing strategies may not always yield a better performance than the classical strategy. Finally, we present a simulation study to verify our foregoing theoretical results. The simulation is conducted in the typical point‐to‐point computational environment. Influences of enhancements on indexing strategies and checkpoint‐inducing conditions for index‐based CIC protocols are discussed. 相似文献
4.
George Bosilca Aurlien Bouteiller Elisabeth Brunet Franck Cappello Jack Dongarra Amina Guermouche Thomas Herault Yves Robert Frdric Vivien Dounia Zaidouni 《Concurrency and Computation》2014,26(17):2772-2791
In this paper, we present a unified model for several well‐known checkpoint/restart protocols. The proposed model is generic enough to encompass both extremes of the checkpoint/restart space, from coordinated approaches to a variety of uncoordinated checkpoint strategies (with message logging). We identify a set of crucial parameters, instantiate them, and compare the expected efficiency of the fault tolerant protocols, for a given application/platform pair. We then propose a detailed analysis of several scenarios, including some of the most powerful currently available high performance computing platforms, as well as anticipated Exascale designs. The results of this analytical comparison are corroborated by a comprehensive set of simulations. Altogether, they outline comparative behaviors of checkpoint strategies at very large scale, thereby providing insight that is hardly accessible to direct experimentation. Copyright © 2013 John Wiley & Sons, Ltd. 相似文献
5.
Time-based coordinated checkpointing protocols are well suited for mobile computing systems because no explicit coordination message is needed while the advantages of coordinated checkpointing are kept. However, without coordination, every process has to take a checkpoint during a checkpointing process. In this paper, an efficient time-based coordinated checkpointing protocol for mobile computing systems over Mobile IP is proposed. The protocol reduces the number of checkpoints per checkpointing process to nearly minimum, so that fewer checkpoints need to be transmitted through the costly wireless link. Our protocol also performs very well in the aspects of minimizing the number and size of messages transmitted in the wireless network. In addition, the protocol is nonblocking because inconsistencies can be avoided by the piggybacked information in every message. Therefore, the protocol brings very little overhead to a mobile host with limited resource. Additionally, by taking advantage of reliable timers in mobile support stations, the time-based checkpointing protocol can adapt to wide area networks. 相似文献
6.
For distributed databases, checkpointing is used to ensure an efficient way to perform global reconstruction. However, the need for global reconstruction is infrequent. Most current checkpointing approaches for distributed databases are too expensive during run time. Some of them allow the checkpointing process to run in parallel with normal transactions at the cost of more data and resource contention, which in turn causes longer response time for normal transactions. Thus, an efficient way to checkpoint distributed databases is needed to avoid degrading the system performance. This paper presents a low-cost solution, called Loosely Synchronized Local Fuzzy Checkpointing (LSLFC), to these problems. LSLFC supports global reconstruction, and our performance study shows that LSLFC has little overhead during run time. 相似文献
7.
基于检测点设置依赖图和属性表的卷回恢复算法 总被引:2,自引:0,他引:2
为了解决检测点设置过程中的Domino效应问题及卷回恢复过程中的活锁问题,并最大限度地减小时间开销,提出了基于检测点设置依赖图和属性表的卷回恢复算法。同以前的算法相比较,该算法一方面节省了用于进程之间同步的时间开销,另一方面检测点设置及卷回过程中涉及少量的相关进程。对该算法的正确性进行了证明。 相似文献
8.
Concern is beginning to grow in the high-performance computing (HPC) community regarding the reliability of future large-scale systems. Disk-based coordinated checkpoint/restart has been the dominant fault tolerance mechanism in HPC systems for the past 30 years. Checkpoint performance is so fundamental to scalability that nearly all capability applications have custom checkpoint strategies to minimize state and reduce checkpoint time. One well-known optimization to traditional checkpoint/restart is incremental checkpointing, which has a number of known limitations. To address these limitations, we describe libhashckpt, a hybrid incremental checkpointing solution that uses both page protection and hashing on GPUs to determine changes in application data with very low overhead. Using real capability workloads and a model outlining the viability and application efficiency increase of this technique, we show that hash-based incremental checkpointing can have significantly lower overheads and increased efficiency than traditional coordinated checkpointing approaches at the scales expected for future extreme-class systems. 相似文献
10.
This paper assesses the use of Chandy and Lamport's distributed snapshots algorithm (DSA) for stabilizing a communication protocol, a special type of distributed system. We show that when a loss of coordination occurs during the distributed execution of the protocol, DSA is not guaranteed to terminate, and therefore it sometimes fails to obtain a global state or snapshot. We propose some modifications to DSA to solve this problem. Finally, we discuss how, in the case of a loss of coordination, the modified algorithm can be used to stabilize a communication protocol, and we assess the suitability of the global state obtained by DSA as a recovery point to be used later in a backward recovery procedure. 相似文献