EPFL

Displaying 1-40 of 97 results

  • White Papers // Mar 2014

    High-Throughput Maps on Message-Passing Manycore Architectures: Partitioning Versus Replication

    The advent of manycore architectures raises new scalability challenges for concurrent applications. Implementing scalable data structures is one of them. Several manycore architectures provide hardware message passing as a means to efficiently exchange data between cores. In this paper, the authors study the implementation of high-throughput concurrent maps in message-passing...

    Provided By EPFL

  • White Papers // Feb 2014

    RCMP: Enabling Efficient Recomputation Based Failure Resilience for Big Data Analytics

    Data replication, the main failure resilience strategy used for big data analytics jobs, can be unnecessarily inefficient. It can cause serious performance degradation when applied to intermediate job outputs in multi-job computations. For instance, for I/O-intensive big data jobs, data replication is especially expensive because very large datasets need to...

    Provided By EPFL

  • White Papers // Jan 2014

    Temperature-Aware Design and Management for 3D Multi-Core Architectures

    Vertically-integrated 3D Multi-Processors Systems-on-Chip (3D MPSoCs) provide the means to continue integrating more functionality within a unit area while enhancing manufacturing yields and runtime performance. However, 3D MPSoCs incur amplified thermal challenges that undermine the corresponding reliability. To address these issues, several advanced cooling technologies, alongside temperature-aware design-time optimizations and...

    Provided By EPFL

  • White Papers // Jan 2014

    Temperature-Aware Runtime Power Management for Chip-Multiprocessors with 3-D Stacked Cache

    The advent of 3-D fabrication technology makes it possible to stack a large amount of last-level cache memory onto a multi-core die to reduce off-chip memory accesses and, thus, increases system performance. However, the higher power density of 3-D Integrated Circuits (ICs) might incur temperature-related problems in reliability, leakage power,...

    Provided By EPFL

  • White Papers // Jan 2014

    Operating System Support for Interface Virtualisation of Reconfigurable Coprocessors

    Reconfigurable Systems-on-Chip (SoC) on the market consists of full-edged processors and large Field-Programmable Gate-Arrays (FPGAs). The latter can be used to implement the system glue logic, various peripherals, and application-specific coprocessors. Using FPGAs for application-specific coprocessors has certain speed up potentials, but it is less frequent in practice because of...

    Provided By EPFL

  • White Papers // Dec 2013

    Resolving the Memory Bottleneck for Single Supply Near-Threshold Computing

    The increase in integrated circuit complexity and continued scaling of process technology has led to a tremendous wealth of new applications. In this paper, the authors focus on a review of state-of-the-art memory designs and new design methods for Near-Threshold Computing (NTC). In particular, it presents new ways to design...

    Provided By EPFL

  • White Papers // Nov 2013

    ATraPos: Adaptive Transaction Processing on Hardware Islands

    Now-a-days, high-performance transaction processing applications increasingly run on multisocket multicore servers. Such architectures exhibit non-uniform memory access latency as well as non-uniform threads communication costs. Unfortunately, traditional shared-everything database management systems are designed for uniform inter-core communication speeds. This causes unpredictable access latencies in the critical path. While lack of...

    Provided By EPFL

  • White Papers // Oct 2013

    Obstruction Degree: Measuring Concurrency in Shared Memory Systems

    In this paper, the authors present the notion of obstruction degree, a new metric for reasoning about the scalability of concurrent algorithms. Essentially, this simple metric gives an indication as to which of two concurrent algorithms is expected to scale better, as well as approximate the maximum number of processors...

    Provided By EPFL

  • White Papers // Aug 2013

    Model-View Sensor Data Management in the Cloud

    Infinite nature of sensor data poses a serious challenge for query processing even in a cloud infrastructure. Model-based sensor data approximation reduces the amount of data for query processing, but all modeled segments need to be scanned, in the worst case. In this paper, the authors propose an innovative index...

    Provided By EPFL

  • White Papers // Aug 2013

    Cloud-Savvy Contextual Spaces as Agile Personal Learning Environments or Informal Knowledge Management Solutions

    In this paper, the authors present how advanced social media platforms can be exploited to construct and share contextual spaces enabling the instantiation of agile personal learning environments or informal knowledge management solutions. The usefulness of open plug-ins to collect resources from the cloud in such dedicated contextual spaces is...

    Provided By EPFL

  • White Papers // Aug 2013

    Empowering Low-Cost CMOS Cameras by Image Processing to Reach Comparable Results with Costly CCDs

    Despite the huge research effort to improve the performance of the Complementary Metal Oxide Semiconductor (CMOS) image sensors, Charge-Coupled Devices (CCDs) still dominate the cell biology related conventional fluorescence microscopic imaging market where low or ultra-low noise imaging is required. A detailed comparison of the sensor specifications and performance is...

    Provided By EPFL

  • White Papers // Aug 2013

    Solving Terminal Revocation in EAC by Augmenting Terminal Authentication

    In this paper the authors propose a solution to enable an accurate terminal revocation in the Extended Access Control (EAC). Chaabouni and Vaudenay in [CV09] pointed out the need for an accurate revocation procedure, but failed to provide a complete solution description. The authors aim at filling this gap. Their...

    Provided By EPFL

  • White Papers // Jun 2013

    Secure & Lightweight Distance-Bounding

    Distance-bounding is a practical solution aiming to prevent relay attacks. The main challenge when designing such protocols is maintaining their inexpensive cryptographic nature, whilst being able to protect against as many, if not all, of the classical threats posed in their context. Moreover, in distance-bounding, some subtle security shortcomings related...

    Provided By EPFL

  • White Papers // May 2013

    A ReRAM-Based Non-Volatile Flip-Flop with Sub-VT Read and CMOS Voltage-Compatible Write

    Ultra-Low Power (ULP) VLSI systems such as wireless sensor nodes and biomedical implants running for many days or even for several years have extremely low power budgets. Embedded memories and pipeline registers consume a dominant share of the total power and area of such systems, while for the digital signal...

    Provided By EPFL

  • White Papers // Apr 2013

    Impact of Instance Seeking Strategies on Resource Allocation in Cloud Data Centers

    With the prosperity of cloud computing, an increasing number of Small and Medium-sized Enterprises (SMEs) move their business to public clouds such as Amazon EC2. To help tenants deploy services in the cloud, researchers either conduct performance evaluations or design mechanisms and software on seeking virtual machines of better performance....

    Provided By EPFL

  • White Papers // Apr 2013

    The Bussard-Bagga and Other Distance-Bounding Protocols Under Attacks

    The communication between an honest prover and an honest verifier can be intercepted by a malicious Man-in-the-Middle (MiM), without the legitimate interlocutors noticing the intrusion. The attacker can simply relay messages from one party to another, eventually impersonating the prover to the verifier and possibly gaining the privileges of the...

    Provided By EPFL

  • White Papers // Apr 2013

    HydroZIP: How Hydrological Knowledge Can Be Used to Improve Compression of Hydrological Data

    From algorithmic information theory, which connects the information content of a data set to the shortest computer program that can produce it, it is known that there are strong analogies between compression, knowledge, inference and prediction. The more the authors know about a data generating process, the better they can...

    Provided By EPFL

  • White Papers // Feb 2013

    Incremental Query Evaluation in a Ring of Databases

    In this paper, the authors approach the incremental view maintenance problem from an algebraic perspective. The algebraic structure of a ring of databases is constructed and extended to form a powerful aggregate query calculus. The query calculus inherits the key properties of rings, such as distributive and the existence of...

    Provided By EPFL

  • White Papers // Feb 2013

    DeepDive: Transparently Identifying and Managing Performance Interference in Virtualized Environments

    Cloud computing in general and Infrastructure-as-a-Service (IaaS) in particular, are becoming ever more popular. Unfortunately, performance interference (and the resulting unpredictability in the delivered performance) across Virtual Machines (VMs) co-located on the same Physical Machine (PM) threatens to make cloud computing inadequate for performance-sensitive customers and more expensive than necessary...

    Provided By EPFL

  • White Papers // Jan 2013

    Enhanced Stream Processing in a DBMS Kernel

    Continuous query processing has emerged as a promising query processing paradigm with numerous applications. A recent development is the need to handle both streaming queries and typical one-time queries in the same application. For example, data warehousing can greatly benefit from the integration of stream semantics, i.e., online analysis of...

    Provided By EPFL

  • White Papers // Dec 2012

    Online Thermal Control Methods for Multiprocessor Systems

    With technological advances, the number of cores integrated on a chip is increasing. This in turn is leading to thermal constraints and thermal design challenges. Temperature gradients and hotspots not only affect the performance of the system but also lead to unreliable circuit operation and affect the lifetime of the...

    Provided By EPFL

  • White Papers // Dec 2012

    NOC-Out: Microarchitecting a Scale-Out Processor

    Scale-out server workloads benefit from many-core processor organizations that enable high throughput thanks to abundant request-level parallelism. A key characteristic of these workloads is the large instruction footprint that exceeds the capacity of private caches. While a shared Last-Level Cache (LLC) can capture the instruction working set, it necessitates a...

    Provided By EPFL

  • White Papers // Oct 2012

    Directive Deficiencies: How Resource Constraints Direct Opportunity Identification in SMEs

    Previous studies show that resource constraints have mixed effects on innovation and opportunity identification by entrepreneurs. Sometimes, resource constraints lead to identifying more opportunities, whereas in other cases, entrepreneurs see fewer opportunities. This study explores a new approach to reconcile this inconsistency. Using a sample of 219 Small- and Medium-sized...

    Provided By EPFL

  • White Papers // Sep 2012

    Design Methods for Parallel Hardware Implementation of Multimedia Iterative Algorithms

    Traditionally, parallel implementations of multimedia algorithms are carried out manually, since the automation of this task is very difficult due to the complex dependencies that generally exist between different elements of the data set. Moreover, there is a wide family of iterative multimedia algorithms that cannot be executed with satisfactory...

    Provided By EPFL

  • White Papers // Jun 2012

    Feedback-based Coding Algorithms for Broadcast Erasure Channels with Degraded Message Sets

    The authors side single-hop Broadcast Packet Erasure Channels (BPEC) with degraded message sets and instantaneous feedback regularly available from all receivers, and demonstrate that the main principles of the virtual-queue-based algorithms in, which were proposed for multiple unicast sessions, can still be applied to this setting and lead to capacity-achieving...

    Provided By EPFL

  • White Papers // Jun 2012

    Scale-Out Processors

    Scale-out datacenters mandate high per-server throughput to get the maximum benefit from the large TCO investment. Emerging applications (e.g., data serving and web search) that run in these datacenters operate on vast datasets that are not accommodated by on-die caches of existing server chips. Large caches reduce the die area...

    Provided By EPFL

  • White Papers // May 2012

    Network-Coded Multihop Multicast: Topology and Encoding Complexity

    In this paper, some novel results on the encoding complexity of network coding and its relation with the network topology are reported. The encoding complexity in network coding is defined as the number of nodes which have to perform coding operations in order to achieve the multicast capacity. These nodes...

    Provided By EPFL

  • White Papers // May 2012

    Instruction Set Extensions for Cryptographic Hash Functions on a Microcontroller Architecture

    In this paper, the authors investigate the benefits of Instruction Set Extensions (ISEs) on 16-bit microcontroller architecture for software implementations of cryptographic hash functions, using the example of the five SHA-3 final round candidates. They identify the general algorithm bottlenecks, taking into account memory footprints and cycle counts of their...

    Provided By EPFL

  • White Papers // May 2012

    Replica Bit-Line Technique for Embedded Multilevel Gain-Cell DRAM

    Multilevel gain-cell DRAMs are interesting to improve the area-efficiency of modern fault-tolerant Systems-on-Chip (SoC) implemented in deep-submicron CMOS technologies. This paper addresses the problem of long access times in such multilevel gain-cell DRAMs, which are further aggravated by process parameter variations. A replica Bit-Line (BL) technique, previously proposed for SRAM,...

    Provided By EPFL

  • White Papers // Apr 2012

    Model-Based Similarity Measure in TimeCloud

    In this paper, the authors present a new approach to measuring similarity over massive time-series data. Their approach is built on two principles: one is to parallelize the large amount computation using a scalable cloud serving system, called TimeCloud. The another is to benefit from the filter-and-refinement approach for query...

    Provided By EPFL

  • White Papers // Mar 2012

    Lightweight Polymorphic Effects

    Type-and-effect systems are a well-studied approach for reasoning about the computational behavior of programs. Nevertheless, there is only one example of an effect system that has been adopted in a wide-spread industrial language: Java's checked exceptions. The authors believe that the main obstacle to using effect systems in day-to-day programming...

    Provided By EPFL

  • White Papers // Mar 2012

    A Class of Feedback-based Coding Algorithms for Broadcast Erasure Channels with Degraded Message Sets

    The authors consider single-hop Broadcast Erasure Channels (BEC) with degraded message sets and instantaneous feedback regularly available from all receivers, and demonstrate that the main principles of the virtual queue-based algorithms in, which were proposed for multiple unicast sessions, can still be applied to this setting and lead to capacity...

    Provided By EPFL

  • White Papers // Mar 2012

    A Hybrid HW-SW Approach for Intermittent Error Mitigation in Streaming-Based Embedded Systems

    Recent advances in process technology augment the Systems-on-Chip (SoCs) functionality per unit area with the substantial decrease of device features. However, features abatement triggers new reliability issues such as the Single-event Multi-bit Upset (SMU) failure rates augmentation. To mitigate these failure rates, the authors propose a novel error mitigation mechanism...

    Provided By EPFL

  • White Papers // Feb 2012

    ECM at Work

    The performance of the Elliptic Curve Method (ECM) for integer factorization plays an important role in the security assessment of RSA-based protocols as a co-factorization tool inside the number field sieve. The efficient arithmetic for Edwards curves found an application by speeding up ECM. The authors propose techniques based on...

    Provided By EPFL

  • White Papers // Feb 2012

    Ron Was Wrong, Whit Is Right

    The authors performed a sanity check of public keys collected on the web. Their main goal was to test the validity of the assumption that different random choices are made each time keys are generated. They found that the vast majority of public keys work as intended. A more disconcerting...

    Provided By EPFL

  • White Papers // Jan 2012

    Active Topology Inference using Network Coding

    The authors' goal, in this paper, is to infer the topology of a network when they can send probes between sources and receivers at the edge of the network and intermediate nodes can perform simple network coding operations, i.e., additions. Their key intuition is that network coding introduces topology-dependent correlation...

    Provided By EPFL

  • White Papers // Dec 2011

    Expected Loss Bounds for Authentication in Constrained Channels

    The authors derive bounds on the expected loss for authentication protocols in channels which are constrained due to noisy conditions and communication costs. This is motivated by a number of authentication protocols, where at least some part of the authentication is performed during a phase, lasting n rounds, with no...

    Provided By EPFL

  • White Papers // Nov 2011

    Tools and Frameworks for Big Learning in Scala: Leveraging the Language for High Productivity and Performance

    There is a lot of activity on leveraging Scala's expressiveness and ecosystem for large-scale learning tasks. This paper introduces three projects that are conducted in the context of the Scala team. By focusing on the used language features, the authors attempt to distill commonalities among the discussed tools and frameworks;...

    Provided By EPFL

  • White Papers // Oct 2011

    RRB-Trees: Efficient Immutable Vectors

    Immutable vectors are a convenient data structure for functional programming and part of the standard library of modern languages like Clojure and Scala. The common implementation is based on wide trees with a fixed number of children per node, which allows fast indexed lookup and update operations. In this paper,...

    Provided By EPFL

  • White Papers // Oct 2011

    Tool Demo: Scala-Virtualized

    This paper describes Scala-Virtualized, which extends the Scala language and compiler with a small number of features that enable combining the benefits of shallow and deep embeddings of DSLs. The authors demonstrate their approach by showing how to embed three different domain-specific languages in Scala. Moreover, they summarize how others...

    Provided By EPFL

  • White Papers // Oct 2010

    The Cicada Attack: Degradation and Denial of Service in IR Ranging

    The authors explain that an interferer with malicious intentions can significantly degrade the performance of Impulse-Radio (IR) ranging. The cicada attack they have developed can decrease the distance (degradation of service) measured by ranging algorithms designed to cope with weak NLOS conditions; it can also jam communication (denial of service)....

    Provided By EPFL

  • White Papers // Dec 2011

    Expected Loss Bounds for Authentication in Constrained Channels

    The authors derive bounds on the expected loss for authentication protocols in channels which are constrained due to noisy conditions and communication costs. This is motivated by a number of authentication protocols, where at least some part of the authentication is performed during a phase, lasting n rounds, with no...

    Provided By EPFL

  • White Papers // May 2012

    Network-Coded Multihop Multicast: Topology and Encoding Complexity

    In this paper, some novel results on the encoding complexity of network coding and its relation with the network topology are reported. The encoding complexity in network coding is defined as the number of nodes which have to perform coding operations in order to achieve the multicast capacity. These nodes...

    Provided By EPFL

  • White Papers // Jan 2010

    SOWER: Self?-Organizing Wireless Network for Messaging

    Short Message Service (SMS) has become extremely popular in many countries, and represents a multi-billion dollars market. Yet many consumers consider that the price cellular network operators charge for it is too high. In this paper, the authors explain that there exist alternatives to cellular networks for the provision of...

    Provided By EPFL

  • White Papers // Jan 2010

    Self-Policing Mobile Ad-Hoc Networks

    Misbehavior in mobile ad-hoc networks occurs for several reasons. Selfish nodes misbehave to save power or to improve their access to service relative to others. Malicious intentions result in misbehavior as exemplified by denial of service attacks. Faulty nodes simply misbehave accidentally. Regardless of the motivation for misbehavior its impact...

    Provided By EPFL

  • White Papers // May 2010

    Performance Profiling in a Virtualized Environment

    Virtualization is a key enabling technology for cloud computing. Many applications deployed in a cloud run in virtual machines. However, profilers based on CPU performance counters do not work well in a virtualized environment. In this paper, the authors explore the possibilities for achieving performance profiling in Virtual Machine Monitors...

    Provided By EPFL

  • White Papers // Jul 2010

    Independent Faults in the Cloud

    Byzantine Fault Tolerant (BFT) protocols are replication-based solutions to the problem of tolerating the arbitrary failures of software and hardware components. The essential assumption for replication is independence of failures. In this paper, the authors categorize four different failure independence levels that could be obtained from the cloud. Providing more...

    Provided By EPFL

  • White Papers // Dec 2010

    Trustful Cumulus Clouds

    Cloud computing offers an appealing business model and it is tempting for companies to delegate their IT services to the cloud. Yet, a company might find it risky to do so for sensible services and to depend entirely on a single provider, which can be vulnerable and constitute a clearly...

    Provided By EPFL

  • White Papers // Mar 2010

    Joint Synchronization, Routing and Energy Saving in CSMA/CA Multi-Hop Hybrid Networks

    Multi-hop hybrid networks can help providing both high bandwidth and broad coverage for wireless data networks. The authors focus on CSMA/CA-based networks and take IEEE 802.11 as a concrete example. They show that the three fundamental operations of synchronization, routing and energy saving can be implemented in an integrated way....

    Provided By EPFL

  • White Papers // Dec 2009

    GNSS-Based Positioning: Attacks and Countermeasures

    Increasing numbers of mobile computing devices, user-portable, or embedded in vehicles, cargo containers, or the physical space, need to be aware of their location in order to provide a wide range of commercial services. Most often, mobile devices obtain their own location with the help of Global Navigation Satellite Systems...

    Provided By EPFL

  • White Papers // Dec 2008

    Deadlock Immunity: Enabling Systems To Defend Against Deadlocks

    Deadlock immunity is a property by which programs, once afflicted by a given deadlock, develop resistance against future occurrences of that and similar deadlocks. The authors describe a technique that enables programs to automatically gain such immunity without assistance from programmers or users. They implemented the technique for both Java...

    Provided By EPFL

  • White Papers // Apr 2010

    Cell Phones as Imaging Sensors

    Camera phones are ubiquitous, and consumers have been adopting them faster than any other technology in modern history. When connected to a network, though, they are capable of more than just picture taking: Suddenly, they gain access to the power of the cloud. The authors exploit this capability by providing...

    Provided By EPFL

  • White Papers // Jul 2010

    A Mobile World of Security

    Mobile users are increasing fast in numbers, new types of services and applications become available, and new mobile systems (e.g., for intelligent transportation) emerge. Meanwhile, the need for securing communication in such large scale, highly dynamic systems grows. But the organizational complexity and operational costs make traditional security solutions hard...

    Provided By EPFL

  • White Papers // May 2011

    SeTraStream: Semantic-Aware Trajectory Construction Over Streaming Movement Data

    With the growth of location-based tracking technology like GPS, RFID and GSM networks, an enormous amount of trajectory data are generated from various real life applications, including traffic management, urban planning and geo-social networks. A lot of studies have already been established on trajectories, ranging from data management to data...

    Provided By EPFL

  • White Papers // Jan 2010

    NC Node Selection Game in Collaborative Streaming Systems

    Network coding has been recently proposed as an efficient method to improve throughput, minimize delays and remove the need for reconciliation between network nodes in distributed streaming systems. It permits to take advantage of the path and node diversity in the network when the network coding nodes are placed efficiently....

    Provided By EPFL

  • White Papers // Jun 2009

    Compromising Electromagnetic Emanations of Wired And Wireless Keyboards

    Computer keyboards are often used to transmit confidential data such as passwords. Since they contain electronic components, keyboards eventually emit electromagnetic waves. These emanations could reveal sensitive information such as keystrokes. The technique generally used to detect compromising emanations is based on a wide-band receiver, tuned on a specific frequency....

    Provided By EPFL

  • White Papers // Nov 2009

    Building a Calculus of Data Structures

    Techniques such as verification condition generation, predicate abstraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Programs and their specifications often make use of data structures such as sets, multisets, algebraic data types, or graphs. Consequently, formulas generated from verification also involve such data structures....

    Provided By EPFL

  • White Papers // Jan 2011

    Cooperative Packet Forwarding in Multi-Domain Sensor Networks

    Sensor networks are large scale networks of low-power devices that collaborate in order to perform a given task. The sensors are limited in battery energy, capacity and computational power. In recent years, researchers have proposed several protocols for such sensor networks assuming that all sensors belong to the same authority....

    Provided By EPFL

  • White Papers // Jan 2011

    SOWER: Self-Organizing Wireless Network for Messaging

    Short Message Service (SMS) has become extremely popular in many countries, and represents a multi-billion dollars market. Yet, many consumers consider that the price cellular network operators charge for it is too high. In this paper, the authors explain that there exist alternatives to cellular networks for the provision of...

    Provided By EPFL

  • White Papers // Dec 2010

    Understanding and Tackling the Root Causes of Instability in Wireless Mesh Networks

    The authors investigate, both theoretically and experimentally, the stability of CSMA-based wireless mesh networks, where a network is said to be stable if and only if the queue of each relay node remains (almost surely) finite. They identify two key factors that impact stability: the network size and the so-called...

    Provided By EPFL

  • White Papers // Nov 2010

    A Practical Hand-on Guide for Deploying a Large-Scale Wireless Multi-Hop Network

    The knowledge of how to exactly deploy a wireless multi-hop network can be of interest for both researchers and engineers. Engineers may be interested in the possibility of extending the coverage area of their traditional access point and to provide ubiquitous Internet connectivity at a significantly reduced cost and some...

    Provided By EPFL

  • White Papers // Oct 2010

    Understanding and Tackling the Root Causes of Instability in Wireless Mesh Networks: (Extended Version)

    The authors addressed the problem of network stability in CSMA-based linear wireless mesh network and provide three main contributions. First, they identified two key factors impacting the stability: the network size and an artifact that they called stealing effect. Second, they proved analytically and showed experimentally that 3-hop networks are...

    Provided By EPFL

  • White Papers // Mar 2010

    Joint Scheduling, Power Control and Routing in Symmetric, One-dimensional, Multi-Hop Wireless Networks

    The authors are interested in finding a jointly optimal scheduling, routing and power control that achieves max-min fair rate allocation in a multi-hop wireless network. This is a highly complex non-convex optimization problem and it has been previously solved only for small networks. They restrict themselves to symmetric networks with...

    Provided By EPFL

  • White Papers // Jul 2011

    Certificate Revocation List Distribution in Vehicular Communication Systems

    The need to evict compromised, faulty, or illegitimate nodes is well understood in prominent projects designing security architectures for Vehicular Communication (VC) systems. The basic approach envisioned to achieve this is via distribution of Certificate Revocation Lists (CRLs). Nonetheless, the problem of how to distribute CRLs effectively and efficiently has...

    Provided By EPFL

  • White Papers // Oct 2011

    RRB-Trees: Efficient Immutable Vectors

    Immutable vectors are a convenient data structure for functional programming and part of the standard library of modern languages like Clojure and Scala. The common implementation is based on wide trees with a fixed number of children per node, which allows fast indexed lookup and update operations. In this paper,...

    Provided By EPFL

  • White Papers // Jul 2010

    A Generic Parallel Collection Framework

    Most applications manipulate structured data. Modern languages and platforms provide collection frameworks with basic data structures like lists, hash-tables and trees. These data structures come with a range of predefined operations which include sorting, filtering or finding elements. Such bulk operations usually traverse the entire collection and process the elements...

    Provided By EPFL

  • White Papers // Apr 2010

    Capabilities for Uniqueness and Borrowing

    An important application of unique object references is safe and efficient message passing in concurrent object-oriented programming. However, to prevent the ill effects of aliasing, practical systems often severely restrict the shape of messages passed by reference. Moreover, the problematic interplay between destructive reads - often used to implement unique...

    Provided By EPFL

  • White Papers // Apr 2010

    Deprecating the Observer Pattern

    Programming interactive systems by means of the observer pattern is hard and error-prone yet is still the implementation standard in many production environments. The authors present an approach to gradually deprecate observers in favor of reactive programming abstractions. Several library layers help programmers to smoothly migrate existing code from callbacks...

    Provided By EPFL

  • White Papers // May 2009

    Concurrent Programming Paradigms, a Comparison in Scala

    There is a rapid rise of multi-cores in recent hardware architectures. To exploit computational power of multi-core architectures, software should shift to be as concurrent as possible; and therefore should have concurrency control mechanisms. There are different concurrency programming paradigms such as locking and conditions, non-blocking algorithms, actors and Software...

    Provided By EPFL

  • White Papers // Nov 2011

    Tools and Frameworks for Big Learning in Scala: Leveraging the Language for High Productivity and Performance

    There is a lot of activity on leveraging Scala's expressiveness and ecosystem for large-scale learning tasks. This paper introduces three projects that are conducted in the context of the Scala team. By focusing on the used language features, the authors attempt to distill commonalities among the discussed tools and frameworks;...

    Provided By EPFL

  • White Papers // Apr 2009

    Towards Privacy-Friendly Online Advertising

    Modern web sites commonly interact with third-party domains to integrate advertisements and generate revenue from them. To improve the relevance of advertisements, online advertisers track user activities online with third-party cookies. However, excessive online tracking might cause unreasonable access to users' browsing information. Users are thus in need of a...

    Provided By EPFL

  • White Papers // Aug 2011

    Building-Blocks for Performance Oriented DSLs

    Domain-specific languages raise the level of abstraction in software development. While it is evident that programmers can more easily reason about very high-level programs, the same holds for compilers only if the compiler has an accurate model of the application domain and the underlying target platform. Since mapping high-level, general-purpose...

    Provided By EPFL

  • White Papers // Oct 2011

    Tool Demo: Scala-Virtualized

    This paper describes Scala-Virtualized, which extends the Scala language and compiler with a small number of features that enable combining the benefits of shallow and deep embeddings of DSLs. The authors demonstrate their approach by showing how to embed three different domain-specific languages in Scala. Moreover, they summarize how others...

    Provided By EPFL

  • White Papers // Mar 2010

    Lightweight Language Support for Type-Based, Concurrent Event Processing

    Many concurrent applications are structured around type-based event handling. Scala provides a library for event-based actors, which allows common idioms to be expressed in a concise and intuitive way. However, innocent-looking programs can exhibit catastrophic performance under certain conditions. In this paper, the authors introduce translucent functions, a type-based refinement...

    Provided By EPFL

  • White Papers // Dec 2009

    Neighbor Discovery With Reception Status Feedback to Transmitters

    Neighbor discovery is essential for the process of self-organization of a wireless network, where almost all routing and medium access protocols need knowledge of one-hop neighbors. In this paper, the authors study the problem of neighbor discovery in a static and synchronous network, where time is divided into slots, each...

    Provided By EPFL

  • White Papers // Feb 2012

    ECM at Work

    The performance of the Elliptic Curve Method (ECM) for integer factorization plays an important role in the security assessment of RSA-based protocols as a co-factorization tool inside the number field sieve. The efficient arithmetic for Edwards curves found an application by speeding up ECM. The authors propose techniques based on...

    Provided By EPFL

  • White Papers // Feb 2012

    Ron Was Wrong, Whit Is Right

    The authors performed a sanity check of public keys collected on the web. Their main goal was to test the validity of the assumption that different random choices are made each time keys are generated. They found that the vast majority of public keys work as intended. A more disconcerting...

    Provided By EPFL

  • White Papers // May 2010

    CCNoC: On-Chip Interconnects for Cache-Coherent Manycore Server Chips

    Many-core chips are emerging as the architecture of choice to provide power-scalability and improve performance while riding the Moore's law. On-chip interconnects are increasingly playing a pivotal role in power- and performance-scalability of such micro-architectures. As supply voltages begin to level off in future technologies, chip designs in general and...

    Provided By EPFL

  • White Papers // Mar 2012

    Lightweight Polymorphic Effects

    Type-and-effect systems are a well-studied approach for reasoning about the computational behavior of programs. Nevertheless, there is only one example of an effect system that has been adopted in a wide-spread industrial language: Java's checked exceptions. The authors believe that the main obstacle to using effect systems in day-to-day programming...

    Provided By EPFL

  • White Papers // Apr 2010

    On Using Static Analysis to Detect Type Errors in PHP Applications

    The authors describe their experience in using abstract interpretation to analyze applications written in PHP. Their work focuses on reconstructing type information from mostly un-annotated code. They present the abstract domain of their analysis, focusing on the features that improve analysis precision. They have implemented their approach as a tool...

    Provided By EPFL