Kahn Process Networks and a Reactive Extension

Kahn and MacQueen have introduced a generic class of determinate asynchronous data-flow applications, called Kahn Process Networks (KPNs) with an elegant mathematical model and semantics in terms of Scott-continuous functions on data streams together with an implementation model of independent asynchronous sequential programs communicating through FIFO buffers with blocking read and non-blocking write operations. The two are related by the Kahn Principle which states that a realization according to the implementation model behaves as predicted by the mathematical function. Additional steps are required to arrive at an actual implementation of a KPN to take care of scheduling of independent processes on a single processor and to manage communication buffers. Because of the expressiveness of the KPN model, buffer sizes and schedules cannot be determined at design time in general and require dynamic run-time system support. Constraints are discussed that need to be placed on such system support so as to maintain the Kahn Principle.We then discuss a possible extension of the KPN model to include the possibility for sporadic, reactive behavior which is not possible in the standard model. The extended model is called Reactive Process Networks. We introduce its semantics, look at analyzability and at more constrained data-flow models combined with reactive behavior

Reactive concurrent programming revisited

In this note we revisit the so-called reactive programming style, which evolves from the synchronous programming model of the Esterel language by weakening the assumption that the absence of an event can be detected instantaneously. We review some research directions that have been explored since the emergence of the reactive model ten years ago. We shall also outline some questions that remain to be investigated

A multiple replica approach to simulate reactive trajectories

A method to generate reactive trajectories, namely equilibrium trajectories leaving a metastable state and ending in another one is proposed. The algorithm is based on simulating in parallel many copies of the system, and selecting the replicas which have reached the highest values along a chosen one-dimensional reaction coordinate. This reaction coordinate does not need to precisely describe all the metastabilities of the system for the method to give reliable results. An extension of the algorithm to compute transition times from one metastable state to another one is also presented. We demonstrate the interest of the method on two simple cases: a one-dimensional two-well potential and a two-dimensional potential exhibiting two channels to pass from one metastable state to another one

DAF-16/FoxO in Caenorhabditis elegans and its role in metabolic remodeling

DAF-16, the only forkhead box transcription factors class O (FoxO) homolog in Caenorhabditis elegans, integrates signals from upstream pathways to elicit transcriptional changes in many genes involved in aging, development, stress, metabolism, and immunity. The major regulator of DAF-16 activity is the insulin/insulin-like growth factor 1 (IGF-1) signaling (IIS) pathway, reduction of which leads to lifespan extension in worms, flies, mice, and humans. In C. elegans daf-2 mutants, reduced IIS leads to a heterochronic activation of a dauer survival program during adulthood. This program includes elevated antioxidant defense and a metabolic shift toward accumulation of carbohydrates (i.e., trehalose and glycogen) and triglycerides, and activation of the glyoxylate shunt, which could allow fat-to-carbohydrate conversion. The longevity of daf-2 mutants seems to be partially supported by endogenous trehalose, a nonreducing disaccharide that mammals cannot synthesize, which points toward considerable differences in downstream mechanisms by which IIS regulates aging in distinct groups