University of Texas at Arlington

Displaying 1-40 of 79 results

  • White Papers // Feb 2014

    Localized Epidemic Detection in Networks with Overwhelming Noise

    The authors consider the problem of detecting an epidemic in a population where individual diagnoses are extremely noisy. The motivation for this problem is the plethora of examples (influenza strains in humans, or computer viruses in Smartphone, etc.) where reliable diagnoses are scarce, but noisy data plentiful. In flu/phone-viruses, exceedingly...

    Provided By University of Texas at Arlington

  • White Papers // Jan 2014

    FastSpot: Host-Compiled Thermal Estimation for Early Design Space Exploration

    Power and temperature of modern day systems have become important metrics in addition to performance. Static and dynamic power dissipation leads to an increase in temperature, which creates cooling and packaging issues. Furthermore, the transient thermal profile determines temperature gradients, hotspots and thermal cycles, which influence wear-out and reliability. Fast...

    Provided By University of Texas at Arlington

  • White Papers // Jan 2014

    Online/Offline Attribute-Based Encryption

    Attribute-Based Encryption (ABE) is a type of public key encryption that allows users to encrypt and decrypt messages based on user attributes. For instance, one can encrypt a message to any user satisfying the Boolean formula (\"Crypto conference attendee\" AND \"PhD student\") OR \"IACR member\". One drawback is that encryption...

    Provided By University of Texas at Arlington

  • White Papers // Jan 2014

    The Optimal Logic Depth Per Pipeline Stage is 6 to 8 FO4 Inverter Delays

    Improvements in microprocessor performance have been sustained by increases in both Instruction Per Cycle (IPC) and clock frequency. In recent years, increases in clock frequency have provided the bulk of the performance improvement. These increases have come from both technology scaling and deeper pipelining of designs. In this paper, the...

    Provided By University of Texas at Arlington

  • White Papers // Jan 2014

    Wish Branches: Enabling Adaptive and Aggressive Predicated Execution

    Predicated execution has been used to avoid the performance loss due to hard-to-predict branches. This approach eliminates a hard-to-predict branch from the program by converting the control dependency of the branch into a data dependency. Traditional predicated execution is not adaptive to run-time (dynamic) branch behavior. The compiler decides to...

    Provided By University of Texas at Arlington

  • White Papers // Jan 2014

    Maximizing Area Efficiency for Single-Chip Server Processors

    In this paper, the authors study area budgets for future single-chip server processors. They balance the area of different processing core organizations and cache configurations to determine which organizations can maximize job throughput on a chip with large numbers of processors. They find that, in future server processors, out-of-order issue...

    Provided By University of Texas at Arlington

  • White Papers // Jan 2014

    Optimal Architectures for Massively Parallel Implementation of Hard Real-Time Beamformers

    In this paper, the authors reports an experimental analysis of real-time computational architectures applied to digital time delay beamformation. The goal of this research has been to identify the most efficient multiprocessor utilization for a prototypical beamformer by modeling the signal processing and applying selected multiprocessor scheduling algorithms. A Synchronous...

    Provided By University of Texas at Arlington

  • White Papers // Jan 2014

    Control Flow Modeling in Statistical Simulation for Accurate and Efficient Processor Design Studies

    Designing a new microprocessor is extremely time-consuming. One of the contributing reasons is that computer designers rely heavily on detailed architectural simulations, which are very time-consuming. Recent paper has focused on statistical simulation to address this issue. The basic idea of statistical simulation is to measure characteristics during program execution,...

    Provided By University of Texas at Arlington

  • White Papers // Aug 2013

    Approximate Logic Synthesis Under General Error Magnitude and Frequency Constraints

    Recent interest in approximate circuit design is driven by its potential for large energy savings. In this paper, the authors address the problem of Approximate Logic Synthesis (ALS). ALS is concerned with formally synthesizing a minimum-cost approximate Boolean network whose behavior deviates in a well-defined manner from a specified exact...

    Provided By University of Texas at Arlington

  • White Papers // Jun 2013

    Fine Grain Word Length Optimization for Dynamic Precision Scaling in DSP Systems

    Dynamic precision scaling is a promising technique to reduce power consumption in Digital Signal Processing (DSP) systems. Power savings are achieved by dynamically adapting word lengths to a time-varying environment. Typical applications are wireless communication systems that operate under different wireless channel conditions. One of the obstacles of such techniques...

    Provided By University of Texas at Arlington

  • White Papers // Jun 2013

    Transforming A Linear Algebra Core to An FFT Accelerator

    In this paper, the authors consider the modifications required to transform a highly-efficient, specialized linear algebra core into an efficient engine for computing Fast Fourier Transforms (FFTs). They review the minimal changes required to support Radix-4 FFT computations and propose extensions to the micro-architecture of the baseline linear algebra core....

    Provided By University of Texas at Arlington

  • White Papers // May 2013

    Improving Internet Security Through Social Information and Social Comparison: A Field Quasi-Experiment

    Cybersecurity is a national priority in this big data era. Because of negative externalities and the resulting lack of economic incentives, companies often under invest in security controls, despite government and industry recommendations. Although many existing studies on security have explored technical solutions, only a few have looked at the...

    Provided By University of Texas at Arlington

  • White Papers // May 2013

    Toward a Fast Stochastic Simulation Processor for Biochemical Reaction Networks

    Computational studies of biological systems have gained widespread attention as a promising alternative to regular experimentation. Within this domain, stochastic simulation algorithms are widely used for in-silico studies of biochemical reaction networks, such as gene regulatory networks. However, inherent computational complexities limit wide-spread adoption and make traditional software solutions on...

    Provided By University of Texas at Arlington

  • White Papers // May 2013

    On/Off Macrocells and Load Balancing in Heterogeneous Cellular Networks

    The rate distribution in Heterogeneous Networks (HetNets) greatly benefits from load balancing, by which mobile users are pushed onto lightly-loaded small cells despite the resulting loss in SINR. This offloading can be made more aggressive and robust if the macrocells leave a fraction of time/frequency resource blank, which reduces the...

    Provided By University of Texas at Arlington

  • White Papers // May 2013

    On the Efficiency of Register File Versus Broadcast Interconnect for Collective Communications in Data-Parallel Hardware Accelerators

    Reducing power consumption and increasing efficiency is a key concern for many applications. How to design highly efficient computing elements while maintaining enough flexibility within a domain of applications is a fundamental question. In this paper, the authors present how broadcast buses can eliminate the use of power hungry multi-ported...

    Provided By University of Texas at Arlington

  • White Papers // Apr 2013

    Multi-Core Cache Hierarchy Modeling for Host-Compiled Performance Simulation

    The need for early software evaluation has increased interest in host-compiled or source-level simulation techniques. For accurate real-time performance evaluation, dynamic cache effects have to be considered in this process. However, in the context of coarse-grained simulation, fast yet accurate modeling of complex multi-core cache hierarchies poses several challenges. In...

    Provided By University of Texas at Arlington

  • White Papers // Feb 2013

    Low Delay MAC Scheduling for Frequency-Agile Multi-Radio Wireless Networks

    Recent trends suggest that cognitive radio based wireless networks will be frequency agile and the nodes will be equipped with multiple radios capable of tuning across large swaths of spectrum. The MAC scheduling problem in such networks refers to making intelligent decisions on which communication links to activate at which...

    Provided By University of Texas at Arlington

  • White Papers // Jan 2013

    Floating Point Architecture Extensions for Optimized Matrix Factorization

    In this paper, the authors examine the mapping of algorithms encountered when solving dense linear systems and linear least-squares problems to a custom linear algebra processor. Specifically, the focus is on Cholesky, LU (with partial pivoting), and QR factorizations. As part of the study, they expose the benefits of redesigning...

    Provided By University of Texas at Arlington

  • White Papers // Jan 2013

    Dynamic Spectrum Leasing Under Uncertainty: A Stochastic Variational Inequality Approach

    In this paper, the authors study the competition among the Primary Users (PUs) in a Dynamic Spectrum Leasing (DSL) system where multiple PUs lease spectrum to the Secondary Users (SUs) for monetary rewards. Considering the uncertainties of the PUs' channel gains and of the SUs' demands for spectrum, the competition...

    Provided By University of Texas at Arlington

  • White Papers // Nov 2012

    User Association for Load Balancing in Heterogeneous Cellular Networks

    To meet surging traffic demands, cellular networks are trending strongly towards increasing heterogeneity, especially through proliferation of small BSs, e.g., picocells and femtocells, which differ primarily in terms of maximum transmit power, physical size, ease-of-deployment and cost. For small cell technology to significantly increase the capacity of tower-based cellular networks,...

    Provided By University of Texas at Arlington

  • White Papers // Nov 2012

    Modeling, Analysis and Design for Carrier Aggregation in Heterogeneous Cellular Networks

    Carrier Aggregation (CA) and Heterogeneous base stations (HetNets) and are two distinct features of next-generation cellular networks. CA increases transmission bandwidth by aggregating multiple component carriers on the physical layer, while small cells in HetNets are vital for data off-loading and can significantly improve area spectral efficiency compared to using...

    Provided By University of Texas at Arlington

  • White Papers // Nov 2012

    Unifying Primary Cache, Scratch, and Register File Memories in a Throughput Processor

    Modern throughput processors such as GPUs employ thousands of threads to drive high-bandwidth, long-latency memory systems. These threads require substantial on-chip storage for registers, cache, and scratchpad memory. Existing designs hard-partition this local storage, fixing the capacities of these structures at design time. The authors evaluate modern GPU workloads and...

    Provided By University of Texas at Arlington

  • White Papers // Oct 2012

    Secure Cooperative Regenerating Codes for Distributed Storage Systems

    Regenerating codes enable trading off repair bandwidth for storage in Distributed Storage Systems (DSS). Due to their distributed nature, these systems are intrinsically susceptible to attacks, and they may be susceptible to multiple node failures. This paper analyzes storage systems that employ cooperative regenerating codes that are robust to (passive)...

    Provided By University of Texas at Arlington

  • White Papers // Sep 2012

    Relational Database to RDF Mapping Patterns

    In order to integrate relational databases into Semantic Web applications, relational databases need to be mapped to RDF. The W3C RDB2RDF working group is in the process of ratifying two standards to map relational databases to RDF: direct mapping and R2RML mapping language. Through the authors' experience as implementors of...

    Provided By University of Texas at Arlington

  • White Papers // Sep 2012

    Flat Datacenter Storage

    Flat Datacenter Storage (FDS) is a high-performance, fault-tolerant, large-scale, locality-oblivious blob store. Using a novel combination of full bisection bandwidth networks, data and metadata striping, and flow control, FDS multiplexes an application's large-scale I/O across the available throughput and latency budget of every disk in a cluster. FDS therefore makes...

    Provided By University of Texas at Arlington

  • White Papers // Aug 2012

    Design of Flexible Audio Processing Platforms Using the System-on-Chip Environment

    Embedded systems and general purpose computing systems used to be at opposite ends of design spectrum, with little to no overlap between each other. In this paper, the authors explain about the application of the System-on-Chip Environment (SCE) towards the design of hardware/software platforms for real-time audio processing following MP3,...

    Provided By University of Texas at Arlington

  • White Papers // Aug 2012

    Dynamic Credentials and Ciphertext Delegation for Attribute-Based Encryption

    Motivated by the question of access control in cloud storage, the authors consider the problem using Attribute-Based Encryption (ABE) in a setting where users' credentials may change and cipher-texts may be stored by a third party. They find that a comprehensive solution to their problem must simultaneously allow for the...

    Provided By University of Texas at Arlington

  • White Papers // Jul 2012

    On the Overhead of Interference Alignment: Training, Feedback, and Cooperation

    Interference Alignment (IA) is a cooperative transmission strategy that, under some conditions, achieves the interference channel's maximum number of degrees of freedom. Realizing IA gains, however, is contingent upon providing transmitters with sufficiently accurate channel knowledge. In this paper, the authors study the performance of IA in multiple-input multiple-output systems...

    Provided By University of Texas at Arlington

  • White Papers // Jul 2012

    Highly Secure Strong PUF Based on Nonlinearity of MOSFET Subthreshold Operation

    Silicon Physical Unclonable Functions (PUFs) are security primitives relying on intrinsic randomness of IC manufacturing. Strong PUFs have a very large input-output space which is essential for secure authentication. Several proposed strong PUFs use timing races to produce a rich set of responses. However, these PUFs are vulnerable to machine-learning...

    Provided By University of Texas at Arlington

  • White Papers // Jun 2012

    A Framework for Automation of System-level Design Space Exploration

    Design Space Exploration (DSE) is the task of identifying optimal implementation architectures for an application. On the front-end, it involves multi-objective optimization through a large space of options, and lends itself to a multitude of algorithmic approaches. On the back-end, it relies extensively on common capabilities such as model refinement,...

    Provided By University of Texas at Arlington

  • White Papers // Jun 2012

    Core-Level Activity Prediction for Multi-Core Power Management

    Existing power management techniques operate by reducing performance capacity (frequency, voltage, resource size) when performance demand is low, such as at idle or similar low activity phases. In the case of multi-core systems, the performance and power demand is the aggregate demand of all cores in the system. Monitoring aggregate...

    Provided By University of Texas at Arlington

  • White Papers // May 2012

    Functional Encryption for Regular Languages

    The authors provide a functional encryption system that supports functionality for regular languages. In their system a secret key is associated with a Deterministic Finite Automata (DFA) M. A ciphertext CT encrypts a message m and is associated with an arbitrary length string w. A user is able to decrypt...

    Provided By University of Texas at Arlington

  • White Papers // May 2012

    A Linear Algebra Core Design for Efficient Level-3 BLAS

    Reducing power consumption and increasing efficiency is a key concern for many applications. It is well-accepted that specialization and heterogeneity are crucial strategies to improve both power and performance. Yet, how to design highly efficient processing elements while maintaining enough flexibility within a domain of applications is a fundamental question....

    Provided By University of Texas at Arlington

  • White Papers // Apr 2012

    Low-Energy Signal Processing Using Circuit-Level Timing-Error Acceptance

    In Digital Signal Processing (DSP) applications, large energy gains can be obtained by accepting some degradation in the output signal quality. In this paper, the authors present static and dynamic techniques for circuit-level timing-error acceptance to significantly improve energy efficiency by shaping the quality energy tradeoff achievable via aggressive VDD...

    Provided By University of Texas at Arlington

  • White Papers // Feb 2012

    On Directly Mapping Relational Databases to RDF and OWL

    Mapping relational databases to RDF is a fundamental problem for the development of the Semantic Web. The authors present a solution, inspired by draft methods defined by the W3C where relational databases are directly mapped to RDF and OWL. Given a relational database schema and its integrity constraints, this direct...

    Provided By University of Texas at Arlington

  • White Papers // Jan 2012

    Low-delay Wireless Scheduling with Partial Channel-state Information

    The authors consider a server serving a time-slotted queued system of multiple packet-based flows, where not more than one flow can be serviced in a single time slot. The flows have exogenous packet arrivals and time-varying service rates. At each time, the server can observe instantaneous service rates for only...

    Provided By University of Texas at Arlington

  • White Papers // Jan 2012

    Queue-based Sub-carrier Grouping For Feedback Reduction In OFDMA Systems

    Sub-carrier grouping is a popular feedback reduction approach for Orthogonal-Frequency-Division Multiple-Access (OFDMA) systems that has been adopted into fourth-generation standards such as 3GPP Long Term Evolution (LTE). Feedback reduction is motivated by the fact that the bandwidth expenditure in acquiring full information in a downlink OFDMA system scales as the...

    Provided By University of Texas at Arlington

  • White Papers // Oct 2011

    Distributed Link Adaptation for Multicast Traffic in MIMO-OFDM Systems

    Multicast traffic exploits the broadcast nature of the wireless medium to deliver the same data to multiple users improving the bandwidth efficiency. Link adaptation can be used in multicast transmission to further increase data rates exploiting feedback from the users. However, it is not easy to have the Quality of...

    Provided By University of Texas at Arlington

  • White Papers // Jun 2011

    A High-Performance, Low-Power Linear Algebra Core

    Achieving high-performance while reducing power consumption is a key concern as technology scaling is reaching its limits. It is well-accepted that application-specific custom hardware can achieve orders of magnitude improvements in efficiency. The question is whether such efficiency can be maintained while providing enough flexibility to implement a broad class...

    Provided By University of Texas at Arlington

  • White Papers // Jun 2011

    A Programmable and Configurable Multi-Port System-on-Chip for Stimulating Electrokinetically-Driven Microfluidic Devices

    Recent research has demonstrated the use of microfluidic devices and electro-kinetics in areas such as medicine, genetics, embryology, epidemiology and pollution analysis, where manipulation of particles suspended in liquid media is required. Micro-fabrication technology has made it possible to increase system complexity and functionality by allowing integration of different processing...

    Provided By University of Texas at Arlington

  • White Papers // Jan 2010

    ReSCo: A Middleware Component for Reliable Service Composition in Pervasive Systems

    Service composition schemes create high-level application services by combining several basic services. Service composition schemes for dynamic, open systems, such as those found in pervasive environments, must be cognizant of the possibility of failures and attacks. In open systems, it is seldom feasible to guarantee the reliability of each node...

    Provided By University of Texas at Arlington

  • White Papers // Oct 2009

    Propagating Updates Through XML Views Using Lineage Tracing

    This paper addresses the problem of updating XML views over relational data by translating view updates expressed in the XQuery update facility to embedded SQL updates. Although the XML views may be defined using the full extent of the XQuery syntax, they can only connect relational tables through restricted one-to-many...

    Provided By University of Texas at Arlington

  • White Papers // Dec 2009

    Methodology To Forecast Product Returns For The Consumer Electronics Industry

    Reverse logistics has gained much attention in recent years. It is becoming a value added area of a supply chain network day by day. For enterprises, it has therefore become essential to manage the reverse flow of materials in an efficient way to gain competitive advantage. One important aspect of...

    Provided By University of Texas at Arlington

  • White Papers // Jan 2010

    A High Capacity Multihop Packet CDMA Wireless Network

    An adhoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure or centralized administration. Due to the limited transmission range of wireless network interfaces, multiple networks "Hops" may be needed for one node to exchange data with another...

    Provided By University of Texas at Arlington

  • White Papers // Jul 2012

    Highly Secure Strong PUF Based on Nonlinearity of MOSFET Subthreshold Operation

    Silicon Physical Unclonable Functions (PUFs) are security primitives relying on intrinsic randomness of IC manufacturing. Strong PUFs have a very large input-output space which is essential for secure authentication. Several proposed strong PUFs use timing races to produce a rich set of responses. However, these PUFs are vulnerable to machine-learning...

    Provided By University of Texas at Arlington

  • White Papers // May 2012

    Functional Encryption for Regular Languages

    The authors provide a functional encryption system that supports functionality for regular languages. In their system a secret key is associated with a Deterministic Finite Automata (DFA) M. A ciphertext CT encrypts a message m and is associated with an arbitrary length string w. A user is able to decrypt...

    Provided By University of Texas at Arlington

  • White Papers // Aug 2012

    Dynamic Credentials and Ciphertext Delegation for Attribute-Based Encryption

    Motivated by the question of access control in cloud storage, the authors consider the problem using Attribute-Based Encryption (ABE) in a setting where users' credentials may change and cipher-texts may be stored by a third party. They find that a comprehensive solution to their problem must simultaneously allow for the...

    Provided By University of Texas at Arlington

  • White Papers // Feb 2013

    Low Delay MAC Scheduling for Frequency-Agile Multi-Radio Wireless Networks

    Recent trends suggest that cognitive radio based wireless networks will be frequency agile and the nodes will be equipped with multiple radios capable of tuning across large swaths of spectrum. The MAC scheduling problem in such networks refers to making intelligent decisions on which communication links to activate at which...

    Provided By University of Texas at Arlington

  • White Papers // Jul 2012

    On the Overhead of Interference Alignment: Training, Feedback, and Cooperation

    Interference Alignment (IA) is a cooperative transmission strategy that, under some conditions, achieves the interference channel's maximum number of degrees of freedom. Realizing IA gains, however, is contingent upon providing transmitters with sufficiently accurate channel knowledge. In this paper, the authors study the performance of IA in multiple-input multiple-output systems...

    Provided By University of Texas at Arlington

  • White Papers // Feb 2012

    On Directly Mapping Relational Databases to RDF and OWL

    Mapping relational databases to RDF is a fundamental problem for the development of the Semantic Web. The authors present a solution, inspired by draft methods defined by the W3C where relational databases are directly mapped to RDF and OWL. Given a relational database schema and its integrity constraints, this direct...

    Provided By University of Texas at Arlington

  • White Papers // Oct 2012

    Secure Cooperative Regenerating Codes for Distributed Storage Systems

    Regenerating codes enable trading off repair bandwidth for storage in Distributed Storage Systems (DSS). Due to their distributed nature, these systems are intrinsically susceptible to attacks, and they may be susceptible to multiple node failures. This paper analyzes storage systems that employ cooperative regenerating codes that are robust to (passive)...

    Provided By University of Texas at Arlington

  • White Papers // May 2009

    Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions

    The authors present a new methodology for proving security of encryption systems using what they call dual system encryption. Their techniques result in fully secure Identity-Based Encryption (IBE) and Hierarchical Identity-Based Encryption (HIBE) systems under the simple and established decisional bilinear Diffie-Hellman and decisional linear assumptions. Their IBE system has...

    Provided By University of Texas at Arlington

  • White Papers // Jan 2014

    Online/Offline Attribute-Based Encryption

    Attribute-Based Encryption (ABE) is a type of public key encryption that allows users to encrypt and decrypt messages based on user attributes. For instance, one can encrypt a message to any user satisfying the Boolean formula (\"Crypto conference attendee\" AND \"PhD student\") OR \"IACR member\". One drawback is that encryption...

    Provided By University of Texas at Arlington

  • White Papers // Dec 2010

    Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization

    The authors present a new methodology for realizing Ciphertext-Policy Attribute Based Encryption (CP-ABE) under concrete and non-interactive cryptographic assumptions in the standard model. Their solutions allow any encrypt or to specify access control in terms of any access formula over the attributes in the system. In their most efficient system,...

    Provided By University of Texas at Arlington

  • White Papers // Jul 2008

    A Bootstrapping Architecture for Integration of Relational Databases to the Semantic Web

    The vision of the semantic web is to create a web of data with well-defined meaning. Most data in the current web is managed by relational databases. Thus, it is imperative for the semantic web community to offer easily implemented solutions to bridging relational database content and RDF. Direct mappings...

    Provided By University of Texas at Arlington

  • White Papers // Sep 2012

    Relational Database to RDF Mapping Patterns

    In order to integrate relational databases into Semantic Web applications, relational databases need to be mapped to RDF. The W3C RDB2RDF working group is in the process of ratifying two standards to map relational databases to RDF: direct mapping and R2RML mapping language. Through the authors' experience as implementors of...

    Provided By University of Texas at Arlington

  • White Papers // Jul 2009

    Transaction Level Modeling of Best-Effort Channels for Networked Embedded Devices

    Most of today's embedded systems exist in some form of a networked environment. Inspired by Ethernet as the most cost-effective local area network technology in general computing, embedded system designers have adapted it for industrial automation. The authors use Transaction Level Modeling techniques to specify and validate best-effort channels for...

    Provided By University of Texas at Arlington

  • White Papers // Dec 2007

    Global Optimization of Compositional Systems

    Embedded systems typically consist of a composition of a set of hardware and software IP modules. Each module is heavily optimized by itself. However, when these modules are composed together, significant additional opportunities for optimizations are introduced because only a subset of the entire functionality is actually used. The authors...

    Provided By University of Texas at Arlington

  • White Papers // Jun 2008

    Analyzing Queuing Systems with Coupled Processors Through Semidefinite Programming

    The authors consider queuing systems with coupled processors, where the service rate at each queue varies depending on the set of queues in the system with non-zero queue lengths. In general, such queuing systems are very difficult to analyze and steady state queue length distributions are known only for two-queue...

    Provided By University of Texas at Arlington

  • White Papers // Sep 2012

    Flat Datacenter Storage

    Flat Datacenter Storage (FDS) is a high-performance, fault-tolerant, large-scale, locality-oblivious blob store. Using a novel combination of full bisection bandwidth networks, data and metadata striping, and flow control, FDS multiplexes an application's large-scale I/O across the available throughput and latency budget of every disk in a cluster. FDS therefore makes...

    Provided By University of Texas at Arlington

  • White Papers // Feb 2010

    An Efficient Randomized Decentralized Algorithm for the Distributed Trigger Counting Problem

    In this paper, the authors study the Distributed Trigger Counting (DTC) problem. Consider a distributed system with n processors, in which each processor receives some triggers from an external source. Consider a distributed system with n processors, in which each processor receives some triggers from an external source. The distributed...

    Provided By University of Texas at Arlington

  • White Papers // Nov 2010

    A Methodology for Leveraging Reconfigurability in Domain Specific Languages

    All other things being equal, hardware specialized for a specific application will outperform hardware that has not been specialized for that specific application. Special-purpose hardware can dramatically accelerate an application. However, designing special-purpose hardware is often prohibitively expensive in terms of manpower and time. This paper describes a methodology that...

    Provided By University of Texas at Arlington

  • White Papers // Oct 2010

    Heterogeneous Multiprocessor Mapping for Real-Time Streaming Systems

    Real-time streaming signal processing systems typically desire high throughput and low latency. Many such systems can be modeled as synchronous data flow graphs. In this paper, the authors address the problem of multi-objective mapping of SDF graphs onto heterogeneous multi-processor platforms. The primary contributions include an Integer Linear Programming (ILP)...

    Provided By University of Texas at Arlington

  • White Papers // May 2013

    Toward a Fast Stochastic Simulation Processor for Biochemical Reaction Networks

    Computational studies of biological systems have gained widespread attention as a promising alternative to regular experimentation. Within this domain, stochastic simulation algorithms are widely used for in-silico studies of biochemical reaction networks, such as gene regulatory networks. However, inherent computational complexities limit wide-spread adoption and make traditional software solutions on...

    Provided By University of Texas at Arlington

  • White Papers // Jun 2011

    A Programmable and Configurable Multi-Port System-on-Chip for Stimulating Electrokinetically-Driven Microfluidic Devices

    Recent research has demonstrated the use of microfluidic devices and electro-kinetics in areas such as medicine, genetics, embryology, epidemiology and pollution analysis, where manipulation of particles suspended in liquid media is required. Micro-fabrication technology has made it possible to increase system complexity and functionality by allowing integration of different processing...

    Provided By University of Texas at Arlington

  • White Papers // Nov 2006

    Zero-Copy Queues for Native Signal Processing Using the Virtual Memory System

    The high performance of current general-purpose processors makes it feasible to perform digital signal processing on the main CPU of a workstation. As the performance gap between CPU speed and memory speed continues to increase, it becomes obvious that DSP applications on workstations must address memory performance. The authors present...

    Provided By University of Texas at Arlington

  • White Papers // Jan 2014

    Optimal Architectures for Massively Parallel Implementation of Hard Real-Time Beamformers

    In this paper, the authors reports an experimental analysis of real-time computational architectures applied to digital time delay beamformation. The goal of this research has been to identify the most efficient multiprocessor utilization for a prototypical beamformer by modeling the signal processing and applying selected multiprocessor scheduling algorithms. A Synchronous...

    Provided By University of Texas at Arlington

  • White Papers // Aug 2007

    The FAST Methodology for High-Speed SoC/Computer Simulation

    In this paper, the authors describe the FAST methodology that enables a single FPGA to accelerate the performance of cycle-accurate computer system simulators modeling modern, realistic SoCs, embedded systems and standard desktop/laptop/server computer systems. The methodology partitions a simulator into a functional model that simulates the functionality of the computer...

    Provided By University of Texas at Arlington

  • White Papers // Nov 2010

    Scalable Multi-Core Sonar Beamforming with Computational Process Networks

    In this paper, the authors evaluate the scalability with respect to processor cores of a three-dimensional sonar beamforming kernel implemented on a multi-core workstation. Beamforming is an example of an extremely parallelizable problem. This implementation is instrumented with OpenMP to exploit multi-core computer systems. However, when executed on a 16-core...

    Provided By University of Texas at Arlington

  • White Papers // Apr 2013

    Multi-Core Cache Hierarchy Modeling for Host-Compiled Performance Simulation

    The need for early software evaluation has increased interest in host-compiled or source-level simulation techniques. For accurate real-time performance evaluation, dynamic cache effects have to be considered in this process. However, in the context of coarse-grained simulation, fast yet accurate modeling of complex multi-core cache hierarchies poses several challenges. In...

    Provided By University of Texas at Arlington

  • White Papers // Sep 2007

    Data Mining and Coordination to Avoid Interference in Wireless Networks

    In this paper, the authors give an overview of a system-level framework to mitigate interference using coarse grained coordination of transmissions across base stations. Their approach is based on collecting and mining measured data capturing a user population's diversity in sensitivity to interference. Measurements of user's channel gains are clustered...

    Provided By University of Texas at Arlington

  • White Papers // Nov 2006

    Fusible Data Structures for Fault-Tolerance

    The authors introduce the concept of fusible data structures to maintain fault-tolerant data in distributed programs. Given a fusible data structure it is possible to combine a set of such structures into a single fused structure that is smaller than the combined size of the original structures. When any of...

    Provided By University of Texas at Arlington

  • White Papers // Feb 2009

    QUICK: A Flexible Full-System Functional Model

    Due to the high cost and time consuming nature of designing, testing, and manufacturing computer systems, simulation is extensively used to model and predict various attributes, such as performance or power, throughout the design cycles. In this paper, the authors introduce the concept of full-system complete-and-rollback functional simulators that make...

    Provided By University of Texas at Arlington

  • White Papers // Jan 2014

    Wish Branches: Enabling Adaptive and Aggressive Predicated Execution

    Predicated execution has been used to avoid the performance loss due to hard-to-predict branches. This approach eliminates a hard-to-predict branch from the program by converting the control dependency of the branch into a data dependency. Traditional predicated execution is not adaptive to run-time (dynamic) branch behavior. The compiler decides to...

    Provided By University of Texas at Arlington

  • White Papers // Dec 2008

    Express Cube Topologies for On-Chip Interconnects

    Driven by continuing scaling of Moore's law, Chip Multi-Processors (CMPs) and systems-on-a-chip are expected to grow the core count from dozens today to hundreds in the near future. Scalability of on-chip interconnect topologies is critical to meeting these demands. In this paper, the authors seek to develop a better understanding...

    Provided By University of Texas at Arlington

  • White Papers // Jun 2012

    Core-Level Activity Prediction for Multi-Core Power Management

    Existing power management techniques operate by reducing performance capacity (frequency, voltage, resource size) when performance demand is low, such as at idle or similar low activity phases. In the case of multi-core systems, the performance and power demand is the aggregate demand of all cores in the system. Monitoring aggregate...

    Provided By University of Texas at Arlington

  • White Papers // Feb 2007

    Complete System Power Estimation: A Trickle-Down Approach Based on Performance Events

    In this paper, the authors propose the use of microprocessor performance counters for online measurement of complete system power consumption. While past studies have demonstrated the use of performance counters for microprocessor power, to the best of their knowledge, the authors are the first to create power models for the...

    Provided By University of Texas at Arlington

  • White Papers // Feb 2006

    Measuring Benchmark Similarity Using Inherent Program Characteristics

    Modern day benchmark suites are typically comprised of a number of application programs where each benchmark consists of hundreds of billions of dynamic instructions. Therefore, a technique that can select a representative subset of programs from a benchmark suite can translate into large savings in simulation time with little loss...

    Provided By University of Texas at Arlington

  • White Papers // Apr 2007

    Mapping of Applications to Heterogeneous Multi-cores Based on Micro-architecture Independent Characteristics

    Heterogeneous multi-core processor is demonstrated to be more efficient than its homogeneous counterpart due to its ability to meet different resource requirements of the applications. One of the challenges of designing a heterogeneous multi-core is how to schedule programs to the core that can execute them most efficiently. This paper...

    Provided By University of Texas at Arlington

  • White Papers // Oct 2006

    Hardware Efficient Piecewise Linear Branch Predictor

    Piecewise linear branch predictor has been demonstrated to have superior prediction accuracy; however, its huge hardware overhead prevents the predictor from being practical in the VLSI design. This paper presents two novel techniques targeting at reducing the hardware cost of the predictor, i.e., history skewed indexing and stack-based misprediction recovery....

    Provided By University of Texas at Arlington