The management of distributed applications and systems (MANDAS) project addresses problems arising in the management applications. The MANDAS information repository (MIR) provides database support for the management a...
详细信息
The management of distributed applications and systems (MANDAS) project addresses problems arising in the management applications. The MANDAS information repository (MIR) provides database support for the management applications and supports their integration into a single management environment. We examine the problem of distributed applications management to extract the requirements for an MIR. Based on the requirements, we present an information model for distributed applications management and outline a prototype MIR developed for the MANDAS project.
distributed transactions gradually become the mainstream mode of data processing. How to avoid the transaction congestion due to network delays and site failures, and how to effectively distinguish between these two f...
详细信息
ISBN:
(纸本)9781467376822
distributed transactions gradually become the mainstream mode of data processing. How to avoid the transaction congestion due to network delays and site failures, and how to effectively distinguish between these two faults become the hot issues in the study of distributed transactions. In the fault detection and distinction of the distributed transaction, we develop a hierarchical detection model, which has the advantages of detecting path clearly, having the small number of probe packet, and approximating the actual network topology. The model can effectively solve the problem of excessive traffic load of the coordination to shorten the time of parallel processing for each sub-transaction. On the other hand, this can reduce unnecessary transaction submissions caused by failures through the detection and differentiation of the fault to enhance the reliability and availability of the agreement. We select D pi F calculus as a modeling language and the extend DpF calculus through adding the clock operator, which intuitively describes the scenarios of node failure and link failure in distributed transaction failures, and then we can distinguish between these two types of failures and validate them by the bisimulation theory.
Our implementation of the DEBS 2013 Challenge is based on a scalable, parallel, and extensible DSMS, which is capable of processing general continuous queries over high volume data streams with low delays. A mechanism...
详细信息
Power semiconductor installations in medium-voltage power grids are usually built by numerous particular power converter units containing large number of power modules. Such large installations place high demands on c...
详细信息
ISBN:
(纸本)9781728156606
Power semiconductor installations in medium-voltage power grids are usually built by numerous particular power converter units containing large number of power modules. Such large installations place high demands on control systems including precise timing and signal distribution across the whole system. This paper deals with a proposed distributed modular control system designed for STATCOM installed in a MV power grid of 22 kV. The proposed control system is designed for a real-time control of the converter with high-speed interference-immune communication, reliable synchronization of numerous PWM outputs and synchronous immediate blocking of fire pulses for safe central stop in case of error handling.
This paper presents a novel architecture for array processor, called LEAP, which is a set of simple processing elements. The targeted programs are perfect innermost loops. By using the technique called if-conversion, ...
详细信息
ISBN:
(纸本)0780378407
This paper presents a novel architecture for array processor, called LEAP, which is a set of simple processing elements. The targeted programs are perfect innermost loops. By using the technique called if-conversion, the control dependence can be converted to data dependence to prediction variables. Then an innermost loop can be represented by a data dependence graph, where the vertex supports the expression statements of high level languages. By mapping the data dependence graph to fixed PEs, each PE steps the loop iteration automatically and independently at the runtime. The execution forms multiple pipelining chains. The simulation of four loops of LFK shows the effectiveness of the LEAP architecture, compared with traditional CISC and RISC architectures.
The proceedings contain 77 papers. The topics discussed include: parallelization and performance analysis of video feature extractions on multi-core based systems;towards optimized packet classification algorithms for...
详细信息
ISBN:
(纸本)076952933X
The proceedings contain 77 papers. The topics discussed include: parallelization and performance analysis of video feature extractions on multi-core based systems;towards optimized packet classification algorithms for multi-core network processors;loop-level speculative parallelism in embedded applications;integrating memory compression and decompression with coherence protocols in distributed shared memory multiprocessors;improving search using a fault-tolerant overlay in unstructured P2P systems;difficulty-aware hybrid search in peer-to-peer networks;ASAP: an advertisement-based search algorithm for unstructured peer-to-peer systems;Mercury: combining performance with dependability using self-virtualization;Flexfetch: a history-aware scheme for I/O energy saving in mobile computing;multi-layer event trace analysis for parallel I/O performance tuning;and efficient parallel algorithm for optimal three-sequences alignment.
Reaching consensus is fundamental in distributed computing. For each execution of a consensus algorithm, there is no difference between the proposed values by different nodes with respect to their proposed times. By p...
详细信息
ISBN:
(纸本)9783030483401;9783030483395
Reaching consensus is fundamental in distributed computing. For each execution of a consensus algorithm, there is no difference between the proposed values by different nodes with respect to their proposed times. By presenting a realistic application scenario related to distributed asynchronous mobile robots in dynamic environments, we argue some safety-critical, real-time systems require reaching consensus on the newest proposed values when the old proposed values may not be valid anymore. Afterward, we formulate a new type of consensus problem called time-based consensus, which requires to take into account the times of proposed values. Finally, to tackle such a consensus problem, we determine an essential characteristic which should be considered.
作者：
Rusu, CristianIrofti, PaulUniversity Politehnica Bucharest
Faculty of Automatic Control and Computers Department of Automatic Control and Computers Bucharest Romania
University of Bucharest Faculty of Mathematics and Computer Science Department of Computer Science Bucharest Romania
Separable, or Kronecker product, dictionaries provide natural decompositions for 2D signals, such as images. In this paper, we describe a highly parallelizable algorithm that learns such dictionaries which reaches spa...
详细信息
The components of a fault-tolerant distributed system must be capable to accurately determine which components of the system are faulty and which are fault-free. In this paper we present a new distributed algorithm fo...
ISBN:
(纸本)0769505686
The components of a fault-tolerant distributed system must be capable to accurately determine which components of the system are faulty and which are fault-free. In this paper we present a new distributed algorithm for event diagnosis in fully-connected networks. An event is defined as a faulty node becoming fault-free, or the opposite. Previous hierarchical algorithms consider a static fault situation, in which an event can only occur after the previous event has been fully diagnosed. The new algorithm is capable of achieving the diagnosis of dynamic events as long as nodes stay in a given state for a period of time long enough for all testers to detect that state. Each node running the algorithm keeps a timestamp for the state of each other node in the system. This timestamp is implemented as a counter, which is incremented every time a node changes its state. In this way, each tester may get information about a given node in the system from more than one tested node without causing any inconsistencies, i.e, without taking an older state for a newer one. Nodes run a hierarchical testing strategy, which is a hypercube when all nodes are fault-free. When a fault-free node is tested, the tester gets diagnostic information about N/2 nodes, for a system of N nodes. In spite of the overhead of keeping and transferring timestamps, the new algorithm significantly reduces the average latency when compared to other similar approaches, presenting a new option for practical diagnosis implementation.
While content-aware distribution policies getting more popular in cluster-based web systems, they make the dispatching node a bottleneck. To achieve scalable server performance, we present a completely distributed arc...
详细信息
ISBN:
(纸本)0780378407
While content-aware distribution policies getting more popular in cluster-based web systems, they make the dispatching node a bottleneck. To achieve scalable server performance, we present a completely distributed architecture in which all hosts participate in request dispatching. To cope with the architecture, we propose a distributed dispatching policy named DWARD. With DWARD, all the server nodes may participate in request dispatching on the basis of local access pattern. In addition, the DWARD policy inherits several desirable features of the centralized algorithms, including load balance, high locality and less forwarding overhead. Finally, a testbed is implemented on the basis of Linux kernel to benchmark various dispatching algorithms. The performance results show that DWARD can achieve favorable throughput compared with state-of-the-art dispatching policies.
暂无评论