Stellarator Optimization Using a Distributed Swarm Intelligence-Based Algorithm

The design of enhanced fusion devices constitutes a key element for the development of fusion as a commercial source of energy. Stellarator optimization presents high computational requirements because of the complexity of the numerical methods needed as well as the size of the solution space regarding all the possible configurations satisfying the characteristics of a feasible reactor. The size of the solution space does not allow to explore every single feasible configuration. Hence, a metaheuristic approach is used to achieve optimized configurations without evaluating the whole solution space. In this paper we present a distributed algorithm that mimics the foraging behaviour of bees. This behaviour has manifested its efficiency in dealing with complex problems

Advances in Grid Computing

This book approaches the grid computing with a perspective on the latest achievements in the field, providing an insight into the current research trends and advances, and presenting a large range of innovative research papers. The topics covered in this book include resource and data management, grid architectures and development, and grid-enabled applications. New ideas employing heuristic methods from swarm intelligence or genetic algorithm and quantum encryption are considered in order to explain two main aspects of grid computing: resource management and data management. The book addresses also some aspects of grid computing that regard architecture and development, and includes a diverse range of applications for grid computing, including possible human grid computing system, simulation of the fusion reaction, ubiquitous healthcare service provisioning and complex water systems

3rd EGEE User Forum

We have organized this book in a sequence of chapters, each chapter associated with an application or technical theme introduced by an overview of the contents, and a summary of the main conclusions coming from the Forum for the chapter topic. The first chapter gathers all the plenary session keynote addresses, and following this there is a sequence of chapters covering the application flavoured sessions. These are followed by chapters with the flavour of Computer Science and Grid Technology. The final chapter covers the important number of practical demonstrations and posters exhibited at the Forum. Much of the work presented has a direct link to specific areas of Science, and so we have created a Science Index, presented below. In addition, at the end of this book, we provide a complete list of the institutes and countries involved in the User Forum

Peak reduction in decentralised electricity systems : markets and prices for flexible planning

In contemporary societies, industrial processes as well as domestic activities rely to a large degree on a well-functioning electricity system. This reliance exists both structurally (the system should always be available) and economically (the prices for electricity affect the costs of operating a business and the costs of living). After many decades of stability in engineering principles and related economic paradigms, new developments require us to reconsider how electricity is distributed and paid for.Twowell-known examples of important technological developments in this regard are decentralised renewable energy generation (e.g. solar and wind power) and electric vehicles. They promise to be highly useful, for instance because they allow us to decrease our CO2 emissions and our dependence on energy imports. However, a widespread introduction of these (and related) technologies requires significant engineering efforts. In particular, two challenges to themanagement of electricity systems are of interest to the scope of this dissertation. First, the usage of these technologies has significant effects on howwell (part of) supply and demand can be planned ahead of time and balanced in real time. Planning and balancing are important activities in electricity distribution for keeping the number of peaks low (peaks can damage network hardware and lead to high prices). It can become more difficult to plan and balance in future electricity systems, because supply will partly depend on intermittent sunshine and wind patterns, and demand will partly depend on dynamic mobility patterns of electric vehicle drivers. Second, these technologies are often placed in the lower voltage (LV) tiers of the grid in a decentralised manner, as opposed to conventional energy sources, which are located in higher voltage (HV) tiers in central positions. This is introducing bi-directional power flows on the grid, and it significantly increases the number of actors in the electricity systems whose day-to-day decisionmaking about consumption and generation (e.g. electric vehicles supplying electricity back to the network) has significant impacts on the electricity system.In this dissertation, we look into dynamic pricing and markets in order to achieve allocations (of electricity and money) which are acceptable in future electricity systems. Dynamic pricing and markets are concepts that are highly useful to enable efficient allocations of goods between producers and consumers. Currently, they are being used to allocate electricity between wholesale traders. In recent years, the roles of the wholesale producer and the retailer have been unbundled in many countries of the world, which is often referred to as “market liberalisation”. This is supposed to increase competition and give end consumers more choice in contracts. Market liberalisation creates opportunities to design markets and dynamic pricing approaches that can tackle the aforementioned challenges in future electricity systems. However, they also introduce new challenges themselves, such as the acceptance of price fluctuations by consumers.The research objective of this dissertation is to develop market mechanisms and dynamic pricing strategies which can deal with the challenges mentioned above and achieve acceptable outcomes. To this end, we formulate three major research questions:First, can we design pricing mechanisms for electricity systems that support two necessary featureswell, which are not complementary—namely to encourage adaptations in electricity consumption and generation on short notice (by participants who have this flexibility), but also to enable planning ahead of electricity consumption and generation (for participants who can make use of planning)?Second, the smart grid vision (among others) posits that in future electricity systems, outcomeswill be jointly determined by a large number of (possibly) small actors and allocations will be mademore frequently than today. Which pricing mechanisms do not require high computational capabilities from the participants, limit the exposure of small participants to risk and are able to find allocations fast?Third, automated grid protection against peaks is a crucial innovation step for network operators, but a costly infrastructure program. Is it possible for smart devices to combine the objective of protecting network assets (e.g. cables) from overloading with applying buying and selling strategies in a dynamic pricing environment, such that the devices can earn back parts of their own costs?In order to answer the research questions, our methods are as follows: We consider four problems which are likely to occur in future electricity systems and are of relevance to our research objective. For each problem, we develop an agent-based model and propose a novel solution. Then, we evaluate our proposed solution using stochastic computational simulations in parameterised scenarios. We thus make the following four contributions:In Chapter 3,we design a market mechanism in which both binding commitments and optional reserve capacity are explicitly represented in the bid format, which can facilitate price finding and planning in future electricity systems (and therefore gives answers to our first research question). We also show that in this mechanism, flexible consumers are incentivised to offer reserve capacity ahead of time, whichwe prove for the case of perfect competition and showin simulations for the case of imperfect competition. We are able to show in a broad range of scenarios that our proposed mechanism has no economic drawbacks for participants. Furthermore (giving answers to our second research question), the mechanism requires less computational capabilities in order to participate in it than a contemporary wholesale electricitymarket with comparable features for planning ahead.In Chapter 4, we consider the complexity of dynamic pricing strategies that retailers could use in future electricity systems (this gives answers to our first, but foremost to our second research question). We argue that two important features of pricing strategies are not complementary—namely power peak reduction and comprehensibility of prices—and we propose indicators for the comprehensibility of a pricing strategy from the perspective of consumers. We thereby add a novel perspective for the design and evaluation of pricing strategies.In Chapter 5, we consider dynamic pricing mechanisms where the price is set by a single seller. In particular, we develop pricing strategies for a seller (a retailer) who commits to respect an upper limit on its unit prices (this gives answers to both our first and second research question). Upper price limits reduce exposure of market participants to price fluctuations. We show that employing the proposed dynamic pricing strategies reduces consumption peaks, although their parameters are being simultaneously optimised for themaximisation of retailer profits.In Chapter 6, we develop control algorithms for a small storage device which is connected to a low voltage cable. These algorithms can be used to reach decisions about when to charge and when to discharge the storage device, in order to protect the cable from overloading as well as to maximise revenue from buying and selling (this gives answers to our third research question). We are able to show in computational simulations that our proposed strategies perform well when compared to an approximated theoretical lower cost bound. We also demonstrate the positive effects of one of our proposed strategies in a laboratory setupwith real-world cable hardware.The results obtained in this dissertation advance the state of the art in designing pricing mechanisms and strategies which are useful for many use cases in future decentralised electricity systems. The contributions made can provide two positive effects: First, they are able to avoid or reduce unwanted extreme situations, often related to consumption or production peaks. Second, they are suitable for small actors who do not have much computation power but still need to participate in future electricity systems where fast decision making is needed

Analysing and Reducing Costs of Deep Learning Compiler Auto-tuning

Deep Learning (DL) is significantly impacting many industries, including automotive, retail and medicine, enabling autonomous driving, recommender systems and genomics modelling, amongst other applications. At the same time, demand for complex and fast DL models is continually growing. The most capable models tend to exhibit highest operational costs, primarily due to their large computational resource footprint and inefficient utilisation of computational resources employed by DL systems. In an attempt to tackle these problems, DL compilers and auto-tuners emerged, automating the traditionally manual task of DL model performance optimisation. While auto-tuning improves model inference speed, it is a costly process, which limits its wider adoption within DL deployment pipelines. The high operational costs associated with DL auto-tuning have multiple causes. During operation, DL auto-tuners explore large search spaces consisting of billions of tensor programs, to propose potential candidates that improve DL model inference latency. Subsequently, DL auto-tuners measure candidate performance in isolation on the target-device, which constitutes the majority of auto-tuning compute-time. Suboptimal candidate proposals, combined with their serial measurement in an isolated target-device lead to prolonged optimisation time and reduced resource availability, ultimately reducing cost-efficiency of the process. In this thesis, we investigate the reasons behind prolonged DL auto-tuning and quantify their impact on the optimisation costs, revealing directions for improved DL auto-tuner design. Based on these insights, we propose two complementary systems: Trimmer and DOPpler. Trimmer improves tensor program search efficacy by filtering out poorly performing candidates, and controls end-to-end auto-tuning using cost objectives, monitoring optimisation cost. Simultaneously, DOPpler breaks long-held assumptions about the serial candidate measurements by successfully parallelising them intra-device, with minimal penalty to optimisation quality. Through extensive experimental evaluation of both systems, we demonstrate that they significantly improve cost-efficiency of autotuning (up to 50.5%) across a plethora of tensor operators, DL models, auto-tuners and target-devices