ACTORS: A Model of Concurrent Computation in Distributed Systems

A foundational model of concurrency is developed in this thesis. We examine issues in the design of parallel systems and show why the actor model is suitable for exploiting large-scale parallelism. Concurrency in actors is constrained only by the availability of hardware resources and by the logical dependence inherent in the computation. Unlike dataflow and functional programming, however, actors are dynamically reconfigurable and can model shared resources with changing local state. Concurrency is spawned in actors using asynchronous message-passing, pipelining, and the dynamic creation of actors. This thesis deals with some central issues in distributed computing. Specifically, problems of divergence and deadlock are addressed. For example, actors permit dynamic deadlock detection and removal. The problem of divergence is contained because independent transactions can execute concurrently and potentially infinite processes are nevertheless available for interaction.

Implementing Distributed Systems Using Linear Naming

Linear graph reduction is a simple computational model in which the cost of naming things is explicitly represented. The key idea is the notion of "linearity". A name is linear if it is only used once, so with linear naming you cannot create more than one outstanding reference to an entity. As a result, linear naming is cheap to support and easy to reason about. Programs can be translated into the linear graph reduction model such that linear names in the program are implemented directly as linear names in the model. Nonlinear names are supported by constructing them out of linear names. The translation thus exposes those places where the program uses names in expensive, nonlinear ways. Two applications demonstrate the utility of using linear graph reduction: First, in the area of distributed computing, linear naming makes it easy to support cheap cross-network references and highly portable data structures, Linear naming also facilitates demand driven migration of tasks and data around the network without requiring explicit guidance from the programmer. Second, linear graph reduction reveals a new characterization of the phenomenon of state. Systems in which state appears are those which depend on certain -global- system properties. State is not a localizable phenomenon, which suggests that our usual object oriented metaphor for state is flawed.

Integration of knowledge-based, qualitative and numeric tools for real time dynamic systems supervision

The proposal presented in this thesis is to provide designers of knowledge based supervisory systems of dynamic systems with a framework to facilitate their tasks avoiding interface problems among tools, data flow and management. The approach is thought to be useful to both control and process engineers in assisting their tasks. The use of AI technologies to diagnose and perform control loops and, of course, assist process supervisory tasks such as fault detection and diagnose, are in the scope of this work. Special effort has been put in integration of tools for assisting expert supervisory systems design. With this aim the experience of Computer Aided Control Systems Design (CACSD) frameworks have been analysed and used to design a Computer Aided Supervisory Systems (CASSD) framework. In this sense, some basic facilities are required to be available in this proposed framework: ·

Synthesis of fused cyclic systems containing medium-sized rings through tandem ROM-RCM of norbornene derivatives embedded in a carbohydrate template

A general approach for the synthesis of fused cyclic systems containing medium-sized rings (7-9) has been developed. The key steps involve a diastereoface-selective Diels-Alder reaction of the dienophiles 4a-d attached to a furanosugar with cyclopentadiene and ring opening (ROM)-ring closing metathesis (RCM) of the resulting norbornene derivatives 10a-d and 11a-d. Diels-Alder reaction of the dienophiles 4a-d with cyclopentadiene in the absence of a catalyst produced 10a-d as the major product arising through addition of the diene to the unhindered Si-face. The most interesting and new aspect of the Diels-Alder reaction of these dienophiles is the accessibility of the Re-face that was blocked by the alkenyl chains under Lewis acid catalysis producing the diastereoisomers 11a-d exclusively. The reversal of facial selectivity from an uncatalyzed reaction to a catalyzed one is unprecedented. The observed stereochemical dichotomy is attributed to rotation of the enone moiety along the or bond linking the sugar moiety during formation of the chelate 13. This makes the Re-face of the enone moiety in 4a-d unhindered. Diels-Alder reaction of the carbocyclic analogue 15 under Lewis acid catalysis produced a 1: 1 mixture of the adducts 16 and 17 confirming the participation of sugar ring oxygen in chelate formation. Finally ROM-RCM of 10a-d and 11a-d with Grubbs' catalyst afforded the cis-syn-cis and cis-anti-cis bicyclo-annulated sugars 21a-d and 23a-d, respectively, containing 7-9 membered rings.

Economic models and algorithms for distributed systems

Distributed computing paradigms for sharing resources such as Clouds, Grids, Peer-to-Peer systems, or voluntary computing are becoming increasingly popular. While there are some success stories such as PlanetLab, OneLab, BOINC, BitTorrent, and SETI@home, a widespread use of these technologies for business applications has not yet been achieved. In a business environment, mechanisms are needed to provide incentives to potential users for participating in such networks. These mechanisms may range from simple non-monetary access rights, monetary payments to specific policies for sharing. Although a few models for a framework have been discussed (in the general area of a "Grid Economy"), none of these models has yet been realised in practice. This book attempts to fill this gap by discussing the reasons for such limited take-up and exploring incentive mechanisms for resource sharing in distributed systems. The purpose of this book is to identify research challenges in successfully using and deploying resource sharing strategies in open-source and commercial distributed systems.

Distributed fuzzy logic for building management systems using local operating networks

This paper describes the development of an experimental distributed fuzzy control system for heating and ventilation (HVAC) systems within a building. Each local control loop is affected by a number of local variables, as well as information from neighboring controllers. By including this additional information it is hoped that a more equal allocation of resources can be achieved.

Distributed systems and multimedia

Edited book to support level 3 undergraduate understanding.

Energy-efficient resource allocation in OFDM systems with distributed antennas

In this paper, we develop an energy-efficient resource-allocation scheme with proportional fairness for downlink multiuser orthogonal frequency-division multiplexing (OFDM) systems with distributed antennas. Our aim is to maximize energy efficiency (EE) under the constraints of the overall transmit power of each remote access unit (RAU), proportional fairness data rates, and bit error rates (BERs). Because of the nonconvex nature of the optimization problem, obtaining the optimal solution is extremely computationally complex. Therefore, we develop a low-complexity suboptimal algorithm, which separates subcarrier allocation and power allocation. For the low-complexity algorithm, we first allocate subcarriers by assuming equal power distribution. Then, by exploiting the properties of fractional programming, we transform the nonconvex optimization problem in fractional form into an equivalent optimization problem in subtractive form, which includes a tractable solution. Next, an optimal energy-efficient power-allocation algorithm is developed to maximize EE while maintaining proportional fairness. Through computer simulation, we demonstrate the effectiveness of the proposed low-complexity algorithm and illustrate the fundamental trade off between energy and spectral-efficient transmission designs.

Distributed power control in cellular mobile radio systems with time-varying link gains

A simple distributed power control algorithm for communication systems with mobile users and unknown time-varying link gains is proposed. We prove that the proposed algorithm is exponentially converging. Furthermore, we show that the algorithm significantly outperforms the well-known Foschini and Miljanic algorithm in the case of quickly moving mobile users.

A distributed approach to global feedback control of multi-agent systems

This paper presents a distributed approach to global state feedback control of for multi-agent systems. The proposed solution is obtained from the construction of decentralised functional observers. The required local control signal is generated asymptotically using only corresponding local output information. It is shown that a complete distribution of the control of a decentralised system having N agents can be achieved upon the satisfaction of some necessary conditions, and that the resulting controller can emulate the performance of a global state feedback controller. A step-by-step design algorithm is given. Its simplicity and correctness are illustrated through a numerical example.

Performance optimization for energy-aware adaptive checkpointing in embedded real-time systems

Using additional store-checkpoinsts (SCPs) and compare-checkpoints (CCPs), we present an adaptive checkpointing for double modular redundancy (DMR) in this paper. The proposed approach can dynamically adjust the checkpoint intervals. We also design methods to calculate the optimal numbers of checkpoints, which can minimize the average execution time of tasks. Further, the adaptive checkpointing is combined with the DVS (dynamic voltage scaling) scheme to achieve energy reduction. Simulation results show that, compared with the previous methods, the proposed approach significantly increases the likelihood of timely task completion and reduces energy consumption in the presence of faults.

Distributed power control in cellular mobile radio systems with time-varying link gains

A simple distributed power control algorithm for communication systems with mobile users and unknown timevarying link gains is proposed. We prove that the proposed algorithm is exponentially converging. Furthermore, we show that the algorithm significantly outperforms the well-known
Foschini and Miljanic algorithm in the case of quickly moving mobile users.

A parallel download protocol for internet-based distributed systems

Parallel transfer of large amounts of data is attractive as (i) the data can be received in less time and (ii) is more resilient to connection failures. This is often used in e-Science under the field of data sharing. Data from one research project should be easily assessable to others regardless of the size of the data thus parallelism is used to help share the data quickly. However, there are many tasks to be carried out to make it possible: replica discovery and load detection just to name two. A common problem with most solutions is they overlook some tasks such as load detection. PHTTP is an innovate protocol which handles the tasks behind parallel transfer while presenting itself as a normal sequential transfer.