University of Mary Washington

Displaying 1-40 of 149 results

  • White Papers // May 2014

    Efficient Implementation of Hyperspectral Anomaly Detection Techniques on GPUs and Multicore Processors

    Anomaly detection is an important task for hyperspectral data exploitation. Although many algorithms have been developed for this purpose in recent years, due to the large dimensionality of hyperspectral image data, fast anomaly detection remains a challenging task. In this paper, the authors exploit the computational power of commodity Graphics...

    Provided By University of Mary Washington

  • White Papers // Mar 2014

    Oblivious Data Structures

    The authors are among the first to systematically investigate (memory-trace) oblivious data structures. They propose a framework for constructing a variety of oblivious data structures, achieving asymptotic performance gains in comparison with generic Oblivious RAM (ORAM). They evaluate the performance of their oblivious data structures in terms of their bandwidth...

    Provided By University of Mary Washington

  • White Papers // Mar 2014

    Verifiable Oblivious Storage

    The authors formalize the notion of Verifiable Oblivious Storage (VOS), where a client outsources the storage of data to a server while ensuring data confidentiality, access pattern privacy, and integrity and freshness of data accesses. VOS generalizes the notion of Oblivious RAM (ORAM) in that it allows the server to...

    Provided By University of Mary Washington

  • White Papers // Jan 2014

    Hierarchical Interconnects for On-Chip Clustering

    In the sub-micron technology era, wire delays are becoming much more important than gate delays, making it particularly attractive to go for clustered designs. A common form of clustering adopted in processors is to replace the centralized instruction scheduler with multiple smaller schedulers that work in parallel within a single...

    Provided By University of Mary Washington

  • White Papers // Dec 2013

    Practical Dynamic Searchable Encryption with Small Leakage

    Dynamic Searchable Symmetric Encryption (DSSE) enables a client to encrypt their document collection in a way that it is still searchable and efficiently updatable. However, all DSSE constructions that have been presented in the literature so far come with several problems: Either they leak a significant amount of information (e.g.,...

    Provided By University of Mary Washington

  • White Papers // Nov 2013

    Optimal Locally Repairable Codes and Connections to Matroid Theory

    Petabyte-scale distributed storage systems are currently transitioning to erasure codes to achieve higher storage efficiency. Classical codes like reed-solomon are highly sub-optimal for distributed environments due to their high overhead in single-failure events. Locally Repairable Codes (LRCs) form a new family of codes that are repair efficient. In particular, LRCs...

    Provided By University of Mary Washington

  • White Papers // Aug 2013

    Schema Extraction for Tabular Data on the Web

    Tabular data is an abundant source of information on the web, but remains mostly isolated from the latter are interconnections since tables lack links and computer-accessible descriptions of their structure. In other words, the schemas of these tables - attribute names, values, data types, etc. - are not explicitly stored...

    Provided By University of Mary Washington

  • White Papers // Aug 2013

    Hone: \"Scaling Down\" Hadoop on Shared-Memory Systems

    The underlying assumption behind Hadoop and, more generally, the need for distributed processing is that the data to be analyzed cannot be held in memory on a single machine. Today, this assumption needs to be re-evaluated. Although petabyte-scale data-stores are increasingly common, it is unclear whether \"Typical\" analytics tasks require...

    Provided By University of Mary Washington

  • White Papers // Jun 2013

    Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose

    Beginning with the work of Lindell and Pinkas, researchers have proposed several protocols for secure two-party computation based on the cut-and-choose paradigm. In existing instantiations of this paradigm, one party generates K garbled circuits; some fraction of those is \"Checked\" by the other party, and the remaining fraction is evaluated....

    Provided By University of Mary Washington

  • White Papers // May 2013

    Optimal Scheduling for Energy Harvesting Transmitters With Hybrid Energy Storage

    The authors consider data transmission with an energy harvesting transmitter which has a hybrid energy storage unit composed of a perfectly efficient Super-Capacitor (SC) and an inefficient battery. The SC has finite space for energy storage while the battery has unlimited space. The transmitter can choose to store the harvested...

    Provided By University of Mary Washington

  • White Papers // May 2013

    Binary Energy Harvesting Channel With Finite Energy Storage

    The authors consider the capacity of an energy harvesting communication channel with a finite-sized battery. As an abstraction of this problem, they consider a system where energy arrives at the encoder in multiples of a fixed quantity, and the physical layer is modeled accordingly as a finite discrete alphabet channel...

    Provided By University of Mary Washington

  • White Papers // May 2013

    An Improved Sub-Packetization Bound for Minimum Storage Regenerating Codes

    Distributed storage systems employ codes to provide resilience to failure of multiple storage disks. Specifically, an (n, k) MDS code stores k symbols in n disks such that the overall system is tolerant to a failure of up to n-k disks. However, access to at least k disks is still...

    Provided By University of Mary Washington

  • White Papers // May 2013

    Non-Asymptotic and Second-Order Achievability Bounds for Source Coding with Side-Information

    In this paper, the authors proved a new non-asymptotic bound on the error probability for the WAK problem. They present a novel achievability bound for the Wyner-Ahlswede-Korner (WAK) problem of lossless source coding with rate-limited side-information. This bound is proved using ideas from channel simulation and channel resolvability. The bound...

    Provided By University of Mary Washington

  • White Papers // May 2013

    An Implementation of Binomial Method of Option Pricing using Parallel Computing

    The Binomial method of option pricing is based on iterating over discounted option payoffs in a recursive fashion to calculate the present value of an option. Implementing the Binomial method to exploit the resources of a parallel computing cluster is non-trivial as the method is not easily parallelizable. The authors...

    Provided By University of Mary Washington

  • White Papers // Apr 2013

    Memory Trace Oblivious Program Execution

    Cloud computing allows users to delegate data and computation to cloud service providers, at the cost of giving up physical control of their computing infrastructure. An attacker with physical access to the computing platform can perform various physical attacks, including probing memory buses and cold-boot style attacks. Previous work on...

    Provided By University of Mary Washington

  • White Papers // Mar 2013

    Access vs. Bandwidth in Codes for Storage

    Erasure-correcting codes are the basis for widely used storage systems, where disks (nodes) correspond to symbols in the code. An important family of codes is the Maximum Distance Separable (MDS) codes, which provide an optimal resiliency to erasures for a given amount of redundancy. Namely, an MDS code with r...

    Provided By University of Mary Washington

  • White Papers // Mar 2013

    On Sharing Private Data with Multiple NonColluding Adversaries

    The authors present SPARSI, a novel theoretical framework for partitioning sensitive data across multiple non-colluding adversaries. Most work in privacy-aware data sharing has considered disclosing summaries where the aggregate information about the data is preserved, but sensitive user information is protected. Nonetheless, there are applications, including online advertising, cloud computing...

    Provided By University of Mary Washington

  • White Papers // Mar 2013

    Technical Report: Does Malware Detection Improve with Diverse AntiVirus Products? an Empirical Study

    The authors present results of an empirical study to evaluate the detection capability of diverse Anti-Virus products (AVs). They have used malware samples that have been collected in a geographically distributed honeypot deployment in several different countries and organizations. The malware have been collected in August 2012; therefore the results...

    Provided By University of Mary Washington

  • White Papers // Mar 2013

    Spread Identity : A New Dynamic Address Remapping Mechanism for Anonymity and DDoS Defense

    The authors present and experimentally evaluate Spread Identity (SI) - a new dynamic network address remapping mechanism that provides anonymity and DDoS defense capabilities for Internet communications. For each session between a source and destination host, the trusted source gateway dynamically and randomly assigns an IP address for the source...

    Provided By University of Mary Washington

  • White Papers // Feb 2013

    Secure Degrees of Freedom of the Gaussian Wiretap Channel With Helpers and No Eavesdropper CSI: Blind Cooperative Jamming

    Wyner introduced the wiretap channel in which a legitimate transmitter wants to have secure communications with a legitimate receiver in the presence of an eavesdropper, and determined its capacity-equivocation region for the degraded case. Csiszar and Korner extended this result to the general, not necessarily degraded, wiretap channel. Leung-Yan-Cheong and...

    Provided By University of Mary Washington

  • White Papers // Feb 2013

    Energy Cooperation in Energy Harvesting Two-Way Communications

    In this paper, the authors investigate a two-way communication channel where users can harvest energy from nature and energy can be transferred in one-way from one of the users to the other. Energy required for data transmission is randomly harvested by the users throughout the communication duration and users have...

    Provided By University of Mary Washington

  • White Papers // Jan 2013

    An Outer Bound for Multiple Access Channels with Correlated Sources

    The capacity region of the multiple access channel with correlated sources remains an open problem. Cover, El Gamal and Salehi gave an achievable region in the form of single-letter entropy and mutual information expressions, without a single-letter converse. Cover, El Gamal and Salehi also suggested a converse in terms of...

    Provided By University of Mary Washington

  • White Papers // Jan 2013

    The Capacity Region of a Class of Discrete Degraded Interference Channels

    The authors provide a single-letter characterization for the capacity region of a class of Discrete Degraded Interference Channels (DDICs). The class of DDICs considered includes the Discrete Additive Degraded Interference Channel (DADIC) studied by Benzel. They show that for the class of DDICs studied, encoder cooperation does not increase the...

    Provided By University of Mary Washington

  • White Papers // Jan 2013

    Optimization Based Rate Control for Multirate Multicast Sessions

    Multi-rate multicasting, where the receivers of a multicast group can receive service at different rates, is an efficient mode of data delivery for many real-time applications. In this paper, the authors address the problem of achieving rates that maximize the total receiver utility for multi-rate multicast sessions. This problem not...

    Provided By University of Mary Washington

  • White Papers // Jan 2013

    A Simple Rate Control Algorithm for Maximizing Total User Utility

    In this paper, the authors consider the rate control problem with the objective of maximizing the total user utility. It takes into account the possible differences in user requirements, and also provides a framework for achieving a wide range of fairness objectives. They propose a simple algorithm for achieving the...

    Provided By University of Mary Washington

  • White Papers // Dec 2012

    Two-Way and Multiple-Access Energy Harvesting Systems With Energy Cooperation

    The authors study the capacity regions of the Gaussian Two-Way Channel (TWC) and the Gaussian two-user Multiple Access Channel (MAC) with one-way energy transfer. In both scenarios, there are two users powered by energy harvesting devices communicating messages to each other or to an access point. They model these scenarios...

    Provided By University of Mary Washington

  • White Papers // Dec 2012

    Runtime Optimizations for Prediction with Tree-Based Models

    Tree-based models have proven to be an effective solution for web ranking as well as other problems in diverse domains. This paper focuses on optimizing the runtime performance of applying such models to make predictions, given an already trained model. Although exceedingly simple conceptually, most implementations of tree-based models do...

    Provided By University of Mary Washington

  • White Papers // Dec 2012

    An Efficient CCA2-Secure Variant of the McEliece Cryptosystem in the Standard Model

    Recently, a few Chosen Ciphertext Attacks secure (CCA2-secure) variants of the McEliece Public-Key Encryption (PKE) scheme in the standard model were introduced. All the proposed schemes are based on encryption repetition paradigm and use general transformation from CPA-secure scheme to a CCA2- secure one. Therefore, the resulting encryption scheme needs...

    Provided By University of Mary Washington

  • White Papers // Dec 2012

    Verifiable Data Streaming

    In a verifiable data streaming protocol, the client streams a long string to the server who stores it in its database. The stream is verifiable in the sense that the server can neither change the order of the elements nor manipulate them. The client may also retrieve data from the...

    Provided By University of Mary Washington

  • White Papers // Nov 2012

    Anti Error Propagation Methods for Wireless Uplink Using Network Coding

    Wireless network coding suffers the error propagation issues that may severely degrade the diversity performance. In this paper, the authors develop two power scaling schemes at the relay side and two detection schemes at the receiver side, respectively, to mitigate error propagation in network-coded uplink channel and thus achieve full...

    Provided By University of Mary Washington

  • White Papers // Nov 2012

    Probabilistic Computation for Information Security

    Probabilistic computation is a convenient means of mechanically reasoning about a variety of information security problems. At its core, information security concerns itself with measuring or limiting the knowledge an adversary might attain from interacting with a protected system. Probabilistic inference lets one compute this knowledge explicitly as long as...

    Provided By University of Mary Washington

  • White Papers // Oct 2012

    Multi-View Constrained Clustering with an Incomplete Mapping Between Views

    Multi-view learning algorithms typically assume a complete bipartite map-ping between the different views in order to exchange information during the learning process. However, many applications provide only a partial mapping between the views, creating a challenge for current methods. To address this problem, the authors propose a multi-view algorithm based...

    Provided By University of Mary Washington

  • White Papers // Oct 2012

    Systematic Integration of Flowgraph- and Module-Level Parallelism in Implementation of DSP Applications on Multiprocessor Systems-on-Chip

    Increasing use of Multi-Processor System-on-Chip (MPSoC) technology is an important trend in the design and implementation of signal processing systems. However, the design of efficient DSP software for MPSoC platforms involves complex inter-related steps, including data decomposition, memory management, and inter-task and inter-thread synchronization. These design steps are challenging, especially...

    Provided By University of Mary Washington

  • White Papers // Sep 2012

    Secure Degrees of Freedom of the Gaussian Wiretap Channel With Helpers

    The secrecy capacity of the canonical Gaussian wiretap channel does not scale with the transmit power, and hence, the secure d.o.f. of the Gaussian wiretap channel with no helpers is zero. It has been known that a strictly positive secure d.o.f. can be obtained in the Gaussian wiretap channel by...

    Provided By University of Mary Washington

  • White Papers // Sep 2012

    Secure Degrees of Freedom of One-Hop Wireless Networks

    The authors study the secure Degrees of Freedom (DoF) of one-hop wireless networks by considering four fundamental wireless network structures: Gaussian wiretap channel, Gaussian broadcast channel with confidential messages, Gaussian interference channel with confidential messages, and Gaussian multiple access wiretap channel. The secrecy capacity of the canonical Gaussian wiretap channel...

    Provided By University of Mary Washington

  • White Papers // Sep 2012

    Cluster-Based Instance Consolidation for Subsequent Matching

    Instance consolidation is a way to merge instances that are thought to be the same or closely related that can be used to support co-reference resolution and entity linking. For Semantic Web data, consolidating instances can be as simple as relating instances using owl: sameAs, as is the case in...

    Provided By University of Mary Washington

  • White Papers // Jul 2012

    Gaussian Wiretap Channel With a Batteryless Energy Harvesting Transmitter

    The authors study the Gaussian wiretap channel with an energy harvesting transmitter which does not have a battery to save energy. In the absence of a battery, the necessary transmission energy is maintained by an i.i.d. energy arrival process. They observe that this channel is an instance of the state-dependent...

    Provided By University of Mary Washington

  • White Papers // Jul 2012

    Gaussian Wiretap Channel With an Amplitude Constraint

    The authors consider the Gaussian wiretap channel with an amplitude constraint, i.e., a peak power constraint, on the channel input. They show that the entire rate-equivocation region of the Gaussian wiretap channel with an amplitude constraint is obtained by discrete input distributions with finite support. They prove this result by...

    Provided By University of Mary Washington

  • White Papers // Jul 2012

    A Domain Independent Framework for Extracting Linked Semantic Data From Tables

    Vast amounts of information is encoded in tables found in documents, on the Web, and in spreadsheets or databases. Integrating or searching over this information benefits from understanding its intended meaning and making it explicit in a semantic representation language like RDF. Most current approaches to generating Semantic Web representations...

    Provided By University of Mary Washington

  • White Papers // Jul 2012

    A Policy-Based Approach to Smart Cloud Services

    Virtualized service models are now emerging and redefining the way information technology is delivered. Managing these services efficiently over the cloud is an open challenge. The authors are developing a policy-based integrated framework for automating acquisition and consumption of Cloud services. They have developed a tool, Smart Cloud Services tool,...

    Provided By University of Mary Washington

  • White Papers // Dec 2009

    Efficient Rational Secret Sharing in Standard Communication Networks

    The authors propose a new methodology for rational secret sharing leading to various instantiations (in both the two-party and multi-party settings) that are simple and efficient in terms of computation, share size, and round complexity. Their protocols do not require physical assumptions or simultaneous channels, and can even be run...

    Provided By University of Mary Washington

  • White Papers // Sep 2009

    Proofs of Storage from Homomorphic Identification Protocols

    Proofs of Storage (PoS) are interactive protocols allowing a client to verify that a server faithfully stores a file. Previous paper has shown that proofs of storage can be constructed from any Homomorphic Linear Authenticator (HLA). The latter, roughly speaking, are signature/message authentication schemes where `Tags' on multiple messages can...

    Provided By University of Mary Washington

  • White Papers // Mar 2007

    Round-Efficient Secure Computation in Point-to-Point Networks

    Essentially all work studying the round complexity of secure computation assume broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poor round complexity when compiled for a point-to-point network due to the high overhead of emulating each invocation of broadcast. This problem is compounded when...

    Provided By University of Mary Washington

  • White Papers // Nov 2012

    Probabilistic Computation for Information Security

    Probabilistic computation is a convenient means of mechanically reasoning about a variety of information security problems. At its core, information security concerns itself with measuring or limiting the knowledge an adversary might attain from interacting with a protected system. Probabilistic inference lets one compute this knowledge explicitly as long as...

    Provided By University of Mary Washington

  • White Papers // Jul 2011

    Generating Linked Data by Inferring the Semantics of Tables

    Vast amounts of information are encoded in structured tables found in documents, on the web, and in spreadsheets or databases. Integrating or searching over this information benefits from understanding its intended meaning. Evidence for a table's meaning can be found in its column headers, cell values, implicit relations between columns,...

    Provided By University of Mary Washington

  • White Papers // Sep 2011

    Data Structure Choices for On-the-Fly Model Checking of Real-Time Systems

    In this paper, the authors study the performance of sparse-matrix-based data structures to represent clock zones (convex sets of clock values) in an on-the-fly predicate equation system model checker for timed automata. They analyze the impact of replacing the dense Difference Bound Matrix (DBM) with both the linked-list CRDZone and...

    Provided By University of Mary Washington

  • White Papers // Aug 2006

    Affine Nested Loop Programs and their Binary Parameterized Dataflow Graph Counterparts

    The behavior of signal processing applications is very often specified in terms of (parameterized) static affine nested loop programs which are nested loop programs in which the loop boundaries, the conditions, and the variable indexing functions are affine functions of the loop iterators and parameters. Parameterized static affine nested loop...

    Provided By University of Mary Washington

  • White Papers // May 2013

    Optimal Scheduling for Energy Harvesting Transmitters With Hybrid Energy Storage

    The authors consider data transmission with an energy harvesting transmitter which has a hybrid energy storage unit composed of a perfectly efficient Super-Capacitor (SC) and an inefficient battery. The SC has finite space for energy storage while the battery has unlimited space. The transmitter can choose to store the harvested...

    Provided By University of Mary Washington

  • White Papers // May 2013

    An Improved Sub-Packetization Bound for Minimum Storage Regenerating Codes

    Distributed storage systems employ codes to provide resilience to failure of multiple storage disks. Specifically, an (n, k) MDS code stores k symbols in n disks such that the overall system is tolerant to a failure of up to n-k disks. However, access to at least k disks is still...

    Provided By University of Mary Washington

  • White Papers // Mar 2013

    Access vs. Bandwidth in Codes for Storage

    Erasure-correcting codes are the basis for widely used storage systems, where disks (nodes) correspond to symbols in the code. An important family of codes is the Maximum Distance Separable (MDS) codes, which provide an optimal resiliency to erasures for a given amount of redundancy. Namely, an MDS code with r...

    Provided By University of Mary Washington

  • White Papers // Mar 2014

    Oblivious Data Structures

    The authors are among the first to systematically investigate (memory-trace) oblivious data structures. They propose a framework for constructing a variety of oblivious data structures, achieving asymptotic performance gains in comparison with generic Oblivious RAM (ORAM). They evaluate the performance of their oblivious data structures in terms of their bandwidth...

    Provided By University of Mary Washington

  • White Papers // Oct 2012

    Systematic Integration of Flowgraph- and Module-Level Parallelism in Implementation of DSP Applications on Multiprocessor Systems-on-Chip

    Increasing use of Multi-Processor System-on-Chip (MPSoC) technology is an important trend in the design and implementation of signal processing systems. However, the design of efficient DSP software for MPSoC platforms involves complex inter-related steps, including data decomposition, memory management, and inter-task and inter-thread synchronization. These design steps are challenging, especially...

    Provided By University of Mary Washington

  • White Papers // Oct 2011

    Vectorization and Mapping of Software Defined Radio Applications on Heterogeneous Multi-Processor Platforms

    A variety of multiprocessor architectures have proliferated even for off-the-shelf computing platforms. To improve performance and productivity for common heterogeneous systems, the authors have developed a workflow to generate efficient solutions. By starting with a formal description of an application and the mapping problem they are able to generate a...

    Provided By University of Mary Washington

  • White Papers // Nov 2009

    Integration of Dataflow Optimization Techniques into a Software Radio Design Framework

    Application specific design frameworks, such as GNU Radio for software defined radio, facilitate fast design flows by leveraging the common application structures of particular domains and rich libraries of elements tailored to them. However, due to their focus on the application, implementations derived from these frameworks are often unable to...

    Provided By University of Mary Washington

  • White Papers // Nov 2010

    Design and Implementation of Real-time Signal Processing Applications on Heterogeneous Multiprocessor Arrays

    Processing structures based on arrays of computational elements form an important class of architectures, which includes Field Programmable Gate Arrays (FPGAs), systolic arrays, and various forms of multi-core processors. A wide variety of design methods and tools have been targeted to regular processing arrays involving homogeneous processing elements. In this...

    Provided By University of Mary Washington

  • White Papers // Jun 2010

    Rapid Prototyping for Digital Signal Processing Systems Using Parameterized Synchronous Dataflow Graphs

    Parameterized Synchronous DataFlow (PSDF) has been used previously for abstract scheduling and as a model for architecting embedded software and FPGA implementations. PSDF has been shown to be attractive for these purposes due to its support for flexible dynamic reconfiguration, and efficient quasi-static scheduling. To apply PSDF techniques more deeply...

    Provided By University of Mary Washington

  • White Papers // Nov 2008

    OpenDF - A Dataflow Toolset for Reconfigurable Hardware and Multicore Systems

    Time after time, the uniprocessor system has managed to survive in spite of rumors of its imminent death. Over the last three decades hardware engineers have been able to achieve performance gains by increasing clock speed, and introducing cache memories and instruction level parallelism. However, current developments in the hardware...

    Provided By University of Mary Washington

  • White Papers // Oct 2011

    Teaching Cross-Platform Design and Testing Methods for Embedded Systems Using DICE

    In this paper, the authors present a motivation for deep integration into embedded systems education of testing-driven design and methods for cross-platform and language-independent test suite development. To support these objectives, they introduce instructional applications of DICE (the DSPCAD Integrative Command line Environment), which is a package of utilities that...

    Provided By University of Mary Washington

  • White Papers // Jul 2009

    A Low-Overhead Scheduling Methodology for Fine-Grained Acceleration of Signal Processing Systems

    Fine-grained accelerators have the potential to deliver significant benefits in various platforms for embedded signal processing. Due to the moderate complexity of their targeted operations, these accelerators must be managed with minimal run-time overhead. In this paper, the authors present a methodology for applying flow-shop scheduling techniques to make effective,...

    Provided By University of Mary Washington

  • White Papers // Jan 2009

    Guest Editorial: Special Issue on Multi-Core Enabled Multimedia Applications & Architectures

    The trend of multi-core processor development brings a shift of paradigm in applications development. Traditionally, increasing clock frequency is one of the main dimensions for conventional processors to achieve higher performance gains. Application developers used to improve performance of their applications by just waiting for faster processor platforms. Today, increasing...

    Provided By University of Mary Washington

  • White Papers // Mar 2009

    An Integrated ASIP Design Flow for Digital Signal Processing Applications

    Application Specific Instruction set Processors (ASIP) allow designers to optimize the architecture of an embedded processor to meet the specific demands of a particular application. A complementary form of customization is provided by domain-specific Models of Computations (MoCs), which can expose the high level structure of applications that is useful...

    Provided By University of Mary Washington

  • White Papers // Aug 2011

    Model-Based Precision Analysis and Optimization for Digital Signal Processors

    Embedded signal processing has witnessed explosive growth in recent years in both scientific and consumer applications, driving the need for complex, high-performance signal processing systems that are largely application driven. In order to efficiently implement these systems on programmable platforms such as Digital Signal Processors (DSPs), it is important to...

    Provided By University of Mary Washington

  • White Papers // Jul 2010

    Efficient Static Buffering to Guarantee Throughput-Optimal FPGA Implementation of Synchronous Dataflow Graphs

    When designing DSP applications for implementation on Field Programmable Gate Arrays (FPGAs), it is often important to minimize consumption of limited FPGA resources while satisfying real-time performance constraints. In this paper, the authors develop efficient techniques to determine dataflow graph buffer sizes that guarantee throughput-optimal execution when mapping Synchronous DataFlow...

    Provided By University of Mary Washington

  • White Papers // Feb 2012

    Mapping Parameterized Cyclo-Static Dataflow Graphs Onto Configurable Hardware

    In recent years, parameterized dataflow has evolved as a useful framework for modeling synchronous and cyclo-static graphs in which arbitrary parameters can be changed dynamically. Parameterized dataflow has proven to have significant expressive power for managing dynamics of DSP applications in important ways. However, efficient hardware synthesis techniques for parameterized...

    Provided By University of Mary Washington

  • White Papers // Jul 2006

    Memory-Constrained Block Processing Optimization for Synthesis of DSP Software

    Digital Signal Processing (DSP) applications involve processing long streams of input data. It is important to take into account this form of processing when implementing embedded software for DSP systems. Task-level vectorization, or block processing, is a useful dataflow graph transformation that can significantly improve execution performance by allowing subsequences...

    Provided By University of Mary Washington

  • White Papers // Mar 2010

    Buffer Management for Multi-Application Image Processing on Multi-Core Platforms: Analysis and Case Study

    Due to the limited amounts of on-chip memory, large volumes of data, and performance and power consumption overhead associated with interprocessor communication, efficient management of buffer memory is critical to multi-core image processing. To address this problem, this paper develops new modeling and analysis techniques based on dataflow representations, and...

    Provided By University of Mary Washington

  • White Papers // Jun 2009

    High-Performance Buffer Mapping to Exploit DRAM Concurrency in Multiprocessor DSP Systems

    Design methodologies and tools based on the Synchronous DataFlow (SDF) model of computation have proven useful for rapid prototyping and implementation of Digital Signal Processing (DSP) applications on multiprocessor systems. One significant problem that arises when mapping applications onto such embedded multiprocessors is the memory wall problem, which is becoming...

    Provided By University of Mary Washington

  • White Papers // Nov 2006

    Dataflow Transformations in High-Level DSP System Design

    Dataflow graph transformations are important in many contexts of SoC implementation, particularly in the domain of signal processing. Most previous work on dataflow graph transformations has focused on synchronous dataflow and closely-related representations. However, because SDF is limited to expressing static dataflow behaviors, modern SoC applications are often not fully...

    Provided By University of Mary Washington

  • White Papers // Oct 2006

    A Communication Interface for Multiprocessor Signal Processing Systems

    Parallelization of embedded software is often desirable for power/performance-related considerations for computation-intensive applications that frequently occur in the signal-processing domain. Although hardware support for parallel computation is increasingly available in embedded processing platforms, there is a distinct lack of effective software support. One of the most widely known efforts in...

    Provided By University of Mary Washington

  • White Papers // May 2008

    Design Methodology for Embedded Computer Vision Systems

    Embedded systems that deploy computer vision applications are becoming common in the users day-to-day consumer lives with the advent of cell-phones, PDAs, cameras, portable game systems, smart cameras and so on. The complexity of such embedded systems is expected to rise even further as consumers demand more functionality and performance...

    Provided By University of Mary Washington

  • White Papers // Aug 2013

    Hone: \"Scaling Down\" Hadoop on Shared-Memory Systems

    The underlying assumption behind Hadoop and, more generally, the need for distributed processing is that the data to be analyzed cannot be held in memory on a single machine. Today, this assumption needs to be re-evaluated. Although petabyte-scale data-stores are increasingly common, it is unclear whether \"Typical\" analytics tasks require...

    Provided By University of Mary Washington

  • White Papers // Aug 2013

    Schema Extraction for Tabular Data on the Web

    Tabular data is an abundant source of information on the web, but remains mostly isolated from the latter are interconnections since tables lack links and computer-accessible descriptions of their structure. In other words, the schemas of these tables - attribute names, values, data types, etc. - are not explicitly stored...

    Provided By University of Mary Washington

  • White Papers // Jan 2014

    Hierarchical Interconnects for On-Chip Clustering

    In the sub-micron technology era, wire delays are becoming much more important than gate delays, making it particularly attractive to go for clustered designs. A common form of clustering adopted in processors is to replace the centralized instruction scheduler with multiple smaller schedulers that work in parallel within a single...

    Provided By University of Mary Washington

  • White Papers // Dec 2006

    Fully-Buffered DIMM Memory Architectures: Understanding Mechanisms, Overheads and Scaling

    Performance gains in memory have traditionally been obtained by increasing memory bus widths and speeds. The diminishing returns of such techniques have led to the proposal of an alternate architecture, the Fully-Buffered DIMM. This new standard replaces the conventional memory bus with a narrow, high-speed interface between the memory controller...

    Provided By University of Mary Washington

  • White Papers // Nov 2013

    Optimal Locally Repairable Codes and Connections to Matroid Theory

    Petabyte-scale distributed storage systems are currently transitioning to erasure codes to achieve higher storage efficiency. Classical codes like reed-solomon are highly sub-optimal for distributed environments due to their high overhead in single-failure events. Locally Repairable Codes (LRCs) form a new family of codes that are repair efficient. In particular, LRCs...

    Provided By University of Mary Washington

  • White Papers // Oct 2007

    Customizable Embedded System Architectures

    The authors outline a framework for dynamic application customization for low-power and real-time embedded systems. The framework implements a cross-layer application-customizable embedded systems platform, in which the hardware, the system software, and the application tasks are fine-tuned in their interaction and functionality to the requirements of the program under execution....

    Provided By University of Mary Washington

  • White Papers // Apr 2013

    Memory Trace Oblivious Program Execution

    Cloud computing allows users to delegate data and computation to cloud service providers, at the cost of giving up physical control of their computing infrastructure. An attacker with physical access to the computing platform can perform various physical attacks, including probing memory buses and cold-boot style attacks. Previous work on...

    Provided By University of Mary Washington

  • White Papers // Mar 2014

    Verifiable Oblivious Storage

    The authors formalize the notion of Verifiable Oblivious Storage (VOS), where a client outsources the storage of data to a server while ensuring data confidentiality, access pattern privacy, and integrity and freshness of data accesses. VOS generalizes the notion of Oblivious RAM (ORAM) in that it allows the server to...

    Provided By University of Mary Washington

  • White Papers // Apr 2012

    Buffer-On-Board Memory System

    The design and implementation of the commodity memory architecture has resulted in significant performance and capacity limitations. To circumvent these limitations, designers and vendors have begun to place intermediate logic between the CPU and DRAM. This additional logic has two functions: to control the DRAM and to communicate with the...

    Provided By University of Mary Washington

  • White Papers // Jun 2008

    CMP$im: A Pin-Based On-The-Fly Multi-Core Cache Simulator

    Chip Multi-Processors (CMPs) are the next attractive point in the design space of future high performance processors. There is a growing need for simulation methodologies to determine the memory system requirements of emerging workloads in a reasonable amount of time. To explore the design space of a CMP memory hierarchy,...

    Provided By University of Mary Washington