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

distributed program RELIABILITY-ANALYSIS

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1986年第1期12卷 42-50页

作者： KUMAR, VKP HARIRI, S RAGHAVENDRA, CS Department of Electrical Engineering - Systems University of Southern California Los Angeles CA 90089

The reliability of distributed processing systems can be expressed in terms of the reliability of the processing components that run the programs, the reliability of the processing components holding the required files, and the reliability of the communication ties used in file transfers. Two reliability measures are introduced, namely, distributed program reliability and distributed system reliability, to accurately model the reliability of distributed systems. The first measure characterizes the likelihood of successful execution of a distributed program that runs on some processing elements and needs to communicate with other processing elements for remote files. The 2nd measure describes the likelihood that all the programs of a given set can run successfully. The graph theory method, which is used to systematically generate file spanning trees to provide the needed connections, is general and can be used in a dynamic environment for efficient reliability evaluation.

关键词： Computer Network Reliability Software Reliability distributed Processing Reliability Theory Indexes Reliability Engineering Spanning Tree distributed program distributed System Graph Theory Reliability

来源：评论

学校读者我要写书评

暂无评论

Students' persistence in a distributed doctoral program in educational leadership in higher education: A mixed methods study

引用

RESEARCH IN HIGHER EDUCATION 2007年第1期48卷 93-135页

作者： Ivankova, Nataliya V. Stick, Sheldon L. Univ Alabama Birmingham Dept Human Studies Birmingham AL 35294 USA Univ Nebraska Dept Educ Adm Lincoln NE 68588 USA

The purpose of this mixed methods sequential explanatory study was to identify factors contributing to students' persistence in the University of Nebraska-Lincoln distributed Doctoral program in Educational Leadership in Higher Education by obtaining quantitative results from surveying 278 current and former students and then following up with four purposefully selected typical respondents to explore those results in more depth. In the first, quantitative, phase, five external and internal to the program factors were found to be predictors to students' persistence in the program: "program", "online learning environment", "student support services", "faculty", and "self-motivation". In the qualitative follow up multiple case study analysis four major themes emerged: (1) quality of academic experiences;(2) online learning environment;(3) support and assistance;and (4) student self-motivation. The quantitative and qualitative findings from the two phases of the study are discussed with reference to prior research. Implications and recommendations for policy makers are provided.

关键词： persistence doctoral students distributed program online learning environment

来源：评论

学校读者我要写书评

暂无评论

ON distributed COMPUTING SYSTEMS RELIABILITY-ANALYSIS UNDER program EXECUTION CONSTRAINTS

引用

IEEE TRANSACTIONS ON COMPUTERS 1994年第1期43卷 87-97页

作者： CHEN, DJ LIN, MS Inst. of Comput. Sci. & Inf. Eng. Nat. Chiao Tung Univ. Hsinchu Taiwan

This correspondence presents an algorithm for computing the reliability of distributed computing systems (DCS). The algorithm, called the Fast Reliability Evaluation Algorithm, is based on the factoring theorem employing several reliability preserving reduction techniques. The effect of file distributions, program distributions, and various topologies on reliability of the DCS is studied in detail using the proposed algorithm. Compared with existing algorithms on various network topologies, file distributions, and program distributions, the proposed algorithm is much more economical in both time and space. To compute the distributed program reliability, the ARPA network is studied to illustrate the feasibility of the proposed algorithm.

关键词： distributed program distributed SYSTEM FACTORING THEOREM GRAPH THEORY RELIABILITY RELIABILITY-PRESERVING REDUCTION SPANNING TREE

来源：评论

学校读者我要写书评

暂无评论

A language for specification of the behavior of distributed programs

引用

programMING AND COMPUTER SOFTWARE 1996年第5期22卷 233-240页

作者： Bakalov, YV Smelyanskii, RL MOSCOW MV LOMONOSOV STATE UNIV DEPT COMPUTAT MATH & CYBERNETMOSCOWRUSSIA

The specification language M(2)-SPEC designed to specify the behavior of distributed programs is described. The language is used in the algorithmic analysis subsystem of the Dyana integrated environment [4], which is ... 详细信息

关键词： Algorithmic properties distributed program Specification Verification

来源：评论

学校读者我要写书评

暂无评论

Aeneas: real-time performance evaluation approach for distributed programs with reliability-constrains

引用

CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2007年第2期10卷 175-186页

作者： Jin, Hai Li, Yunfa Han, Zongfen Wu, Hao Qiang, Weizhong Huazhong Univ Sci & Technol Cluster & Grid Comp Lab Wuhan 430074 Peoples R China

A novel approach, called Aeneas, which is based on the execution state of distributed programs, is proposed in this paper. It is for the real-time performance analysis of distributed programs with reliability-constrains. In Aeneas, there are two important factors, the available data files and the transmission paths of each available data file. Some algorithms are designed to find all the transmission paths of each data file needed while the program executes, count the transmission time for each transmission path, then get the aggregate expression of transmission time, calculate the fastest response time and the slowest response time of distributed programs with reliability-constrains. In order to justify the feasibility and the availability of this approach, a series of experiments have been done. The results show that it is feasible and efficient to evaluate the real-time performance for distributed software with reliability-constrains.

关键词： distributed program reliability real-time performance response time

来源：评论

学校读者我要写书评

暂无评论

Unfolding-Based Dynamic Partial Order Reduction of Asynchronous distributed programs 39th

Unfolding-Based Dynamic Partial Order Reduction of Asynchron...

引用

39th IFIP WG 6.1 International Conference on Formal Techniques for distributed Objects, Components, and Systems (FORTE) Held as Part of the 14th International Federated Conference on distributed Computing Techniques (DisCoTec)

作者： The Anh Pham Jeron, Thierry Quinson, Martin Univ Rennes IRISA CNRS INRIA Rennes France

ISBN: (纸本)9783030217594;9783030217587

Unfolding-based Dynamic Partial Order Reduction (UDPOR) is a recent technique mixing Dynamic Partial Order Reduction (DPOR) with concepts of concurrency such as unfoldings to efficiently mitigate state space explosion in model-checking of concurrent programs. It is optimal in the sense that each Mazurkiewicz trace, i.e. a class of interleavings equivalent by commuting independent actions, is explored exactly once. This paper shows that UDPOR can be extended to verify asynchronous distributed applications, where processes both communicate by messages and synchronize on shared resources. To do so, a general model of asynchronous distributed programs is formalized in TLA+. This allows to define an independence relation, a main ingredient of the unfolding semantics. Then, the adaptation of UDPOR, involving the construction of an unfolding, is made efficient by a precise analysis of dependencies. A prototype implementation gives promising experimental results.

关键词： Partial order Unfolding distributed program Asynchronous

来源：评论

学校读者我要写书评

暂无评论

THE EDEN SYSTEM - A TECHNICAL REVIEW

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1985年第1期11卷 43-59页

作者： ALMES, GT BLACK, AP LAZOWSKA, ED NOE, JD Department of Computer Science University of Washington

The Eden project is a 5-year experiment in designing, constructing, and using an ''integrated distributed'' computing system. The goal is to combine the benefits of integration and distribution by supporting an object-based style of programming on top of a node machine/local network hardware base. The experimental hypothesis is that such an architecture will offer an environment conducive to building distributed applications. In evaluating the benefits (in terms of programmability) and the costs (in terms of necessary support) of the system architecture 3 years into the project, attention is focused on: 1. the concept, history, status, and context of the Eden system, 2. the way in which the task of supporting the Eden architecture is divided among the kernel, the programming language, and user-level (library) code, and 3. the experiences with paper designs and prototype implementations that led to this division of labor. It is shown how distributed applications make use of various aspects of the Eden architecture, and some preliminary evaluations are presented based on experiences to date.

关键词： Remote Procedure Call Capability Concurrent Euclid Concurrent programming distributed Electronic Mail distributed program distributed System Eden Object Oriented System

来源：评论

学校读者我要写书评

暂无评论

Reproducing the behavior of a parallel program by using dataflow execution models

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 1997年第4期E80D卷 495-503页

作者： Takahashi, N Miei, T NTT Software Lab Musashino-shi Japan

We present a general framework with which we can evaluate the flexibility and efficiency of various replay systems for parallel programs. In our approach, program monitoring is modeled by making a virtual dataflow program graph, referred to as a VDG, that includes all the instructions executed by the program. The behavior of the program replay is modeled on the parallel interpretation of a VDG based on two basic parallel execution models for dataflow program graphs: a data-driven model and a demand-driven model. Previous attempts to replay parallel programs, known as Instant Replay and P-Sequence, are also modeled as variations of the data-driven replay, i.e. the data-driven interpretation of a VDG. We show that the demand-driven replay, i.e, the demand-driven interpretation of a VDG, is more flexible in program replay than the data-driven replay since it allows better control of parallelism and a more selective replay. We also show that we can implement a demand-driven replay that requires almost the same amount of data to be saved during program monitoring as does the data-driven replay, and which eliminates any centralized bottleneck during program monitoring by optimizing the demand propagation and using an effective data structure.

关键词： parallel program distributed program program debugger execution monitoring dataflow computing

来源：评论

学校读者我要写书评

暂无评论

AUTOMATED TIMING ANALYSIS OF REAL-TIME programS

引用

SOFTWARE ENGINEERING JOURNAL 1994年第5期9卷 221-227页

作者： HILL, MR JOSEPH, M UNIV WARWICK DEPT COMP SCICOVENTRY CV4 7ALW MIDLANDSENGLAND

ReStat is an interactive software tool for statically analysing the timing properties of real-time programs. Given a distributed program, a description of an architecture and a scheduling discipline, ReStat can be used to determine whether the implementation of the program on the architecture will meet a set of timing deadlines. The program may consist of a number of communicating processes and these can be statically assigned to any processor. Each process is assumed to have a simple, non-terminating cyclic structure, as is often the case in real-time control systems. ReStat uses a method of static analysis which establishes the timing properties of a real-time program by examining finite execution segments. The analysis is based on the syntactic structure of the program and can be efficiently implemented. The paper provides an overview of an experimental version of the tool and illustrates its use as a design aid by way of examples.

关键词： software tools communicating processes distributed processing safety static analysis ReStat real-time systems system monitoring distributed systems software automated timing analysis distributed program temporal logic timing deadlines software reliability Formal logic interactive software tool real-time programs finite execution segments safety-critical program programming support real-time control systems syntactic structure Diagnostic, testing, debugging and evaluating systems

来源：评论

学校读者我要写书评

暂无评论

AN ALGORITHM FOR SOLVING distributed TERMINATION PROBLEM

MICROPROCESSING AND MICROPROGRAMMING

引用

MICROPROCESSING AND MICROprogramMING 1988年第4期22卷 263-271页

作者： ARORA, RK GUPTA, MN INDIAN INST TECHNOL CTR COMP SERVNEW DELHI 110016INDIA

A spanning tree based termination detection algorithm for solving distributed termination problem is given along with its correctness proof. In this algorithm, the root process, apart from assuming the additional responsibility of termination detection, is treated like any other process of the distributed program. The root process initiates detection-message wave only after getting sufficient evidence in support of termination detection condition from each of its children which in turn obtain the supporting information from their own respective children, if any. The detection-message wave either gets purged on the way or concludes termination on reaching back the root process.

关键词： distributed program Termination detection Message communication Spanning tree

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：