Princeton Software

Displaying 41-80 of 92 results

  • White Papers // Aug 2012

    Managing the Adoption of Asymmetric Bidirectional Firewalls: Seeding and Mandating

    The security of the Internet can be significantly improved if Internet Service Providers adopt firewalls to monitor traffic entering and leaving access networks. But this process suffers due to 'Free-riding', and hence, regulatory requirements and 'Seeding' strategies are required to influence the adoption process. In this paper, the authors analytically...

    Provided By Princeton Software

  • White Papers // Jul 2012

    Physical Layer Security in Wireless Networks With Passive and Active Eavesdroppers

    Security is becoming an increasingly important issue in wireless communications, to which physical layer approaches can contribute by providing addition resources for securing confidential messages. In this paper, the resilience of multi-user networks to passive and active eavesdropping is investigated. In particular, average secrecy capacities are evaluated in scenarios involving...

    Provided By Princeton Software

  • White Papers // Jul 2012

    PETRELS: Parallel Estimation and Tracking of Subspace by Recursive Least Squares From Partial Observations

    Many real world data sets exhibit an embedding of low-dimensional structure in a high-dimensional manifold. Examples include images, videos and internet traffic data. It is of great significance to reduce the storage requirements and computational complexity when the data dimension is high. Therefore, the authors consider the problem of reconstructing...

    Provided By Princeton Software

  • White Papers // Jul 2012

    To Code or Not to Code: Revisited

    The authors revisit the dilemma of whether one should or should not code when operating under delay constraints. In those curious cases when the source and the channel are probabilistically matched so that symbol-by-symbol coding is optimal in terms of the average distortion achieved, they show that it also achieves...

    Provided By Princeton Software

  • White Papers // Jun 2012

    Lossless Data Compression Rate: Asymptotics and Non-Asymptotics

    This paper considers the distribution of the optimum rate of lossless compression. It shows that in the non-asymptotic regime the fundamental limits of lossless compression with and without prefix constraints are tightly coupled. The authors give an exact analysis of the fundamental limit for arbitrary sources. Gaussian approximations to the...

    Provided By Princeton Software

  • White Papers // Jun 2012

    Physical Attack Protection With Human-Secure Virtualization in Data Centers

    Cloud computing-based data centers, which hold a large amount of customer data, are vulnerable to physical attacks and insider threats. Current protection and defense mechanisms for security of data held in data centers are either completely physical (sensors, barriers, etc.) or completely cyber (firewalls, encryption, etc.). In this paper, the...

    Provided By Princeton Software

  • White Papers // May 2012

    Channel Estimation Impact Over MIMO-MAC Achievable Rates

    The authors present inner and outer bounds of the rate region for the multiple-input-multiple-output mutiple access channel with imperfect channel estimates. They then employ them to compare different channel estimation techniques. They show that the benefit of using traditional compressed sensing recovery techniques, specifically orthogonal matching pursuit, for multipath wireless...

    Provided By Princeton Software

  • White Papers // May 2012

    Feedback and Delayed CSI Can Be as Good as Perfect CSI

    The Degrees of Freedom (DoF) region of the two-user MIMO Interference Channel (IC) is completely characterized in the presence of noiseless channel output feedback from each receiver to its respective transmitter and with the assumption of delayed Channel State Information (CSI) at the transmitters. It is shown that having output...

    Provided By Princeton Software

  • White Papers // May 2012

    A New Converse in Rate-Distortion Theory

    The fundamental problem in non-asymptotic rate-distortion theory is to estimate the minimum achievable source coding rate at any given block-length k compatible with allowable distortion d. This paper shows new finite-block-length converse bounds applicable to lossy source coding as well as joint source-channel coding, which are tight enough not only...

    Provided By Princeton Software

  • White Papers // May 2012

    A Scalable Server for 3D Metaverses

    Metaverses are three-dimensional virtual worlds where anyone can add and script new objects. Metaverses today, such as Second Life, are dull, lifeless, and stagnant because users can see and interact with only a tiny region around them, rather than a large and immersive world. Current metaverses impose this distance restriction...

    Provided By Princeton Software

  • White Papers // Apr 2012

    Achievability of Efficient Satisfaction Equilibria in Self-Configuring Networks

    In this paper, a behavioral rule that allows radio devices to achieve an Efficient Satisfaction Equilibrium (ESE) in fully Decentralized Self-Configuring Networks (DSCNs) is presented. The relevance of ESE in the context of DSCNs is that at such state, radio devices adopt a transmission/receive configuration such that they are able...

    Provided By Princeton Software

  • White Papers // Apr 2012

    A General Approach for Efficiently Accelerating Software-Based Dynamic Data Flow Tracking on Commodity Hardware

    Despite the demonstrated usefulness of Dynamic Data Flow Tracking (DDFT) techniques in a variety of security applications, the poor performance achieved by available prototypes prevents their widespread adoption and use in production systems. The authors present and evaluate a novel methodology for improving the performance overhead of DDFT frameworks, by...

    Provided By Princeton Software

  • White Papers // Feb 2012

    Enabling Application Directed Storage Systems

    Modern storage systems are becoming increasingly complex as the authors move towards multi-tiered systems composed of heterogeneous technologies. NAND-flash is a large contributor to this trend because of its low latency, high bandwidth, good density and power characteristics. A modern enterprise storage system is likely to contain: some DRAM used...

    Provided By Princeton Software

  • White Papers // Oct 2011

    Faster than Nyquist, Slower than Tropp

    The sampling rate of analog-to-digital converters is severely limited by underlying technological constraints. Recently, Tropp et al. proposed a new architecture, called a Random Demodulator (RD) that attempts to circumvent this limitation by sampling sparse, band-limited signals at a rate much lower than the Nyquist rate. An integral part of...

    Provided By Princeton Software

  • White Papers // Oct 2011

    Relative Entropy at the Channel Output of a Capacity-Achieving Code

    In this paper the authors establish a new inequality tying together the coding rate, the probability of error and the relative entropy between the channel and the auxiliary output distribution. This inequality is then used to show the strong converse, and to prove that the output distribution of a code...

    Provided By Princeton Software

  • White Papers // Oct 2011

    Choir Codes: Coding for Full Duplex Interference Management

    Communication networks conventionally operate with half-duplex methods and interference avoiding schemes to manage multiple transceivers. Here, the authors consider a method in which nodes transmit and receive in concert to achieve full duplex communication without transmitter coordination. They build on a recent framework for full-duplex communication in ad-hoc wireless networks...

    Provided By Princeton Software

  • White Papers // Aug 2011

    Fixed-Length Lossy Compression in the Finite Blocklength Regime: Gaussian Source

    If the block-length is permitted to grow without limit, the rate-distortion function characterizes the minimal source coding rate compatible with a given distortion level, either in average or excess distortion sense. However, as relatively short block-lengths are common in some applications due to both delay and coding complexity constraints, it...

    Provided By Princeton Software

  • White Papers // Jun 2011

    Asynchronous Code-Division Random Access Using Convex Optimization

    Many applications in cellular systems and sensor networks involve a random subset of a large number of users asynchronously reporting activity to a base station. This paper examines the problem of MUltiuser Detection (MUD) in random access channels for such applications. Traditional orthogonal signaling ignores the random nature of user...

    Provided By Princeton Software

  • White Papers // May 2011

    Exploring the Potential of CMP Core Count Management on Data Center Energy Savings

    A data center's power and energy consumption is a crucial design issue, and is often a fundamental determiner of its performance potential. Conventional power/energy management approaches data centers have focused on uniprocessor rather than multiprocessor servers and on techniques such as Dynamic Voltage and Frequency Scaling (DVFS). Given the increasing...

    Provided By Princeton Software

  • White Papers // May 2011

    Deterministic Pilot Sequences for Sparse Channel Estimation in OFDM Systems

    This paper examines the problem of multipath channel estimation in single-antenna Orthogonal Frequency Division Multiplexing (OFDM) systems. In particular, the authors study the problem of pilot assisted channel estimation in wideband OFDM systems, where the time-domain (discrete) channel is approximately sparse. Existing works on this topic established that techniques from...

    Provided By Princeton Software

  • White Papers // May 2011

    Minimum Energy to Send K Bits Through the Gaussian Channel with and Without Feedback

    This paper analyzes the behavior of the minimum energy per bit for memoryless Gaussian channels as a function of k, the number of information bits. It is demonstrated that in this non-asymptotic regime, noiseless feedback leads to significantly better energy efficiency. In particular, without feedback achieving energy per bit of...

    Provided By Princeton Software

  • White Papers // Feb 2011

    RegReS: Adaptively Maintaining a Target Density of Regional Services in Opportunistic Vehicular Networks

    Pervasive vehicle-mounted mobile devices are increasingly common, and can be viewed as a large-scale ad hoc network on which collaborative, location-based services can be directly supported. In order to support such services within a geographic region, a certain number of computational, storage and sensing mobile devices need to be carriers...

    Provided By Princeton Software

  • White Papers // Jan 2011

    Time-Dependent Broadband Pricing

    Charging different prices for Internet access at different times induces users to spread out their capacity, or bandwidth, g consumption across times of the day. Is it feasible and how much benefit can it bring? The authors design architecture for time-dependent broadband pricing. They develop an efficient way to compute...

    Provided By Princeton Software

  • White Papers // Jan 2011

    Identifying Important Places in People's Lives From Cellular Network Data

    People spend most of their time at a few key locations, such as home and work. Being able to identify how the movements of people cluster around these "Important places" is crucial for a range of technology and policy decisions, such as telecommunications and transportation infrastructure deployment. In this paper,...

    Provided By Princeton Software

  • White Papers // Jan 2011

    Scalable Speculative Parallelization on Commodity Clusters

    While clusters of commodity servers and switches are the most popular form of large-scale parallel computers, many programs are not easily parallelized for execution upon them. In particular, high inter-node communication cost and lack of globally shared memory appear to make clusters suitable only for server applications with abundant task-level...

    Provided By Princeton Software

  • White Papers // Dec 2010

    Protection Over Asymmetric Channels, S-MATE: Secure Multipath Adaptive Traffic Engineering

    There have been several approaches to the problem of provisioning traffic engineering between core network nodes in Internet Service Provider (ISP) networks. Such approaches aim to minimize network delay, increase capacity, and enhance security services between two core (relay) network nodes, an ingress node and an egress node. MATE (Multipath...

    Provided By Princeton Software

  • White Papers // Nov 2010

    Arimoto Channel Coding Converse and Renyi Divergence

    Arimoto proved a non-asymptotic upper bound on the probability of successful decoding achievable by any code on a given discrete memory-less channel. In this paper the authors present a simple derivation of the Arimoto converse based on the data-processing inequality for Renyi divergence. The method has two benefits. First, it...

    Provided By Princeton Software

  • White Papers // Nov 2010

    Channel Dispersion and Moderate Deviations Limits for Memoryless Channels

    Recently, Altug and Wagner posed a question regarding the optimal behavior of the probability of error when channel coding rate converges to the capacity sufficiently slowly. They gave a sufficient condition for the Discrete Memory-less Channel (DMC) to satisfy a Moderate Deviation Property (MDP) with the constant equal to the...

    Provided By Princeton Software

  • White Papers // Oct 2010

    S-MATE: Secure Coding-Based Multipath Adaptive Traffic Engineering

    There have been several approaches to provisioning traffic between core network nodes in Internet Service Provider (ISP) networks. Such approaches aim to minimize network delay, increase network capacity, and enhance network security services. MATE (Multipath Adaptive Traffic Engineering) protocol has been proposed for multipath adaptive traffic engineering between an ingress...

    Provided By Princeton Software

  • White Papers // Oct 2010

    Revisiting Model Selection and Recovery of Sparse Signals Using One-Step Thresholding

    This paper studies non-asymptotic model selection and recovery of sparse signals in high-dimensional, linear inference problems. In contrast to the existing literature, the focus here is on the general case of arbitrary design matrices and arbitrary nonzero entries of the signal. In this regard, it utilizes two easily computable measures...

    Provided By Princeton Software

  • White Papers // Sep 2010

    Multiuser Detection in Asynchronous On-Off Random Access Channels Using Lasso

    This paper considers on - off random access channels where users transmit either a one or a zero to a base station. Such channels represent an abstraction of control channels used for scheduling requests in third-generation cellular systems and uplinks in wireless sensor networks deployed for target detection. This paper...

    Provided By Princeton Software

  • White Papers // Sep 2010

    Uncertainty in Interdependent Security Games

    Even the well-motivated models of information security have application limitations due to the inherent uncertainties involving risk. This paper exemplifies a formal mechanism for resolving this kind of uncertainty in InterDependent Security (IDS) scenarios. The authors focus on a single IDS model involving a computer network, and adapt the model...

    Provided By Princeton Software

  • White Papers // Jul 2010

    Why Gabor Frames? Two Fundamental Measures of Coherence and Their Role in Model Selection

    The problem of model selection arises in a number of contexts, such as subset selection in linear regression, estimation of structures in graphical models, and signal denoising. This paper studies non-asymptotic model selection for the general case of arbitrary (random or deterministic) design matrices and arbitrary nonzero entries of the...

    Provided By Princeton Software

  • White Papers // May 2010

    Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography

    Motivated by the question of basing cryptographic protocols on stateless tamper-proof hardware tokens, the authors revisit the question of un-conditional two-prover zero-knowledge proofs for NP. Their main technical tool is a new primitive that they call interactive locking, an efficient realization of an unconditionally secure commitment scheme in the interactive...

    Provided By Princeton Software

  • White Papers // May 2010

    WideArea Route Control for Distributed Services

    Many distributed services would benefit from control over the flow of traffic to and from their users, to offer better performance and higher reliability at a reasonable cost. Unfortunately, although today's cloud-computing platforms offer elastic computing and bandwidth resources, they do not give services control over wide-area routing. The authors...

    Provided By Princeton Software

  • White Papers // Apr 2010

    Model Selection: Two Fundamental Measures of Coherence and Their Algorithmic Significance

    The problem of model selection arises in a number of contexts, such as compressed sensing, subset selection in linear regression, estimation of structures in graphical models, and signal denoising. This paper generalizes the notion of incoherence in the existing literature on model selection and introduces two fundamental measures of coherence...

    Provided By Princeton Software

  • White Papers // Apr 2010

    Self-Organized Spectrum Sharing in Large MIMO Multiple-Access Channels

    In this paper, a deterministic approximation for the rate region of multiple access channels is provided when base station and users have a large number of antennas, and when the transmission bandwidth is divided into several independent subbands. An explicit formulation is also given to the transmit covariance matrices, at...

    Provided By Princeton Software

  • White Papers // Dec 2009

    Obfuscation of Hyperplane Membership

    Previous paper on program obfuscation gives strong negative results for general-purpose obfuscators, and positive results for obfuscating simple functions such as equality testing (point functions). In this paper, the authors construct an obfuscator for a more complex algebraic functionality: testing for membership in a hyperplane (of constant dimension). They prove...

    Provided By Princeton Software

  • White Papers // Nov 2009

    The Capacity of the Frequency/Time-Selective Fading Channel

    The authors find the capacity of discrete-time channels subject to both frequency-selective and time-selective fading, where the channel output is observed in additive Gaussian noise. A coherent model is assumed where the fading coefficients are known at the receiver. Capacity depends on the first-order distributions of the fading processes in...

    Provided By Princeton Software

  • White Papers // Sep 2009

    Minimum Energy Per Bit for Gaussian Broadcast Channels with Common Message and Cooperating Receivers

    This paper considers a three - terminal communication problem with one source node which broadcasts a common message to two destination nodes over a wireless medium. The destination nodes can cooperate over bidirectional wireless links. The authors study the minimum energy per information bit for this setup when there is...

    Provided By Princeton Software

  • White Papers // Nov 2009

    The Capacity of the Frequency/Time-Selective Fading Channel

    The authors find the capacity of discrete-time channels subject to both frequency-selective and time-selective fading, where the channel output is observed in additive Gaussian noise. A coherent model is assumed where the fading coefficients are known at the receiver. Capacity depends on the first-order distributions of the fading processes in...

    Provided By Princeton Software

  • White Papers // Oct 2012

    Non-Asymptotic Achievability Bounds in Multiuser Information Theory

    Invoking random coding, but not typical sequences, the authors give non-asymptotic achievability results for the major setups in multiuser information theory. No limitations, such as memory-lessness or discreteness, on sources/channels are imposed. All the bounds given are powerful enough to yield the constructive side of the (asymptotic) capacity regions in...

    Provided By Princeton Software

  • White Papers // Apr 2013

    Optimal Lossless Compression: Source Varentropy and Dispersion

    This paper deals with the fundamental limits of strictly-lossless variable-length compression of known sources without prefix constraints. The source dispersion characterizes the time-horizon over which it is necessary to code in order to approach the entropy rate within a pre-specified tolerance. The authors show that for a large class of...

    Provided By Princeton Software

  • White Papers // Aug 2011

    Fixed-Length Lossy Compression in the Finite Blocklength Regime: Gaussian Source

    If the block-length is permitted to grow without limit, the rate-distortion function characterizes the minimal source coding rate compatible with a given distortion level, either in average or excess distortion sense. However, as relatively short block-lengths are common in some applications due to both delay and coding complexity constraints, it...

    Provided By Princeton Software

  • White Papers // Apr 2010

    Self-Organized Spectrum Sharing in Large MIMO Multiple-Access Channels

    In this paper, a deterministic approximation for the rate region of multiple access channels is provided when base station and users have a large number of antennas, and when the transmission bandwidth is divided into several independent subbands. An explicit formulation is also given to the transmit covariance matrices, at...

    Provided By Princeton Software

  • White Papers // May 2011

    Exploring the Potential of CMP Core Count Management on Data Center Energy Savings

    A data center's power and energy consumption is a crucial design issue, and is often a fundamental determiner of its performance potential. Conventional power/energy management approaches data centers have focused on uniprocessor rather than multiprocessor servers and on techniques such as Dynamic Voltage and Frequency Scaling (DVFS). Given the increasing...

    Provided By Princeton Software

  • White Papers // May 2010

    WideArea Route Control for Distributed Services

    Many distributed services would benefit from control over the flow of traffic to and from their users, to offer better performance and higher reliability at a reasonable cost. Unfortunately, although today's cloud-computing platforms offer elastic computing and bandwidth resources, they do not give services control over wide-area routing. The authors...

    Provided By Princeton Software

  • White Papers // Oct 2010

    S-MATE: Secure Coding-Based Multipath Adaptive Traffic Engineering

    There have been several approaches to provisioning traffic between core network nodes in Internet Service Provider (ISP) networks. Such approaches aim to minimize network delay, increase network capacity, and enhance network security services. MATE (Multipath Adaptive Traffic Engineering) protocol has been proposed for multipath adaptive traffic engineering between an ingress...

    Provided By Princeton Software

  • White Papers // May 2012

    Channel Estimation Impact Over MIMO-MAC Achievable Rates

    The authors present inner and outer bounds of the rate region for the multiple-input-multiple-output mutiple access channel with imperfect channel estimates. They then employ them to compare different channel estimation techniques. They show that the benefit of using traditional compressed sensing recovery techniques, specifically orthogonal matching pursuit, for multipath wireless...

    Provided By Princeton Software

  • White Papers // May 2012

    Feedback and Delayed CSI Can Be as Good as Perfect CSI

    The Degrees of Freedom (DoF) region of the two-user MIMO Interference Channel (IC) is completely characterized in the presence of noiseless channel output feedback from each receiver to its respective transmitter and with the assumption of delayed Channel State Information (CSI) at the transmitters. It is shown that having output...

    Provided By Princeton Software

  • White Papers // Dec 2010

    Protection Over Asymmetric Channels, S-MATE: Secure Multipath Adaptive Traffic Engineering

    There have been several approaches to the problem of provisioning traffic engineering between core network nodes in Internet Service Provider (ISP) networks. Such approaches aim to minimize network delay, increase capacity, and enhance security services between two core (relay) network nodes, an ingress node and an egress node. MATE (Multipath...

    Provided By Princeton Software

  • White Papers // Oct 2012

    Achieving Pareto Optimal Equilibria in Energy Efficient Clustered Ad Hoc Networks

    In this paper, a decentralized iterative algorithm able to achieve a Pareto optimal working point in a clustered ad hoc network is analyzed. Here, radio devices are assumed to operate above a minimal Signal to Interference plus Noise Ratio (SINR) threshold while minimizing the global power consumption. A distributed algorithm,...

    Provided By Princeton Software

  • White Papers // Sep 2012

    Performance Isolation and Fairness for Multi-Tenant Cloud Storage

    Shared storage services enjoy wide adoption in commercial clouds. But most systems today provide weak performance isolation and fairness between tenants, if at all. Misbehaving or high-demand tenants can overload the shared service and disrupt other well-behaved tenants, leading to unpredictable performance and violating SLAs. This paper presents Pisces, a...

    Provided By Princeton Software

  • White Papers // Dec 2009

    Obfuscation of Hyperplane Membership

    Previous paper on program obfuscation gives strong negative results for general-purpose obfuscators, and positive results for obfuscating simple functions such as equality testing (point functions). In this paper, the authors construct an obfuscator for a more complex algebraic functionality: testing for membership in a hyperplane (of constant dimension). They prove...

    Provided By Princeton Software

  • White Papers // Jun 2009

    Reconstructing RSA Private Keys from Random Key Bits

    The authors show that an RSA private key with small public exponent can be efficiently recovered given a 0.27 fraction of its bits at random. An important application of this work is to the \"Cold boot\" attacks of Halderman et al. They make new observations about the structure of RSA...

    Provided By Princeton Software

  • White Papers // Sep 2013

    Interference Masking for Secure Wireless Broadcast Communications

    Physical layer security has been recognized as a promising technique to realize secure wireless communications. In this paper, a novel interference masking approach is proposed for secure broadcast scenarios. Specifically when there is an external jamming node, pre-coding matrices at the source and jammer are carefully designed to ensure that...

    Provided By Princeton Software

  • White Papers // May 2010

    Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography

    Motivated by the question of basing cryptographic protocols on stateless tamper-proof hardware tokens, the authors revisit the question of un-conditional two-prover zero-knowledge proofs for NP. Their main technical tool is a new primitive that they call interactive locking, an efficient realization of an unconditionally secure commitment scheme in the interactive...

    Provided By Princeton Software

  • White Papers // Feb 2013

    Language-Based Security for Software-Defined Networks

    In many settings, including campuses, enterprises, militaries, and datacenters, networks must be shared between entities that send and receive traffic over common hardware. The authors analyze the fundamental problem of how to program shared networks in a secure and reliable manner. Their solution is based on a new programming model...

    Provided By Princeton Software

  • White Papers // Dec 2012

    Fairness and Isolation in Multi-Tenant Storage as Optimization Decomposition

    Shared storage services enjoy wide adoption in commercial clouds. But most systems today provide weak performance isolation and fairness between tenants, if at all. Most approaches to multi-tenant resource allocation are based either on per-VM allocations or hard rate limits that assume uniform workloads to achieve high utilization. Instead, Pisces,...

    Provided By Princeton Software

  • White Papers // Jan 2013

    Reducing GPU Offload Latency via Fine-Grained CPU-GPU Synchronization

    GPUs are seeing increasingly widespread use for general purpose computation due to their excellent performance for highly-parallel, throughput-oriented applications. For many workloads, however, the performance benefits of offloading are hindered by the large and unpredictable overheads of launching GPU kernels and of transferring data between CPU and GPU. This paper...

    Provided By Princeton Software

  • White Papers // Jul 2013

    Starchart: Hardware and Software Optimization Using Recursive Partitioning Regression Trees

    Graphics Processing Units (GPUs) are in increasingly wide use, but significant hurdles lie in selecting the appropriate algorithms, runtime parameter settings, and hardware configurations to achieve power and performance goals with them. Exploring hardware and software choices requires time consuming simulations or extensive real-system measurements. While some auto-tuning support has...

    Provided By Princeton Software

  • White Papers // May 2013

    Increasing Smart Meter Privacy Through Energy Harvesting and Storage Devices

    Smart meters are key elements for the operation of smart grids. By providing near real-time information on the energy consumption of individual users, smart meters increase the efficiency in generation, distribution and storage of energy in a smart grid. The ability of the utility provider to track users' energy consumption...

    Provided By Princeton Software

  • White Papers // Jan 2014

    GARNET: A Detailed On-Chip Network Model inside a Full-System Simulator

    Until very recently, microprocessor designs were computation-centric. On-chip communication was frequently ignored. This was because of fast, single-cycle on-chip communication. The interconnect power was also insignificant compared to the transistor power. With uniprocessor designs providing diminishing returns and the advent of Chip Multi-Processors (CMPs) in mainstream systems, the on-chip network...

    Provided By Princeton Software

  • White Papers // Jan 2014

    A Technology-Aware and Energy-Oriented Topology Exploration for On-Chip Networks

    On-chip interconnection networks have been proposed and used in the past few years to replace buses and dedicated wires as the standard on-chip interconnection fabric. As packet-switching interconnection networks replace buses and dedicated wires to become the standard on-chip interconnection fabric, reducing their power consumption has been identified to be...

    Provided By Princeton Software

  • White Papers // Apr 2014

    Nonparametric Detection of Anomalous Data via Kernel Mean Embedding

    An anomaly detection problem is investigated, in which there are totally n sequences with s anomalous sequences to be detected. Each normal sequence contains m independent and identically distributed (i.i.d.) samples drawn from a distribution p, whereas each anomalous sequence contains m i.i.d. samples drawn from a distribution q that...

    Provided By Princeton Software

  • White Papers // Aug 2006

    A Statistical Traffic Model for On-Chip Interconnection Networks

    Network traffic modeling is a critical first step towards understanding and unraveling network power/performance related issues. Extensive prior research in the area of classic networks such as the Internet, Ethernet, and wireless LANs transporting TCP/IP, HTTP, and FTP traffic among others, has demonstrated how traffic models and model-based synthetic traffic...

    Provided By Princeton Software

  • White Papers // Apr 2006

    Selective Runtime Memory Disambiguation in a Dynamic Binary Translator

    Alias analysis, traditionally performed statically, is unsuited for a Dynamic Binary Translator (DBT) due to incomplete control-flow information and the high complexity of an accurate analysis. Whole-program profiling, however, shows that most memory references do not alias. The current technique used in DBTs to disambiguate memory references, instruction inspection, is...

    Provided By Princeton Software

  • White Papers // Jun 2013

    Fast Condensation of the Program Dependence Graph

    Aggressive compiler optimizations are formulated around the Program Dependence Graph (PDG). Many techniques, including loop fission and parallelization are concerned primarily with dependence cycles in the PDG. The Directed Acyclic Graph of Strongly Connected Components (DAGSCC) represents these cycles directly. The naive method to construct the DAGSCC first computes the...

    Provided By Princeton Software

  • White Papers // Sep 2007

    Revisiting the Sequential Programming Model for Multi-Core

    Single-threaded programming is already considered a complicated task. The move to multi-threaded programming only increases the complexity and cost involved in software development due to rewriting legacy code, training of the programmer, increased debugging of the program, and efforts to avoid race conditions, deadlocks, and other problems associated with parallel...

    Provided By Princeton Software

  • White Papers // Jan 2011

    Scalable Speculative Parallelization on Commodity Clusters

    While clusters of commodity servers and switches are the most popular form of large-scale parallel computers, many programs are not easily parallelized for execution upon them. In particular, high inter-node communication cost and lack of globally shared memory appear to make clusters suitable only for server applications with abundant task-level...

    Provided By Princeton Software

  • White Papers // Jul 2007

    Speculative Decoupled Software Pipelining

    In recent years, microprocessor manufacturers have shifted their focus from single-core to multi-core processors. To avoid burdening programmers with the responsibility of parallelizing their applications, some researchers have advocated automatic thread extraction. A recently proposed technique, Decoupled SoftWare Pipelining (DSWP), has demonstrated promise by partitioning loops into long-running, fine-grained threads...

    Provided By Princeton Software

  • White Papers // Nov 2006

    Non-Uniform Fault Tolerance

    As devices become more susceptible to transient faults that can affect program correctness, processor designers will increasingly compensate by adding hardware or software redundancy. Proposed redundancy techniques and those currently in use are generally applied uniformly to a structure despite non-uniformity in the way errors within the structure manifest themselves...

    Provided By Princeton Software

  • White Papers // Mar 2014

    Integrating Energy Storage Into the Smart Grid: A Prospect Theoretic Approach

    In this paper, the interactions and energy exchange decisions of a number of geographically distributed storage units are studied under decision-making involving end-users. In particular, a non-cooperative game is formulated between customer-owned storage units where each storage unit's owner can decide on whether to charge or discharge energy with a...

    Provided By Princeton Software

  • White Papers // Feb 2014

    Parallel Streaming Computation on Error-Prone Processors

    Hardware fault rates are increasing due to decreasing transistor sizes in newer technology nodes. To ensure reliability, circuits need more redundancy and higher voltage margins, incurring high area/performance/energy overheads. Since some applications, such as multimedia processing and streaming applications, can tolerate some types of errors, approximate computing research has begun...

    Provided By Princeton Software

  • White Papers // Jun 2009

    PARSEC 2.0: A New Benchmark Suite for Chip-Multiprocessors

    The second version of the Princeton Application Repository for SharEd-memory Computers (PARSEC) has been released. PARSEC is a benchmark suite for Chip Multi-Processors (CMPs) that focus on emerging applications. It includes a diverse set of workloads from different domains such as interactive animation or systems applications that mimic large-scale commercial...

    Provided By Princeton Software

  • White Papers // Jan 2014

    Implementing Application-Specific Cache-Coherence Protocols in Configurable Hardware

    Streamlining communication is key to achieving good performance in shared-memory parallel programs. While full hardware support for cache coherence generally offers the best performance, not all parallel machines provide it. Instead, software layers using Shared Virtual Memory (SVM) can be built to enforce coherence at a higher level. In prior...

    Provided By Princeton Software

  • White Papers // Oct 2006

    Support for High-Frequency Streaming in CMPs

    As the industry moves toward larger-scale chip multiprocessors, the need to parallelize applications grows. High inter-thread communication delays, exacerbated by over-stressed high-latency memory subsystems and ever-increasing wire delays, require parallelization techniques to create partially or fully independent threads to improve performance. Unfortunately, developers and compilers alike often fail to find...

    Provided By Princeton Software

  • White Papers // Mar 2006

    Automatic Instruction-Level Software-Only Recovery

    As chip densities and clock rates increase, processors are becoming more susceptible to transient faults that can affect program correctness. Computer architects have typically addressed reliability issues by adding redundant hardware, but these techniques are often too expensive to be used widely. Software-only reliability techniques have shown promise in their...

    Provided By Princeton Software

  • White Papers // Nov 2006

    Configurable Transient Fault Detection Via Dynamic Binary Translation

    Smaller feature sizes, lower voltage levels, and reduced noise margins have helped improve the performance and lower the power consumption of modern microprocessors. These same advances have made processors more susceptible to transient faults that can corrupt data and make systems unavailable. Designers often compensate for transient faults by adding...

    Provided By Princeton Software

  • White Papers // Jan 2014

    Global Multi-Threaded Instruction Scheduling

    Recently, the microprocessor industry has moved toward Chip Multi-Processor (CMP) designs as a means of utilizing the increasing transistor counts in the face of physical and micro-architectural limitations. Despite this move, CMPs do not directly improve the performance of single threaded codes, a characteristic of most applications. In order to...

    Provided By Princeton Software