Search NASA⌕ Search

SEARCH · Search NASA

Results for “Distributed Computing Resources”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,027 records · Page 57

Co-Operative Resource Allocation: Building an Open Cloud Market Using Shared Infrastructure

In this paper we present DRIVE, a distributed service-based system designed to facilitate an open economic market for federating Cloud providers. Additionally, to address the challenges associated with market ownership and operation we propose the use of a cooperative (co-op) infrastructure in which the services that make up DRIVE are hosted across participants' resources. To prevent malicious behavior we use cryptographic, secure and privacy preserving allocation protocols as a means of establishing trust in the allocation infrastructure. Finally, we investigate through simulation the effect of different strategies, pricing functions, and penalty models on allocation performance and revenue, and show that the overhead of running DRIVE's services on commodity infrastructure is modest.

97 MATHEMATICS AND COMPUTING↗

University Coalition for Fossil Fuel Energy Research

Following a nationwide open competition, the University Coalition for Fossil Energy Research (UCFER) was established in October 2015 through a cooperative agreement between Penn State and the Department of Energy (DOE) National Energy Technology Laboratory (NETL). Penn State lead UCFER with the objective of advancing basic and applied research for clean and low-carbon energy based on fossil fuels in support of the DOE’s mission. UCFER focused on research that improves the efficiency of production and use of fossil energy resources, while minimizing the environmental impacts and reducing greenhouse gas emissions. Penn State lead a team of nine universities (Massachusetts Institute of Technology, The Pennsylvania State University, Princeton University, Texas A&M University, University of Kentucky, University of Southern California, The University of Tulsa, University of Wyoming, and Virginia Polytechnic and State University) during the competition stage, adding seven more universities in 2017 (Carnegie Mellon University, Louisiana State University, The Ohio State University, University of North Dakota, University of Pittsburgh, University of Utah, and West Virginia University). This Coalition exhibited a wide geographical distribution across the U.S. bringing a wide variety of fossil energy expertise. This national university alliance was a major collaborative effort with NETL to address specific topics of R&D in NETL’s mission area, which involved one or more of NETL’s five core competencies (Geologic and Environmental Systems, Materials Engineering and Manufacturing, Energy Conversion Engineering, Systems Engineering and Analysis, and Computational Science and Engineering). The first five to six months of the project was the definitization stage. During this period, Penn State worked closely with NETL to finalize the Coalition organizational structure and By- Laws, prepare a statement of substantial involvement and a statement of project objectives, and develop operations and membership plans. A major component of this stage included preparing an execution plan to solicit research, evaluate proposals, recommend selected projects to NETL, and award projects. In addition, a plan was prepared to monitor projects, review projects, disseminate knowledge from research projects and develop an online system for Coalition research portfolio management. This included developing a website and several databases. The first of six rounds of solicitations started in mid-2016. Projects from the sixth solicitation started February 1, 2021, and ended January 31, 2023. Projects that were selected represented twelve technology lines. Approximately $16.6 million in funding was available for the six solicitations. Most of the funding was provided by DOE, Office of Fossil Energy (DOEFE) with the DOE Fuel Cells Technologies Office (DOE-FCTO) providing funding for a few projects. Coalition universities submitted 259 proposals in response to the solicitations, requesting approximately $67.0 million in funding, and forty-three projects were selected. However, one project withdrew after the principal investigator left the university. The management of the Coalition projects was a major activity by Penn State. Managing the Coalition projects consisted of monitoring the projects, reviewing the projects through annual technical review meetings, disseminating knowledge from the research projects, and developing an online system for Coalition research portfolio management. Penn State’s OMT monitored projects to ensure that all milestones (technical, schedule, budget) were met, expenditures were allowable, cost share (when applicable) were reported, and all technical reports were submitted. The OMT also posted the technical reports electronically on a secure members-only website for access and review by the Coalition members. Disseminating knowledge from the research projects was done through a website, newsletters, various meetings, conferences, journal articles, publicity/press releases, and project summaries that were prepared after each project was completed. Penn State kept NETL apprised of UCFER progress through quarterly reports (thirtyone were submitted by Penn State), verbal and written communications, yearly updates at the annual technical review meetings, and cost accrual reports. The UCFER project had a significant impacty. The UCFER program established the first national university alliance in fossil energy research with a major collaboration effort with DOE NETL that addressed specific topics in NETL’s research and development mission areas. It generated inter-university collaborations, which was another program interest. Twenty-two out of 259 proposals contained collaborations (≈8.5%) and three of forty-two funded projects involved inter-university collaborations (≈7.0%). The forty-two funded projects provided support at fourteen universities involving 269 personnel. Research was conducted by 106 faculty, 115 graduate and undergraduate students, forty-six research staff and post-doctoral scholars, and two visiting scholars. Students and post-doctoral scholars were also on-site at NETL through CRADAs. In addition, non-Coalition participants included six universities and sixteen companies and national laboratories. The non-Coalition participants were involved as subcontractors, providers of cost share, performed unpaid consultation and sample analysis, served as advisory board members, or were providers of samples and materials for testing. UCFER also produced visibility in that fifty-six refereed journal articles were published, fifty-seven conference papers and twenty-three posters were prepared, 190 presentations were given, eight patent applications were filed, two books/book chapters were written, and ten software codes were developed. Collaboration between NETL and the individual projects was a major requirement for all funded projects. This included NETL staff time to support collaboration, consultation, technical guidance, sample preparation and analysis, internships at NETL, on-site testing and equipment usage by Coalition participants at NETL, co-mentoring students, and coauthoring journal articles and conference papers. Collaboration was impacted by COVID-19 in that not all on-site activities could be performed. NETL personnel were coauthors on eight of the conference papers (fourteen percent of the conference papers that were prepared) and seventeen of the journal articles (thirty percent of the journal articles that were prepared). A website was developed for an online proposal solicitation and review process and to provide exposure to UCFER. A website analysis highlighted the large amount of member and general public interest in UCFER by interpreting access statistics from March 2016 through June 2023. Visitors to the site originated from many different organizations, businesses, and countries. The website provided a means to disseminate information to both the general public and the UCFER members and was successfully used for outreach activities. In addition, NETL required that RFP release, proposal submission, and proposal reviews all be performed online. Penn State successfully developed these capabilities in a secure section of the website, which were used throughout the UCFER project. It is recognized that each project had its technical successes. In addition, highlighted successes were compiled and summarized from the research projects. Information was requested from the PIs of completed projects. In addition, Penn State’s Operations Management Team reviewed subcontract reports to identify project successes. Examples of information requested from PIs included (not all-inclusive): new projects that have been funded as a result of UCFER funding; new commercial products; establishment of a new center; new patent; new software; best paper awards; highly-cited work; and graduate student successes. A total of forty-eight highlighted successes were reported.

01 COAL, LIGNITE, AND PEAT↗

Adaptive resource allocation for surrogate modeling of systems comprised of multiple disciplines with varying fidelity

We present an adaptive algorithm for constructing surrogate models for integrated systems composed of a set of coupled components. With this goal we introduce ‘coupling’ variables with a priori unknown distributions that allow approximations of each component to be built independently. Once built, the surrogates of the components are combined and used to predict system-level quantities of interest (QoI) at a fraction of the cost of interrogating the full system model. We use a greedy experimental design procedure, based upon a modification of Multi-Index Stochastic Collocation (MISC), to minimize the error of the combined surrogate. This is achieved by refining each component surrogate in accordance with its relative contribution to error in the approximation of the system-level QoI. Our adaptation of MISC is a multi-fidelity procedure that can leverage ensembles of models of varying cost and accuracy, for one or more components, to produce estimates of system-level QoI. Several numerical examples demonstrate the efficacy of the proposed approach on systems involving feed-forward and feedback coupling. For a fixed computational budget, the proposed algorithm is able to produce approximations that are orders of magnitude more accurate than approximations that treat the integrated system as a black-box.

97 MATHEMATICS AND COMPUTING↗

Modelling an induced thermal plume with data from electrical resistivity tomography and distributed temperature sensing: a case study in northeast Italy

Groundwater tracer tests are often used to improve aquifer characterization, but they present several disadvantages, such as the need to pour solutions or dyes into the aquifer system and alteration of the water’s chemical properties. Thus, tracers can affect the groundwater flow mechanics and data interpretation becomes more complex, hindering effective study of ground heat pumps for low enthalpy geothermal systems. This paper presents a preliminary methodology based on a multidisciplinary application of heat as a tracer for defining the main parameters of shallow aquifers. The field monitoring techniques electrical resistivity tomography (ERT) and distributed temperature sensing (DTS) are noninvasive and were applied to a shallow-aquifer test site in northeast Italy. The combination of these measurement techniques supports the definition of the main aquifer parameters and therefore the construction of a reliable conceptual model, which is then described through the numerical code FEFLOW. This model is calibrated with DTS and validated by ERT outcomes. The reliability of the numerical model in terms of fate and transport is thereby enhanced, leading to the potential for better environmental management and protection of groundwater resources through more cost-effective solutions.

54 ENVIRONMENTAL SCIENCES↗

Using the Criticality Accident Alarm System modeling capabilities in SCALE [Slides]

The following is a summary of advice for CAAS modeling in SCALE. Refer to the SCALE Criticality Safety and Radiation Shielding training slides or to the SCALE manual for exact syntax. Use a mesh for the fission source that is the most adequate for the problem to solve (coarse/fine). Don’t spend unnecessary resources; simplify the model if it does not impact the final results of interest. Be careful to deactivate secondary fissions in MAVRIC or the calculation may never end. Check that k eff and $\overline{\upsilon}$ calculated results are logical. Between KENO and MAVRIC, cross section libraries, materials, geometry, and mesh grid can be the same or different. Iterative calculations are usually complex problems that need variance reduction. It will be hard to find the best solving parameters in the first attempt; expert judgement is needed. Check each step separately. Use Fulcrum to visualize fission source, mesh source, and spatial/energy distributions to find potential errors or impactful imprecisions.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Synapse: Synthetic application profiler and emulator

Abstract Motivated by the need to emulate workload execution characteristics on high- performance and distributed heterogeneous resources, we introduce Synapse. Synapse is used as a proxy application (or "representative application") for real workloads, with the advantage that it can be tuned in different ways and dimensions, and also at levels of granularity that are not possible with real applications. Synapse has a platform-independent application profiler, and has the ability to emulate profiled workloads on a variety of resources. Experiments show that the automated profiling performed using Synapse captures an application's characteristics with high fidelity. The emulation of an application using Synapse can reproduce the application's execution behavior in the original run- time environment, and can also reproduce those behaviors on different run-time environments.

97 MATHEMATICS AND COMPUTING↗

NVMalloc: Exposing an Aggregate SSD Store as a Memory Partition in Extreme-Scale Machines

DRAM is a precious resource in extreme-scale machines and is increasingly becoming scarce, mainly due to the growing number of cores per node. On future multi-petaflop and exaflop machines, the memory pressure is likely to be so severe that we need to rethink our memory usage models. Fortunately, the advent of non-volatile memory (NVM) offers a unique opportunity in this space. Current NVM offerings possess several desirable properties, such as low cost and power efficiency, but suffer from high latency and lifetime issues. We need rich techniques to be able to use them alongside DRAM. In this paper, we propose a novel approach for exploiting NVM as a secondary memory partition so that applications can explicitly allocate and manipulate memory regions therein. More specifically, we propose an NVMalloc library with a suite of services that enables applications to access a distributed NVM storage system. We have devised ways within NVMalloc so that the storage system, built from compute node-local NVM devices, can be accessed in a byte-addressable fashion using the memory mapped I/O interface. Our approach has the potential to re-energize out-of-core computations on large-scale machines by having applications allocate certain variables through NVMalloc, thereby increasing the overall memory capacity available. Our evaluation on a 128-core cluster shows that NVMalloc enables applications to compute problem sizes larger than the physical memory in a cost-effective manner. It can bring more performance/efficiency gain with increased computation time between NVM memory accesses or increased data access locality. In addition, our results suggest that while NVMalloc enables transparent access to NVM-resident variables, the explicit control it provides is crucial to optimize application performance.

Computer Science↗

NVMalloc: Exposing an Aggregate SSD Store as a Memory Partition in Extreme-Scale Machines

DRAM is a precious resource in extreme-scale machines and is increasingly becoming scarce, mainly due to the growing number of cores per node. On future multi-petaflop and exaflop machines, the memory pressure is likely to be so severe that we need to rethink our memory usage models. Fortunately, the advent of non-volatile memory (NVM) offers a unique opportunity in this space. Current NVM offerings possess several desirable properties, such as low cost and power efficiency, but suffer from high latency and lifetime issues. We need rich techniques to be able to use them alongside DRAM. In this talk, we present a novel approach for exploiting NVM as a secondary memory partition so that applications can explicitly allocate and manipulate memory regions therein. More specifically, we propose an NVMalloc library with a suite of services that enables applications to access a distributed NVM storage system. We have devised ways within NVMalloc so that the storage system, built from compute node-local NVM devices, can be accessed in a byte-addressable fashion using the memory mapped I/O interface. Our approach has the potential to re-energize out-of-core computations on largescale machines by having applications allocate certain variables through NVMalloc, thereby increasing the overall memory capacity available. Our evaluation on a 128-core cluster shows that NVMalloc enables applications to compute problem sizes larger than the physical memory in a cost-effective manner. It can bring more performance/efficiency gain with increased computation time between NVM memory accesses or increased data access locality. In addition, our results suggest that while NVMalloc enables transparent access to NVM-resident variables, the explicit control it provides is crucial to optimize application performance.

99 GENERAL AND MISCELLANEOUS↗

Chimbuko: A Workflow-Level Scalable Performance Trace Analysis Tool

ABSTRACT Due to the sheer volume of data it is typically impractical to analyze the detailed performance of an HPC application running at-scale. While conventional small-scale benchmarking and scaling studies are often sufficient for simple applications, many modern workflow-based applications couple multiple elements with competing resource demands and complex inter-communication patterns for which performance cannot easily be studied in isolation and at small scale. This work discusses Chimbuko, a performance analysis framework that provides real-time, in situ anomaly detection. By focusing specifically on performance anomalies and their origin (aka provenance), data volumes are dramatically reduced without losing necessary details. To the best of our knowledge, Chimbuko is the first online, distributed, and scalable workflow-level performance trace analysis framework. We demonstrate the tool's usefulness on Oak Ridge National Laboratory's Summit system.

97 MATHEMATICS AND COMPUTING↗

Integrating Asynchronous Task Parallelism with OpenSHMEM, In: OpenSHMEM 2016: OpenSHMEM and Related Technologies. Enhancing OpenSHMEM for Hybrid Environments

Partitioned Global Address Space (PGAS) programming models combine shared and distributed memory features, and provide a foundation for high-productivity parallel programming using lightweight one-sided communications. The OpenSHMEM programming interface has recently begun gaining popularity as a lightweight library-based approach for developing PGAS applications, in part through its use of a symmetric heap to realize more efficient implementations of global pointers than in other PGAS systems. However, current approaches to hybrid inter-node and intra-node parallel programming in OpenSHMEM rely on the use of multithreaded programming models (e.g., pthreads, OpenMP) that harness intra-node parallelism but are opaque to the OpenSHMEM runtime. This OpenSHMEM+X approach can encounter performance challenges such as bottlenecks on shared resources, long pause times due to load imbalances, and poor data locality. Furthermore, OpenSHMEM+X requires the expertise of hero-level programmers, compared to the use of just OpenSHMEM. All of these are hard challenges to mitigate with incremental changes. This situation will worsen as computing nodes increase their use of accelerators and heterogeneous memories.

Computer Science↗

Defensive Islanding to Enhance the Resilience of Distribution Systems Against Cyber-Induced Failures

The extensive integration of communication, computation, and control technologies into cyber-physical power systems (CPPSs) has increased the vulnerabilities of CPPSs to cyberattacks. This calls for developing solutions that assess and reduce the impacts of cyber-induced failures on CPPSs. This paper proposes a defensive islanding strategy to isolate impacted parts of the CPPS and form self-sufficient islanded grids with an objective of minimum load curtailment. The defensive islanding aims to split a power system into smaller grids to improve its resilience against a potential extreme event. A clustering approach that leverages the hierarchical spectral clustering method is utilized for the optimal defensive islanding. The proposed approach captures the fragility behavior and loading conditions of power system components due to cyber-induced failures. A graphical-based coupling framework is used to map the impacts of cyber failures into operation of power system components. The proposed method is demonstrated on a modified 33-node distribution feeder system integrated with distributed energy resources. The amount of load curtailment and radiality constraints have been used to evaluate the performance of the proposed clustering strategies. The results show the capability of the proposed algorithm to create islands considering the cyber-induced failures for enhanced resilience.

cyber-induced failures↗

Approximate Scheduling of DERs with Discrete Complex Injections

Rapid penetration of renewable energy based Distributed Energy Resources (DER) has the potential to exacerbate the challenges inherent in grid frequency and voltage regulation. However, their real time controllability can be leveraged to not only mitigate such challenges, but improve the economics and quality of grid operations. A plethora of DER scheduling algorithms have been developed for fast and efficient scheduling of these resources. These algorithms schedule the complex - real and reactive power injected into (or drawn from) the grid by the DERs under various cost objective functions and grid constraints. However, a vast majority of such algorithms assume the feasible range of power injections to be continuous. In reality, the control options available for several DERs form a discrete space. This implies that the feasible range of power injections also forms a discrete space. This makes DER scheduling an NP-hard problem. Integer/Mixed Integer program based algorithms, which guarantee optimality in the objective value, have been developed. But these are prohibitively expensive in terms of computational time requirements. On the other hand, fast heuristic based solutions have also been developed. But as they do not provide any guarantee on the optimality of the objective, or on satisfying the constraints, they are unreliable for grid operations. Recent works have developed approximation algorithms which offer the best of both the approaches above: (near) optimality and low computational complexity, both of which are governed by a user defined accuracy parameter ϵ. In this work, we significantly improve upon such existing works by developing an approximation algorithm which schedules DERs with complex injections (as opposed to only real injection) and whose runtime is polynomial (as opposed to exponential) in 1/ϵ. We provide theoretical analysis and support them with experimental results to validate the guarantees provided by our approximation algorithm.

14 SOLAR ENERGY↗

Communication Simulations for Power System Applications

New smart grid technologies and concepts, such as dynamic pricing, demand response, dynamic state estimation, and wide area monitoring, protection, and control, are expected to require considerable communication resources. As the cost of retrofit can be high, future power grids will require the integration of high-speed, secure connections with legacy communication systems, while still providing adequate system control and security. While considerable work has been performed to create co-simulators for the power domain with load models and market operations, limited work has been performed in integrating communications directly into a power domain solver. The simulation of communication and power systems will become more important as the two systems become more inter-related. This paper will discuss ongoing work at Pacific Northwest National Laboratory to create a flexible, high-speed power and communication system co-simulator for smart grid applications. The framework for the software will be described, including architecture considerations for modular, high performance computing and large-scale scalability (serialization, load balancing, partitioning, cross-platform support, etc.). The current simulator supports the ns-3 (telecommunications) and GridLAB-D (distribution systems) simulators. Ongoing and future work will be described, including planned future expansions for a traditional transmission solver. A test case using the co-simulator, utilizing a transactive demand response system created for the Olympic Peninsula and AEP gridSMART demonstrations, requiring two-way communication between distributed and centralized market devices, will be used to demonstrate the value and intended purpose of the co-simulation environment.

co-simulation↗

Formally Verified ZTA Requirements for OT/ICS Environments with Isabelle/HOL

The clean energy transformation includes the integration of distributed energy resources with the power grid, which has led to a substantial increase in the complexity of power grids infrastructure and the underlying operational technology environment. Power grids infrastructure represents an operational technology environment that has become a system of systems, integrating heterogeneous devices which are both software-and hardware-intensive; as a result, there are increasing demands to exploit advances in the commodity of software-hardware infrastructures to improve energy systems requirements such as cybersecurity and resilience. In such a setting, system requirements at different levels mix, which leads to vulnerabilities and undesirable outcomes. The use of formal methods to characterize and prove system requirements removes ambiguity, increases automation, and provides high levels of assurance and reliability. In this paper, we contribute a methodology and a framework for the system-level verification of zero trust architecture requirements in operational technology environments. We define a formal specification for the core functionalities of operational technology environments, the corresponding invariants, and security proofs. Of particular note is our modular approach for the formal verification of asynchronous interactions in operational technology environments. The formal specification and the proofs have been mechanized using the interactive theorem proving environment Isabelle/HOL.

formal methods↗

Modeling the Strategic Behavior of an Active Distribution Network in the ISO Markets

With increasing integration of distributed energy resources (DERs), active distribution networks (ADNs) can actively participate in the electricity markets by dispatching their DERs, which can change the existing electricity market paradigm. It is essential to investigate the strategic behaviors of ADNs and their DER dispatch when they participate in the wholesale market as price-makers. This paper proposes a bi-level optimization model to study the strategic behavior of an ADN in both energy and reserve markets. The optimal scheduling of DERs in the ADN is modeled as the upper level problem and the joint energy and reserve market-clearing of the ISO is modeled as the lower-level problem. The two-level optimization models exchange bidding information and energy/reserve prices with each other. The proposed bi-Ievel optimization problem is converted to a mathematical programming with equilibrium constraints (MPEC) by using Karush-Kuhn Tucker (KKT) conditions and strong duality theory. Further, the MPEC problem is reformulated as a computationally-solvable mixed integer second order cone programming (MISOCP) model. The simulation results on an illustrative case demonstrate the impact of the strategic bidding of the ADN on the day-ahead energy and reserve market prices.

active distribution network↗

Modeling the Strategic Behavior of an Active Distribution Network in the ISO Markets

With increasing integration of distributed energy resources (DERs), active distribution networks (ADNs) can actively participate in the electricity markets by dispatching their DERs, which can change the existing electricity market paradigm. It is essential to investigate the strategic behaviors of ADNs and their DER dispatch when they participate in the wholesale market as price-makers. This paper proposes a bi-level optimization model to study the strategic behavior of an ADN in both energy and reserve markets. The optimal scheduling of DERs in the ADN is modeled as the upper level problem and the joint energy and reserve market-clearing of the ISO is modeled as the lower-level problem. The two-level optimization models exchange bidding information and energy/reserve prices with each other. The proposed bi-Ievel optimization problem is converted to a mathematical programming with equilibrium constraints (MPEC) by using Karush-Kuhn Tucker (KKT) conditions and strong duality theory. Further, the MPEC problem is reformulated as a computationally-solvable mixed integer second order cone programming (MISOCP) model. The simulation results on an illustrative case demonstrate the impact of the strategic bidding of the ADN on the day-ahead energy and reserve market prices.

Xue, Yaosuo↗

Modular Quantum Processor with an All-to-All Reconfigurable Router

Superconducting qubits provide a promising approach to large-scale fault-tolerant quantum computing. However, qubit connectivity on a planar surface is typically restricted to only a few neighboring qubits. Achieving longer-range and more flexible connectivity, which is particularly appealing in light of recent developments in error-correcting codes, however, usually involves complex multilayer packaging and external cabling, which is resource intensive and can impose fidelity limitations. Here, we propose and realize a high-speed on-chip quantum processor that supports reconfigurable all-to-all coupling with a large on-off ratio. We implement the design in a four-node quantum processor, built with a modular design comprising a wiring substrate coupled to two separate qubit-bearing substrates, each including two single-qubit nodes. We use this device to demonstrate reconfigurable controlled-𝑍 gates across all qubit pairs, with a benchmarked average fidelity of 96.00% ± 0.08% and best fidelity of 97.14% ± 0.07%, limited mainly by dephasing in the qubits. We also generate multiqubit entanglement, distributed across the separate modules, demonstrating GHZ-3 and GHZ-4 states with fidelities of 88.15% ± 0.24% and 75.18% ± 0.11%, respectively. This approach promises efficient scaling to larger-scale quantum circuits and offers a pathway for implementing quantum algorithms and error-correction schemes that benefit from enhanced qubit connectivity.

Quantum circuits↗

Improved Particle Swarm Algorithm Using Rubik’s Cube Topology for Bilevel Building Energy Transaction

Following the rapid growth of distributed energy resources (e.g., renewables, battery), localized peer-to-peer energy transactions are receiving more attention for multiple benefits, such as reducing power loss and stabilizing the main power grid. To promote distributed renewables locally, the local trading price is usually set to be within the external energy purchasing and selling price range. Consequently, building prosumers are motivated to trade energy through a local transaction center. This local energy transaction is modeled in bilevel optimization game. A selfish upper level agent is assumed with the privilege to set the internal energy transaction price with an objective of maximizing its arbitrage profit. Meanwhile, the building prosumers at the lower level will response to this transaction price and make decisions on electricity transaction amount. Therefore, this non-cooperative leader-follower trading game is seeking for equilibrium solutions on the energy transaction amount and prices. Additionally, a uniform local transaction price structure (purchase price equals selling price) is considered here. Aiming at reducing the computational burden from classical Karush–Kuhn–Tucker (KKT) transformation and protecting the private information of each stakeholder (e.g., building), swarm intelligence-based solution approach is employed for upper level agent to generate trading price and coordinate the transactive operations. On one hand, to decrease the chance of premature convergence in global-best topology, Rubik’s Cube topology is proposed in this study based on further improvement of a two-dimensional square lattice model (i.e., one local-best topology-Von Neumann topology). Rotating operation of the cube is introduced to dynamically changing the neighborhood and enhancing information flow at the later searching state. Several groups of experiments are designed to evaluate the performance of proposed Rubik’s Cube topology-based particle swarm algorithm. The results have validated the effectiveness of proposed topology and operators comparing with global-best version PSO and Von Neumann topology-based PSO and its scalability on larger scale applications.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗