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

THE CONCURRENT ASSIGNMENT REPRESENTATION OF synchronous systems

PARALLEL COMPUTING 1989年第2期9卷 227-256页

作者： MARTIN, AR TUCKER, JV UNIV LEEDS DEPT COMP STUDIESLEEDS LS2 9JTW YORKSHIREENGLAND

We consider the specification and programming of synchronous concurrent algorithms . This general class of algorithms includes clocked hardware, systolic algorithms, neural nets for example. We present some simple the... 详细信息

关键词： abstract data type clocks concurrent assignment specification design of hardware streams synchronous systems systolic algorithms

来源：评论

学校读者我要写书评

暂无评论

GRADUATE AND POSTGRADUATE MEDICAL-EDUCATION WITH THE synchronous systems-MODEL

引用

BEHAVIORAL SCIENCE 1991年第4期36卷 253-273页

作者： JASNOSKI, MB WARNER, RM UNIV NEW HAMPSHIRE PSYCHOL DURHAM NH 03824 USA

AbstractBehavioral sciences have an important new role, particularly in medicine and prevention (Revans, 1990; Starr, 1982). A decade ago when the ideology of medical care shifted from a biomedical to a biopsychosocial model, behavioral and social factors ascended in importance in modern health concerns (see Engel, 1977). Now, a living systems model called synchronous systems (Jasnoski&Schwartz, 1985) incorporates environmental (including the social and physical) along with physiological and psychological factors into its structure. The environment has been gaining recognition as an important determinant in health, disease, and wellness (Daniel, 1990; Demick&Wapner, 1990; Lawton, 1990; Stokols, 1990). The phrase “synchronous systems” departs from the traditional linear thought patterns to depict contemporaneous occurrences. Synchrony refers to simultaneous experiences or events, with an emphasis on healthy, congruent process and function. Positive, beneficial process in human functioning emphasizes prevention as found in public health efforts but refers also to dysfunctional and recuperative foundation of medicine as a departure from the healthy norm. These process and functional dynamics in the synchronous systems Model derive conceptually from systems theory, specifically from control and cybernetic theories (Cannon, 1932; Weiner, 1948). The dynamic complexity of health in the whole human system, which also incorporates the environment, requires synthesis of knowledge from the biological, social, behavioral, and ecological sciences. This article provides the fundamentals of the structural and functional synthesis possible in the synchronous systems Model. Its direct application to multidisciplinary research is also presented along with its specific application to medical education, policy, research, and service deliv

关键词： ALL LEVELS ALL SUBsystems synchronous systems BIOPSYCHOLOGICAL MODEL SYNCHRONY PSYCHONEUROIMMUNOLOGY CIRCADIAN RHYTHMS BIOFEEDBACK

来源：评论

学校读者我要写书评

暂无评论

A Theoretical Foundation for Timing synchronous systems Using Asynchronous Structures

引用

ACM TRANSACTIONS ON DESIGN AUTOMATION OF ELECTRONIC systems 2020年第2期25卷 16-16页

作者： Tadros, Ramy N. Beerel, Peter A. Univ Southern Calif USC 3740 McClintock Ave Los Angeles CA 90089 USA

Timing of synchronous systems is an everlasting stumbling block to the booming demands for lower power consumption and higher operation speeds in the electronics industry. This hardship is aggravated by the growing levels of variability in state-of-the-art silicon dimensions and in other beyond-CMOS technologies. Although some designers continue to strongly believe in the performance advantages of being fully synchronous, others have radically shifted toward extremely robust delay-insensitive domains. Targeting a different compromise of both performance and robustness, this article provides sufficient conditions for an asynchronous system to be able to generate the periodic signals necessary for the timing of a fully synchronous system and highlights a specific hierarchical clocking structure that with a single tunable delay satisfies these conditions. Using an asynchronous clock distribution network benefits from both the natural robustness of asynchronous structures and the advantageous performance of synchronous clocking.

关键词： Asynchronous circuits synchronous systems timing analysis clocking Petri nets marked graphs superconducting electronics single flux quantum

来源：评论

学校读者我要写书评

暂无评论

A clock-based dynamic logic for the verification of CCSL specifications in synchronous systems

引用

SCIENCE OF COMPUTER PROGRAMMING 2021年 203卷 102591-102591页

作者： Zhang, Yuanrui Wu, Hengyang Chen, Yixiang Mallet, Frederic Southwest Univ Sch Math & Stat Chongqing Peoples R China Southwest Univ Coll Comp & Informat Sci RISE Chongqing Peoples R China East China Normal Univ CMoE Engn Res Ctr Software Hardware Codesign Tech Shanghai 200062 Peoples R China Univ Cote Azur CNRS INRIA I3S F-06900 Sophia Antipolis France

The Clock Constraint Specification Language (CCSL) is a clock-based specification language for real-time embedded systems. With logical clocks defined as first-class citizens, CCSL provides a natural way for describing clock constraints in synchronous systems - a classical model of concurrency for real-time embedded systems. In this paper, we propose a clock-based dynamic logic called CCSL Dynamic Logic (CDL) for the verification of CCSL specifications in synchronous systems. It extends the first-order dynamic logic with a synchronous execution mechanism in its program model and with CCSL primitives as terms in its logical formulae. We build a sound and relatively complete proof system for CDL to support the verification. Compared with previous approaches for verifying CCSL specifications, which are based on model checking and SMT checking techniques, our approach, which is based on theorem-proving, offers a unified verification framework in which both bounded and unbounded CCSL specifications can be verified. Technically, with the proof system of CDL, a complex CDL formula can be semi-automatically transformed into a set of quantifier-free, arithmetical first-order logic (QF-AFOL) formulae which can be checked by an SMT solver in an efficient way. As a case study, we analyze a simple synchronous system throughout the paper to illustrate how CDL works. We analyze and prove the soundness and completeness of the proof system for CDL. Currently, CDL is partially mechanized in Coq. (C) 2020 Elsevier B.V. All rights reserved.

关键词： Dynamic logic The clock constraint specification language synchronous systems Verification Theorem proving

来源：评论

学校读者我要写书评

暂无评论

On the Subject of Non-Equivocation Defining Non-Equivocation in synchronous Agreement systems 20

On the Subject of Non-Equivocation Defining Non-Equivocation...

引用

39th Symposium on Principles of Distributed Computing

作者： Madsen, Mads Frederik Debois, Soren IT Univ Copenhagen Copenhagen Denmark

ISBN: (纸本)9781450375825

We study non-equivocation in synchronous agreement protocols: the restriction on faulty processes that they cannot act differently towards distinct non-faulty processes. Guarantees of non-equivocation have been used to provide improved fault tolerance in agreement protocols, and various mechanisms for achieving it have been proposed. However, the exact meaning of non-equivocation varies subtly in the literature. In this paper, we propose two different formal notions of non-equivocation: strong and weak. We define both as fault models for synchronous agreement protocols with reliable channels, and we show how the two models yield distinct bounds for the minimal number of communication rounds required and the maximum number of faulty processes tolerable to achieve agreement: 1 round, n > t for strong non-equivocation;and t + 1 rounds, n > 2t for weak non-equivocation. This makes weak non-equivocation the only fault model with a lower bound on fault tolerance of n > 2t for broadcast agreement and interactive consistency, confirming the folklore knowledge that equivocation is, in a sense, the most critical of the Byzantine faults. Finally, we show how the weak and strong non-equivocation fault models relate to well-known agreement problems: strong non-equivocation corresponds to Byzantine broadcast and weak non-equivocation to crusader agreement.

关键词： Agreement non-equivocation fault tolerance synchronous systems

来源：评论

学校读者我要写书评

暂无评论

Modelling and Performance Analysis of synchronous and Asynchronous Links Integrated into Multi-Machine systems 19

Modelling and Performance Analysis of Synchronous and Asynch...

引用

19th IEEE-India-Council International Conference (INDICON)

作者： Rashmi Gaonkar, Dattatraya N. Natl Inst Technol Karnataka Dept Elect & Elect Engn Bangalore Karnataka India

ISBN: (纸本)9781665473507

The performance analysis of synchronous and asynchronous multi-machine systems with tie-lines as Line Commutated Converter based High Voltage Direct Current links (LCC-HVDC) or Thyristor Controlled Series Capacitor (TCSC) lines is presented in this paper. Detailed inferences are drawn for the systems subjected to various dynamic events. The effect of variation of synchronous tie-line power levels on the modal behaviour is investigated. The asynchronous system modes are analysed with reference to the modes of its synchronous counterparts. Eigenvalue analysis of the systems are obtained through prony analysis which avoids the need of in-depth analytical computations.

关键词： synchronous systems asynchronous systems LCC-HVDC TCSC modal analysis

来源：评论

学校读者我要写书评

暂无评论

Agreement in synchronous networks with ubiquitous faults

引用

THEORETICAL COMPUTER SCIENCE 2007年第2-3期384卷 232-249页

作者： Santoro, Nicola Widmayer, Peter Carleton Univ Sch Comp Sci Ottawa ON K1S 5B6 Canada ETH Zentrum Inst Theoret Informat Zurich Switzerland

In this paper we are interested in synchronous distributed systems subject to transient and ubiquitous failures. This includes systems where failures will occur on any communication link, systems where every processor will experience at one time or another send or receive failure, etc., and, following a failure, normal functioning resuming after a finite time. Notice that these cases cannot be handled by the traditional component failure models. The model we use is the communication failure model, also called the transinission failure or a dynamic faults or mobile faults model. Using this model, we study the fundamental problem of agreement in synchronous networks of arbitrary topology with ubiquitous faults. We establish bounds on the number of dynamic faults that make any non-trivial form of agreement (even strong majority) impossible;in turn, these bounds express connectivity requirements that must be met to achieve any meaningful form of agreement. We also provide, constructively, bounds on the number of dynamic faults in spite of which any non-trivial form of agreement (even unanimity) is possible. These bounds are shown to be tight for a large class of networks, which includes hypercubes, toruses, rings, and complete graphs;incidentally, we close the existing gap between possibility and impossibility of non-trivial agreement in complete graphs in the presence of dynamic Byzantine faults. None of these results is derivable in the component failure models;in particular, all our possibility results hold in situations for which those models indicate impossibility. (C) 2007 Elsevier B.V. All rights reserved.

关键词： theory of distributed computation synchronous systems dynamic faults mobile faults transmission failure model arbitrary network topology agreement majority bivalency argument limits to computability

来源：评论

学校读者我要写书评

暂无评论

Optimistically tuning synchronous byzantine consensus: another win for null messages

引用

DISTRIBUTED COMPUTING 2021年第5期34卷 395-410页

作者： Goren, Guy Moses, Yoram Technion City Viterbi Fac Elect & Comp Engn Haifa Israel

Modular methods that transform Byzantine consensus protocols for the synchronous model into ones that are fast and communication efficient in failure-free executions are presented. Small and short protocol segments called layers are custom designed to act as a highly efficient preliminary stage that solves Consensus if no failures occur. When composed with a Byzantine consensus protocol of choice, they allow considerable control over the tradeoff in the combined protocol's behavior in the presence of failures and its performance in their absence. In failure-free executions, they are more efficient than all existing Byzantine consensus protocols. In the presence of failures, they incur a small cost over the complexity of the original consensus protocol being transformed. A key ingredient underlying the efficiency of the new layers is the judicious use of null messages for broadcasting information in failure-free runs. In particular, the notion of a silent validation round, which implements such a broadcast, is defined and used in several ways.

关键词： Null messages Fault-tolerance Byzantine Consensus Silent validation round synchronous systems

来源：评论

学校读者我要写书评

暂无评论

Vertex Coloring with Communication Constraints in synchronous Broadcast Networks

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED systems 2019年第7期30卷 1672-1686页

作者： Lakhlef, Hicham Raynal, Michel Taiani, Francois Univ Technol Compiegne CNRS UMR 6174 Maitre Conference F-60200 Compiegne France Univ Rennes CNRS INRIA IRISA F-35000 Rennes France Polytech Univ Hong Kong Hung Hom Hong Kong Peoples R China

This paper considers distributed vertex-coloring in broadcast/receive networks suffering from conflicts and collisions. (A collision occurs when, during the same round, messages are sent to the same process by too many neighbors;a conflict occurs when a process and one of its neighbors broadcast during the same round.) More specifically, the paper focuses on multi-channel networks, in which a process may either broadcast a message to its neighbors or receive a message from at most gamma of them. The paper first provides a new upper bound on the corresponding graph coloring problem (known as frugal coloring) in general graphs, proposes an exact bound for the problem in trees, and presents a deterministic, parallel, color-optimal, collision-and conflict-free distributed coloring algorithm for trees, and proves its correctness.

关键词： Distributed algorithms message-passing broadcast/receive communication synchronous systems multi-coloring vertex coloring TDMA slot allocation

来源：评论

学校读者我要写书评

暂无评论

Universal dynamic synchronous self-stabilization

引用

DISTRIBUTED COMPUTING 2002年第3期15卷 137-153页

作者： Boldi, P Vigna, S Univ Milan Dipartimento Sci Informaz I-20122 Milan Italy

We prove the existence of a "universal" synchronous self-stabilizing protocol, that is, a protocol that allows a distributed system to stabilize to a desired nonreactive behaviour (as long as a protocol stabilizing to that behaviour exists). Previous proposals required drastic increases in asymmetry and knowledge to work, whereas our protocol does not use any additional knowledge, and does not require more symmetry-breaking conditions than available;thus, it is also stabilizing with respect to dynamic changes in the topology. We prove an optimal quiescence time n + D for a synchronous network of n processors and diameter D;the protocol can be made finite state with a negligible loss in quiescence time. Moreover, an optimal D + 1 protocol is given for the case of unique identifiers. As a consequence, we provide an effective proof technique that allows to show whether self-stabilization to a certain behaviour is possible under a wide range of models.

关键词： self-stabilization anonymous networks graph fibrations synchronous systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：