Boston University

Displaying 121-160 of 168 results

  • White Papers // May 2010

    On the Cost of Supporting Mobility and Multihoming

    As the Internet has evolved and grown, an increasing number of nodes (hosts or autonomous systems) have become multihomed, i.e., a node is connected to more than one network. Multihoming can be viewed as a special case of Mobility - as a node moves, it unsubscribes from one network and...

    Provided By Boston University

  • White Papers // May 2010

    Using Lightweight Formal Methods for JavaScript Security

    The goal of this investigation was to apply lightweight formal methods to the study of the security of the JavaScript language. Previous work has shown that lightweight formal methods present a new approach to the study of security in the context of the Java Virtual Machine (JVM). Since there is...

    Provided By Boston University

  • White Papers // Apr 2010

    Virtualization and Programming Support for Video Sensor Networks With Application to Wireless and Physical Security

    Network Security Systems are heavily anchored in the digital plane of "Cyber Space" and hence cannot be used effectively to derive the physical identity of an intruder in order to prevent further malicious wireless broadcasts (i.e., Escorting an Intruder off the Premises Based on Physical Evidence). Embedded Sensor Networks (SNs)...

    Provided By Boston University

  • White Papers // Apr 2010

    Specialization, Productivity And Financing Constraints

    The authors analyze financial contracting when the specificity of investments is endogenous. Specialization decreases the liquidation value of assets, but it also improves a firm's long term productivity. While the first effect is known to make financing more difficult, the authors show that the second effect can ease financing constraints...

    Provided By Boston University

  • White Papers // Apr 2010

    On the Detection of Policy Conflicts in Interdomain Routing

    The Dynamic Policy Routing model (DPR) was recently introduced to explicitly model the dynamics of policy routing. DPR extends the formalism of the stable paths problem with discrete synchronous time to capture the propagation of path changes in any dynamic network using a structure called the causation chain. In this...

    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 2010

    A Green Distributed Cooperation for Network and Content Management

    The authors propose a distributed approach in which an Internet Service Provider (ISP) and a Content Provider (CP) cooperate to minimize total power consumption. The authors solution is distributed between the ISP and the CP to limit shared information, such as network topology and servers load. In particular, they develop...

    Provided By Boston University

  • White Papers // Mar 2010

    QoS-Enabled Video Streaming in Wireless Sensor Networks

    Recent advances in wireless communications technology and low-power, low-cost CMOS imaging sensors enable a new sensing modality employing ubiquitous distributed video sensing. In many video sensing applications multimedia streams are often required by the base station to provide detailed information of the target spot in the sensor field. However, limited...

    Provided By Boston University

  • White Papers // Mar 2010

    The Relationship Between Mobile and Fixed Line Communications: A Survey

    While a dramatic worldwide increase in mobile communication to above 4 billion users has occurred, wealthy countries in the last few years have experienced a significant decline in fixed network subscriptions. Such Fixed-to-Mobile Substitution (FMS) is at the center of this literature survey. Theoretical models explaining FMS are scarce and...

    Provided By Boston University

  • White Papers // Mar 2010

    Colocation as a Service Strategic and Operational Services for Cloud Colocation

    By co-locating with other tenants of an Infrastructure as a Service (IaaS) offering, IaaS users could reap significant cost savings by judiciously sharing their use of the fixed-size instances offered by IaaS providers. This paper presents the blueprints of a Co-location as a Service (CaaS) framework. CaaS strategic services identify...

    Provided By Boston University

  • White Papers // Mar 2010

    Colocation as a Service: Strategic and Operational Services for Cloud Colocation

    By colocating with other tenants of an Infrastructure as a Service (IaaS) offering, IaaS users could reap significant cost savings by judiciously sharing their use of the fixed-size instances offered by IaaS providers. This paper presents the blueprints of a Colocation as a Service (CaaS) framework. CaaS strategic services identify...

    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 // Feb 2010

    Scale Invariant Properties Of Public Debt Growth

    Public debt is one of the important economic variables that quantitatively describe a nation's economy. Because bankruptcy is a risk faced even by institutions as large as governments (e.g. Iceland), national debt should be strictly controlled with respect to national wealth. Also, the problem of eliminating extreme poverty in the...

    Provided By Boston University

  • White Papers // Feb 2010

    A Type-Theoretic Framework for Efficient and Safe Colocation of Periodic Real-Time Systems

    Desirable application performance is typically guaranteed through the use of Service Level Agreements (SLAs) that specify fixed fractions of resource capacities that must be allocated for unencumbered use by the application. The mapping between what constitutes desirable performance and SLAs is not unique: multiple SLA expressions might be functionally equivalent....

    Provided By Boston University

  • White Papers // Feb 2010

    Mixture Models of Endhost Network Traffic

    In recent years there has been much interest in modeling internet traffic that comes from inside large networks, such as at routers or gateways. In this paper, the authors focus on modeling a little studied type of traffic - namely the network traffic generated from end-hosts. They study traffic data...

    Provided By Boston University

  • White Papers // Feb 2010

    Distributed Advance Network Reservation With Delay Guarantees

    New architectures have recently been proposed and deployed to support end-to-end advance reservation of network resources. These architectures rely on the use a centralized scheduler, which may be unpractical in large or administratively heterogeneous networks. In this paper, the authors explore and demonstrate the feasibility of implementing distributed solutions for...

    Provided By Boston University

  • White Papers // Jan 2010

    Does Lumpy Investment Matter For Business Cycles?

    The authors present an analytically tractable general equilibrium business cycle model that features micro-level investment lumpiness. They prove an exact irrelevance proposition which provides sufficient conditions on preferences, technology, and the fixed cost distribution such that any positive upper support of the fixed cost distribution yields identical equilibrium dynamics of...

    Provided By Boston University

  • White Papers // Jan 2010

    Design-Space Exploration for CMOS Photonic Processor Networks

    This paper presents a review of recent advances in building high-throughput, energy-efficient photonic networks for core-to-core and core-to-DRAM communication in many-core processor systems. To sustain the performance scaling in these systems, the increase in core count has to be followed by the corresponding increase in energy-efficiency of the core, the...

    Provided By Boston University

  • White Papers // Jan 2010

    Wireless Infrared Communications

    Wireless infrared communications refers to the use of free-space propagation of light waves in the near infrared band as a transmission medium for communication. The communication can be between one portable communication device and another or between a portable de-vice and a tethered device, called an access point or base...

    Provided By Boston University

  • White Papers // Dec 2009

    Extreme Value FEC for Reliable Broadcasting in Wireless Networks

    The advent of practical rateless codes enables implementation of highly efficient packet-level Forward Error Correction (FEC) strategies for reliable data broadcasting in loss-prone wireless networks, such as sensor networks. Yet, the critical question of accurately quantifying the proper amount of redundancy has remained largely unsolved. In this paper, the authors...

    Provided By Boston University

  • White Papers // Dec 2009

    The Structure And Growth Of Weighted Networks

    The authors develop a simple theoretical framework for the evolution of weighted networks that is consistent with a number of stylized features of real-world data. In the framework, the Barabasi-Albert model of network evolution is extended by assuming that link weights evolve according to a geometric Brownian motion. The model...

    Provided By Boston University

  • White Papers // Dec 2009

    Reliable Wireless Broadcasting With Near-Zero Feedback

    The authors examine the problem of minimizing feedbacks in reliable wireless broadcasting, by pairing rateless coding with extreme value theory. Their key observation is that, in a broadcast environment, this problem resolves into estimating the maximum number of packets dropped among many receivers rather than for each individual receiver. With...

    Provided By Boston University

  • White Papers // Dec 2009

    On-Line Pricing of Secondary Spectrum Access With Unknown Demand Function and Call Length Distribution

    The authors consider a wireless provider who caters to two classes of customers, namely primary and secondary users. Primary users have long term contracts while secondary users are admitted and priced according to current availability of excess spectrum. Secondary users accept an advertised price with a certain probability defined by...

    Provided By Boston University

  • White Papers // Nov 2009

    A Distributed Actor-Critic Algorithm and Applications to Mobile Sensor Network Coordination Problems

    The authors introduce and establish the convergence of a distributed actor-critic method that orchestrates the coordination of multiple agents solving a general class of a Markov decision problem. The method leverages the centralized single-agent actor-critic algorithm of and uses a consensus-like algorithm for updating agents' policy parameters. As an application...

    Provided By Boston University

  • White Papers // Oct 2009

    Safe Compositional Network Sketches: The Formal Framework

    NetSketch is a tool for the specification of constrained-flow applications and the certification of desirable safety properties imposed thereon. NetSketch is conceived to assist system integrators in two types of activities: Modeling and design. As a modeling tool, it enables the of an existing system while retaining sufficient information about...

    Provided By Boston University

  • White Papers // Oct 2009

    Safe Compositional Network Sketches: Tool & Use Cases

    NetSketch is a tool that enables the specification of network-flow applications and the certification of desirable safety properties imposed thereon. NetSketch is conceived to assist system integrators in two types of activities: modeling and design. As a modeling tool, it enables the of an existing system while retaining sufficient information...

    Provided By Boston University

  • White Papers // Oct 2009

    Impact of Asymmetric Traffic Densities on Delay Tolerant Vehicular Ad Hoc Networks

    Vehicular networking can be achieved with short, medium, or long-range communication technologies. However, there are trade-offs in the adoption of these technologies including data capacity, continuity of connections, energy use and contention with other users. The authors focus on short range technologies that support both near-neighbor communication, for safety applications,...

    Provided By Boston University

  • White Papers // Oct 2009

    Limits and Opportunities for Designing Manycore Processor-to-Memory Networks Using Monolithic Silicon Photonics

    To sustain the historic performance improvement in VLSI systems, while remaining within the power envelope, the trend has moved towards designing multiple cores on a single die. However, if designed using current and/or projected electrical solutions, these systems would quickly get bandwidth-limited due to bandwith density limitations and power constraints....

    Provided By Boston University

  • White Papers // Oct 2009

    PhD Forum: Routing Protocol and Performance Modeling in Delay Tolerant Vehicular Networks

    Development of networking protocols is essential for an emerging class of applications described as Vehicular Ad hoc NETworks (VANETs). The scope and requirements of applications vary significantly, and existing techniques do not apply. The nature of data exchange varies in time and space and thus, the protocols need to accommodate...

    Provided By Boston University

  • White Papers // Oct 2009

    On Fair Sharing of Spectrum Via CSMA

    The authors contrast CSMA and TDMA schemes for medium access in spatially dispersed wireless networks under the primary interference model. CSMA is based on random access via dynamically tuned parameters, whereas TDMA involves periodic bursts that are offset in time so as to avoid packet collisions. They study TDMA in...

    Provided By Boston University

  • White Papers // Sep 2009

    Active Hidden Models for Tracking With Kernel Projections

    The authors introduce Active Hidden Models (AHM) that utilize kernel methods traditionally associated with classification. They use AHMs to track deformable objects in video sequences by leveraging kernel projections. They introduce the "Subset projection" method which improves the efficiency of the tracking approach by a factor of ten. They successfully...

    Provided By Boston University

  • White Papers // Sep 2009

    Asymptotically Optimal Data Dissemination in Multi-Channel Wireless Sensor Networks: Single Radios Suffice

    The authors analyze the performance limits of data dissemination with multi-channel, single radio sensors under random packet loss. They formulate the problem of minimizing the average delay of data dissemination as a stochastic shortest path problem and show that, for an arbitrary topology network, an optimal control policy can be...

    Provided By Boston University

  • White Papers // Sep 2009

    Tracking a Large Number of Objects From Multiple Views

    The authors propose a multi-object multi-camera framework for tracking large numbers of tightly-spaced objects that rapidly move in three dimensions. They formulate the problem of finding correspondences across multiple views as a multidimensional assignment problem and use a greedy randomized adaptive search procedure to solve this NP-hard problem efficiently. To...

    Provided By Boston University

  • White Papers // Sep 2009

    Is a Detector Only Good for Detection?

    A common design of an object recognition system has two steps, a detection step followed by a foreground within class classification step. For example, consider face detection by a boosted cascade of detectors followed by face ID recognition via One-Vs-All (OVA) classifiers. Another example is human detection followed by pose...

    Provided By Boston University

  • White Papers // Aug 2009

    Principles of Safe Policy Routing Dynamics

    This paper introduces the Dynamic Policy Routing (DPR) model that captures the propagation of route updates under arbitrary changes in topology or path preferences. DPR introduces the notion of causation chains where the route flap at one node causes a flap at the next node along the chain. Using DPR,...

    Provided By Boston University

  • White Papers // Aug 2009

    PreDA: Predicate Routing for DTN Architectures Over MANET

    The authors consider a Delay Tolerant Network (DTN) whose users (Nodes) are connected by an underlying Mobile Ad hoc NETwork (MANET) substrate. Users can declaratively express high-level policy constraints on how "Content" should be routed. For example, content can be directed through an intermediary DTN node for the purposes of...

    Provided By Boston University

  • White Papers // Aug 2009

    Angels: In-Network Support for Minimum Distribution Time in P2P Overlays

    This paper proposes the use of in-network caches (which the authors call Angels) to reduce the Minimum Distribution Time (MDT) of a file from a seeder - a node that possesses the file - to a set of leechers - nodes who are interested in downloading the file. An Angel...

    Provided By Boston University

  • White Papers // Aug 2009

    Pricing Strategies for Spectrum Lease in Secondary Markets

    The authors develop analytical models to characterize pricing of spectrum rights in cellular CDMA networks. Specifically, they consider a primary license holder that aims to lease its spectrum within a certain geographic sub-region of its network. Such a transaction has two contrasting economic implications: On the one hand the lessor...

    Provided By Boston University

  • White Papers // Jul 2009

    Brief Announcement: Cloud Computing Games: Pricing Services of Large Data Centers

    Organizations opt to reduce costs by contracting their day-to-day computing needs to service providers who offer large-scale data centers and cloud computing services. Like other computing commodities, data centers provide paid services that require careful pricing. Using a Stackelberg game formulation, this paper presents a demand-based pricing model for maximizing...

    Provided By Boston University

  • White Papers // Jun 2009

    CSR: Constrained Selfish Routing in Ad-Hoc Networks

    Routing protocols for ad-hoc networks assume that the nodes forming the network are either under a single authority, or else that they would be altruistically forwarding data for other nodes with no expectation of a return. These assumptions are unrealistic since in ad-hoc networks, nodes are likely to be autonomous...

    Provided By Boston University

  • White Papers // Dec 2009

    On-Line Pricing of Secondary Spectrum Access With Unknown Demand Function and Call Length Distribution

    The authors consider a wireless provider who caters to two classes of customers, namely primary and secondary users. Primary users have long term contracts while secondary users are admitted and priced according to current availability of excess spectrum. Secondary users accept an advertised price with a certain probability defined by...

    Provided By Boston University

  • White Papers // Aug 2010

    A Modality for Safe Resource Sharing and Code Reentrancy

    The potential of linear logic in facilitating reasoning on resource usage has long been recognized. However, convincing uses of linear types in practical programming are still rather rare. In this paper, the authors present a general design to effectively support practical programming with linear types. In particular, they introduce and...

    Provided By Boston University

  • White Papers // Dec 2011

    Slice Embedding Solutions for Distributed Service Architectures

    Network virtualization provides a novel approach to run multiple concurrent virtual networks over a common physical network infrastructure. From a research perspective, this enables the networking community to concurrently experiment with new Internet architectures and protocols. From a market perspective, on the other hand, this paradigm is appealing as it...

    Provided By Boston University

  • White Papers // Oct 2011

    A Framework for the Evaluation and Management of Network Centrality

    Network-analysis literature is rich in node-centrality measures that quantify the centrality of a node as a function of the (shortest) paths of the network that go through it. Existing work focuses on defining instances of such measures and designing algorithms for the specific combinatorial problems that arise for each instance....

    Provided By Boston University

  • White Papers // Jul 2011

    The Denotational and Static Semantics of a Domain-Specific Language for Flow-Network Design

    Flow networks are inductively defined, assembled from small network modules to produce arbitrarily large ones, with interchangeable and expanding functionally-equivalent parts. The authors carry out this induction formally using a Domain-Specific Language (DSL). Associated with their DSL is a typing system (or static semantics), a system of formal annotations that...

    Provided By Boston University

  • White Papers // Jul 2011

    A Domain-Specific Language for Incremental and Modular Design of Large-Scale Verifiably-Safe Flow Networks

    The authors define a Domain-Specific Language (DSL) to inductively assemble flow networks from small networks or modules to produce arbitrarily large ones, with interchangeable functionally-equivalent parts. Their small networks or modules are "Small" only as the building blocks in this inductive definition (there is no limit on their size). Associated...

    Provided By Boston University

  • White Papers // Jul 2011

    Posit: An Adaptive Framework for Lightweight IP Geolocation

    Location-specific Internet services are predicated on the ability to identify the geographic position of IP hosts accurately. Fundamental to prior geolocation techniques is their reliance on landmarks with known coordinates whose distance from target hosts is intrinsically tied to the ability to make accurate location estimates. In this paper, the...

    Provided By Boston University

  • White Papers // May 2010

    On the Cost of Supporting Mobility and Multihoming

    As the Internet has evolved and grown, an increasing number of nodes (hosts or autonomous systems) have become multihomed, i.e., a node is connected to more than one network. Multihoming can be viewed as a special case of Mobility - as a node moves, it unsubscribes from one network and...

    Provided By Boston University

  • White Papers // Oct 2010

    On Supporting Mobility and Multihoming in Recursive Internet Architectures

    As the Internet has evolved and grown, an increasing number of nodes (hosts or autonomous systems) have become multihomed, i.e., a node is connected to more than one network. Mobility can be viewed as a special case of multihoming - as a node moves, it unsubscribes from one network and...

    Provided By Boston University

  • White Papers // May 2011

    Inverse Compute-and-Forward: Extracting Messages From Simultaneously Transmitted Equations

    The authors consider the transmission of independent messages over a Gaussian relay network with interfering links. Using the compute-and-forward framework, relays can efficiently decode equations of the transmitted messages. The relays can then send their collected equations to the destination, which solves for its desired messages. Here, they study a...

    Provided By Boston University

  • White Papers // Jan 2011

    Swarming on Optimized Graphs for N-Way Broadcast

    In this paper, the authors showed that swarming protocols for bulk data transfers perform much better when operating over optimized overlay topologies that take into consideration the end-to-end performance characteristics of the underlying network. Such topologies improve the aggregate transmission capacity of nodes, but where they make a huge difference...

    Provided By Boston University

  • White Papers // Feb 2013

    Intra-Car Wireless Sensors Data Collection: A Multi-Hop Approach

    The authors experimentally investigate the benefits of multi-hop networking for intra-car data aggregation under the current state-of-the-art Collection Tree Protocol (CTP). They show how this protocol actively adjusts collection routes according to channel dynamics in various practical car environments, resulting in performance gains over single-hop aggregation. Throughout their experiments, they...

    Provided By Boston University

  • White Papers // Feb 2011

    Angels In the Cloud: A Peer-Assisted Bulk-Synchronous Content Distribution Service

    Leveraging client upload capacity through peer-assisted content distribution was shown to decrease the load on content providers, while also improving average distribution times. These benefits, however, are limited by the disparity between client upload and download speeds, especially in scenarios requiring a Minimum Distribution Time (MDT) of a fresh piece...

    Provided By Boston University

  • White Papers // May 2011

    Mining a Web Security Portal - A Case Study

    Vast amount of information is available on the web which could help an instructor when teaching an information technology course. Various online publishers provide this knowledge in the form of RSS feeds which could be subscribed by individual users through various RSS aggregators. In this paper, the authors present on...

    Provided By Boston University

  • White Papers // Jan 2013

    Spatio-Temporal Network Anomaly Detection by Assessing Deviations of Empirical Measures

    The authors introduce an Internet traffic anomaly detection mechanism based on large deviations results for empirical measures. Using past traffic traces they characterize network traffic during various time-of-day intervals, assuming that it is anomaly-free. They present two different approaches to characterize traffic: a model-free approach based on the method of...

    Provided By Boston University

  • White Papers // Aug 2012

    Scheduling Mobile Nodes for Cooperative Data Transport in Sensor Networks

    Message Ferrying has been shown to be an effective approach to support routing in sparse ad hoc or sensor networks. Considering a generic network model where each node in the network wishes to send data to some (or possibly all) other nodes with known (and possibly different) rates, the authors...

    Provided By Boston University

  • White Papers // Jan 2013

    Probabilistic Indoor Tracking of Mobile Wireless Nodes Relative to Landmarks

    The profile-based approach is known to be advantageous when it comes to inferring positions of mobile wireless devices in complex indoor environments. The past decade has seen a significant body of work that explores different implementations of this approach, with varying degrees of success. Here, the authors cast the profile-based...

    Provided By Boston University

  • White Papers // Apr 2012

    On Delay-Minimized Data Harvesting With Mobile Elements in Wireless Sensor Networks

    The authors consider the problem of routing and scheduling a set of mobile elements that act as mechanical carriers of data, harvesting them from sensor nodes and delivering them to a sink. The objective is to minimize the data delivery latency. Most of the existing work has focused on designing...

    Provided By Boston University

  • White Papers // Sep 2011

    Energy Optimized Topologies for Distributed Averaging in Wireless Sensor Networks

    The authors study the energy efficient implementation of averaging/consensus algorithms in wireless sensor networks. For static, time-invariant topologies they start from the recent result that a bidirectional spanning tree is preferable in terms of convergence time. They formulate the combinatorial optimization problem of selecting such a minimal energy tree as...

    Provided By Boston University

  • White Papers // Jan 2012

    A Least Squares Temporal Difference Actor-Critic Algorithm With Applications to Warehouse Management

    This paper develops a new approximate dynamic programming algorithm for Markov decision problems and applies it to a vehicle dispatching problem arising in warehouse management. The algorithm is of the actor-critic type and uses a least squares temporal difference learning method. It operates on a sample-path of the system and...

    Provided By Boston University

  • White Papers // Sep 2011

    Position and Movement Detection of Wireless Sensor Network Devices Relative to a Landmark Graph

    The authors present a novel probabilistic framework for reliable indoor positioning of mobile sensor network devices. Compared to existing approaches, ours adopts complex computations in exchange for high localization accuracy while needing low hardware investment and moderate set-up cost. To that end, they use full distributional information on signal measurements...

    Provided By Boston University

  • White Papers // Nov 2009

    A Distributed Actor-Critic Algorithm and Applications to Mobile Sensor Network Coordination Problems

    The authors introduce and establish the convergence of a distributed actor-critic method that orchestrates the coordination of multiple agents solving a general class of a Markov decision problem. The method leverages the centralized single-agent actor-critic algorithm of and uses a consensus-like algorithm for updating agents' policy parameters. As an application...

    Provided By Boston University

  • White Papers // Mar 2010

    Colocation as a Service Strategic and Operational Services for Cloud Colocation

    By co-locating with other tenants of an Infrastructure as a Service (IaaS) offering, IaaS users could reap significant cost savings by judiciously sharing their use of the fixed-size instances offered by IaaS providers. This paper presents the blueprints of a Co-location as a Service (CaaS) framework. CaaS strategic services identify...

    Provided By Boston University

  • White Papers // Jan 2013

    CCM: Scalable, On-Demand Compute Capacity Management for Cloud Datacenters

    Multi-tenant cloud computing datacenters run diverse workloads with time varying resource demands. This continuously leads to areas of high and low resource utilization throughout the cloud infrastructure. The authors present CCM (Cloud Capacity Manager) - a prototype system, and, methods for dynamically multiplexing the compute capacity of cloud datacenters at...

    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 // Jan 2014

    Strategies for Anticipating Risk in Heterogeneous System Design

    Heterogeneous design presents an opportunity to improve energy efficiency but raises a challenge in resource management. Prior design methodologies aim for performance and efficiency, yet a deployed system may miss these targets due to run-time effects, which the authors denote as risk. They propose design strategies that explicitly aim to...

    Provided By Boston University

  • White Papers // Jun 2013

    Navigating Heterogeneous Processors with Market Mechanisms

    As datacenters proliferate and access to them is democratized, increasingly diverse cloud applications will demand computation. To accommodate the rise in demand, traditional datacenter servers have relied on Moore's Law. This strategy is insufficient as Dennard scaling ends and constrains the power efficiency of processor servers. Instead of relying on...

    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 // 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 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 // 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 // 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 // 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 // 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 // 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 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 // 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 // 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 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