Boston University

Displaying 161-179 of 179 results

  • White Papers // May 2009

    RefLink: An Interface That Enables People With Motion Impairments to Analyze Web Content and Dynamically Link to References

    In this paper, the authors present RefLink, an interface that allows users to analyze the content of web page by dynamically linking to an online encyclopedia such as Wikipedia. Upon opening a webpage, RefLink instantly provides a list of terms extracted from the webpage and annotates each term by the...

    Provided By Boston University

  • White Papers // May 2009

    Colocation Games and Their Application to Distributed Resource Management

    The authors introduce Colocation Games as the basis of a general framework for modeling, analyzing, and facilitating the interactions between the various stakeholders in distributed/cloud computing environments, where resources are offered in an open marketplace to independent, rational parties interested in setting up their own applications. Virtualization technologies enable the...

    Provided By Boston University

  • White Papers // May 2009

    Elucidating the Instability of Random Access Wireless Mesh Networks

    This paper investigates 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. The authors identify two key factors that impact stability: the network size and the...

    Provided By Boston University

  • White Papers // Apr 2009

    Optimized Scheduled Multiple Access Control for Wireless Sensor Networks

    The authors consider wireless sensor networks with multiple sensor modalities that capture data to be transported over multiple frequency channels to potentially multiple gateways. They study a general problem of maximizing a utility function of achievable transmission rates between communicating nodes. Decisions involve routing, transmission scheduling, power control, and channel...

    Provided By Boston University

  • White Papers // Apr 2009

    On the Performance and Robustness of Managing Reliable Transport Connections

    The authors revisit the problem of connection management for reliable transport. At one extreme, a pure Soft-State (SS) approach safely removes the state of a connection at the sender and receiver once the state timers expire without the need for explicit removal messages. And new connections are established without an...

    Provided By Boston University

  • White Papers // Apr 2009

    Mining Frequent Arrangements of Temporal Intervals

    The problem of discovering frequent arrangements of temporal intervals is studied. It is assumed that the database consists of sequences of events, where an event occurs during a time-interval. The goal is to mine temporal arrangements of event intervals that appear frequently in the database. The motivation of this work...

    Provided By Boston University

  • White Papers // Apr 2009

    Seed Scheduling for Peer-to-Peer Networks

    The initial phase in a content distribution (file sharing) scenario is a delicate phase due to the lack of global knowledge and the dynamics of the overlay. An unwise distribution of the pieces in this phase can cause delays in reaching steady state, thus increasing file download times. The authors...

    Provided By Boston University

  • White Papers // Mar 2009

    Spot Pricing of Secondary Spectrum Access in Wireless Cellular Networks

    Recent deregulation initiatives enable cellular providers to sell excess spectrum for secondary usage. In this paper, the authors investigate the problem of optimal spot pricing of spectrum by a provider in the presence of both non-elastic primary users, with long-term commitments, and opportunistic, elastic secondary users. They first show that...

    Provided By Boston University

  • White Papers // Mar 2009

    On Spectrum Sharing in Narrowband Cellular Wireless Networks

    The authors study secondary spectrum sharing in narrow-band cellular networks in which calls in neighboring cells need to be assigned different channels. Analysis of such networks are in general difficult due to large state spaces and lack of closed form expressions. Here they consider linear topologies and show that they...

    Provided By Boston University

  • White Papers // Feb 2009

    Movement and Recovery Analysis of a Mouse-Replacement Interface for Users With Severe Disabilities

    The Camera Mouse is a mouse-replacement interface for users with movement impairments. It tracks a selected body feature, such as the nose, eyebrow or finger, through a web camera and translates the user's movements to movements of the mouse pointer. Occasionally, the Camera Mouse loses the feature being tracked, when...

    Provided By Boston University

  • White Papers // Feb 2009

    Safe Compositional Network Sketches: Reasoning With Automated Assistance

    NetSketch is a tool for the specification of Constrained-Flow Networks (CFNs) and the certification of desirable safety properties imposed thereon, conceived to assist system integrators in modeling and design. It provides compositional analysis capabilities based on a strongly-typed domain-specific language (DSL) for describing and reasoning about CFNs and relevant invariants....

    Provided By Boston University

  • White Papers // Feb 2009

    Bootstrapped Oblivious Transfer and Secure Two-Party Function Computation

    The authors propose an information theoretic framework for the Secure two-party Function Computation (SFC) problem and introduce the notion of SFC capacity. They study and extend string Oblivious Transfer (OT) to sample-wise OT. They propose an efficient, perfectly private OT protocol utilizing the binary erasure channel or source. They also...

    Provided By Boston University

  • White Papers // Jan 2009

    Rateless Coding With Feedback

    The erasure resilience of rateless codes, such as Luby-Transform (LT) codes, makes them particularly suitable to a wide variety of loss-prone wireless and sensor network applications, ranging from digital video broadcast to software updates. Yet, traditional rateless codes usually make no use of a feedback communication channel, a feature available...

    Provided By Boston University

  • White Papers // Jan 2009

    Hyperbolic Embedding and Routing for Dynamic Graphs

    The authors propose an embedding and routing scheme for arbitrary network connectivity graphs, based on greedy routing and utilizing virtual node coordinates. In dynamic multihop packet-switching communication networks, routing elements can join or leave during network operation or exhibit intermittent failures. They present an algorithm for online greedy graph embedding...

    Provided By Boston University

  • White Papers // Dec 2008

    Predictable Interrupt Management and Scheduling in the Composite Component-based System

    In this paper, the authors present the design of user-level scheduling hierarchies in the composite component-based system. The motivation for this is centered around the design of a system that is both dependable and predictable, and which is configurable to the needs of specific applications. Untrusted application developers can safely...

    Provided By Boston University

  • White Papers // Jan 2007

    Hijack: Taking Control of COTS Systems for Real-Time User-Level Services

    In this paper, the authors focus on a technique to empower Commercial-Off-The-Shelf (COTS) systems with an execution environment, and corresponding services, to support real-time and embedded applications. By leveraging COTS systems, they are able to reduce the potentially expensive maintenance and development costs of proprietary solutions. They describe a system...

    Provided By Boston University

  • White Papers // Oct 2006

    Process-Aware Interrupt Scheduling and Accounting

    In most operating systems, the handling of interrupts is typically performed within the address space of the kernel. Moreover, interrupt handlers are invoked asynchronously during the execution of arbitrary processes. Unfortunately, this allows for a process's time quantum to be consumed by arbitrary interrupt handling. To avoid significant impact to...

    Provided By Boston University

  • White Papers // Jul 2006

    Authenticated Index Structures for Aggregation Queries in Outsourced Databases

    In an outsourced database system the data owner publishes information through a number of remote, untrusted servers with the goal of enabling clients to access and query the data more efficiently. As clients cannot trust servers, query authentication is an essential component in any outsourced database system. Clients should be...

    Provided By Boston University

  • White Papers // Feb 2006

    Optimal Mechanism For Selling Substitutes

    In this paper we study a problem of a multiproduct monopolist selling substitutable goods to a buyer with unknown valuations. Under the standard distributional assumptions we find that in the optimal menu every nontrivial contract delivers some good with certainty. Using this result we apply control-theoretic tools to the case...

    Provided By Boston University

  • White Papers // Apr 2010

    Reliable MLC NAND Flash Memories Based on Nonlinear T-Error-Correcting Codes

    The semiconductor industry witnesses an explosive growth of the NAND flash memory market in the past several years. Due to its high data transfer rate, low power consumption, big storage density and long mechanical durability, the NAND flash memories are widely used as storage media for devices such as portable...

    Provided By Boston University

  • White Papers // Mar 2014

    Profiling EEMBC MultiBench Programs Using Full-System Simulations

    In this paper, the authors present the profiling of EEMBC parallel benchmark programs that is designed for the evaluation and future development of scalable SMP architectures. Modern Multi-Processor System-on-Chip (MPSoC) includes tens of IP blocks, such as CPUs, memories, input/output devices, and HW accelerators,. Figure 1 shows an example of...

    Provided By Boston University

  • White Papers // Jun 2012

    Adaptive Energy-Efficient Resource Sharing for Multi-threaded Workloads in Virtualized Systems

    Computational demand on today's data centers is continuously increasing, as computing trends are shifting towards the cloud. The corresponding increases in energy consumption and management complexity remain as major challenges for data centers. Server virtualization provides opportunities to improve energy efficiency by reducing the number of physical servers through workload...

    Provided By Boston University

  • White Papers // Jan 2014

    Quest-V: A Virtualized Multikernel for High-Confidence Systems

    In this paper, the authors outline the design of 'Quest-V', which is implemented as a collection of separate kernels operating together as a distributed system on a chip. Quest-V uses virtualization techniques to isolate kernels and prevent local faults from affecting remote kernels. This leads to a high-confidence multikernel approach,...

    Provided By Boston University

  • White Papers // Oct 2006

    Process-Aware Interrupt Scheduling and Accounting

    In most operating systems, the handling of interrupts is typically performed within the address space of the kernel. Moreover, interrupt handlers are invoked asynchronously during the execution of arbitrary processes. Unfortunately, this allows for a process's time quantum to be consumed by arbitrary interrupt handling. To avoid significant impact to...

    Provided By Boston University

  • White Papers // Jan 2007

    Hijack: Taking Control of COTS Systems for Real-Time User-Level Services

    In this paper, the authors focus on a technique to empower Commercial-Off-The-Shelf (COTS) systems with an execution environment, and corresponding services, to support real-time and embedded applications. By leveraging COTS systems, they are able to reduce the potentially expensive maintenance and development costs of proprietary solutions. They describe a system...

    Provided By Boston University

  • White Papers // Jan 2014

    On the Integration of Real-time Asynchronous Event Handling Mechanisms with Existing Operating System Services

    In this paper, the authors present an asynchronous event handling mechanism for real-time applications that leverages existing system services in COTS systems. In their implementation, event dispatching is initiated within bottom-half interrupt handling routines, in order to support predictable, safe, and efficient event handling functionality at user-level. They compare their...

    Provided By Boston University

  • White Papers // Jan 2014

    Mutable Protection Domains: Towards a Component-based System for Dependable and Predictable Computing

    The increasing complexity of software poses significant challenges for real-time and embedded systems beyond those based purely on timeliness. With embedded systems and applications running on everything from mobile phones, PDAs, to automobiles, aircraft and beyond, an emerging challenge is to ensure both the functional and timing correctness of complex...

    Provided By Boston University

  • White Papers // Dec 2008

    Predictable Interrupt Management and Scheduling in the Composite Component-based System

    In this paper, the authors present the design of user-level scheduling hierarchies in the composite component-based system. The motivation for this is centered around the design of a system that is both dependable and predictable, and which is configurable to the needs of specific applications. Untrusted application developers can safely...

    Provided By Boston University

  • White Papers // Oct 2010

    Online Cache Modeling for Commodity Multicore Processors

    Modern Chip-level Multi-Processors (CMPs) contain multiple processor cores sharing a common last-level cache, memory interconnects, and other hardware resources. Workloads running on separate cores compete for these resources, often resulting in highly variable performance. It is generally desirable to co-schedule workloads that have minimal resource contention, in order to improve...

    Provided By Boston University

  • White Papers // Jan 2011

    HIRES: a System for Predictable Hierarchical Resource Management

    In this paper, the authors present HIRES, a system structured around predictable, Hierarchical Resource Management (HRM). Applications and different subsystems use customized resource managers that control the allocation and usage of memory, CPU, and I/O. This increased resource management flexibility enables subsystems with different timing constraints to specialize resource management...

    Provided By Boston University

  • White Papers // Jun 2012

    Time Management in the Quest-V RTOS

    Quest-V is a new system currently under development for multicore processors. It comprises a collection of separate kernels operating together as a distributed system on a chip. Each kernel is isolated from others using virtualization techniques, so that faults do not propagate throughout the entire system. This multikernel design supports...

    Provided By Boston University

  • White Papers // Jan 2013

    Real-Time USB Communication in the Quest Operating System

    In this paper, the authors describe a real-time USB 2 subsystem for the quest operating system. Quest is designed for real-time embedded systems. Such systems need to interact with their environment using sensors and actuators. On many embedded platforms today there is support for basic serial, USB 2.0 and 100...

    Provided By Boston University

  • White Papers // Oct 2013

    The Quest-V Separation Kernel for Mixed Criticality Systems

    Embedded systems are increasingly featuring multi and many-core processors, due in part to their power, performance and price benefits. These processors offer new opportunities for an increasingly significant class of mixed criticality systems. In mixed criticality systems, there is a combination of application and system components with different safety and...

    Provided By Boston University

  • White Papers // Jun 2014

    Distributed Real-Time Fault Tolerance on a Virtualized Multi-Core System

    In this paper, the authors present different approaches for real-time fault tolerance using redundancy methods for multi-core systems. Using hardware virtualization, a distributed system on a chip is created, where the cores are isolated from one another except through explicit communication channels. Using this system architecture, redundant tasks that would...

    Provided By Boston University

  • White Papers // Mar 2010

    Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases

    Physical computational devices leak side-channel information that may, and often does, reveal secret internal states. The authors present a general transformation that compiles any circuit into a new, functionally equivalent circuit which is resilient against well-defined classes of leakage. Their construction requires a small, stateless and computation-independent leak-proof component that...

    Provided By Boston University

  • White Papers // May 2014

    Learning Modular Structures from Network Data and Node Variables

    A standard technique for understanding underlying dependency structures among a set of variables posits a shared conditional probability distribution for the variables measured on individuals within a group. This approach is often referred to as module networks, where individuals are represented by nodes in a network, groups are termed modules,...

    Provided By Boston University

  • White Papers // Jul 2006

    Authenticated Index Structures for Aggregation Queries in Outsourced Databases

    In an outsourced database system the data owner publishes information through a number of remote, untrusted servers with the goal of enabling clients to access and query the data more efficiently. As clients cannot trust servers, query authentication is an essential component in any outsourced database system. Clients should be...

    Provided By Boston University

  • White Papers // Mar 2012

    Performance and Power Analysis of RCCE Message Passing on the Intel Single-Chip Cloud Computer

    The number of cores integrated on a single chip increases with each generation of computers. Traditionally, a single Operating System (OS) manages all the cores and resource allocation on a multi-core chip. Intel's Single-chip Cloud Computer (SCC), a manycore processor built for research use with 48 cores, is an implementation...

    Provided By Boston University