Optimizing Event-Driven Simulations

Event-driven molecular dynamics is a valuable tool in condensed and soft matter physics when particles can be modeled as hard objects or more generally if their interaction potential can be modeled in a stepwise fashion. Hard spheres model has been indeed widely used both for computational and theoretical description of physical systems. Recently further developments of computational techniques allow simulations of hard rigid objects of generic shape. In present paper we will present some optimizations for event-driven simulations that offered significant speedup over previous methods. In particular we will describe a generalization of well known linked list method and an improvement on nearest neighbor lists method recently proposed by us.Comment: Submitted to Comp. Phys. Comm. Special Issue for CCP201

Event-Driven Network Programming

Software-defined networking (SDN) programs must simultaneously describe static forwarding behavior and dynamic updates in response to events. Event-driven updates are critical to get right, but difficult to implement correctly due to the high degree of concurrency in networks. Existing SDN platforms offer weak guarantees that can break application invariants, leading to problems such as dropped packets, degraded performance, security violations, etc. This paper introduces EVENT-DRIVEN CONSISTENT UPDATES that are guaranteed to preserve well-defined behaviors when transitioning between configurations in response to events. We propose NETWORK EVENT STRUCTURES (NESs) to model constraints on updates, such as which events can be enabled simultaneously and causal dependencies between events. We define an extension of the NetKAT language with mutable state, give semantics to stateful programs using NESs, and discuss provably-correct strategies for implementing NESs in SDNs. Finally, we evaluate our approach empirically, demonstrating that it gives well-defined consistency guarantees while avoiding expensive synchronization and packet buffering

An Event-Driven Multi-Kernel Convolution Processor Module for Event-Driven Vision Sensors

Event-Driven vision sensing is a new way of sensing visual reality in a frame-free manner. This is, the vision sensor (camera) is not capturing a sequence of still frames, as in conventional video and computer vision systems. In Event-Driven sensors each pixel autonomously and asynchronously decides when to send its address out. This way, the sensor output is a continuous stream of address events representing reality dynamically continuously and without constraining to frames. In this paper we present an Event-Driven Convolution Module for computing 2D convolutions on such event streams. The Convolution Module has been designed to assemble many of them for building modular and hierarchical Convolutional Neural Networks for robust shape and pose invariant object recognition. The Convolution Module has multi-kernel capability. This is, it will select the convolution kernel depending on the origin of the event. A proof-of-concept test prototype has been fabricated in a 0.35 m CMOS process and extensive experimental results are provided. The Convolution Processor has also been combined with an Event-Driven Dynamic Vision Sensor (DVS) for high-speed recognition examples. The chip can discriminate propellers rotating at 2 k revolutions per second, detect symbols on a 52 card deck when browsing all cards in 410 ms, or detect and follow the center of a phosphor oscilloscope trace rotating at 5 KHz.Unión Europea 216777 (NABAB)Ministerio de Ciencia e Innovación TEC2009-10639-C04-0

Event-driven Adaptation in COP

Context-Oriented Programming languages provide us with primitive constructs to adapt program behaviour depending on the evolution of their operational environment, namely the context. In previous work we proposed ML_CoDa, a context-oriented language with two-components: a declarative constituent for programming the context and a functional one for computing. This paper describes an extension of ML_CoDa to deal with adaptation to unpredictable context changes notified by asynchronous events.Comment: In Proceedings PLACES 2016, arXiv:1606.0540

Asynchronous Networks and Event Driven Dynamics

Real-world networks in technology, engineering and biology often exhibit dynamics that cannot be adequately reproduced using network models given by smooth dynamical systems and a fixed network topology. Asynchronous networks give a theoretical and conceptual framework for the study of network dynamics where nodes can evolve independently of one another, be constrained, stop, and later restart, and where the interaction between different components of the network may depend on time, state, and stochastic effects. This framework is sufficiently general to encompass a wide range of applications ranging from engineering to neuroscience. Typically, dynamics is piecewise smooth and there are relationships with Filippov systems. In the first part of the paper, we give examples of asynchronous networks, and describe the basic formalism and structure. In the second part, we make the notion of a functional asynchronous network rigorous, discuss the phenomenon of dynamical locks, and present a foundational result on the spatiotemporal factorization of the dynamics for a large class of functional asynchronous networks

Event-driven displays for manipulator control

The problem of constructing event-related information displays from multidimensional data generated by proximity, force-torque and tactile sensors integrated with the terminal device of a remotely controlled manipulator is considered. Event-driven displays are constructed by using appropriate algorithms acting on sensory data in real time. Event-driven information displays lessen the operator's workload and improve control performance. The paper describes and discusses several event-driven display examples that were implemented in the JPL teleoperator project, including a brief outline of the data handling system which drives the graphics display in real time. The paper concludes with a discussion of future plans to integrate event-driven displays with visual (TV) information

Event-Driven Molecular Dynamics in Parallel

Although event-driven algorithms have been shown to be far more efficient than time-driven methods such as conventional molecular dynamics, they have not become as popular. The main obstacle seems to be the difficulty of parallelizing event-driven molecular dynamics. Several basic ideas have been discussed in recent years, but to our knowledge no complete implementation has been published yet. In this paper we present a parallel event-driven algorithm including dynamic load-balancing, which can be easily implemented on any computer architecture. To simplify matters our explanations refer to a basic multi-particle system of hard spheres, but can be extended easily to a wide variety of possible models.Comment: 10 pages, 9 figure

Comments on event driven animation

Event driven animation provides a general method of describing controlling values for various computer animation techniques. A definition and comments are provided on genralizing motion description with events. Additional comments are also provided about the implementation of twixt