Generic design of Chinese remaindering schemes

We propose a generic design for Chinese remainder algorithms. A Chinese remainder computation consists in reconstructing an integer value from its residues modulo non coprime integers. We also propose an efficient linear data structure, a radix ladder, for the intermediate storage and computations. Our design is structured into three main modules: a black box residue computation in charge of computing each residue; a Chinese remaindering controller in charge of launching the computation and of the termination decision; an integer builder in charge of the reconstruction computation. We then show that this design enables many different forms of Chinese remaindering (e.g. deterministic, early terminated, distributed, etc.), easy comparisons between these forms and e.g. user-transparent parallelism at different parallel grains

Adaptive Triangular System Solving

Large-scale applications and software systems are getting increasingly complex. To deal with this complexity, those systems must manage themselves in accordance with high-level guidance from humans. Adaptive and hybrid algorithms enable this self-management of resources and structured inputs. In this talk, we first propose a classification of the different notions of adaptivity. For us, an algorithm is adaptive (or a poly-algorithm) when there is a choice at a high level between at least two distinct algorithms, each of which could solve the same problem. The choice is strategic, not tactical. It is motivated by an increase of the performance of the execution, depending on both input/output data and computing resources. Then we propose a new adaptive algorithm for the exact simultaneous resolution of several triangular systems over finite fields. The resolution of such systems is e.g. one of the two main operations in block Gaussian elimination. For solving triangular systems over finite fields, the block algorithm reduces to matrix multiplication and achieves the best known algebraic complexity. Exact matrix multiplication, together with matrix factorizations, over finite fields can now be performed at the speed of the highly optimized numerical BLAS routines. This has been established by the FFLAS and FFPACK libraries. In this talk we propose several practicable variants solving these systems: a pure recursive version, a reduction to the numerical dtrsm routine and a delaying of the modulus operation. Then a cascading scheme is proposed to merge these variants into an adaptive sequential algorithm. We then propose a parallelization of this resolution. The adaptive sequential algorithm is not the best parallel algorithm since its recursion induces a dependancy. A better parallel algorithm would be to first invert the matrix and then to multiply this inverse by the right hand side. Unfortunately the latter requires more total operations than the adaptive algorithm. We thus propose a coupling of the sequential algorithm and of the parallel one in order to get the best performances on any number of processors. The resulting cascading is then an adaptation to resources. This shows that the same process has been used both for adaptation to data and to resources. We thus propose a generic framework for the automatic adaptation of algorithms using recursive cascading

Some Reflections about the Ancient Aqueduct of Galermi (Syracuse, Italy)

Since 2012, the Centre Camille Jullian team carries out an interdisciplinary study of the aqueduct Galermi, architectural work and hydraulic engineering of about 30 km long. This aqueduct, built between the 5th century BC and the Roman Empire, first supplied drinking water to Greek and/or Roman Syracuse. In the 16th–17th centuries, partial transformations have been done and changed the function of the channel, with the installation of flour mills. In the 19th century, the new Italian state gradually expropriated immediate neighbors who exploited abusively the aqueduct. It was then devoted only to irrigate the Syracusan territory according to a system of concessions that has almost remained unchanged since the 19th century. The paper will present this program and the last results that the team obtained in the last two years, particularly about intakes of water and underground galleries, and which chronology can be proposed

Recursion based parallelization of exact dense linear algebra routines for Gaussian elimination

International audienceWe present block algorithms and their implementation for the parallelization of sub-cubic Gaussian elimination on shared memory architectures.Contrarily to the classical cubic algorithms in parallel numerical linear algebra, we focus here on recursive algorithms and coarse grain parallelization.Indeed, sub-cubic matrix arithmetic can only be achieved through recursive algorithms making coarse grain block algorithms perform more efficiently than fine grain ones. This work is motivated by the design and implementation of dense linear algebraover a finite field, where fast matrix multiplication is used extensively and where costly modular reductions also advocate for coarse grain block decomposition. We incrementally build efficient kernels, for matrix multiplication first, then triangular system solving, on top of which a recursive PLUQ decomposition algorithm is built. We study the parallelization of these kernels using several algorithmic variants: either iterative or recursive and using different splitting strategies. Experiments show that recursive adaptive methods for matrix multiplication, hybrid recursive-iterative methods for triangular system solve and tile recursive versions of the PLUQ decomposition, together with various data mapping policies, provide the best performance on a 32 cores NUMA architecture. Overall, we show that the overhead of modular reductions is more than compensated by the fast linear algebra algorithms and that exact dense linear algebra matches the performance of full rank reference numerical software even in the presence of rank deficiencies

Secret Key Leakage from Public Key Perturbation of DLP-based Cryptosystems

Finding efficient countermeasures for cryptosystems against fault attacks is challenged by a constant discovery of flaws in designs. Even elements, such as public keys, that do not seem critical must be protected. From the attacks against RSA, we develop a new attack of DLP-based cryptosystems, built in addition on a lattice analysis to recover DSA public keys from partially known nonces. Based on a realistic fault model, our attack only requires 16 faulty signatures to recover a 160-bit DSA secret key within a few minutes on a standard PC. These results significantly improves the previous public element fault attack in the context of DLP-based cryptosystems

Anchoring Secreted Proteins in Endoplasmic Reticulum by Plant Oleosin: The Example of Vitamin B12 Cellular Sequestration by Transcobalamin

BACKGROUND: Oleosin is a plant protein localized to lipid droplets and endoplasmic reticulum of plant cells. Our idea was to use it to target functional secretory proteins of interest to the cytosolic side of the endoplasmic reticulum of mammalian cells, through expressing oleosin-containing chimeras. We have designed this approach to create cellular models deficient in vitamin B12 (cobalamin) because of the known problematics associated to the obtainment of effective vitamin B12 deficient cell models. This was achieved by the overexpression of transcobalamin inside cells through anchoring to oleosin. METHODOLOGY: chimera gene constructs including transcobalamin-oleosin (TC-O), green fluorescent protein-transcobalamin-oleosin (GFP-TC-O) and oleosin-transcobalamin (O-TC) were inserted into pAcSG2 and pCDNA3 vectors for expression in sf9 insect cells, Caco2 (colon carcinoma), NIE-115 (mouse neuroblastoma), HEK (human embryonic kidney), COS-7 (Green Monkey SV40-transfected kidney fibroblasts) and CHO (Chinese hamster ovary cells). The subcellular localization, the changes in vitamin B12 binding activity and the metabolic consequences were investigated in both Caco2 and NIE-115 cells. PRINCIPAL FINDINGS: vitamin B12 binding was dramatically higher in TC-O than that in O-TC and wild type (WT). The expression of GFP-TC-O was observed in all cell lines and found to be co-localized with an ER-targeted red fluorescent protein and calreticulin of the endoplasmic reticulum in Caco2 and COS-7 cells. The overexpression of TC-O led to B12 deficiency, evidenced by impaired conversion of cyano-cobalamin to ado-cobalamin and methyl-cobalamin, decreased methionine synthase activity and reduced S-adenosyl methionine to S-adenosyl homocysteine ratio, as well as increases in homocysteine and methylmalonic acid concentration. CONCLUSIONS/SIGNIFICANCE: the heterologous expression of TC-O in mammalian cells can be used as an effective strategy for investigating the cellular consequences of vitamin B12 deficiency. More generally, expression of oleosin-anchored proteins could be an interesting tool in cell engineering for studying proteins of pharmacological interest

The EPOC project: Energy Proportional and Opportunistic Computing system

15397International audienceWith the emergence of the Future Internet and the dawning of new IT models such as cloud computing, the usage of data centers (DC), and consequently their power consumption, increase dramatically. Besides the ecological impact, the energy consumption is a predominant criteria for DC providers since it determines the daily cost of their infrastructure. As a consequence, power management becomes one of the main challenges for DC infrastructures and more generally for large-scale distributed systems. In this paper, we present the EPOC project which focuses on optimizing the energy consumption of mono-site DCs connected to the regular electrical grid and to renewable energy sources