Load-sharing policies in parallel simulation of agent-based demographic models

Execution parallelism in agent-Based Simulation (ABS) allows to deal with complex/large-scale models. This raises the need for runtime environments able to fully exploit hardware parallelism, while jointly offering ABS-suited programming abstractions. In this paper, we target last-generation Parallel Discrete Event Simulation (PDES) platforms for multicore systems. We discuss a programming model to support both implicit (in-place access) and explicit (message passing) interactions across concurrent Logical Processes (LPs). We discuss different load-sharing policies combining event rate and implicit/explicit LPs’ interactions. We present a performance study conducted on a synthetic test case, representative of a class of agent-based models.Peer ReviewedPostprint (author's final draft

A Case Study for Reversible Computing: Reversible Debugging of Concurrent Programs

International audienceReversible computing allows one to run programs not only in the usual forward direction, but also backward. A main application area for reversible computing is debugging, where one can use reversibility to go backward from a visible misbehaviour towards the bug causing it. While reversible debugging of sequential systems is well understood, reversible debugging of concurrent and distributed systems is less settled. We present here two approaches for debugging concurrent programs, one based on backtracking, which undoes actions in reverse order of execution, and one based on causal consistency, which allows one to undo any action provided that its consequences, if any, are undone beforehand. The first approach tackles an imperative language with shared memory, while the second one considers a core of the functional message-passing language Erlang. Both the approaches are based on solid formal foundations

Alkylation of the Tumor Suppressor PTEN Activates Akt and β-Catenin Signaling: A Mechanism Linking Inflammation and Oxidative Stress with Cancer

PTEN, a phosphoinositide-3-phosphatase, serves dual roles as a tumor suppressor and regulator of cellular anabolic/catabolic metabolism. Adaptation of a redox-sensitive cysteinyl thiol in PTEN for signal transduction by hydrogen peroxide may have superimposed a vulnerability to other mediators of oxidative stress and inflammation, especially reactive carbonyl species, which are commonly occurring by-products of arachidonic acid peroxidation. Using MCF7 and HEK-293 cells, we report that several reactive aldehydes and ketones, e.g. electrophilic α,β-enals (acrolein, 4-hydroxy-2-nonenal) and α,β-enones (prostaglandin A2, Δ12-prostaglandin J2 and 15-deoxy-Δ-12,14-prostaglandin J2) covalently modify and inactivate cellular PTEN, with ensuing activation of PKB/Akt kinase; phosphorylation of Akt substrates; increased cell proliferation; and increased nuclear β-catenin signaling. Alkylation of PTEN by α,β-enals/enones and interference with its restraint of cellular PKB/Akt signaling may accentuate hyperplastic and neoplastic disorders associated with chronic inflammation, oxidative stress, or aging

Habitat effects on the breeding performance of three forest-dwelling hawks

PLoS ONE 10(9): e0137877Habitat loss causes population declines, but the mechanisms are rarely known. In the European Boreal Zone, loss of old forest due to intensive forestry is suspected to cause declines in forest-dwelling raptors by reducing their breeding performance. We studied the boreal breeding habitat and habitat-associated breeding performance of the northern goshawk (Accipiter gentilis), common buzzard (Buteo buteo) and European honey buzzard (Pernis apivorus). We combined long-term Finnish bird-of-prey data with multi-source national forest inventory data at various distances (100–4000 m) around the hawk nests. We found that breeding success of the goshawk was best explained by the habitat within a 2000-m radius around the nests; breeding was more successful with increasing proportions of old spruce forest and water, and decreasing proportions of young thinning forest. None of the habitat variables affected significantly the breeding success of the common buzzard or the honey buzzard, or the brood size of any of the species. The amount of old spruce forest decreased both around goshawk and common buzzard nests and throughout southern Finland in 1992–2010. In contrast, the area of young forest increased in southern Finland but not around hawk nests. We emphasize the importance of studying habitats at several spatial and temporal scales to determine the relevant species-specific scale and to detect environmental changes. Further effort is needed to reconcile the socioeconomic and ecological functions of forests and habitat requirements of old forest specialists.Peer reviewe

Reversing Unbounded Petri Nets

International audienceIn Petri nets, computation is performed by executing transitions. An effect-reverse of a given transition b is a transition that, when executed, undoes the effect of b. A transition b is reversible if it is possible to add enough effect-reverses of b so to always being able to undo its effect, without changing the set of reachable markings. This paper studies the transition reversibility problem: in a given Petri net, is a given transition b reversible? We show that, contrarily to what happens for the subclass of bounded Petri nets, the transition reversibility problem is in general undecidable. We show, however, that the same problem is decidable in relevant subclasses beyond bounded Petri nets, notably including all Petri nets which are cyclic, that is where the initial marking is reachable from any reachable marking. We finally show that some non-reversible Petri nets can be restructured, in particular by adding new places, so to make them reversible, while preserving their behaviour

From Reversible Semantics to Reversible Debugging

International audienceThis paper presents a line of research in reversible computing for concurrent systems. This line of research started in 2004 with the definition of the first reversible extensions for concurrent process calculi such as CCS, and is currently heading to the production of practical reversible debuggers for concurrent languages such as Erlang. Main questions that had to be answered during the research include the following. Which is the correct notion of reversibility for concurrent systems? Which history information needs to be stored? How to control the basic reversibility mechanism? How to exploit reversibility for debugging? How to apply reversible debugging to real languages