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

distributed termination detection for dynamic systems

PARALLEL COMPUTING 1997年第14期22卷 2025-2045页

作者： Dhamdhere, DM Iyer, SR Reddy, EKK Department of Computer Science Indian Institute of Technology Powai Bombay 400 076 India

A symmetric algorithm for detecting the termination of a distributed computation is presented. The algorithm does not require global information concerning the system and does not assume any communication features, barring finite delays in the delivery of messages. It permits dynamic creation and destruction of processes participating in the computation, and also permits destruction of a process by external processes, such as the OS kernel. It also provides for external processes spontaneously joining an ongoing computation. Proofs of safety and liveness are provided.

关键词： dynamic systems termination detection interprocess communication distributed programming external processes control messages

来源：评论

学校读者我要写书评

暂无评论

A distributed mechanical system simulation platform based on a "gluing algorithm"

引用

JOURNAL OF COMPUTING AND INFORMATION SCIENCE IN ENGINEERING 2005年第1期5卷 71-76页

作者： Wang, JZ Ma, ZD Hulbert, GM Univ Michigan Dept Mech Engn Ann Arbor MI 48109 USA

Three key concepts are presented in this paper, which comprise the foundation of a distributed simulation platform for design and virtual prototyping of general mechanical systems that have their subsystems distributed amongst dispersed development units in multilayered supply chains. First, a general and efficient model description for simulation is defined using XML. Each model is described with an XML file and stored in model database. A complete model can then be assembled based on these model descriptions. Simulation of a model is started simply by sending the model description to a simulation server and running it through a web-based graphics user interface. Second, a new gluing algorithm, denoted as the T-T method, is developed, which enables distributed simulations (both the component models and simulation of the components) to be coupled while maintaining the independence of the separate component simulations. Third, a logical distributed simulation architecture is laid out that can be implemented with one of the existing technologies for distributed computing. Interfaces between different network components have been standardized to enable extensibility of the architecture. These concepts have been incorporated into a prototype web-based distributed simulation system that demonstrates the potential of the new techniques for solving real engineering design problems. 2005 American Institute of Physics.

关键词： virtual prototyping engineering graphics XML Simulation product design supply chains Gluing Internet distributed programming digital simulation mechanical engineering computing Algorithms graphical user interfaces

来源：评论

学校读者我要写书评

暂无评论

Topology-Specific Synthesis of Self-Stabilizing Parameterized Systems with Constant-Space Processes

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 2021年第3期47卷 614-629页

作者： Ebnenasir, Ali Klinkhamer, Alex P. Michigan Technol Univ Dept Comp Sci Houghton MI 49931 USA Google Mountain View CA 94043 USA

This paper investigates the synthesis of parameterized systems that are self-stabilizing by construction. To this end, we present several significant results. First, we show a counterintuitive result that despite the undecidability of verifying self-stabilization for parameterized unidirectional rings, synthesizing self-stabilizing unidirectional rings is decidable! This is surprising because it is known that, in general, the synthesis of distributed systems is harder than their verification. Second, we present a topology-specific synthesis method (derived from our proof of decidability) that generates the state transition system of template processes of parameterized self-stabilizing systems with elementary unidirectional topologies (e.g., rings, chains, trees). We also provide a software tool that implements our synthesis algorithms and generates interesting self-stabilizing parameterized unidirectional rings in less than 50 microseconds on a regular laptop. We validate the proposed synthesis algorithms for decidable cases in the context of several interesting distributed protocols. Third, we show that synthesis of self-stabilizing bidirectional rings remains undecidable.

关键词： Topology Protocols Convergence Software algorithms Portable computers Automata Transforms Self-stabilization distributed programming formal methods program synthesis

来源：评论

学校读者我要写书评

暂无评论

Google's MapReduce programming model -: Revisited

引用

SCIENCE OF COMPUTER programming 2008年第1期70卷 1-30页

作者： Laemmel, Ralf Microsoft Corp Data Programmabil Team Redmond WA 98052 USA

Google's MapReduce programming model serves for processing large data sets in a massively parallel manner. We deliver the first rigorous description of the model including its advancement as Google's domain-specific language Sawzall. To this end, we reverse-engineer the seminal papers on MapReduce and Sawzall, and we capture our findings as an executable specification. We also identify and resolve some obscurities in the informal presentation given in the seminal papers. We use typed functional programming (specifically Haskell) as a tool for design recovery and executable specification. Our development comprises three components: (i) the basic program skeleton that underlies MapReduce computations;(ii) the opportunities for parallelism in executing MapReduce computations;(iii) the fundamental characteristics of Sawzall's aggregators as an advancement of the MapReduce approach. Our development does not formalize the more implementational aspects of an actual, distributed execution of MapReduce computations. (C) 2007 Elsevier B.V. All rights reserved.

关键词： data processing parallel programming distributed programming software design executable specification typed functional programming MapReduce Sawzall map reduce list homomorphism Haskell

来源：评论

学校读者我要写书评

暂无评论

Network-based multicomputers: A practical supercomputer architecture

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 1996年第8期7卷 861-875页

作者： Steenkiste, P Sckool of Computer Science Carnegie Mellon University Pittsburgh PA USA

Multicomputers built around a general network are an attractive architecture for a wide class of applications. The architecture provides many benefits compared with special-purpose approaches, including heterogeneity, reuse of application and system code;and sharing of resources. The architecture also poses new challenges to both computer system implementers and users. First, traditional local-area networks do not have enough bandwidth and create a communication bottleneck, thus seriously limiting the set of applications that can be run effectively. Second, programmers have to deal with large bodies of code distributed over a variety of architectures, and work in an environment where both the network and nodes are shared with other users. Our experience in the Nectar project shows that it is possible to overcome these problems. We show how networks based on high-speed crossbar switches and efficient protocol implementations can support high bandwidth and low latency communication while still enjoying the flexibility of general networks, and we use three applications to demonstrate that network-based multicomputers are a practical architecture. We also show how the network traffic generated by this new class of applications poses severe requirements for networks.

关键词： multicomputer workstation cluster high-speed network host-network interlace distributed programming traffic characteristics

来源：评论

学校读者我要写书评

暂无评论

Modeling Service Applications for Optimal Parallel Embedding

引用

IEEE TRANSACTIONS ON CLOUD COMPUTING 2018年第4期6卷 1067-1079页

作者： Huang, Changcheng Zhu, Jiafeng Carleton Univ Dept Syst & Comp Engn Ottawa ON K1S 5B6 Canada Huawei Technol Inc Santa Clara CA USA

Leveraging the traditional virtual network concept, some recent research works have proposed the Virtual Data Center (VDC) as an abstraction to capture both bandwidth and compute/storage resource requirements for an application. However a virtual node in a VDC is limited to a virtual machine (VM), which can only be embedded onto a single physical machine. This condition limits the applicability of the VDC abstraction and the potential of deploying parallel computing. In this paper, we propose a new abstraction based on our Application Centric Network Virtualization (ACNV) approach. Specifically, we model a service application offered by a service provider as a virtual network of service function nodes, which closely matches the service provider's view on the architecture of the application. An infrastructure provider that hosts the application decides how to map the virtual network to the substrate network. Different from the VDC abstraction, each virtual node in our proposed abstraction can be split and mapped onto multiple physical machines, which allows the infrastructure provider to provide auto scaling for the application with variable number of physical machines for exploring the full benefits of parallel computing. We also allow multiple virtual nodes to be mapped and colocated in the same physical machine to minimize resource fragmentation and communication overhead. Extensive simulation results show that the proposed ACNV abstraction outperforms existing VDC-like approaches in achieving optimal resource usage.

关键词： Architecture distributed network network topology distributed application modeling technique distributed programming

来源：评论

学校读者我要写书评

暂无评论

Continuation-based transformations for coordination languages

引用

THEORETICAL COMPUTER SCIENCE 2000年第1期240卷 117-146页

作者： Jagannathan, S NEC Res Inst Princeton NJ 08540 USA

Coordination languages for parallel and distributed systems specify mechanisms for creating tasks and communicating data among them. These languages typically assume that (a) once a task begins execution on some processor, it will remain resident on that processor throughout its lifetime, and (b) communicating shared data among tasks is through some form of message-passing and data migration. In this paper, we investigate an alternative approach to understanding coordination. Communication-passing style (CmPS) refers to a coordination semantics in which data communication is always undertaken by migrating the continuation of the task requiring the data to the processor where the data resides. Communication-passing style is closely related to continuation-passing style (CPS), a useful transformation for compiling functional languages. Just as CPS eliminates implicit call-realm sequences, CmPS eliminates implicit inter-processor data communication and synchronization requests. In a CmPS-transformed program, only continuations (i.e., control contexts) are trans transmitted across machines: all synchronization and data communication occurs locally. Besides providing significant optimization opportunities, CmPS is a natural representation for implementations on networks of workstations. This paper presents several operational semantics for a coordination language that supports first-class (shared) distributed data repositories. The computation sub-language considered is an untyped call-by-value functional language similar to pure scheme. The first semantics describes a conventional synchronous message-passing implementation;the second is a formulation of a CmPS implementation: and, the third refines this implementation to support computation migration, a technique to lazily migrate control state. Using computation migration, an implementation "distributes" a continuation among multiple machines reducing bandwidth requirements needed to support thread mobility. We prove t

关键词： continuations distributed programming operational semantics task migration tuple-spaces

来源：评论

学校读者我要写书评

暂无评论

Flexibility and coordination in event-based, loosely coupled, distributed systems

引用

COMPUTER LANGUAGES SYSTEMS & STRUCTURES 2010年第2期36卷 142-157页

作者： Silvestre, B. Rossetto, S. Rodriguez, N. Briot, J. -P. Pontifical Catholic Univ Rio de Janeiro PUC Rio Dept Informat BR-22451900 Rio De Janeiro Brazil LIP6 Paris6 Paris France Univ Fed Fluminense BR-24220000 Niteroi RJ Brazil

The scale and diversity of interactions in current wide-area distributed programming environments. specially in Internet-based applications, point to the fact that there is no single solution for coordinating distributed applications. Instead, what is needed is the ability to easily build and combine different coordination abstractions. In this paper, we discuss the role of some language features, such as first-class function values, closures, and coroutines, in allowing different coordination mechanisms to be constructed out of a small set of communication primitives, and to be easily mixed and combined. Using the Lua programming language, we define a basic asynchronous primitive, which allows programming in a direct event-driven style with the syntax of function calls, and, based on this primitive, we build different well-known coordination abstractions for distributed computing. (c) 2009 Elsevier Ltd. All rights reserved.

关键词： Coordination Synchronization distributed programming Interpreted language Closures Coroutines First-class functions Asynchronous remote procedure call

来源：评论

学校读者我要写书评

暂无评论

distributed detection of sequential anomalies in univariate time series

引用

VLDB JOURNAL 2021年第4期30卷 579-602页

作者： Schneider, Johannes Wenig, Phillip Papenbrock, Thorsten Univ Potsdam Hasso Plattner Inst Potsdam Germany

The automated detection of sequential anomalies in time series is an essential task for many applications, such as the monitoring of technical systems, fraud detection in high-frequency trading, or the early detection of disease symptoms. All these applications require the detection to find all sequential anomalies possibly fast on potentially very large time series. In other words, the detection needs to be effective, efficient and scalable w.r.t. the input size. Series2Graph is an effective solution based on graph embeddings that are robust against re-occurring anomalies and can discover sequential anomalies of arbitrary length and works without training data. Yet, Series2Graph is no t scalable due to its single-threaded approach;it cannot, in particular, process arbitrarily large sequences due to the memory constraints of a single machine. In this paper, we propose our distributed anomaly detection system, short DADS, which is an efficient and scalable adaptation of Series2Graph. Based on the actor programming model, DADS distributes the input time sequence, intermediate state and the computation to all processors of a cluster in a way that minimizes communication costs and synchronization barriers. Our evaluation shows that DADS is orders of magnitude faster than S2G, scales almost linearly with the number of processors in the cluster and can process much larger input sequences due to its scale-out property.

关键词： distributed programming Sequential anomaly Actor model Data mining Time series

来源：评论

学校读者我要写书评

暂无评论

Logical clock requirements for reverse engineering scenarios from a distributed system

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 2002年第4期28卷 321-339页

作者： Hrischuk, CE Woodside, CM Rat Software NE Woodinville WA 98072 USA Carleton Univ Dept Syst & Comp Engn Ottawa ON K1S 5B6 Canada

To reverse engineer scenarios from event traces, one must infer causal relationships between events. The inferences are usually based on a trace with sequence numbers or timestamps corresponding to some kind of logical clock. In practice, there is an explosion of potentially causal relationships in the trace, which limits one's ability to extract scenarios. This work defines a more parsimonious form of causality called scenario causality that concentrates on certain major causal relationships and ignores more subtle potentially causal links. The influence of an event is restricted to the particular scenario it is part of. An event which is not a message reception is defined to be caused by the previous event in the same software object, while a message reception is caused by a sending event in another object, The events are ordered to form a scenario event graph where typed nodes are events and the typed edges are certain causal relationships. Intuitively, we might say that most logical clocks, which identify events which "happened before" a given event and, thus, are potentially causal, give an upper bound on the set of causal events;scenario causality identifies a lower bound. The much smaller lower bound set makes it possible to reverse engineer and automate the analysis of scenarios.

关键词： logical clock causal order software tracing graph grammar trace analysis distributed programming reverse engineering event labeling debugging web services

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：