We consider the initial-value problem for the one-dimensional, time-dependent wave equation with positive, Lipschitz continuous coefficients, which are constant outside a bounded region. Under the assumption of compact support of the initial data, we prove that the local energy decays exponentially fast in time, and provide the explicit constant to which the solution converges for large times. We give explicit estimates of the rate of this exponential decay by two different techniques. The first one is based on the definition of a modified, weighted local energy, with suitably constructed weights. The second one is based on the integral formulation of the problem and, under a more restrictive assumption on the variation of the coefficients, allows us to obtain improved decay rates.
The paper is focused on the new approach to electric power distribution. Following the analogy of telecommunications network and power grids evolution a power packetizing technology is proposed. The new concept of the Packet Power Grid (PPG) is proposed as a set of different power sources and power consumers joined by power lines and electronic switches controlled by a supporting information computer network. Different electrical sensors form an important part of the PPG as well. The paper overviews the PPG as the next power grid evolution step after the Smart Grid. The PPG approach solves a number of problems of open concurrent power market development e.g. highly-efficient energy usage and numerous small sources adoption. The growing Packet Power Grid can play the role of the global power highway the same way as the Internet plays the role of the global information highway.
Parallel discrete event simulation (PDES) harnesses parallel processing to improve the performance and capacity of simulation, supporting bigger and more detailed models simulated for more scenarios. The presence of interference from other users can lead to dramatic slowdown in the performance of the simulation. Interference is typically managed using operating system scheduling support (e.g., gang scheduling), a heavyweight approach with some drawbacks. We propose an application-level approach to interference resilience through alternative simulation scheduling and mapping algorithms. More precisely, the most resilient simulators allow dynamic mapping of simulation event execution to processing resources (a work pool model). However, this model has significant scheduling overhead and poor cache locality. Thus, we investigate using application-level interference mitigation where the application detects the presence of interference and reacts by changing the thread task allocation. Specifically, we propose a locality-aware adaptive dynamic mapping (LADM) algorithm that adjusts the number of active threads on the fly by detecting the presence of interference. LADM avoids having the application stall when threads are inactive due to context switching. We investigate different mechanisms for monitoring the level of interference and different approaches for remapping tasks. We show that LADM can substantially reduce the impact of interference while maintaining memory locality.
26 January 2022 in Computers & Mathematics with Applications