University of Illinois at Urbana Champaign

Displaying 1-40 of 92 results

  • White Papers // Feb 2014

    Multi-tier Dynamic Vectorization for Translating GPU Optimizations into CPU Performance

    Developing high performance GPU code is labor intensive. Ideally, developers could recoup high GPU development costs by generating high-performance programs for CPUs and other architectures from the same source code. However, current OpenCL compilers for non-GPUs do not fully exploit optimizations in well-tuned GPU codes. To address this problem, the...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Jan 2014

    A Framework for Dynamic Energy Efficiency and Temperature Management

    While technology is delivering increasingly sophisticated and powerful chip designs, it is also imposing alarmingly high energy requirements on the chips. One way to address this problem is to manage the energy dynamically. Unfortunately, current dynamic schemes for energy management are relatively limited. In addition, they manage energy either for...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Jan 2014

    Characterizing the Effects of Transient Faults on a High-Performance Processor Pipeline

    The progression of implementation technologies into the sub-100 nanometer lithographies renew the importance of understanding and protecting against single-event upsets in digital systems. In this work, the effects of transient faults on high performance microprocessors are explored. To perform a thorough exploration, a highly detailed register transfer level model of...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Jan 2014

    Hardware/System Support for Four Economic Models for Many Core Computing

    In this paper, the authors argue for a new set of economic models for many-core computing. Current economic models for processors require a customer to estimate her average-case or worst-case computational requirements beforehand and then buy a processor/system that meets those needs. Physically changing the chip is the only way...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Dec 2013

    Employees' Acceptance of Knowledge Management Systems and Its Impact on Creating Learning Organizations

    Many organizations are eager to become learning organizations that are known to contribute to increased financial performance, innovation, and the retention of workers who possess valuable organizational knowledge. For this reason, Knowledge Management Systems (KMSs) in reality have been utilized as a means to foster the development of learning organizations....

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Nov 2013

    A Framework for Evaluating Intrusion Detection Architectures in Advanced Metering Infrastructures

    The scale and complexity of Advanced Metering Infrastructure (AMI) networks requires careful planning for the deployment of security solutions. In particular, the large number of AMI devices and the volume and diversity of communication expected to take place on the various AMI networks make the role of Intrusion Detection Systems...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Nov 2013

    Semantic Frame-Based Document Representation for Comparable Corpora

    Document representation is a fundamental problem for text mining. Many efforts have been done to generate concise yet semantic representation, such as bag-of-words, phrase, sentence and topic-level descriptions. Nevertheless, most existing techniques counter difficulties in handling monolingual comparable corpus, which is a collection of monolingual documents conveying the same topic....

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Oct 2013

    A Feature-Enhanced Ranking-Based Classifier for Multimodal Data and Heterogeneous Information Networks

    The authors propose a heterogeneous information network mining algorithm: Feature-enhanced RankClass (F-RankClass). F-RankClass extends RankClass to a unified classification framework that can be applied to binary or multiclass classification of unimodal or multimodal data. They experimented on a multimodal document dataset, 2008/9 Wikipedia selection for schools. For unimodal classification, F-RankClass...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Sep 2013

    An Actor-Centric, Asset-Based Monitor Deployment Model for Cloud Computing

    Effective monitoring is essential for the security of cloud systems. Although many monitoring tools exist in the cloud domain, there is little guidance on how to deploy monitors to make the most of collected monitor data and increase the chances of detecting security breaches. The authors introduce an actor-centric, asset-based...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Apr 2013

    Large-Scale Spectral Clustering on Graphs

    Graph clustering has received growing attention in recent years as an important analytical technique, both due to the prevalence of graph data, and the usefulness of graph structures for exploiting intrinsic data characteristics. However, as graph data grows in scale, it becomes increasingly more challenging to identify clusters. In this...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Apr 2013

    Learning Universally Quantified Invariants of Linear Data Structures

    The authors propose a new automaton model, called quantified data automata over words that can model quantified invariants over linear data structures, and build poly-time active learning algorithms for them, where the learner is allowed to query the teacher with membership and equivalence queries. In order to express invariants in...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Jan 2013

    MemGuard: Memory Bandwidth Reservation System for Efficient Performance Isolation in Multi-Core Platforms

    Memory bandwidth in modern multi-core platforms is highly variable for many reasons and is a big challenge in designing real-time systems as applications are increasingly becoming more memory intensive. In this paper, the authors proposed, designed, and implemented an efficient memory bandwidth reservation system, that they call MemGuard. MemGuard distinguishes...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Jan 2013

    SecureCore: A Multicore-Based Intrusion Detection Architecture for Real-Time Embedded Systems

    Security violations are becoming more common in real-time systems - an area that was considered to be invulnerable in the past - as evidenced by the recent W32.Stuxnet and Duqu worms. A failure to protect such systems from malicious entities could result in significant harm to both humans as well...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Jan 2013

    Adaptive Reliability Chipkill Correct (ARCC)

    Chipkill correct is an advanced type of error correction in memory that is popular among servers. Large field studies of memories have shown that chipkill correct reduces uncorrectable error rate by 4X to 36X compared to SECDED. Currently, there is a strong trade-off between power and reliability among different chipkill...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Jan 2013

    Refrint: Intelligent Refresh to Minimize Power in On-Chip Multiprocessor Cache Hierarchies

    As manycores use dynamic energy ever more efficiently, static power consumption becomes a major concern. In particular, in a large manycore running at a low voltage, leakage in on-chip memory modules contributes substantially to the chip's power draw. This is unfortunate, given that, intuitively, the large multi-level cache hierarchy of...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Dec 2012

    Smart Grid Protocol Testing Through Cyber-Physical Testbeds

    Sound cyber security testing is a critical challenge, in particular for large and complex systems such as the smart grid. In this paper, the authors explore the need for, and specific issues involved in, security testing for smart grid components and standards and how testbeds play a critical role in...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Dec 2012

    A General Framework for Distributed Vote Aggregation

    The authors present a general model for opinion dynamics in a social network together with several possibilities for object selections at times when the agents are communicating. They explain the limiting behavior of such a dynamics and show that this dynamics almost surely converges. They consider some special implications of...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Dec 2012

    Low Rank Mechanism for Optimizing Batch Queries Under Differential Privacy

    Differential privacy is a promising privacy-preserving paradigm for statistical query processing over sensitive data. It works by injecting random noise into each query result, such that it is provably hard for the adversary to infer the presence or absence of any individual record from the published noisy results. The main...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Oct 2012

    AMI Threats, Intrusion Detection Requirements and Deployment Recommendations

    Advanced Metering Infrastructures (AMI) facilitates bidirectional communication between smart meters and utilities, allowing information about consumption, outages, and electricity rates to be shared reliably and efficiently. However, the numerous smart meters being connected through mesh networks open new opportunities for attackers to interfere with communications and compromise utilities' assets or...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Oct 2012

    ETM: Entity Topic Models for Mining Documents Associated with Entities

    Topic models, which factor each document into different topics and represent each topic as a distribution of terms, have been widely and successfully used to better understand collections of text documents. However, documents are also associated with further information, such as the set of real-world entities mentioned in them. For...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Oct 2012

    Stream Classification with Recurring and Novel Class Detection using Class-Based Ensemble

    Concept-evolution has recently received a lot of attention in the context of mining data streams. Concept-evolution occurs when a new class evolves in the stream. Although many recent studies address this issue, most of them do not consider the scenario of recurring classes in the stream. A class is called...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Oct 2012

    Towards Active Learning on Graphs: An Error Bound Minimization Approach

    Active learning on graphs has received increasing interest in the past years. In this paper, the authors propose a non-adaptive active learning approach on graphs, based on generalization error bound minimization. In particular, they present a data-dependent error bound for a graph-based learning method, namely Learning with Local and Global...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Oct 2012

    Risk-Sensitive Mean Field Games

    In this paper, the authors study a class of risk-sensitive mean-field stochastic differential games. They show that under appropriate regularity conditions, the mean-field value of the stochastic differential game with exponentiated integral cost functional coincides with the value function described by a Hamilton-Jacobi-Bellman (HJB) equation with an additional quadratic term....

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Sep 2012

    Cost Modeling of Response Actions for Automated Response and Recovery in AMI

    The smart grid is creating new security vulnerabilities due to the deployment of networked devices into the traditional grid. A core component of the smart grid is the Advanced Metering Infrastructures (AMIs), which increase the attack surface due to smart devices deployed at households. Manual management of security incidents in...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Jul 2012

    Hiding Checkpoint Overhead in HPC Applications with a Semi-Blocking Algorithm

    The HPC community has seen a steady increase in the number of components in every generation of supercomputers. Assembling a large number of components into a single cluster makes a machine more powerful, but also much more prone to failures. Therefore, fault tolerance has become a major concern in HPC....

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Jun 2012

    State-Based Analysis in ADVISE

    There is an increasing need for quantitative security metrics to empower the decision-making of system architects and administrators. The authors previously defined the ADVISE method, which combines a state-based security model and an adversary profile to generate quantitative metrics through simulation. Since simulation is often costly, particularly when applied to...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Jun 2012

    Heavy Traffic Optimal Resource Allocation Algorithms for Cloud Computing Clusters

    Cloud computing is emerging as an important platform for business, personal and mobile computing applications. In this paper, the authors explain a stochastic model of cloud computing, where jobs arrive according to a stochastic process and request resources like CPU, memory and storage space. They consider a model where the...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // May 2012

    Surviving Congestion in Geo-Distributed Storage Systems

    In this paper, the authors presented Vivace, a distributed key value storage system that replicates data synchronously across many sites, while being able to cope with congestion of the links connecting those sites. Vivace relies on two novel algorithms that can overcome congestion by prioritizing a small amount of critical...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Apr 2012

    Memory Access Control in Multiprocessor for Real-time Systems with Mixed Criticality

    Shared resource access interference, particularly memory and system bus, is a big challenge in designing predictable real-time systems because its worst case behavior can significantly differ. In this paper, the authors propose a software based memory throttling mechanism to explicitly control the memory interference. They developed analytic solutions to compute...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Apr 2012

    Understanding the Role of Automated Response Actions in Improving AMI Resiliency

    The smart grid promises better services and higher reliability but is exposed to new security threats. In particular, deployment of Advanced Metering Infrastructures (AMIs) will vastly increase the attack surface because of the smart meters installed in customer homes. Managing the security of AMIs cannot be done manually because of...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Mar 2012

    Octopus: A Secure and Anonymous DHT Lookup

    Distributed Hash Table (DHT) lookup is a core technique in structured Peer-to-Peer (P2P) networks. Its decentralized nature introduces security and privacy vulnerabilities for applications built on top of them; thus set out to design a lookup mechanism achieving both security and anonymity, heretofore an open problem. The authors present Octopus,...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Mar 2012

    An Algorithm for Fast Edit Distance Computation on GPUs

    The problem of finding the edit distance between two sequences are important problems with applications in many domains like virus scanners, security kernels, natural language translation and genome sequence alignment. The traditional dynamic-programming based algorithm is hard to parallelize on SIMD processors as the algorithm is memory intensive and has...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Feb 2012

    S3A: Secure System Simplex Architecture for Enhanced Security of Cyber-Physical Systems

    Until recently, cyber-physical systems, especially those with safety-critical properties that manage critical infrastructure (e.g. power generation plants, water treatment facilities, etc.) were considered to be invulnerable against software security breaches. The recently discovered 'W32.Stuxnet' worm has drastically changed this perception by demonstrating that such systems are susceptible to external attacks....

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Jan 2012

    Fixed and Market Pricing for Cloud Services

    This paper considers two simple pricing schemes for selling cloud instances and studies the trade-off between them. The authors characterize the equilibrium for the hybrid system where arriving jobs can choose between fixed or the market based pricing. They provide theoretical and simulation based evidence suggesting that fixed price generates...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Jan 2012

    BulkSMT: Designing SMT Processors for Atomic-Block Execution

    Multiprocessor architectures that continuously execute atomic blocks (or chunks) of instructions can improve performance and software productivity. However, all of the prior proposals for such architectures assume single-context cores as building blocks - rather than the widely-used Simultaneous Multi-Threading (SMT) cores. As a result, they are underutilizing hardware resources. This...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Jan 2012

    Power Balanced Pipelines

    Since, the onset of pipelined processors, balancing the delay of the microarchitectural pipeline stages such that each microarchitectural pipeline stage has an equal delay has been a primary design objective, as it maximizes instruction throughput. Unfortunately, this causes significant energy inefficiency in processors, as each microarchitectural pipeline stage gets the...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Jul 2011

    Dynamic Load Balance for Optimized Message Logging in Fault Tolerant HPC Applications

    Computing systems will grow significantly larger in the near future to satisfy the needs of computational scientists in areas like climate modeling, biophysics and cosmology. Supercomputers being installed in the next few years will comprise millions of cores, hundreds of thousands of processor chips and millions of physical components. However,...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Jun 2011

    The Multiple-Asymmetric-Utility System Model: A Framework for Modeling Cyber-Human Systems

    Traditional cyber security modeling approaches either do not explicitly consider system participants or assume a fixed set of participant behaviors that are independent of the system. Increasingly, accumulated cyber security data indicate that system participants can play an important role in the creation or elimination of cyber security vulnerabilities. Thus,...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Jun 2011

    Model-Based Security Metrics Using ADversary VIew Security Evaluation (ADVISE)

    System architects need quantitative security metrics to make informed trade-off decisions involving system security. The security metrics need to provide insight on weak points in the system defense, considering characteristics of both the system and its adversaries. To provide such metrics, the authors formally define the ADversary VIew Security Evaluation...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // May 2011

    P3CA: Private Anomaly Detection Across ISP Networks

    Detection of malicious traffic in the Internet would be much easier if ISP networks shared their traffic traces. Unfortunately, state-of-the-art anomaly detection algorithms require detailed traffic information which is considered extremely private by operators. To address this, the authors propose an algorithm that allows ISPs to cooperatively detect anomalies without...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Jan 2010

    Structured Databases on the Web: Observations and Implications

    The Web has been rapidly "Deepened" by the prevalence of databases online. With the potentially unlimited information hidden behind their query interfaces, this "Deep Web" of searchable databases is clearly an important frontier for data access. This paper surveys this relatively unexplored frontier, measuring characteristics pertinent to both exploring and...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Sep 2009

    Analyzing 802.11n Performance Gains

    This paper examines the peak performance of an 802.11n system with respect to the achievable throughput and the authors decompose the gains observed due to the various PHY/MAC layer features offered from 802.11n. The results show that while the MIMO PHY and channel bonding offered from 802.11n increase the PHY...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Jan 2011

    MiddleWhere: A Middleware for Location Awareness in Ubiquitous Computing Applications

    Location awareness significantly enhances the functionality of ubiquitous computing services and applications, and enriches the way they interact with users and resources in the environment. Many different alternative or complementary location sensing technologies are available. However, these technologies give location information in different formats and with different resolution and confidence....

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Dec 2008

    Business Intelligence & IT Governance: The Current Trend and Its Implication on Modern Businesses

    Businesses go through many changes and challenges during its lifetime whether those changes threaten the stability of the business, improve its business processes, or even affect its internal structure. The changing market is constantly introducing new challenges for businesses every day whether it is through a shift in trends or...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Sep 2008

    Probabilistic Modeling and Analysis of DoS Protection for the ASV Protocol

    The Adaptive Selective Verification (ASV) protocol was recently proposed as an effective and efficient DoS countermeasure within the shared channel model, in which clients and attackers probabilistically share communication bandwidth with the server. ASV has been manually shown to satisfy some desirable availability and bandwidth consumption properties. Due to the...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Mar 2009

    Privacy and Ethical Issues in Location-Based Tracking Systems

    Location-based Tracking Systems (LTSs) use a variety of technologies to record the locations of objects. An LTS can increase the risks to the privacy and security of individuals. Previous studies have failed to distinguish between losses and violations of privacy when the locations of individuals are recorded by an LTS....

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Oct 2008

    Text Cube: Computing IR Measures for Multidimensional Text Database Analysis

    Since Jim Gray introduced the concept of "Data cube" in 1997, data cube, associated with OnLine Analytical Processing (OLAP), has become a driving engine in data warehouse industry. Because the boom of Internet has given rise to an ever increasing amount of text data associated with other multidimensional information, it...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Jun 2010

    VEX: Vetting Browser Extensions for Security Vulnerabilities

    The browser has become the de facto platform for everyday computation. Among the many potential attacks that target or exploit browsers, vulnerabilities in browser extensions have received relatively little attention. Currently, extensions are vetted by manual inspection, which does not scale well and is subject to human error. In this...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Jan 2011

    Are Disks the Dominant Contributor for Storage Failures? A Comprehensive Study of Storage Subsystem Failure Characteristics

    Building reliable storage systems becomes increasingly challenging as the complexity of modern storage systems continues to grow. Understanding storage failure characteristics is crucially important for designing and building a reliable storage system. While several recent studies have been conducted on understanding storage failures, almost all of them focus on the...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // May 2011

    P3CA: Private Anomaly Detection Across ISP Networks

    Detection of malicious traffic in the Internet would be much easier if ISP networks shared their traffic traces. Unfortunately, state-of-the-art anomaly detection algorithms require detailed traffic information which is considered extremely private by operators. To address this, the authors propose an algorithm that allows ISPs to cooperatively detect anomalies without...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Apr 2011

    CoCo: Coding-Based Covert Timing Channels for Network Flows

    In this paper, the authors propose CoCo, a novel framework for establishing covert timing channels. The CoCo covert channel modulates the covert message in the inter-packet delays of the network flows, while a coding algorithm is used to ensure the robustness of the covert message to different perturbations. The CoCo...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Oct 2010

    Towards Improving Network Flow Watermarks Using the Repeat-Accumulate Codes

    Network intruders try to hide their identity by relaying their traffic through a number of intermediate hosts, called stepping stones. Network flow watermarks have been used to detect such attacks by inserting a special timing pattern into one flow by means of artificial delays and detecting relayed flows by searching...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Jan 2011

    Scalable Modeling and Performance Evaluation of Wireless Sensor Networks

    A notable feature of many proposed Wireless Sensor Networks (WSNs) deployments is their scale: hundreds to thousands of nodes linked together. In such systems, modeling the state of the entire system as a cross-product of the states of individual nodes results in the well-known state explosion problem. Instead, the authors...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Sep 2009

    Statistical Guarantees of Performance for MIMO Designs

    Sources of noise such as quantization, introduce randomness into Register Transfer Level (RTL) designs of Multiple Input Multiple Output (MIMO) systems. Performance of these MIMO RTL designs is typically quantified by metrics averaged over simulations. In this paper, the authors introduce a formal approach to compute these metrics with high...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Jan 2009

    Performance Tradeoffs Among Percolation-Based Broadcast Protocols in Wireless Sensor Networks

    Broadcast of information in wireless sensor networks is an important operation, e.g., for code updates, queries, membership information, etc. In this paper, the authors analyze and experimentally compare the performance of vanilla versions of several well-known broadcast mechanisms namely, flooding, site percolation, bond percolation, and modified bond percolation. They carry...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // May 2010

    Backpressure-Based Packet-by-Packet Adaptive Routing in Communication Networks

    Backpressure-based adaptive routing algorithms where each packet is routed along a possibly different path have been extensively studied in the literature. However, such algorithms typically result in poor delay performance and involve high implementation complexity. In this paper, the authors develop a new adaptive routing algorithm built upon the widely-studied...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Aug 2010

    On the Achievable Throughput of CSMA Under Imperfect Carrier Sensing

    Recently, it has been shown that a simple, distributed CSMA algorithm is throughput-optimal. However, throughput-optimality is established under the perfect or ideal carrier sensing assumption, i.e., each link can precisely sense the presence of other active links in its neighborhood. In contrast, the authors investigate achievable throughput of the CSMA...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Jun 2010

    A Study on False Channel Condition Reporting Attacks in Wireless Networks

    Wireless networking protocols are increasingly being designed to exploit a user's measured channel condition; the authors call such protocols channel-aware. Each user reports its measured channel condition to a manager of wireless resources and a channel-aware protocol uses these reports to determine how resources are allocated to users. In a...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Oct 2012

    Risk-Sensitive Mean Field Games

    In this paper, the authors study a class of risk-sensitive mean-field stochastic differential games. They show that under appropriate regularity conditions, the mean-field value of the stochastic differential game with exponentiated integral cost functional coincides with the value function described by a Hamilton-Jacobi-Bellman (HJB) equation with an additional quadratic term....

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Mar 2012

    Octopus: A Secure and Anonymous DHT Lookup

    Distributed Hash Table (DHT) lookup is a core technique in structured Peer-to-Peer (P2P) networks. Its decentralized nature introduces security and privacy vulnerabilities for applications built on top of them; thus set out to design a lookup mechanism achieving both security and anonymity, heretofore an open problem. The authors present Octopus,...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Feb 2012

    S3A: Secure System Simplex Architecture for Enhanced Security of Cyber-Physical Systems

    Until recently, cyber-physical systems, especially those with safety-critical properties that manage critical infrastructure (e.g. power generation plants, water treatment facilities, etc.) were considered to be invulnerable against software security breaches. The recently discovered 'W32.Stuxnet' worm has drastically changed this perception by demonstrating that such systems are susceptible to external attacks....

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Jun 2010

    Fictitious Play with Time-Invariant Frequency Update for Network Security

    The authors explain two-player security games which can be viewed as sequences of nonzero-sum matrix games played by an Attacker and a Defender. The evolution of the game is based on a stochastic fictitious play process, where players do not have access to each other's payoff matrix. Each has to...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Mar 2010

    Security Games with Decision and Observation Errors

    The authors explain two-player security games which can be viewed as sequences of nonzero-sum matrix games played by an Attacker and a Defender. The evolution of the game is based on a stochastic fictitious play process. Players do not have access to each other's payoff matrix. Each has to observe...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Feb 2010

    Assisted Common Information with Applications to Secure Two-Party Computation

    Secure multi-party computation is a central problem in modern cryptography. An important sub-class of this are problems of the following form: Alice and Bob desire to produce sample(s) of a pair of jointly distributed random variables. Each party must learn nothing more about the other party's output than what its...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Jun 2012

    Heavy Traffic Optimal Resource Allocation Algorithms for Cloud Computing Clusters

    Cloud computing is emerging as an important platform for business, personal and mobile computing applications. In this paper, the authors explain a stochastic model of cloud computing, where jobs arrive according to a stochastic process and request resources like CPU, memory and storage space. They consider a model where the...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Jan 2012

    Fixed and Market Pricing for Cloud Services

    This paper considers two simple pricing schemes for selling cloud instances and studies the trade-off between them. The authors characterize the equilibrium for the hybrid system where arriving jobs can choose between fixed or the market based pricing. They provide theoretical and simulation based evidence suggesting that fixed price generates...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Dec 2012

    A General Framework for Distributed Vote Aggregation

    The authors present a general model for opinion dynamics in a social network together with several possibilities for object selections at times when the agents are communicating. They explain the limiting behavior of such a dynamics and show that this dynamics almost surely converges. They consider some special implications of...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Dec 2012

    Low Rank Mechanism for Optimizing Batch Queries Under Differential Privacy

    Differential privacy is a promising privacy-preserving paradigm for statistical query processing over sensitive data. It works by injecting random noise into each query result, such that it is provably hard for the adversary to infer the presence or absence of any individual record from the published noisy results. The main...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Dec 2008

    RAINBOW: A Robust and Invisible Non-Blind Watermark for Network Flows

    Linking network flows is an important problem in intrusion detection as well as anonymity. Passive traffic analysis can link flows but requires long periods of observation to reduce errors. Watermarking techniques allow for better precision and blind detection, but they do so by introducing significant delays to the traffic flow,...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Oct 2010

    AtomTracker: A Comprehensive Approach to Atomic Region Inference and Violation Detection

    A particularly insidious type of concurrency bug is atomicity violations. While there has been substantial work on automatic detection of atomicity violations, each existing technique has focused on a certain type of atomic region. To address this limitation, this paper presents AtomTracker, a comprehensive approach to atomic region inference and...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Sep 2010

    InstantCheck: Checking the Determinism of Parallel Programs Using On-the-fly Incremental Hashing

    Developing multithreaded programs in shared-memory systems is difficult. One key reason is the non-determinism of thread interaction, which may result in one code input producing different outputs in different runs. Unfortunately, enforcing determinism by construction typically comes at a performance, hardware, or programmability cost. An alternative is to check during...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Sep 2010

    ScalableBulk: Scalable Cache Coherence for Atomic Blocks in a Lazy Environment

    Recently-proposed architectures that continuously operate on atomic blocks of instructions (also called chunks) can boost the programmability and performance of shared-memory multiprocessing. However, they must support chunk operations very efficiently. In particular, in lazy conflict-detection environments, it is key that they provide scalable chunk commits. Unfortunately, current proposals typically fail...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Jan 2014

    A Framework for Dynamic Energy Efficiency and Temperature Management

    While technology is delivering increasingly sophisticated and powerful chip designs, it is also imposing alarmingly high energy requirements on the chips. One way to address this problem is to manage the energy dynamically. Unfortunately, current dynamic schemes for energy management are relatively limited. In addition, they manage energy either for...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Sep 2007

    Paceline: Improving Single-Thread Performance in Nanoscale CMPs Through Core Overclocking

    Under current worst-case design practices, manufacturers specify conservative values for processor frequencies in order to guarantee correctness. To recover some of the lost performance and improve single-thread performance, this paper presents the Paceline leader-checker microarchitecture. In Paceline, a leader core runs the thread at higher-than-rated frequency, while passing execution hints...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Sep 2007

    Uncorq: Unconstrained Snoop Request Delivery in Embedded-Ring Multiprocessors

    Snoopy cache coherence can be implemented in any physical network topology by embedding a logical unidirectional ring in the network. Control messages are forwarded using the ring, while other messages can use any path. While the resulting coherence protocols are inexpensive to implement, they enable many ways of overlapping multiple...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Sep 2006

    Scalable Cache Miss Handling for High Memory-Level Parallelism

    Recently-proposed processor microarchitectures for high Memory Level Parallelism (MLP) promise substantial performance gains. Unfortunately, current cache hierarchies have Miss-Handling Architectures (MHAs) that are too limited to support the required MLP - they need to be redesigned to support 1-2 orders of magnitude more outstanding misses. Yet, designing scalable MHAs is...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Sep 2008

    EVAL: Utilizing Processors with Variation-Induced Timing Errors

    Parameter variation in integrated circuits causes sections of a chip to be slower than others. If, to prevent any resulting timing errors, the authors design processors for worst-case parameter values, they may lose substantial performance. An alternate approach explored in this paper is to design for closer to nominal values,...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Sep 2008

    Facelift: Hiding and Slowing Down Aging in Multicores

    Processors progressively age during their service life due to normal workload activity. Such aging results in gradually slower circuits. Anticipating this fact, designers add timing guardbands to processors, so that processors last for a number of years. As a result, aging has important design and cost implications. To address this...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Jul 2010

    Scaling eCGA Model Building via Data-Intensive Computing

    In this paper, the authors show how the extended compact genetic algorithm can be scaled using data-intensive computing techniques such as MapReduce. Two different frameworks (Hadoop and MongoDB) are used to deploy MapReduce implementations of the compact and extended compact genetic algorithms. Results show that both are good choices to...

    Provided By University of Illinois at Urbana Champaign

  • White Papers // Mar 2012

    An Algorithm for Fast Edit Distance Computation on GPUs

    The problem of finding the edit distance between two sequences are important problems with applications in many domains like virus scanners, security kernels, natural language translation and genome sequence alignment. The traditional dynamic-programming based algorithm is hard to parallelize on SIMD processors as the algorithm is memory intensive and has...

    Provided By University of Illinois at Urbana Champaign