1,467,779 research outputs found

    Modeling of linear fading memory systems

    Get PDF
    Motivated by questions of approximate modeling and identification, we consider various classes of linear time-varying bounded-input-bounded output (BIBO) stable fading memory systems and the characterizations are proved. These include fading memory systems in general, almost periodic systems, and asymptotically periodic systems. We also show that the norm and strong convergence coincide for BIBO stable causal fading memory system

    Exploring Application Performance on Emerging Hybrid-Memory Supercomputers

    Full text link
    Next-generation supercomputers will feature more hierarchical and heterogeneous memory systems with different memory technologies working side-by-side. A critical question is whether at large scale existing HPC applications and emerging data-analytics workloads will have performance improvement or degradation on these systems. We propose a systematic and fair methodology to identify the trend of application performance on emerging hybrid-memory systems. We model the memory system of next-generation supercomputers as a combination of "fast" and "slow" memories. We then analyze performance and dynamic execution characteristics of a variety of workloads, from traditional scientific applications to emerging data analytics to compare traditional and hybrid-memory systems. Our results show that data analytics applications can clearly benefit from the new system design, especially at large scale. Moreover, hybrid-memory systems do not penalize traditional scientific applications, which may also show performance improvement.Comment: 18th International Conference on High Performance Computing and Communications, IEEE, 201

    Timoshenko systems with fading memory

    Full text link
    The decay properties of the semigroup generated by a linear Timoshenko system with fading memory are discussed. Uniform stability is shown to occur within a necessary and sufficient condition on the memory kernel

    Memory functions and Correlations in Additive Binary Markov Chains

    Full text link
    A theory of additive Markov chains with long-range memory, proposed earlier in Phys. Rev. E 68, 06117 (2003), is developed and used to describe statistical properties of long-range correlated systems. The convenient characteristics of such systems, a memory function, and its relation to the correlation properties of the systems are examined. Various methods for finding the memory function via the correlation function are proposed. The inverse problem (calculation of the correlation function by means of the prescribed memory function) is also solved. This is demonstrated for the analytically solvable model of the system with a step-wise memory function.Comment: 11 pages, 5 figure

    Dual redundant core memory systems

    Get PDF
    Electronic memory system consisting of series redundant drive switch circuits, triple redundant majority voted memory timing functions, and two data registers to provide functional dual redundancy is described. Signal flow through the circuits is illustrated and equence of events which occur within the memory system is explained

    Memory erasure in small systems

    Full text link
    We consider an overdamped nanoparticle in a driven double-well potential as a generic model of an erasable one-bit memory. We study in detail the statistics of the heat dissipated during an erasure process and show that full erasure may be achieved by dissipating less heat than the Landauer bound. We quantify the occurrence of such events and propose a single-particle experiment to verify our predictions. Our results show that Landauer's principle has to be generalized at the nanoscale to accommodate heat fluctuations.Comment: 4 pages, 4 figure
    • …
    corecore