Transfert versus mutualisation des coûts et des risques d'amont en aval – Apports des notions hydrologiques d'échelle, structure, émergence et impact

International audienceLe bassin versant est l'unité territoriale qui détermine les ressources et les aléas hydrologiques. Son organisation hydrographique est la structure intégratrice des processus et des probabilités d'occurrence. La tendance naturelle des acteurs présents sur ce territoire consiste à prévenir localement les risques par rapport à des enjeux multiples et dispersés. L'agrégation des processus influencés par les aménagements et pratiques anthropiques diffus tend à transférer les risques vers l'aval, vers le futur et/ou vers des usages différents. Nous mettons alors en évidence l'intérêt d'une gestion intégrée du territoire par rapport aux ressources, flux et aléas hydrologiques, au niveau et au sein du bassin versant, autour de la structure hydrographique. Cela s'appuie sur une idée de mutualisation structurée d'amont en aval. Une telle perspective demande d'identifier les variables inter-disciplinaires et les niveaux de gouvernance pertinents pour d'une part expliciter les enjeux et d'autre part établir les règles de mise en oeuvre de la mutualisation. L'objet de cette communication est de présenter cette idée de mutualisation du point de vue hydrologique

A Short Overview of Executing Γ Chemical Reactions over the ΣC and τC Dataflow Programming Models

International audienceMany-core processors offer top computational power while keeping the energy consumption reasonable compared to complex processors. Today, they enter both high-performance computing systems, as well as embedded systems. However, these processors require dedicated programming models to efficiently benefit from their massively parallel architectures. The chemical programming paradigm has been introduced in the late eighties as an elegant way of formally describing distributed programs. Data are seen as molecules that can freely react thanks to operators to create new data. This paradigm has also been used within the context of grid computing and now seems to be relevant for many-core processors. Very few implementations of runtimes for chemical programming have been proposed, none of them giving serious elements on how it can be deployed onto a real architecture. In this paper, we propose to implement some parts of the chemical paradigm over the ΣC dataflow programming language, that is dedicated to many-core processors. We show how to represent molecules using agents and communication links, and to iteratively build the dataflow graph following the chemical reactions. A preliminary implementation of the chemical reaction mechanisms is provided using the τ C dataflow compilation toolchain, a language close to ΣC, in order to demonstrate the relevance of the proposition

Introducing a Data Sliding Mechanism for Cooperative Caching in Manycore Architectures

International audienceIn this paper, we propose a new cooperative caching method improving the cache miss rate for manycore micro- architec- tures. The work is motivated by some limitations of recent adaptive cooperative caching proposals. Elastic Cooperative caching (ECC), is a dynamic memory partitioning mechanism that allows sharing cache across cooperative nodes according to the application behavior. However, it is mainly limited with cache eviction rate in case of highly stressed neighbor- hood. Another system, the adaptive Set-Granular Cooperative Caching (ASCC), is based on finer set-based mechanisms for a better adaptability. However, heavy localized cache loads are not efficiently managed. In such a context, we propose a cooperative caching strategy that consists in sliding data through closer neighbors. When a cache receives a storing request of a neighbor's private block, it spills the least recently used private data to a close neighbor. Thus, solicited saturated nodes slide local blocks to their respective neighbors to always provide free cache space. We also propose a new Priority- based Data Replacement policy to decide efficiently which blocks should be spilled, and a new mechanism to choose host destination called Best Neighbor selector. The first analytic performance evaluation shows that the proposed cache management policies reduce by half the average global communication rate. As frequent accesses are focused in the neighboring zones, it efficiently improves on-Chip traffic. Finally, our evaluation shows that cache miss rate is en- hanced: each tile keeps the most frequently accessed data 1- Hop close to it, instead of ejecting them Off-Chip. Proposed techniques notably reduce the cache miss rate in case of high solicitation of the cooperative zone, as it is shown in the performed experiments

Throughput constrained parallelism reduction in cyclo-static dataflow applications

International audienceThis paper deals with semantics-preserving parallelism reduction methods for cyclo-static dataflow applications. Parallelism reduction is the process of equivalent actors fusioning. The principal objectives of parallelism reduction are to decrease the memory footprint of an application and to increase its execution performance. We focus on parallelism reduction methodologies constrained by application throughput. A generic parallelism reduction methodology is introduced. Experimental results are provided for asserting the performance of the proposed method

Modélisation robuste de l'impact agrégé de retenues collinaires sur l'hydrologie de surface

En raison du développement de l'industrie légumière, les retenues collinaires à vocation d'irrigation se multiplient dans le département du Morbihan (Bretagne, France). Même si de tels aménagements hydrauliques ont une influence individuelle faible, leur multiplication et leur concentration géographique peuvent avoir des conséquences dommageables sur l'hydrologie de surface. Nous proposons d'utiliser une fonction de transfert de type Hydrogramme Unitaire Géomorphologique, basée sur l'identification de la fonction aire normalisée du bassin versant contribuant effectivement à l'écoulement et sur l'estimation d'une vitesse moyenne d'écoulement dans les thalwegs. Le déterminisme de cette fonction de transfert permet de semi-distribuer l'afflux pluviométrique. Il nous permet en outre de proposer une méthodologie de simulation explicite de l'effet agrégé des retenues collinaires, connaissant leur mode de fonctionnement hydraulique local. Puis, pour le bassin versant pilote de l'Yvel (302 km2), nous étudions a priori l'impact de l'implantation de retenues collinaires selon un scénario géographique de développement préférentiel et pour différents degrés d'intensification.In response to the increasing demand from the food industry for fresh produce, many farms located in the administrative county of Morbihan (Brittany, France) have intensified their vegetable crop production (e.g. peas, beans, spinach) due to their high value. To obtain the best yields and to respect contracts signed with industrial partners, irrigation has been widely used by the farming community to support this production. Since 1989, 500 to 600 ha/year of irrigated farmland have been developed with financial support from state, regional and county agencies. The official purpose of this financing program is to irrigate 50% of the fields cultivated for vegetable crops. Water use for irrigation was estimated to be 6 million m3 in 1999. The demand for irrigation coincides with the period of low water levels in the stream. Thus, there is strong competition with drinking water demands and ecological flow requirements. Moreover, the potential use of groundwater to fulfill these demands is not possible. One of the solutions is to build small headwater dams to store winter flows and use this resource during the growing season. In order to help local public authorities assess their strategy, we need to develop a robust quantification method to study the impact of this development.The 302 km2 Yvel watershed is the site of a highly developed region of small headwater dams because the geological substratum is composed mainly of schist with low groundwater reserves, precipitation is less than the regional average, and the industrial demand for vegetable crops is high. For all these reasons, this watershed is particularly vulnerable. Moreover, from a regional policy point of view, the downstream part of the watershed is located within the Morbihan county whereas the upstream part is located within the Côtes d'Armor and Ille et Vilaine counties, which do not provide any financial support for irrigation development. The current concentration of headwater irrigation dams reflects these regional development incentives as dams are mostly built in the downstream part of the watershed.To study the impact of small headwater dams on watershed hydrology, we propose a conceptual tool built around a geomorphological instantaneous unit hydrograph (GIUH) modelling approach. The GIUH structure, which is based on the effective watershed normalized area function and an estimated mean flow velocity, allows for the explicit accounting of dams and, and thus, can be used for a priori assessment studies. It can also be used in a semi-distributed perspective, where spatial discretization is determined from rainfall variabilities instead of gauging station constraints. These two points allowed us to study three regional irrigation development scenarios: construction of 100, 200 and 300 future headwater irrigation dams. Using two observed rainfall events, we showed that the simulated hydrograph shape at the watershed outlet can be significantly modified. In conclusion, in situ observations and simulation results suggest that : (1) headwater dams do not have any impact when reservoirs are full - lamination is locally observed and thus, does not have any impact on the watershed hydrograph; (2) a spatially homogeneous implementation of headwater dams modifies the watershed hydrograph according to a contributing watershed area ratio; similar behaviour is observed for low water level periods; and (3) localized implementation can be studied through modelling with enough precision to give relevant information to decision makers

Using the Spring Physical Model to Extend a Cooperative Caching Protocol for Many-Core Processors

International audienceAs the number of embedded cores grows up, the off-chip memory wall becomes an overwhelming bottleneck. As a consequence, it is more and more prevalent to efficiently exploit on-chip data storage. In a previous work, we proposed a data sliding mechanism that allows to store data onto our closest neighborhood, even under heavy stress loads. However, each cache block is allowed to migrate only one time to a neighbor's cache (e.g. 1-Chance Forwarding). In this paper, we propose an extension of our mechanism in order to expand the cooperative caching area. Our work is based on an adaptive physical model, where each cache block is considered as a mass connected to a spring. This technique constrains data migration according to the spring constant and the difference of work-loads between cores. This adaptive data sliding approach leads to a balanced spread of data on the chip and therefore improves on-chip storage. On-chip data access has been evaluated using an analytical approach. Results show that the extended data sliding increases the global cache hit rate on the chip, especially in the context of juxtaposed hot spots

Modèles et protocoles de cohérence des données en environnement volatil

Ce rapport s'intéresse au problème de la visualisation des données partagées dans les applications à base de couplage de codes sur les grilles. Nous proposons d'améliorer l'efficacité de la visualisation en intervenant sur les mécanismes de gestion des données répliquées et plus particulièrement au niveau du protocole de cohérence. La notion de lecture relâchée est alors introduite comme une extension du modèle de cohérence à l'entrée (entry consistency). Ce nouveau type d'opération peut être réalisé sans prise de verrou, en parallèle avec des écritures. En revanche, l'utilisateur relâche les contraintes sur la fraîcheur de la donnée et accepte de lire des versions légèrement anciennes, dont le retard est néanmoins contrôlé. L'implémentation de cette approche au sein du service de partage de données pour grilles JuxMem montre des gains considérables par rapport à une implémentation classique basée sur des lectures avec prise de verrou