Distributed Region-Based Memory Allocation and Synchronization

We present DRASync, a region-based allocator that implements a global address space abstraction for MPI programs with pointer-based data structures. The main features of DRASync are: (a) it amortizes communication among nodes to allow efficient parallel allocation in a global address space; (b) it takes advantage of bulk deallocation and good locality with pointer-based data structures; (c) it supports ownership semantics of regions by nodes akin to reader–writer locks, which makes for a high-level, intuitive synchronization tool in MPI programs, without sacrificing message-passing performance. We evaluate DRASync against a state-of-the-art distributed allocator and find that it produces comparable performance while offering a higher-level abstraction to programmers.

Distributed Consensus Charging for Current Unbalance Reduction

Electric Vehicle (EV) technology has developed rapidly in recent years, with the result that increasing levels of EV penetration are expected on electrical grids in the near future. The increasing electricity demand due to EVs is expected to provide many challenges for grid companies, and it is expected that it will be necessary to reinforce the current electrical grid infrastructure to cater for increasing loads at distribution level. However, by harnessing the power of Vehicle to Grid (V2G) technologies, groups of EVs could be harnessed to provide ancillary services to the grid. Current unbalance occurs at distribution level when currents are unbalanced between each of the phases. In this paper a distributed consensus algorithm is used to coordinate EV charging in order to minimise current unbalance. Simulation results demonstrate that the proposed algorithm is effective in rebalancing phase currents.

Distributed MPC for Frequency Regulation in Multi-Terminal HVDC Grids

High Voltage Direct Current (HVDC) lines allow large quantities of power to be
transferred between two points in an electrical power system. A Multi-Terminal HVDC (MTDC) grid consists of a meshed network of HVDC lines, and this allows energy reserves to be shared between a number of AC areas in an efficient manner. Secondary Frequency Control (SFC) algorithms return the frequencies in areas connected by AC or DC lines to their original setpoints after Primary Frequency Controllers have been called following a contingency. Where multiple
TSOs are responsible for different parts of a MTDC grid it may not be possible to implement SFC from a centralised location. Thus, in this paper a simple gain based distributed Model Predictive Control strategy is proposed for Secondary Frequency Control of MTDC grids which allows TSOs to cooperatively perform SFC without the need for centralised coordination.

Distributed Sounding Art – Practices in Distributing Sound (eds. Barry Truax, Marcel Cobussen and Vincent Meelberg)

This chapter examines distributed sounding art by focusing on three key aspects that we consider essentially tied to the notion of distribution: assignment, transport and sharing. These aspects aid us in navigating through a number of nodes in a history of sounding art practices where sound becomes assigned, transported and shared between places and people. Sound or data become distributed, and in the process of distribution, meanings become assigned and altered through differing socio-cultural contexts of places and people. We have selected several works, commencing in the 1960’s as we consider this period as having produced some of the seminal works that address distribution.
We draw on works by composers, performers and sound artists and thus present a history of sounding art, which is amongst the many histories of sounding art in the 20th and 21st century.

Electron-acoustic solitons in an electron-beam plasma system with kappa-distributed electrons

Interaction of a stream of high-energy electrons with the background plasma plays an important role in the astrophysical phenomena such as interplanetary and stellar bow shock and Earth's foreshock emission. It is not yet fully understood how electrostatic solitary waves are produced at the bow shock. Interestingly, a population of energetic suprathermal electrons were also found to exist in those environments. Previously, we have studied the properties of negative electrostatic potential solitary structures exist in such a plasma with excess suprathermal electrons. In the present study, we investigate the existence conditions and propagation properties of electron-acoustic solitary waves in a plasma consisting of an electron beam fluid, a cold electron fluid, and hot suprathermal electrons modeled by a kappa-distribution function. The Sagdeev pseudopotential method was used to investigate the occurrence of stationary-profile solitary waves. We have determined how the electron-acoustic soliton characteristics depend on the electron beam parameters. It is found that the existence domain for solitons becomes narrower with an increase in the suprathermality of hot electrons, increasing the beam speed, decreasing the beam-to-cold electron population ratio. These results lead to a better understanding of the formation of electron-acoustic solitary waves observed in those space plasma systems characterized by kappa-distributed electrons and inertial drifting (beam) electrons.

Electron-acoustic solitons in an electron-beam plasma system with kappa-distributed electrons

We investigate the existence conditions and propagation properties of electron-acoustic solitary waves in a plasma consisting of an electron beam fluid, a cold electron fluid, and a hot suprathermal electron component modeled by a k-distribution function. The Sagdeev pseudopotential method was used to investigate the occurrence of stationary-profile solitary waves. We have determined how the soliton characteristics depend on the electron beam parameters. It is found that the existence domain for solitons becomes narrower with an increase in the suprathermality of hot electrons, increasing the beam speed, and decreasing the beam-to-cold electron population ratio.

Distributed Massive MIMO in Cellular Networks: Impact of Imperfect Hardware and Number of Oscillators

Distributed massive multiple-input multiple-output (MIMO) combines the array gain of coherent MIMO processing with the proximity gains of distributed antenna setups. In this paper, we analyze how transceiver hardware impairments affect the downlink with maximum ratio transmission. We derive closed-form spectral efficiencies expressions and study their asymptotic behavior as the number of the antennas increases. We prove a scaling law on the hardware quality, which reveals that massive MIMO is resilient to additive distortions, while multiplicative phase noise is a limiting factor. It is also better to have separate oscillators at each antenna than one per BS.

The Local and the Distributed in the Sonic Arts

This paper addresses the relationship between local and distributed strategies with reference to two recent participatory sound art projects in Belfast and Rio de Janeiro. The local concern for site and place is discussed and juxtaposed with distributed practices, which,by definition question and extend the very notion of site or locale. I refer to examples from ethnomusicology, anthropology and education in which participative horizontal research methodologies lead to a dynamic articulation of local conditions and allow for a reflection on how technology impacts on social interaction and relationships with place. The works of Samuel Araújo, Georgina Born and Brazilian pedagogue Paulo Freire provide a framework of reference in this context.

Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer Networks

Motivated by the need for designing efficient and robust fully-distributed computation in highly dynamic networks such as Peer-to-Peer (P2P) networks, we study distributed protocols for constructing and maintaining dynamic network topologies with good expansion properties. Our goal is to maintain a sparse (bounded degree) expander topology despite heavy {\em churn} (i.e., nodes joining and leaving the network continuously over time). We assume that the churn is controlled by an adversary that has complete knowledge and control of what nodes join and leave and at what time and has unlimited computational power, but is oblivious to the random choices made by the algorithm. Our main contribution is a randomized distributed protocol that guarantees with high probability the maintenance of a {\em constant} degree graph with {\em high expansion} even under {\em continuous high adversarial} churn. Our protocol can tolerate a churn rate of up to $O(n/\poly\log(n))$ per round (where $n$ is the stable network size). Our protocol is efficient, lightweight, and scalable, and it incurs only $O(\poly\log(n))$ overhead for topology maintenance: only polylogarithmic (in $n$) bits needs to be processed and sent by each node per round and any node's computation cost per round is also polylogarithmic. The given protocol is a fundamental ingredient that is needed for the design of efficient fully-distributed algorithms for solving fundamental distributed computing problems such as agreement, leader election, search, and storage in highly dynamic P2P networks and enables fast and scalable algorithms for these problems that can tolerate a large amount of churn.