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

Efficient rollback recovery technique in distributed computing systems

IEEE TRANSACTIONS ON PARALLEL AND distributed systems 1996年第6期7卷 565-577页

作者： Chiu, GM Young, CR Department of Electrical Engineering and Technology National Taiwan Institute of Technology Taipei Taiwan

In this paper we propose a new approach for implementing rollback-recovery in a distributed computing system. A concept of logical ring is introduced for the maintenance of information required for consistent recovery from a system crash. Message processing order of a process is kept by all other processes on its logical ring. Transmission of data messages are accompanied by the circulation of the associated order messages on the ring. The sizes of the order messages are small. In addition, redundant transmission of order information is avoided, thereby reducing the communication overhead incurred during failure-free operation. Furthermore, updating of the order information and garbage collection task are simplified in the proposed mechanism. Our approach does not require information about message processing order be written to stable storage;in fact, the time-consuming operations of saving information in stable storage are confined to the checkpointing activities. When failures occur, a surviving process need roll back only if some preceding order information is totally lost, which is relatively unlikely considering the ever growing speed of communication networks. It is shown that a system can recover correctly as long as there exists at least one surviving process.

关键词： checkpoint crash recovery distributed computing systems fault tolerance logical ring rollback

来源：评论

学校读者我要写书评

暂无评论

LOAD-LEVELING IN FAULT-TOLERANT distributed computing systems

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1986年第4期12卷 554-560页

作者： PATNAIK, LM IYER, KV VIKRAM SARABHAI SPACE CTR TRIVANDRUM 695022KERALAINDIA

Seen hierarchically, an information network can have 3 different functions associated with it: 1. information processing, 2. network processing, and 3. database function. A distributed computing system is considered mainly at the network processing level in the context of load-leveling, a process by which a given workload is spread evenly over the processors in a distributed system. Assuming a horizontally distributed system, formulations of the edge-failure and node-failure recovery problems from the standpoint of load-leveling are developed. The conditions for the existence of solutions to these problems are analyzed, and simple algorithms are presented for these problems. In connection with the node-failure recovery problem, the concept of a node-failure metric to characterize different possible solutions is introduced, exploiting the idea of the strength of processors. A possible application of the recovery methods in the context of reconfiguration of distributed database systems is examined.

关键词： Program Processors Resource Management Measurement Context distributed computing Throughput Arrays Work Load Allocation distributed computing systems Fault Recovery Horizontal Distribution Load Leveling

来源：评论

学校读者我要写书评

暂无评论

Efficient algorithms for reliability analysis of distributed computing systems

引用

INFORMATION SCIENCES 1999年第1-2期117卷 89-106页

作者： Lin, MS Chang, MS Chen, DJ Tamsui Oxford Univ Coll Dept Informat Management Taipei 25103 Taiwan Natl Chiao Tung Univ Dept Comp Sci & Informat Engn Hsinchu 30050 Taiwan

A distributed computing system is modeled as a collection of resources (e.g. processing elements, data tiles and programs) interconnected via an arbitrary communication network and controlled by a distributed operating system, The distributed program reliability in a distributed computing system is the probability of successful execution of a program running on multiple processing elements and needs to retrieve data files from other processing elements. This reliability varies according to (1) the topology of the distributed computing system, (2) the reliability of the communication edges, (3) the data files and programs distribution among processing elements and (4) the data files required to execute a program. In addition, computing the reliability of distributed computing systems is #P-complete even when the distributed computing system is restricted to a series-parallel, a 2-tree, a tree, or a star structure. This paper presents efficient algorithms for computing the reliability of a distributed program running on other restricted classes of networks. (C) 1999 Elsevier Science Inc. All rights reserved.

关键词： distributed computing systems distributed program reliability computational complexity algorithms

来源：评论

学校读者我要写书评

暂无评论

REGENERATION WITH VIRTUAL COPIES FOR distributed computing systems

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1993年第6期19卷 594-602页

作者： ADAM, NR TEWARI, R TEMPLE UNIV DEPT COMP & INFORMAT SCIPHILADELPHIAPA 19122

We consider the consistency control problem for replicated data in a distributed computing system (DCS) and propose a new algorithm to dynamically regenerate copies of data objects in response to node failures and network partitioning in the system. The DCS is assumed to have strict consistency constraints for data object copies. The new algorithm combines the advantages of voting based algorithms and regeneration mechanisms to maintain mutual consistency of replicated data objects in the case of node failures and network partitioning. Our algorithm extends the feasibility of regeneration to DCS on wide area networks, and is able to satisfy user queries as long as there is one current partition in the system. A stochastic availability analysis of our algorithm shows that it provides improved availability as compared to previously proposed dynamic voting algorithms.

关键词： AVAILABILITY distributed computing systems MUTUAL CONSISTENCY NETWORK PARTITIONING REGENERATION REPLICATED DATA

来源：评论

学校读者我要写书评

暂无评论

Dynamic task allocation models for large distributed computing systems

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed systems 1995年第12期6卷 1301-1315页

作者： Chang, HWD Oldham, WJB TEXAS TECH UNIV DEPT COMP SCILUBBOCKTX 79409

Dynamic task allocation for distributed computing systems (DCS) is an important goal to be achieved for engineering applications, The purpose of dynamic task allocation is to increase the system throughput in a dynamic environment, which can be done by balancing the utilization of computing resources and minimizing communication between processors during run time, In this paper, we propose two dynamic task allocation models which are: 1) the clustering simulated annealing model (CSAM) and 2) the mean field annealing model (MFAM). Both of these models combine characteristics of statistical and deterministic approaches, These models provide the rapid convergence characteristic of the deterministic approaches while preserving the solution quality afforded by simulated annealing, Simulation results of the CSAM acid MFAM provide a stable and balanced system with 50% and 10% of the convergence time needed by simulated annealing, respectively. The results of this research are important in that it presents the feasibility of applying statistically based task allocation models on large DCSs in a dynamic environment, Solutions of these models depend on the annealing process instead of the structures of the input data, providing the possibility of obtaining better solutions by using more efficient computing hardware.

关键词： distributed computing systems dynamic task allocation interprocessor communication load balancing optimization

来源：评论

学校读者我要写书评

暂无评论

A genetic task allocation algorithm for distributed computing systems incorporating problem specific knowledge

引用

INTERNATIONAL JOURNAL OF HIGH SPEED computing 1996年第4期8卷 363-370页

作者： Tripathi, AK Vidyarthi, DP Mantri, AN BANARAS HINDU UNIV FAC SCIDEPT COMP SCIVARANASI 221005UTTAR PRADESHINDIA

distributed computing systems (DCS) promise a convenient platform for parallel processing and consequently can be expected to provide highly improved throughput and turnaround characteristics for all types of computing jobs. Task allocation in DCS remains to be an important and relevant problem attracting the attention of researchers in the discipline. Genetic Algorithms (GA) have successfully been used to solve various optimization problems. A GA based task allocation model for multiprocessors has been proposed by Hou, Ansari & Ren [3]. We present a Genetic Task Allocation Algorithm for DCS, wherein we have considered the underlying interconnection network of the processors, communication requirements among modules of the tasks apart from the precedence relation of the task graph that has been considered in [3] also. We have also considered multiprogramming at every processing nodes with related characteristic values. We have, intentionally, made use of the finding [4] that the incorporation of the problem specific knowledge in construction of GAs improves the initial population structures. The model and algorithm proposed by us is sufficiently simple and adequately usable for the purpose of simulation experiments and its possible incorporation in future operating systems of DCS.

关键词： distributed computing systems multiprogramming task Inter-Module Communication (IMC) genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

A GRAPH MATCHING APPROACH TO OPTIMAL TASK ASSIGNMENT IN distributed computing systems USING A MINIMAX CRITERION

引用

IEEE TRANSACTIONS ON COMPUTERS 1985年第3期34卷 197-203页

作者： SHEN, CC TSAI, WH Institute of Computer Engineering National Chiao Tung University

A graph matching approach is proposed in this paper for solving the task assignment problem encountered in distributed computing systems. A cost function defined in terms of a single unit, time, is proposed for evaluating the effectiveness of task assignment. This cost function represents the maximum time for a task to complete module execution and communication in all the processors. A new optimization criterion, called the minimax criterion, is also proposed, based on which both minimization of interprocessor communication and balance of processor loading can be achieved. The proposed approach allows various system constraints to be included for consideration. With the proposed cost function and the minimax criterion, optimal task assignment is defined. Graphs are then used to represent the module relationship of a given task and the processor structure of a distributed computing system. Module assignment to system processors is transformed into a type of graph matching, called weak homomorphism. The search of optimal weak homomorphism corresponding to optimal task assignment is next formulated as a state-space search problem. It is then solved by the well-known A* algorithm in artificial intelligence after proper heuristic information for speeding up the search is suggested. An illustrative example and some experimental results are also included to show the effectiveness of the heuristic search.

关键词： A* algorithm distributed computing systems grapi matching interprocessor communication load balancing minimax criterion state-space search weak homomorphism

来源：评论

学校读者我要写书评

暂无评论

SOFTWARE-DESIGN METHODS FOR distributed computing systems

引用

COMPUTER COMMUNICATIONS 1992年第4期15卷 213-224页

作者： YAU, SS JIA, XP BAE, DH UNIV FLORIDA DEPT COMP & INFORMAT SCIGAINESVILLEFL 32611

Due to the rapid development of computer, communication and microelectronics technologies, the trend of distributed computing systems is to become more distributed. Because the characteristics of distributed computing systems are significantly different from those of traditional computing systems, different approaches are needed to effectively address the design issues related to the characteristics of software for distributed computing systems. In this paper, the methods currently used to develop the software for distributed computing systems are classified into three approaches: dataflow-oriented;communication-oriented;and object-oriented. Their applicabilities to various applications for distributed computing systems are discussed, and object-oriented approach is identified as a more promising approach to developing distributed software. The future trends and research directions of software development techniques for distributed computing systems are discussed.

关键词： SOFTWARE DESIGN METHODS distributed computing systems DATA-FLOW-ORIENTED APPROACH COMMUNICATION-ORIENTED APPROACH OBJECT-ORIENTED APPROACH

来源：评论

学校读者我要写书评

暂无评论

On principles in engineering of distributed computing systems

引用

SOFT computing 2008年第2期12卷 201-206页

作者： Korotkikh, Victor Korotkikh, Galina Univ Cent Queensland Fac Business & Informat Mackay Qld 4740 Australia

Engineering of distributed computing systems requires understanding of principles of complex systems, which have not been yet identified. To address the situation we use a concept of structural complexity and present results of computational experiments suggesting the possibility of a general optimality condition of complex systems. The optimality condition introduces the structural complexity of a system as a key to its optimization.

关键词： distributed computing systems complex systems complexity optimization perception-based information

来源：评论

学校读者我要写书评

暂无评论

Invariants Based Failure Diagnosis in distributed computing systems

Invariants Based Failure Diagnosis in Distributed Computing ...

引用

29th IEEE International Symposium on Reliable distributed systems

作者： Chen, Haifeng Jiang, Guofei Yoshihira, Kenji Saxena, Akhilesh NEC Labs Amer Inc Princeton NJ 08540 USA

ISBN: (纸本)9780769542508

This paper presents an instance based approach to diagnosing failures in computing systems. Owing to the fact that a large portion of occurred failures are repeated ones, our method takes advantage of past experiences by storing historical failures in a database and retrieving similar instances in the occurrence of failure. We extract the system `invariants' by modeling consistent dependencies between system attributes during the operation, and construct a network graph based on the learned invariants. When a failure happens, the status of invariants network, i.e., whether each invariant link is broken or not, provides a view of failure characteristics. We use a high dimensional binary vector to store those failure evidences, and develop a novel algorithm to efficiently retrieve failure signatures from the database. Experimental results in a web based system have demonstrated the effectiveness of our method in diagnosing the injected failures.

关键词： distributed systems Failure Diagnosis Invariants Web based system binary vector distributed computing systems distributed processing graph theory invariant based failure diagnosis network graph software fault tolerance vectors

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：