INRIA

Displaying 1-40 of 541 results

  • White Papers // Mar 2014

    Evaluating Streaming Strategies for Event Processing across Infrastructure Clouds

    Infrastructure clouds revolutionized the way in which the authors approach resource procurement by providing an easy way to lease compute and storage resources on short notice, for a short amount of time, and on a pay-as-you-go basis. This new opportunity, however, introduces new performance trade-offs. Making the right choices in...

    Provided By INRIA

  • White Papers // Mar 2014

    Sum-of-Product Architectures Computing Just Right

    Many digital filters and signal-processing transforms can be expressed as a Sum of Products with Constants (SPC). This paper addresses the automatic construction of low-precision, but high accuracy SPC architectures: these architectures are specified as last-bit accurate with respect to a mathematical definition. In other words, they behave as if...

    Provided By INRIA

  • White Papers // Jan 2014

    Interactive Inference of Join Queries

    The authors investigate the problem of inferring join queries from user interactions. The user is presented with a set of candidate tuples and is asked to label them as positive or negative depending on whether or not she would like the tuples as part of the join result. The goal...

    Provided By INRIA

  • White Papers // Jan 2014

    Context-Aware Top-k Processing using Views

    Search applications where queries are dependent on their context are becoming increasingly relevant in today's online applications. For example, the context may be the location of the user in location-aware search or the social network of the query initiator in social-aware search. Processing such queries efficiently is inherently difficult, and...

    Provided By INRIA

  • White Papers // Jan 2014

    Deduction with Contradictions in Datalog

    The authors study deduction in the presence of inconsistencies. Following previous works, they capture deduction via datalog programs and in-consistencies through violations of Functional Dependencies (FDs). They study and compare two semantics for datalog with FDs: the first, of a logical nature, is based on inferring facts one at a...

    Provided By INRIA

  • White Papers // Dec 2013

    A Fine-grained Approach for Power Consumption Analysis and Prediction

    Power consumption has become a critical concern in modern computing systems for various reasons including financial savings and environmental protection. With battery powered devices, the authors need to care about the available amount of energy since it is limited. For the case of supercomputers, as they imply a large aggregation...

    Provided By INRIA

  • White Papers // Dec 2013

    Toward Better Simulation of MPI Applications on Ethernet/TCP Networks

    In the High Performance Computing (HPC) field, accurately predicting the execution time of parallel applications is of utmost importance to assess their scalability, and this is particularly true for applications slated for deployment on next-generation exascale systems. While much effort has been put towards understanding the high-level behavior of these...

    Provided By INRIA

  • White Papers // Nov 2013

    Extracting UML/OCL Integrity Constraints and Derived Types from Relational Databases

    Relational databases usually enforce relevant organizational business rules. This aspect is ignored by current database reverse engineering approaches which only focus on the extraction of the structural part of the conceptual schema. Other database elements like triggers, views, column constraints, etc. are not considered by those methods. As a result,...

    Provided By INRIA

  • White Papers // Nov 2013

    Reasoning About Pattern-Based XML Queries

    The authors survey results about static analysis of pattern-based queries over XML documents. These queries are analogs of conjunctive queries, their unions and Boolean combinations, in which tree patterns play the role of atomic formulae. As in the relational case, they can be viewed as both queries and incomplete documents,...

    Provided By INRIA

  • White Papers // Nov 2013

    Dynamic Workload-Based Partitioning Algorithms for Continuously Growing Databases

    Applications with very large databases, where data items are continuously appended, are becoming more and more common. Thus, the development of efficient data partitioning is one of the main requirements to yield good performance. In the case of applications that have complex access patterns, e.g. scientific applications, workload-based partitioning could...

    Provided By INRIA

  • White Papers // Oct 2013

    WaRG: Warehousing RDF Graphs

    Databases of facts, each characterized by multiple dimensions, whose values are recorded in measures, are at the core of multidimensional Data Warehouses (DWs in short). The facts can then be analyzed by means of aggregating the measures. Data warehouses are typically built to analyze (some aspects of) an enterprise's business...

    Provided By INRIA

  • White Papers // Aug 2013

    Proved Generation of Implementations from Computationally Secure Protocol Specifications

    In order to obtain implementations of security protocols proved secure in the computational model, the authors previously proposed the following approach: they write a specification of the protocol in the input language of the computational protocol verifier CryptoVerif, prove it secure using CryptoVerif, then generate an OCaml implementation of the...

    Provided By INRIA

  • White Papers // Aug 2013

    Collective Mind: Cleaning Up the Research and Experimentation Mess in Computer Engineering Using Crowdsourcing, Big Data and Machine Learning

    Software and hardware co-design and optimization of HPC systems has become intolerably complex, ad-hoc, time consuming and error prone due to enormous number of available design and optimization choices, complex interactions between all software and hardware components, and multiple strict requirements placed on performance, power consumption, size, reliability and cost....

    Provided By INRIA

  • White Papers // Aug 2013

    On the Impact of Network Topology on Wireless Sensor Networks Performances

    Wireless Sensor Networks (WSN) are composed of constrained devices and deployed in unattended and hostile environments. Most papers presenting solutions for WSN evaluate their work over random topologies to highlight some of their \"Good\" performances. They rarely study these behaviors over more than one topology. Yet, the topology used can...

    Provided By INRIA

  • White Papers // Jul 2013

    Practical Cryptanalysis of a Public-Key Encryption Scheme Based on New Multivariate Quadratic Assumptions

    In this paper, the authors investigate the security of a public-key encryption scheme introduced by Huang, Liu and Yang (HLY) at PKC'12. This new scheme can be provably reduced to the hardness of solving a set of quadratic equations whose coefficients of highest degree are chosen according to a discrete...

    Provided By INRIA

  • White Papers // Jul 2013

    Towards a Framework for Semantic Exploration of Frequent Patterns

    Mining frequent patterns is an essential task in discovering hidden correlations in datasets. Although frequent patterns unveil valuable information, there are some challenges which limit their usability. The number of possible patterns is often very large which hinders their effective exploration. Patterns with many items are hard to read and...

    Provided By INRIA

  • White Papers // Jul 2013

    Privacy in Content-Oriented Networking: Threats and Countermeasures

    As the Internet struggles to cope with scalability, mobility, and security issues, new network architectures are being proposed to better accommodate the needs of modern systems and applications. In particular, Content-Oriented Networking (CON) has emerged as promising next-generation Internet architecture: it sets to decouple content from hosts, at the network...

    Provided By INRIA

  • White Papers // Jun 2013

    Model-driven Extraction and Analysis of Network Security Policies

    Firewalls are a key element in network security. They are in charge of filtering the traffic of the network in compliance with a number of access-control rules that enforce a given security policy. In an always-evolving context, where security policies must often be updated to respond to new security requirements,...

    Provided By INRIA

  • White Papers // Jun 2013

    DB2SNA: An All-in-One Tool for Extraction and Aggregation of Underlying Social Networks From Relational Databases

    In the enterprise context, people need to visualize different types of interactions between heterogeneous objects (e.g. product and site, customers and product, people interaction (social network)...). The existing approaches focus on social networks extraction using web document. However a considerable amount of information is stored in relational databases. Therefore, relational...

    Provided By INRIA

  • White Papers // May 2013

    Adapting Workflows Using Generic Schemas: Application to the Security of Business Processes

    Existing approaches to the adaptation of workflows over web services fall short in two respects. First, they only provide, if ever, limited means for taking into account the execution history of a workflow. Second, they do not support adaptations that require modifications not only at the service composition level but...

    Provided By INRIA

  • White Papers // May 2013

    Advanced Validation of the DVMS Approach to Fully Distributed VM Scheduling

    The holy grail for Infrastructure as a Service (IaaS) providers is to maximize the utilization of their infrastructure while ensuring the Quality of Service (QoS) for the virtual machines they host. Although the frameworks in charge of managing Virtual Machines (VM) on pools of physical ones (PM) have been significantly...

    Provided By INRIA

  • White Papers // May 2013

    Dynamic Scalability of a Consolidation Service

    In the coming years, cloud environments will increasingly face energy saving issues. While consolidating the virtual machines running in a cloud is a well-accepted solution to reduce the energy consumption, ensuring the scalability of the consolidation service remains a challenging issue. In this paper, the authors propose an elastic consolidation...

    Provided By INRIA

  • White Papers // May 2013

    Performance Modeling for Power Consumption Reduction on SCC

    As power is becoming one of the biggest challenge in high performance computing, the authors are proposing a performance model on the Single-chip Cloud Computer in order to predict both power consumption and runtime of regular codes. This model takes into account the frequency at which the cores of the...

    Provided By INRIA

  • White Papers // Apr 2013

    Towards an Access-Control Metamodel for Web Content Management Systems

    Out-of-the-box Web Content Management Systems (WCMSs) are the tool of choice for the development of millions of enterprise web sites but also the basis of many web applications that reuse WCMS for important tasks like user registration and authentication. This widespread use highlights the importance of their security, as WCMSs...

    Provided By INRIA

  • White Papers // Apr 2013

    Supporting Data Privacy in P2P Systems

    Peer-To-Peer (P2P) systems have been very successful for large-scale data sharing. However, sharing sensitive data, like in online social networks, without appropriate access control, can have undesirable impact on data privacy. Data can be accessed by everyone (by potentially untrusted peers) and used for everything (e.g., for marketing or activities...

    Provided By INRIA

  • White Papers // Apr 2013

    QUAIL: A Quantitative Security Analyzer for Imperative Code

    Quantitative security analysis evaluates and compares how effectively a system protects its secret data. The authors introduce QUAIL, the first tool able to perform an arbitrary-precision quantitative analysis of the security of a system depending on private information. QUAIL builds a Markov Chain model of the system's behavior as observed...

    Provided By INRIA

  • White Papers // Apr 2013

    Verification of a Self-Configuration Protocol for Distributed Applications in the Cloud

    In this paper, the authors focus on a self-configuration protocol, which is able to configure a whole distributed application without requiring any centralized server. The high degree of parallelism involved in this protocol makes its design complicated and error-prone. In order to check that this protocol works as expected, they...

    Provided By INRIA

  • White Papers // Mar 2013

    An Analysis of Web Servers Architectures Performances on Commodity Multicores

    The authors study the impact of concurrent programming models on multicore performances of Web servers. More precisely, they consider three implementations of servers, each being representative of a particular model: Knot (thread-based), server (event-driven), Watpipe (stage-based). Their experiments show that memory access costs increase with the number of cores. They...

    Provided By INRIA

  • White Papers // Mar 2013

    From Computationally-Proved Protocol Specifications to Implementations and Application to SSH

    This paper presents a novel technique for obtaining implementations of security protocols, proved secure in the computational model. The authors formally specify the protocol to prove, they prove this specification using the computationally-sound protocol verifier CryptoVerif, and they automatically translate it into an implementation in OCaml using a new compiler...

    Provided By INRIA

  • White Papers // Mar 2013

    Static Analysis of XML Security Views and Query Rewriting

    In this paper, the authors revisit the view based security framework for XML without imposing any of the previously considered restrictions on the class of queries, the class of DTDs, and the type of annotations used to de ne the view. First, they study query rewriting with views when the...

    Provided By INRIA

  • White Papers // Mar 2013

    Implementing TLS with Verified Cryptographic Security

    TLS is possibly the most used protocol for secure communications, with an 18-year history of flaws and fixes, ranging from its protocol logic to its cryptographic design and from the Internet standard to its diverse implementations. The authors develop a verified reference implementation of TLS 1.2. Their code fully supports...

    Provided By INRIA

  • White Papers // Feb 2013

    Good Coupling Between LDPC-Staircase and Reed-Solomon for the Design of GLDPC Codes for the Erasure Channel

    In this paper, the authors analyze the design of Generalized LDPC-staircase (GLDPC-staircase) codes, where the base code is an LDPC-Staircase code and component codes are Reed-Solomon codes. More precisely they compare two schemes: scheme A has the property that on each check node of the base code the repair symbol...

    Provided By INRIA

  • White Papers // Feb 2013

    SRLG-Diverse Routing With the Star Property

    The notion of Shared Risk Link Groups (SRLG) has been introduced to capture survivability issues where some links of a network fail simultaneously. In this context, the diverse routing problem is to find a set of pair-wise SRLG-disjoint paths between a given pair of end nodes of the network. This...

    Provided By INRIA

  • White Papers // Feb 2013

    DSLM : Dynamic Synchronous Language With Memory

    The authors propose a new language called DSLM based on the synchronous/reactive model. In DSLM, systems are composed of several sites executed asynchronously, while each site is running a number of agents in a synchronous way. An agent consists of a script and a memory. Scripts may call functions or...

    Provided By INRIA

  • White Papers // Feb 2013

    Efficient Caching in Content-Centric Networks Using OpenFlow

    Content distribution and retrieval are dominant Internet applications today. However, the Internet was designed for communication between exactly two machines and this communication model reduces the efficiency of content delivery services. To fit today's trend, Content-Centric Networking (CCN) has been proposed. In CCN, contents are retrieved directly by their names,...

    Provided By INRIA

  • White Papers // Feb 2013

    Selecting Benchmark Combinations for the Evaluation of Multicore Throughput

    Most high-performance processors today are able to execute multiple threads of execution simultaneously. Threads share processor resources, like the last-level cache, which may decrease throughput in a non obvious way, depending on threads' characteristics. Computer architects usually study multi-programmed workloads by considering a set of benchmarks and some combinations of...

    Provided By INRIA

  • White Papers // Feb 2013

    SINR-Based Coverage Probability in Cellular Networks Under Multiple Connections

    The authors give numerically tractable, explicit integral expressions for the distribution of the Signal-to-Interference-and-Noise-Ratio (SINR) experienced by a typical user in the downlink channel from the k-th strongest bases stations of a cellular network modelled by Poisson point process on the plane. Their model comprises power-low path-loss model with arbitrarily...

    Provided By INRIA

  • White Papers // Jan 2013

    Coloring Based Hierarchical Routing Approach

    Graph coloring was exploited in wireless sensor networks to solve many optimization problems. These problems are related in general to channel assignment. In this paper, the authors propose to jointly use coloring for routing purposes. They introduce CHRA a coloring based hierarchical routing approach. Coloring is exploited to avoid interferences...

    Provided By INRIA

  • White Papers // Jan 2013

    Formal Analysis of a Hardware Dynamic Task Dispatcher with CADP

    The complexity of multiprocessor architectures for mobile multimedia applications renders their validation challenging. In addition, to provide the necessary flexibility, a part of the functionality is realized by software. Thus, a formal model has to take into account both hardware and software. In this paper, the authors report on the...

    Provided By INRIA

  • White Papers // Jan 2013

    Tradeoffs for Reliable Quantum Information Storage in Surface Codes and Color Codes

    The generalization of Low Density Parity-Check (LDPC) codes to the quantum setting is far from evident. The fact that most of the constructions of quantum LDPC codes have bounded minimum distance illustrates this difficulty. Such a distance is not sufficient for a family of quantum LDPC codes. Topological constructions of...

    Provided By INRIA

  • White Papers // Jul 2010

    Modeling the Economic Value of Location and Preference Data of Mobile Users

    The defining characteristic of wireless and mobile networking is user mobility, and related to it is the ability for the network to capture (at least partial) information on where users are located and how users change location over time. Information about location is becoming critical, and therefore valuable, for an...

    Provided By INRIA

  • White Papers // Dec 2011

    The P2P-RPL Routing Protocol for IPv6 Sensor Networks: Testbed Experiments

    An important part of the foreseen Internet of Things consists in wireless sensor networks running adapted IPv6 protocols. Since the way sensors are scattered is generally unplanned and may evolve with time, a routing protocol is needed in order to provide paths across such networks. Efforts towards standardizing RPL, a...

    Provided By INRIA

  • White Papers // Dec 2011

    A Parallel Tiled Solver for Dense Symmetric Indefinite Systems on Multicore Architectures

    The authors describe an efficient and innovative parallel tiled algorithm for solving symmetric indefinite systems on multicore architectures. This solver avoids pivoting by using a multiplicative preconditioning based on symmetric randomization. This randomization prevents the communication overhead due to pivoting, is computationally inexpensive and requires very little storage. Following randomization,...

    Provided By INRIA

  • White Papers // Apr 2012

    Implementing a BGP-Free ISP Core With LISP

    The sustained growth pace of the global routing table is exerting an economical strain on ISPs by requiring untimely router upgrades. Notably, it has been speculated that the growth rate of router FIBs is surpassing that of its supporting technology and that the deployment of IPv6 is only to make...

    Provided By INRIA

  • White Papers // Nov 2012

    IBTrack: An ICMP Black Holes Tracker

    ICMP is a key protocol to exchange control and error messages over the Internet. An appropriate ICMP's processing throughout a path is therefore a key requirement both for troubleshooting operations (e.g. debugging routing problems) and for several functionalities (e.g. Path Maximum Transmission Unit Discovery, PMTUD). Unfortunately it is common to...

    Provided By INRIA

  • White Papers // Jul 2010

    Reducing Costs and Pollution in Cellular Networks

    Cellular wireless networks are expected to provide high quality audio and video services while enabling fast and low cost Internet access to mobile users. The need for green cost efficient networks are twofold: reduce the service price, and preserve the environment. In this paper, the authors discuss the various strategies...

    Provided By INRIA

  • White Papers // Jun 2011

    On the Minimization of Power Consumption in Base Stations Using On/off Power Amplifiers

    Using energy generated with fossil fuel causes global warming due to the greenhouse effect, which threatens the people environment. One of the challenges for New Generation Networks (NGN) is then the reduction of energy consumption, in particular at the BSs (Base Stations) which use about 85% of the total network...

    Provided By INRIA

  • White Papers // May 2011

    Modeling and Tolerating Heterogeneous Failures in Large Parallel Systems

    As supercomputers and clusters increase in size and complexity, system failures are inevitable. Different hardware components (such as memory, disk, or network) of such systems can have different failure rates. Prior works assume failures equally affect an application, whereas the authors' goal is to provide failure models for applications that...

    Provided By INRIA

  • White Papers // Feb 2011

    On the Scheduling of Checkpoints in Desktop Grids

    Frequent resources failures are a major challenge for the rapid completion of batch jobs. Checkpointing and migration is one approach to accelerate job completion avoiding deadlock. The authors study the problem of scheduling checkpoints of sequential jobs in the context of Desktop Grids, consisting of volunteered distributed resources. They craft...

    Provided By INRIA

  • White Papers // Feb 2013

    SRLG-Diverse Routing With the Star Property

    The notion of Shared Risk Link Groups (SRLG) has been introduced to capture survivability issues where some links of a network fail simultaneously. In this context, the diverse routing problem is to find a set of pair-wise SRLG-disjoint paths between a given pair of end nodes of the network. This...

    Provided By INRIA

  • White Papers // Feb 2013

    SINR-Based Coverage Probability in Cellular Networks Under Multiple Connections

    The authors give numerically tractable, explicit integral expressions for the distribution of the Signal-to-Interference-and-Noise-Ratio (SINR) experienced by a typical user in the downlink channel from the k-th strongest bases stations of a cellular network modelled by Poisson point process on the plane. Their model comprises power-low path-loss model with arbitrarily...

    Provided By INRIA

  • White Papers // Feb 2013

    Good Coupling Between LDPC-Staircase and Reed-Solomon for the Design of GLDPC Codes for the Erasure Channel

    In this paper, the authors analyze the design of Generalized LDPC-staircase (GLDPC-staircase) codes, where the base code is an LDPC-Staircase code and component codes are Reed-Solomon codes. More precisely they compare two schemes: scheme A has the property that on each check node of the base code the repair symbol...

    Provided By INRIA

  • White Papers // Jan 2013

    Coloring Based Hierarchical Routing Approach

    Graph coloring was exploited in wireless sensor networks to solve many optimization problems. These problems are related in general to channel assignment. In this paper, the authors propose to jointly use coloring for routing purposes. They introduce CHRA a coloring based hierarchical routing approach. Coloring is exploited to avoid interferences...

    Provided By INRIA

  • White Papers // Feb 2013

    Efficient Caching in Content-Centric Networks Using OpenFlow

    Content distribution and retrieval are dominant Internet applications today. However, the Internet was designed for communication between exactly two machines and this communication model reduces the efficiency of content delivery services. To fit today's trend, Content-Centric Networking (CCN) has been proposed. In CCN, contents are retrieved directly by their names,...

    Provided By INRIA

  • White Papers // Dec 2012

    Association Control for Wireless LANs: Pursuing Throughput Maximization and Energy Efficiency

    Because the Access Points (APs) and the STAtions (STAs) of a community access network are deployed at the users' desired places, the APs and STAs tend to concentrate in certain areas. A concentration of STAs often results in the AP(s) and STAs in that particular area suffering from severe congestion....

    Provided By INRIA

  • White Papers // Jun 2010

    Digging Into Anonymous Traffic: A Deep Analysis of the Tor Anonymizing Network

    Users' anonymity and privacy are among the major concerns of today's Internet. Anonymizing networks are then poised to become an important service to support anonymous driven Internet communications and consequently enhance users' privacy protection. Indeed, Tor an example of anonymizing networks based on onion routing concept attracts more and more...

    Provided By INRIA

  • White Papers // Mar 2013

    From Computationally-Proved Protocol Specifications to Implementations and Application to SSH

    This paper presents a novel technique for obtaining implementations of security protocols, proved secure in the computational model. The authors formally specify the protocol to prove, they prove this specification using the computationally-sound protocol verifier CryptoVerif, and they automatically translate it into an implementation in OCaml using a new compiler...

    Provided By INRIA

  • White Papers // Oct 2012

    Differentially Private Histogram Publishing through Lossy Compression

    Differential privacy has emerged as one of the most promising privacy models for private data release. It can be used to release different types of data, and, in particular, histograms, which provide useful summaries of a dataset. Several differentially private histogram releasing schemes have been proposed recently. However, most of...

    Provided By INRIA

  • White Papers // Sep 2011

    Layout Guidelines for 3D Architectures Including Optical Ring Network-on-Chip (ORNoC)

    Trends in design of the next generation of Multi-Processors System-on-Chip (MPSoC) point to 3D integration of thousand of processing elements, requiring high performance interconnect for high throughput and low latency communications. Optical on-chip interconnects enable significantly increased bandwidth and decreased latency. They are thus considered as one of the most...

    Provided By INRIA

  • White Papers // Nov 2011

    Classification and Elimination of Conflicts in Hardware Transactional Memory Systems

    In this paper, the authors analyze the sources of performance losses in hardware transactional memory and investigate techniques to reduce the losses. It dissects the root causes of data conflicts in Hardware Transactional Memory systems (HTM) into four classes of conflicts: true sharing, false sharing, silent store, and write-write conflicts....

    Provided By INRIA

  • White Papers // Jul 2011

    Register Reverse Rematerialization

    Reversible computing could be in more or less long term mandatory for minimizing heat dissipation inherent to computing. It aims at keeping all information on input and intermediate values available at any step of the computation. Rematerialization in register allocation amounts to recomputing values instead of spilling them in memory...

    Provided By INRIA

  • White Papers // Feb 2012

    Performance Evaluation and Analysis of Thread Pinning Strategies on Multi-Core Platforms: Case Study of SPEC OMP Applications on Intel Architectures

    With the introduction of multi-core processors, thread affinity has quickly appeared to be one of the most important factors to accelerate program execution times. The current paper presents a complete experimental study on the performance of various thread pinning strategies. The authors investigate four application independent thread pinning strategies and...

    Provided By INRIA

  • White Papers // Jul 2011

    Self-Healing Distributed Scheduling Platform

    Distributed systems require effective mechanisms to manage the reliable provisioning of computational resources from different and distributed providers. Moreover, the dynamic environment that affects the behavior of such systems and the complexity of these dynamics demand autonomous capabilities to ensure the behavior of distributed scheduling platforms and to achieve business...

    Provided By INRIA

  • White Papers // Dec 2010

    Automatic Generation of FPGA-Specific Pipelined Accelerators

    Recent, increase in the complexity of the circuits has brought high-level synthesis tools as a must in the digital circuit design. However, these tools come with several limitations, and one of them is the efficient use of pipelined arithmetic operators. This paper explains how to generate efficient hardware with pipelined...

    Provided By INRIA

  • White Papers // Sep 2011

    Designing a CPU Model: From a Pseudo-Formal Document to Fast Code

    For validating low level embedded software, engineers use simulators that take the real binary as input. Like the real hardware, these full-system simulators are organized as a set of components. The main component is the CPU simulator (ISS), because it is the usual bottleneck for the simulation speed, and its...

    Provided By INRIA

  • White Papers // Nov 2010

    Scheduling, Binding and Routing System for a Run-Time Reconfigurable Operator Based Multimedia Architecture

    In this paper, the authors present a system for application scheduling, binding and routing for a run-time Reconfigurable Operator based Multimedia Architecture (ROMA). They use constraint programming to formalize their architecture model together with a specific application program. For this purpose they use an abstract representation of their architecture, which...

    Provided By INRIA

  • White Papers // Oct 2011

    Stream and Memory Hierarchy Design for Multi-Purpose Accelerators

    Power and programming challenges make heterogeneous multi-cores composed of cores and ASICs an attractive alternative to homogeneous multi-cores. Recently, multi-purpose loop-based generated accelerators have emerged as an especially attractive accelerator option. They have several assets: short design time (automatic generation), flexibility (multi-purpose) but low configuration and routing overhead (unlike FPGAs),...

    Provided By INRIA

  • White Papers // Mar 2010

    Towards Phase Change Memory as a Secure Main Memory

    Phase Change Memory (PCM) technology appears as a promising technology for designing main memory in future computer systems. PCM presents advantages over DRAMs in terms of static energy consumption as well as integration scalability for future technologies generations; for instance, anticipates a 4X higher memory density with PCM than with...

    Provided By INRIA

  • White Papers // May 2012

    Non-Generic Floating-Point Software Support for Embedded Media Processing

    Even though media processing applications may rely intensively on floating-point computations, some modern embedded media processors such as the ST231 from the STMicroelectronics ST200 VLIW family do not contain floating-point hardware and provide architectural support only for integer arithmetic. In this paper, the authors present some work in progress on...

    Provided By INRIA

  • White Papers // Jul 2011

    FPGA-Specific Synthesis of Loop-Nests With Pipelined Computational Cores

    Application development tends to pack more features per product. In order to cope with competition, added features usually employ complex algorithms, making full use of existing processing power. When application performance is poor, one may envision accelerating the whole application or a computationally demanding kernel using the following solutions: multi-core...

    Provided By INRIA

  • White Papers // Nov 2011

    HLS Tools for FPGA: Faster Development with Better Performance

    FPGA density is increasing exponentially in such a way that the number of gates is approximately doubling every two years. Consequently, very complex designs can consequently be integrated into a single FPGA component, which can now be considered as high computing power accelerators. Designing FPGA-based accelerators is a difficult and...

    Provided By INRIA

  • White Papers // Jan 2011

    Identifying Scalar Behavior in CUDA Kernels

    The authors propose a compiler analysis pass for programs expressed in the Single Program, Multiple Data (SPMD) programming model. It identifies statically several kinds of regular patterns that can occur between adjacent threads, including common computations, memory accesses at consecutive locations or at the same location and uniform control flow....

    Provided By INRIA

  • White Papers // Nov 2010

    Replacement Policies for Shared Caches on Symmetric Multicores : A Programmer-Centric Point of View

    The presence of shared caches in current multicore processors may generate a lot of performance variability in multi-programmed environments. For applications with quality-of-service requirements, this performance variability may lead the programmer to be overly pessimistic about performance and reduce the application features and/or spend a lot of effort optimizing the...

    Provided By INRIA

  • White Papers // Aug 2013

    Collective Mind: Cleaning Up the Research and Experimentation Mess in Computer Engineering Using Crowdsourcing, Big Data and Machine Learning

    Software and hardware co-design and optimization of HPC systems has become intolerably complex, ad-hoc, time consuming and error prone due to enormous number of available design and optimization choices, complex interactions between all software and hardware components, and multiple strict requirements placed on performance, power consumption, size, reliability and cost....

    Provided By INRIA

  • White Papers // Jan 2014

    Interactive Inference of Join Queries

    The authors investigate the problem of inferring join queries from user interactions. The user is presented with a set of candidate tuples and is asked to label them as positive or negative depending on whether or not she would like the tuples as part of the join result. The goal...

    Provided By INRIA

  • White Papers // Nov 2013

    Dynamic Workload-Based Partitioning Algorithms for Continuously Growing Databases

    Applications with very large databases, where data items are continuously appended, are becoming more and more common. Thus, the development of efficient data partitioning is one of the main requirements to yield good performance. In the case of applications that have complex access patterns, e.g. scientific applications, workload-based partitioning could...

    Provided By INRIA

  • White Papers // Jan 2014

    Context-Aware Top-k Processing using Views

    Search applications where queries are dependent on their context are becoming increasingly relevant in today's online applications. For example, the context may be the location of the user in location-aware search or the social network of the query initiator in social-aware search. Processing such queries efficiently is inherently difficult, and...

    Provided By INRIA

  • White Papers // Jan 2014

    Deduction with Contradictions in Datalog

    The authors study deduction in the presence of inconsistencies. Following previous works, they capture deduction via datalog programs and in-consistencies through violations of Functional Dependencies (FDs). They study and compare two semantics for datalog with FDs: the first, of a logical nature, is based on inferring facts one at a...

    Provided By INRIA

  • White Papers // Nov 2012

    A Model for Assisting Business Users Along Analytical Processes

    User-centric business intelligence aims at empowering analysts who interact with complex tools, by allowing them to perform accurate data manipulations and analysis without necessarily requiring IT expertise and knowledge of underlying data specifications. Recommender systems contribute to easing their tasks but most of them operate inside walled gardens and cannot...

    Provided By INRIA

  • White Papers // Jul 2011

    Bridging the Gap Between the Business Processes and the Service Oriented Architecture

    Bridging the gap between the (ever) evolving Business and its supporting IT capabilities is of high relevance in today's enterprise information system roadmap. Without an agile development method and stable IT architectural principles there is no chance to foreshadow a successful route to valuable computerized software solutions. The Service Oriented...

    Provided By INRIA