A Trichotomy for Regular Simple Path Queries on Graphs

Regular path queries (RPQs) select nodes connected by some path in a graph. The edge labels of such a path have to form a word that matches a given regular expression. We investigate the evaluation of RPQs with an additional constraint that prevents multiple traversals of the same nodes. Those regular simple path queries (RSPQs) find several applications in practice, yet they quickly become intractable, even for basic languages such as (aa)* or a*ba*. In this paper, we establish a comprehensive classification of regular languages with respect to the complexity of the corresponding regular simple path query problem. More precisely, we identify the fragment that is maximal in the following sense: regular simple path queries can be evaluated in polynomial time for every regular language L that belongs to this fragment and evaluation is NP-complete for languages outside this fragment. We thus fully characterize the frontier between tractability and intractability for RSPQs, and we refine our results to show the following trichotomy: Evaluations of RSPQs is either AC0, NL-complete or NP-complete in data complexity, depending on the regular language L. The fragment identified also admits a simple characterization in terms of regular expressions. Finally, we also discuss the complexity of the following decision problem: decide, given a language L, whether finding a regular simple path for L is tractable. We consider several alternative representations of L: DFAs, NFAs or regular expressions, and prove that this problem is NL-complete for the first representation and PSPACE-complete for the other two. As a conclusion we extend our results from edge-labeled graphs to vertex-labeled graphs and vertex-edge labeled graphs.Comment: 15 pages, conference submissio

High-energy radiation from the relativistic jet of Cygnus X-3

Cygnus X-3 is an accreting high-mass X-ray binary composed of a Wolf-Rayet star and an unknown compact object, possibly a black hole. The gamma-ray space telescope Fermi found definitive evidence that high-energy emission is produced in this system. We propose a scenario to explain the GeV gamma-ray emission in Cygnus X-3. In this model, energetic electron-positron pairs are accelerated at a specific location in the relativistic jet, possibly related to a recollimation shock, and upscatter the stellar photons to high energies. The comparison with Fermi observations shows that the jet should be inclined close to the line of sight and pairs should not be located within the system. Energetically speaking, a massive compact object is favored. We report also on our investigations of the gamma-ray absorption of GeV photons with the radiation emitted by a standard accretion disk in Cygnus X-3. This study shows that the gamma-ray source should not lie too close to the compact object.Comment: 4 pages, 3 figures, Proceedings of the SF2A conference held in Marseille, 21-24 June 201

Reclaiming the energy of a schedule: models and algorithms

We consider a task graph to be executed on a set of processors. We assume that the mapping is given, say by an ordered list of tasks to execute on each processor, and we aim at optimizing the energy consumption while enforcing a prescribed bound on the execution time. While it is not possible to change the allocation of a task, it is possible to change its speed. Rather than using a local approach such as backfilling, we consider the problem as a whole and study the impact of several speed variation models on its complexity. For continuous speeds, we give a closed-form formula for trees and series-parallel graphs, and we cast the problem into a geometric programming problem for general directed acyclic graphs. We show that the classical dynamic voltage and frequency scaling (DVFS) model with discrete modes leads to a NP-complete problem, even if the modes are regularly distributed (an important particular case in practice, which we analyze as the incremental model). On the contrary, the VDD-hopping model leads to a polynomial solution. Finally, we provide an approximation algorithm for the incremental model, which we extend for the general DVFS model.Comment: A two-page extended abstract of this work appeared as a short presentation in SPAA'2011, while the long version has been accepted for publication in "Concurrency and Computation: Practice and Experience

Approximation algorithms for energy, reliability and makespan optimization problems

In this paper, we consider the problem of scheduling an application on a parallel computational platform. The application is a particular task graph, either a linear chain of tasks, or a set of independent tasks. The platform is made of identical processors, whose speed can be dynamically modified. It is also subject to failures: if a processor is slowed down to decrease the energy consumption, it has a higher chance to fail. Therefore, the scheduling problem requires to re-execute or replicate tasks (i.e., execute twice a same task, either on the same processor, or on two distinct processors), in order to increase the reliability. It is a tri-criteria problem: the goal is to minimize the energy consumption, while enforcing a bound on the total execution time (the makespan), and a constraint on the reliability of each task. Our main contribution is to propose approximation algorithms for these particular classes of task graphs. For linear chains, we design a fully polynomial time approximation scheme. However, we show that there exists no constant factor approximation algorithm for independent tasks, unless P=NP, and we are able in this case to propose an approximation algorithm with a relaxation on the makespan constraint.Dans ce papier, nous considérons le problème d'ordonnancement d'une application sur une plateforme parallèle de calcul. L'application est un graphe de tâches particulier: soit une chaîne de tâche, soit un ensemble de tâches indépendantes. La plateforme est constituée de processeurs identiques, dont la vitesse peut être modifiée dynamiquement. Cette plateforme est aussi sujette à des fautes: lorsque l'on réduit la vitesse d'exécution d'un processeur pour diminuer la consommation d'énergie, ce processeur a une plus grande chance de faillir. C'est pourquoi, pour augmenter la fiabilité du processus, l'ordonnanceur va devoir choisir de re-exécuter ou répliquer certaines tâches (les exécuter deux fois, soit sur le même processeur, soit sur deux processeurs distincts). Le problème est donc tri-critère: nous cherchons à minimiser la consommation d'énergie, tout en préservant une limite sur le temps d'exécution, ainsi qu'une borne sur la fiabilité de chaque tâche. Nos contributions résident en l'écriture d'algorithmes d'approximation efficaces pour les deux classes de graphes étudiées. Dans le cas des chaînes linéaires, nous proposons un schéma d'approximation entièrement polynomial (FPTAS). Puis nous prouvons qu'il n'existe pas d'algorithmes d'approximation à facteur constant dans le cas des tâches indépendantes, sauf si P=NP, mais nous sommes cependant capable d'exhiber un algorithme d'approximation lorsque l'on autorise une relaxation de la contrainte sur le temps d'exécution

Co-Scheduling Algorithms for High-Throughput Workload Execution

This paper investigates co-scheduling algorithms for processing a set of parallel applications. Instead of executing each application one by one, using a maximum degree of parallelism for each of them, we aim at scheduling several applications concurrently. We partition the original application set into a series of packs, which are executed one by one. A pack comprises several applications, each of them with an assigned number of processors, with the constraint that the total number of processors assigned within a pack does not exceed the maximum number of available processors. The objective is to determine a partition into packs, and an assignment of processors to applications, that minimize the sum of the execution times of the packs. We thoroughly study the complexity of this optimization problem, and propose several heuristics that exhibit very good performance on a variety of workloads, whose application execution times model profiles of parallel scientific codes. We show that co-scheduling leads to to faster workload completion time and to faster response times on average (hence increasing system throughput and saving energy), for significant benefits over traditional scheduling from both the user and system perspectives

A kinematic and dynamic comparison of surface and underwater displacement in high level monofin swimming

International audienceFin-swimming performance can be divided into underwater and surface water races. World records are about 10% faster for underwater swimming vs. surface swimming, but little is known about the advantage of underwater swimming for monofin swimming. Some authors reported that the air-water interface influences the kinematics and leads to a narrow vertical amplitude of the fin. On the one hand, surface swimming is expected to affect drag parameters (cross-sectional area (S) and active drag (AD)) when compared to underwater swimming. On the other hand, the surface swimming technique may also affect efficiency (η). The aim of this study is therefore to evaluate and compare drag parameters and efficiency during underwater and surface swimming. To this end, 12 international level monofin swimmers were measured during both underwater and surface swimming. Kinematic parameters (both dimensional and non-dimensional), η (calculated according to the Elongated-Body Theory), and AD (computed with Velocity Perturbation Method) were calculated for an underwater and a surface fin-swimming trial, performed at maximal speed. As expected, results showed significantly lower velocities during surface swimming vs. underwater ( = 2.5 m.s vs. = 2.36 m.s, < .01). Velocities during underwater and surface swimming were strongly correlated ( = .97, < .01). Underwater swimming was also associated with higher vertical amplitudes of the fin compared to surface swimming ( = 0.55 m vs. = 0.46 m, < .01). Length-specific amplitudes (A/L) were in the order of 20% during underwater swimming as for undulating fish, and significantly higher than during surface swimming (A/L = 17%, < .01). Efficiency for surface swimming was about 6% lower than for underwater swimming ( = 0.79 vs. = 0.74, < .01). This decrease could be associated with an increase in swimming frequency for surface swimming ( = 2.15 Hz vs. = 2.08 Hz, < .01). Active drag during surface swimming was about 7% higher than for underwater swimming ( = 78.9 N vs. = 84.7 N, < .01). A significantly smaller cross-sectional area for surface swimming ( = 0.053 m vs. = 0.044 m, < .01) and higher drag coefficient for surface swimming ( = 0.47 vs. = 0.69, < .01) were measured. Finally, correlation between cross-sectional area and vertical amplitude of the fin was reported for both underwater and surface swimming. These results suggest that the performance improvement during underwater swimming is not only linked to a wave drag reduction effect but also to a specific swimming technique due to the free surface

Ran GTPase promotes oocyte polarization by regulating ERM (Ezrin/Radixin/Moesin) inactivation.

International audienceAsymmetric meiotic divisions in mammalian oocytes are driven by the eccentric positioning of the spindle, along with a dramatic reorganization of the overlying cortex, including a loss of microvilli and formation of a thick actin cap. Actin polarization relies on a Ran-GTP gradient centered on metaphase chromosomes; however, the downstream signaling cascade is not completely understood. In a recent study, we have shown that Ran promotes actin cap formation via the polarized activation of Cdc42. The related GTPase Rac is also activated in a polarized fashion in the oocyte cortex and co-localizes with active Cdc42. In other cells, microvilli collapse can be triggered by inactivation of the ERM (Ezrin/Radixin/Moesin) family of actin-membrane crosslinkers under the control of Rac. Accordingly, we show here that Ran-GTP promotes a substantial loss of phosphorylated ERMs in the cortex overlying the spindle in mouse oocytes. However, this polarized phospho-ERM exclusion zone was unaffected by Rac or Cdc42 inhibition. Therefore, we suggest that Ran activates two distinct pathways to regulate actin cap formation and microvilli disassembly in the polarized cortex of mouse oocytes. The possibility of a crosstalk between Rho GTPase and ERM signaling and a role for ERM inactivation in promoting cortical actin dynamics are also discussed

Approximation Algorithms for Energy, Reliability, and Makespan Optimization Problems

International audienceWe consider the problem of scheduling an application on a parallel computational platform. The application is a particular task graph, either a linear chain of tasks, or a set of independent tasks. The platform is made of identical processors, whose speed can be dynamically modified. It is also subject to failures: if a processor is slowed down to decrease the energy consumption, it has a higher chance to fail. Therefore, the scheduling problem requires us to re-execute or replicate tasks (i.e., execute twice the same task, either on the same processor, or on two distinct processors), in order to increase the reliability. It is a tri-criteria problem: the goal is to minimize the energy consumption, while enforcing a bound on the total execution time (the makespan), and a constraint on the reliability of each task. Our main contribution is to propose approximation algorithms for linear chains of tasks and independent tasks. For linear chains, we design a fully polynomial-time approximation scheme. However, we show that there exists no constant factor approximation algorithm for independent tasks, unless P=NP, and we propose in this case an approximation algorithm with a relaxation on the makespan constraint