Carnegie Mellon University

Displaying 1-40 of 514 results

  • White Papers // Dec 2014

    Approximate Lifted Inference with Probabilistic Databases

    In this paper, the authors propose a new approach for approximate evaluation of P-hard queries with probabilistic databases. In their approach, every query is evaluated entirely in the database engine by evaluating a fixed number of query plans, each providing an upper bound on the true probability, then taking their...

    Provided By Carnegie Mellon University

  • White Papers // Jul 2014

    Phinding Phish: Evaluating Phishing Tools

    "There are currently dozens of freely available tools to combat phishing and other web-based scams, many of which are web browser extensions that warn users when they are browsing a suspected phishing site. The authors developed an automated test bed for testing anti-phishing tools. They used 200 verified phishing URLs...

    Provided By Carnegie Mellon University

  • White Papers // Jul 2014

    LAPWiN: Location-Aided Probing for Protecting User Privacy in Wi-Fi Networks

    Efficient Wi-Fi probing has been demonstrated to leak sensitive user information. During the probing process, Wi-Fi clients transmit the names of previously known Wi-Fi Access Points (APs) in plaintext. An eavesdropper can easily collect the information leaked by this Wi-Fi probing process to mount numerous attacks, such as fake AP...

    Provided By Carnegie Mellon University

  • White Papers // May 2014

    Studying the Effectiveness of Security Images in Internet Banking

    Security images are often used as part of the login process on internet banking websites, under the theory that they can help foil phishing attacks. Previous studies, however, have yielded inconsistent results about users' ability to notice that a security image is missing and their willingness to log in even...

    Provided By Carnegie Mellon University

  • White Papers // May 2014

    Characterizing Application Memory Error Vulnerability to Optimize Datacenter Cost Via Heterogeneous-Reliability Memory

    Memory devices represent a key component of datacenter Total Cost of Ownership (TCO), and techniques used to reduce errors that occur on these devices increase this cost. Existing approaches to providing reliability for memory devices pessimistically treat all data as equally vulnerable to memory errors. The authors' key insight is...

    Provided By Carnegie Mellon University

  • White Papers // Mar 2014

    All Your Screens are Belong to Us: Attacks Exploiting the HTML5 Screen Sharing API

    HTML5 changes many aspects in the browser world by introducing numerous new concepts; in particular, the new HTML5 screen sharing API impacts the security implications of browsers tremendously. One of the core assumptions on which browser security is built is that there is no cross-origin feedback loop from the client...

    Provided By Carnegie Mellon University

  • White Papers // Mar 2014

    The Heterogeneous Block Architecture

    This paper makes two new observations that lead to a new heterogeneous core design. First, the authors observe that most serial code exhibits fine-grained heterogeneity: at the scale of tens or hundreds of instructions, regions of code fit different micro-architectures better (at the same point or at different points in...

    Provided By Carnegie Mellon University

  • White Papers // Feb 2014

    Predictable Coherent Caching with Incoherent Caches

    Caches are a well known hardware construct for improving energy consumption and average performance by keeping frequently-used data near processing resources. Yet, at the same time, they form a major hurdle for worst-case execution time analyses, in particular if they are shared between multiple cores. Exploiting that most shared data...

    Provided By Carnegie Mellon University

  • White Papers // Feb 2014

    SpringFS: Bridging Agility and Performance in Elastic Distributed Storage

    The elastic storage systems can be expanded or contracted to meet current demand, allowing servers to be turned off or used for other tasks. However, the usefulness of an elastic distributed storage system is limited by its agility: how quickly it can increase or decrease its number of servers. Due...

    Provided By Carnegie Mellon University

  • White Papers // Jan 2014

    Toward Strong, Usable Access Control for Shared Distributed Data

    As non-expert users produce increasing amounts of personal digital data, usable access control becomes critical. Current approaches often fail, because they insufficiently protect data or confuse users about policy specification. This paper presents penumbra, a distributed file system with access control designed to match users' mental models while providing principled...

    Provided By Carnegie Mellon University

  • White Papers // Jan 2014

    Improving Cache Performance by Exploiting Read-Write Disparity

    Cache read misses stall the processor if there are no independent instructions to execute. In contrast, most cache write misses are off the critical path of execution, since writes can be buffered in the cache or the store buffer. With few exceptions, cache lines that serve loads are more critical...

    Provided By Carnegie Mellon University

  • White Papers // Jan 2014

    Agentless Cloud-wide Streaming of Guest File System Updates

    The authors propose a non-intrusive approach for monitoring Virtual Machines (VMs) in the cloud. At the core of this approach is a mechanism for selective real-time monitoring of guest file updates within VM instances. This mechanism is agentless, requiring no guest VM support. It has low virtual I/O overhead, low...

    Provided By Carnegie Mellon University

  • White Papers // Jan 2014

    Improving DRAM Performance by Parallelizing Refreshes with Accesses

    Modern main memory is predominantly built using Dynamic Random Access Memory (DRAM) cells. A DRAM cell consists of a capacitor to store one bit of data as electrical charge. The capacitor leaks charge over time, causing stored data to change. As a result, DRAM requires an operation called refresh that...

    Provided By Carnegie Mellon University

  • White Papers // Jan 2014

    Bounding Memory Interference Delay in COTS-based Multi-Core Systems

    In Commercial-Off-The-Shelf (COTS) multi-core systems, a task running on one core can be delayed by other tasks running simultaneously on other cores due to interference in the shared DRAM main memory. Such memory interference delay can be large and highly variable, thereby posing a significant challenge for the design of...

    Provided By Carnegie Mellon University

  • White Papers // Jan 2014

    ARP Attacks in Wireless Ad Hoc Networks

    Previous research to secure ad hoc network protocols concentrates on key distribution and on securing the routing protocol. Unfortunately, securing the routing layer is not sufficient to secure the ad hoc network, as lower layer and upper layer communication protocols remain vulnerable to attack. In this paper, the authors illustrate...

    Provided By Carnegie Mellon University

  • White Papers // Jan 2014

    Matching Database Access Patterns to Storage Characteristics

    Database storage managers employ sophisticated algorithms attempting to exploit the performance available inside today's storage systems. However, because the communication between the Storage Manager (SM) and a storage device is limited by a high-level protocol, both the SM and the device make decisions largely in isolation and do not realize...

    Provided By Carnegie Mellon University

  • White Papers // Dec 2013

    Exploiting Compressed Block Size as an Indicator of Future Reuse

    The authors introduce a set of new Compression-Aware Management Policies (CAMP) for on-chip caches that employ data compression. Their management policies are based on two key ideas. First, they show that it is possible to build a more efficient management policy for compressed caches if the compressed block size is...

    Provided By Carnegie Mellon University

  • White Papers // Dec 2013

    Tetrisched: Space-Time Scheduling for Heterogeneous Datacenters

    Tetrisched is a new scheduler that explicitly considers both job-specific preferences and estimated job runtimes in its allocation of resources. Combined, this information allows tetrisched to provide higher overall value to complex application mixes consolidated on heterogeneous collections of machines. Job-specific preferences, provided by tenants in the form of composable...

    Provided By Carnegie Mellon University

  • White Papers // Nov 2013

    More Effective Distributed ML via a Stale Synchronous Parallel Parameter Server

    The authors propose a parameter server system for distributed ML, which follows a Stale Synchronous Parallel (SSP) model of computation that maximizes the time computational workers spend doing useful work on ML algorithms, while still providing correctness guarantees. The parameter server provides an easy-to-use shared interface for read/write access to...

    Provided By Carnegie Mellon University

  • Webcasts // Nov 2013

    Engineering Realistic Synthetic Insider Threat (Cyber-Social) Test Data

    Access to data remains a significant impediment to advancing the science of insider threat research. In this webcast, the presenter going to explain about engineering realistic synthetic about the insider threat test data from the virtual event who manages the insider threat.

    Provided By Carnegie Mellon University

  • Webcasts // Nov 2013

    Emerging Trends

    An emerging trend to pay attention to is the malicious outsider taking advantage of an inadvertent insider. In this webcast, the presenter going to explain about emerging trends in insider threat research from the virtual event managing the insider threat.

    Provided By Carnegie Mellon University

  • Webcasts // Nov 2013

    Best Practices and Controls for Mitigating Insider Threats

    Threats can stem from simple activities like uploading, emailing, and posting sensitive data, etc. In this webcast, the presenter will explain about best practices and controls for mitigating insider threats from the virtual event of how to manage the insider threat.

    Provided By Carnegie Mellon University

  • Webcasts // Nov 2013

    Panel Discussion: Managing the Insider Threat: What Every Organization Should Know

    In this webcast, the presenter going to discuss about managing the insider threat and how to ensure the protection of and appropriate access to intellectual property and other critical assets, systems, and data.

    Provided By Carnegie Mellon University

  • Webcasts // Nov 2013

    Illicit Cyber Activity Involving Fraud

    In this webcast, the presenter going to explain about illicit cyber activity involving fraud from the virtual event managing the insider threat. the presenters aim is to assist organizations in improving their security posture and incident response capability by researching technical threat areas, developing and conducting information security assessments, and...

    Provided By Carnegie Mellon University

  • Podcasts // Nov 2013

    Overview of the Threat Posed by Insiders to Critical Assets

    Insiders pose a substantial threat by virtue of their knowledge of and access to the users systems and/or their databases. In this webcast, the presenter will give an overview of the threat posed by insiders to critical assets.

    Provided By Carnegie Mellon University

  • White Papers // Nov 2013

    Energy-Governed Resilient Networked Systems

    Connected embedded systems in the realm of smart infrastructures comprise ubiquitous end-point devices supported by a communication infrastructure. Device, energy supply and network failures are a reality and provisioned communications could fail. Self-organization is a process where network devices cooperate with each other to restore network connectivity on detecting network...

    Provided By Carnegie Mellon University

  • White Papers // Oct 2013

    GOTCHA Password Hackers!

    The authors introduce GOTCHAs (Generating panOptic Turing tests to tell Computers and Humans Apart) as a way of preventing automated offline dictionary attacks against user selected passwords. A GOTCHA is a randomized puzzle generation protocol, which involves interaction between a computer and a human. Informally, a GOTCHA should satisfy two...

    Provided By Carnegie Mellon University

  • White Papers // Oct 2013

    Challenges in Security and Privacy for Mobile Edge-Clouds

    Mobile devices such as Smartphone and tablets are ubiquitous today, and many of them possess significant computation power, powerful sensors such as high-resolution cameras and GPS sensors, and a wealth of sensor data such as photos, videos, and location information. Collections of mobile devices in close geographical proximity present both...

    Provided By Carnegie Mellon University

  • White Papers // Sep 2013

    Designing for Self-Configuration and Self-Adaptation in the Internet of Things

    The Internet of Things (IoT) paradigm comprises a heterogenous mix of connected devices connected to the Internet. This promises a wealth of opportunity for a large collection of distributed applications and services. However, the IoT introduces significant changes to the Internet model, largely in the form of billions to trillions...

    Provided By Carnegie Mellon University

  • White Papers // Sep 2013

    LightTx: A Lightweight Transactional Design in Flash-based SSDs to Support Flexible Transactions

    Flash memory has accelerated the architectural evolution of storage systems with its unique characteristics compared to magnetic disks. The no-overwrite property of flash memory has been leveraged to efficiently support transactions, a commonly used mechanism in systems to provide consistency. However, existing transaction designs embedded in flash-based Solid State Drives...

    Provided By Carnegie Mellon University

  • White Papers // Sep 2013

    HAT: Heterogeneous Adaptive Throttling for On-Chip Networks

    The Network-on-Chip (NoC) is a primary shared resource in a Chip Multi-Processor (CMP) system. As core counts continue to increase and applications become increasingly data-intensive, the network load will also increase, leading to more congestion in the network. This network congestion can degrade system performance if the network load is...

    Provided By Carnegie Mellon University

  • White Papers // Sep 2013

    Program Interference in MLC NAND Flash Memory: Characterization, Modeling, and Mitigation

    As NAND flash memory continues to scale down to smaller process technology nodes, its reliability and endurance are degrading. One important source of reduced reliability is the phenomenon of program interference: when a flash cell is programmed to a value, the programming operation affects the threshold voltage of not only...

    Provided By Carnegie Mellon University

  • White Papers // Sep 2013

    Secure Two-Party Computation with Reusable Bit-Commitments, via A Cut-and-Choose with Forge-and-Lose Technique

    A Secure Two-Party Computation (S2PC) protocol allows two parties to compute over their combined private inputs, as if inter-mediated by a trusted third party. In the active model, security is maintained even if one party is malicious, deviating from the protocol specification. For example, an honest party retains privacy of...

    Provided By Carnegie Mellon University

  • White Papers // Aug 2013

    Design of a Write-Optimized Data Store

    The WriteBuffer (WB) tree is a new write-optimized data structure that can be used to implement per-node storage in unordered key-value stores. The WB tree provides faster writes than the Log-Structured Merge (LSM) tree that is used in many current high-performance key-value stores. It achieves this by replacing compactions in...

    Provided By Carnegie Mellon University

  • Webcasts // Aug 2013

    Observations of Successful Cyber Security Operations

    In this Webcast, the presenter going explain about the cyber security The presenter will also discuss the observations of successful cyber security operations from the virtual event showing the users a big picture about the organization how they successfully react to new specific accessories build on the cyber security.

    Provided By Carnegie Mellon University

  • Webcasts // Aug 2013

    Responding to a Large Scale Cybersecurity Incident

    In this Webcast, the presenter explain about how to respond to a large scale cyber security incidents, with an introduction about the role of technology. Technology which is an important one, but the limitations of that need to be understood.

    Provided By Carnegie Mellon University

  • Webcasts // Aug 2013

    20+ Years of Cyber (in)Security

    The use of information and communications technology is pervasive. The information systems are increasingly interconnected and interdependent. Attack technology is outpacing defensive technology. In this webcast, the presenter will give an introduction to the cyber security.

    Provided By Carnegie Mellon University

  • Webcasts // Aug 2013

    Achieving Mission Assurance Through Resilience Management

    In this webcast, the presenter going to explain about the resilience management. Resilience management is to protect a sustain organizations mission and business operations. The presenter will also explain about how the organizations are constant operational stress on these days.

    Provided By Carnegie Mellon University

  • Webcasts // Aug 2013

    Developing Your Cyber Workforce

    In this webcast, the presenter going to explain about the how to develop the cyber workforce against the security attacks. The presenter going to discuss about the new solutions and research that he had done to improve the security.

    Provided By Carnegie Mellon University

  • White Papers // Aug 2013

    Breaking the DDoS Attack Chain

    Department of Defense (DoD) communications and data networks continue to be targets for adversaries to deny operational use of those networks. Distributed Denial of Service (DDoS) is one such attack strategy that has proven to be an effective method of denying service to military, political, infrastructure, and economic targets. The...

    Provided By Carnegie Mellon University

  • White Papers // Sep 2011

    Scheduling Heterogeneous Processors Isn't As Easy As You Think

    The authors consider preemptive online scheduling algorithms to minimize the total weighted/unweighted flow time plus energy for speed-scalable heterogeneous multiprocessors. They show that the well-known priority scheduling algorithms highest density first, weighted shortest elapsed time first, and weighted late arrival processor sharing, are not O(1)-speed O(1)-competitive for the objective of...

    Provided By Carnegie Mellon University

  • White Papers // Feb 2014

    Predictable Coherent Caching with Incoherent Caches

    Caches are a well known hardware construct for improving energy consumption and average performance by keeping frequently-used data near processing resources. Yet, at the same time, they form a major hurdle for worst-case execution time analyses, in particular if they are shared between multiple cores. Exploiting that most shared data...

    Provided By Carnegie Mellon University

  • White Papers // Jul 2014

    LAPWiN: Location-Aided Probing for Protecting User Privacy in Wi-Fi Networks

    Efficient Wi-Fi probing has been demonstrated to leak sensitive user information. During the probing process, Wi-Fi clients transmit the names of previously known Wi-Fi Access Points (APs) in plaintext. An eavesdropper can easily collect the information leaked by this Wi-Fi probing process to mount numerous attacks, such as fake AP...

    Provided By Carnegie Mellon University

  • White Papers // Mar 2014

    All Your Screens are Belong to Us: Attacks Exploiting the HTML5 Screen Sharing API

    HTML5 changes many aspects in the browser world by introducing numerous new concepts; in particular, the new HTML5 screen sharing API impacts the security implications of browsers tremendously. One of the core assumptions on which browser security is built is that there is no cross-origin feedback loop from the client...

    Provided By Carnegie Mellon University

  • White Papers // Nov 2013

    Energy-Governed Resilient Networked Systems

    Connected embedded systems in the realm of smart infrastructures comprise ubiquitous end-point devices supported by a communication infrastructure. Device, energy supply and network failures are a reality and provisioned communications could fail. Self-organization is a process where network devices cooperate with each other to restore network connectivity on detecting network...

    Provided By Carnegie Mellon University

  • White Papers // Sep 2013

    Designing for Self-Configuration and Self-Adaptation in the Internet of Things

    The Internet of Things (IoT) paradigm comprises a heterogenous mix of connected devices connected to the Internet. This promises a wealth of opportunity for a large collection of distributed applications and services. However, the IoT introduces significant changes to the Internet model, largely in the form of billions to trillions...

    Provided By Carnegie Mellon University

  • White Papers // Jul 2014

    Phinding Phish: Evaluating Phishing Tools

    "There are currently dozens of freely available tools to combat phishing and other web-based scams, many of which are web browser extensions that warn users when they are browsing a suspected phishing site. The authors developed an automated test bed for testing anti-phishing tools. They used 200 verified phishing URLs...

    Provided By Carnegie Mellon University

  • White Papers // Feb 2010

    Location-Sharing Technologies: Privacy Risks and Controls

    "Due to the ability of cell phone providers to use cell phone towers to pinpoint users' locations, federal E911 requirements, the increasing popularity of GPS-capabilities in cellular phones, and the rise of cellular phones for Internet use, a plethora of new applications have been developed that share users' real-time location...

    Provided By Carnegie Mellon University

  • White Papers // May 2014

    Studying the Effectiveness of Security Images in Internet Banking

    Security images are often used as part of the login process on internet banking websites, under the theory that they can help foil phishing attacks. Previous studies, however, have yielded inconsistent results about users' ability to notice that a security image is missing and their willingness to log in even...

    Provided By Carnegie Mellon University

  • White Papers // Apr 2012

    Measuring the Effectiveness of Privacy Tools for Limiting Behavioral Advertising

    Online Behavioral Advertising (OBA) is the practice of tailoring ads based on an individual's activities online. Users have expressed privacy concerns regarding this practice, and both the advertising industry and third parties offer tools for users to control the OBA they receive. The authors provide the first systematic method for...

    Provided By Carnegie Mellon University

  • White Papers // Apr 2012

    Cruel Intentions: A Security Analysis of Web Intents

    Web intents are a new web collaboration framework intended to bring the benefits of Android's Intent model to the web. Web Intents are currently implemented as a JavaScript shim, supporting several major local storage enabled browsers. A prototype native implementation is under development for Google Chrome. While Android's intent model...

    Provided By Carnegie Mellon University

  • White Papers // Apr 2012

    Self-Exfiltration: The Dangers of Browser-Enforced Information Flow Control

    Since the early days of Netscape, browser vendors and web security researchers have restricted out-going data based on its destination. The security argument accompanying these mechanisms is that they prevent sensitive user data from being sent to the attacker's domain. However, in this paper, the authors show that regulating web...

    Provided By Carnegie Mellon University

  • Presentations // Jan 2003

    Pricing

    Pricing spells out the amount of money that would be charged in exchange for a particular product or service. An effective pricing strategy helps in building strong customer loyalty over time. Different types of pricing strategies are called into operation at different stages of the product life cycle. The paper...

    Provided By Carnegie Mellon University

  • White Papers // Apr 2013

    Tiered-Latency DRAM: A Low Latency and Low Cost DRAM Architecture

    The capacity and cost-per-bit of DRAM have historically scaled to satisfy the needs of increasingly large and complex computer systems. However, DRAM latency has remained almost constant, making memory latency the performance bottleneck in today's systems. The authors observe that the high access latency is not intrinsic to DRAM, but...

    Provided By Carnegie Mellon University

  • White Papers // Apr 2013

    Practical Batch-Updatable External Hashing with Sorting

    In this paper the authors present a practical external hashing scheme that supports fast lookup (7 microseconds) for large datasets (millions to billions of items) with a small memory footprint (2.5 bits/item) and fast index construction (151 K items/s for 1-KiB key-value pairs). Their scheme combines three key techniques: a...

    Provided By Carnegie Mellon University

  • White Papers // Jan 2013

    TABLEFS: Enhancing Metadata Efficiency in the Local File System

    File systems that manage magnetic disks have long recognized the importance of sequential allocation and large transfer sizes for file data. Fast random access has dominated metadata lookup data structures with increasing use of B-trees on-disk. Yet the authors' experiments with workloads dominated by metadata and small file access indicate...

    Provided By Carnegie Mellon University

  • White Papers // Jan 2013

    Giga+TableFS on PanFS: Scaling Metadata Performance on Cluster File Systems

    Modern file systems provide scalable performance for large file data management. However, in case of metadata management the usual approach is to have single or few points of Meta-Data Service (MDS). In the current world, file systems are challenged by unique needs such as managing exponentially growing files, using file-system...

    Provided By Carnegie Mellon University

  • White Papers // Nov 2012

    MemC3: Compact and Concurrent MemCache with Dumber Caching and Smarter Hashing

    MemC3 is an in-memory key-value store that is designed to provide caching service for read-mostly workloads. It is built on carefully engineered algorithms and data structures with a set of architecture-aware and workload-ware optimizations to achieve high concurrency, space-efficiency and cache-locality. In particular, MemC3 uses a new hashing scheme -...

    Provided By Carnegie Mellon University

  • White Papers // Nov 2012

    HPC Computation on Hadoop Storage with PLFS

    In this paper the authors describe how they adapted the Parallel Log Structured File-System (PLFS) to enable HPC applications to be able read and write data from the HDFS cloud storage subsystem. Their enhanced version of PLFS provides HPC applications with the ability to concurrently write from multiple compute nodes...

    Provided By Carnegie Mellon University

  • White Papers // Oct 2012

    JackRabbit: Improved Agility in Elastic Distributed Storage

    Elastic storage systems can be expanded or contracted to meet current demand, allowing servers to be turned off or used for other tasks. However, the usefulness of an elastic distributed storage system is limited by its agility: how quickly it can increase or decrease its number of servers. This paper...

    Provided By Carnegie Mellon University

  • White Papers // Sep 2013

    HAT: Heterogeneous Adaptive Throttling for On-Chip Networks

    The Network-on-Chip (NoC) is a primary shared resource in a Chip Multi-Processor (CMP) system. As core counts continue to increase and applications become increasingly data-intensive, the network load will also increase, leading to more congestion in the network. This network congestion can degrade system performance if the network load is...

    Provided By Carnegie Mellon University

  • White Papers // Aug 2012

    Row Buffer Locality Aware Caching Policies for Hybrid Memories

    Phase Change Memory (PCM) is a promising technology that can offer higher capacity than DRAM. Unfortunately, PCM's access latency and energy are higher than DRAM's and its endurance is lower. Many DRAM-PCM hybrid memory systems use DRAM as a cache to PCM, to achieve the low access latency and energy,...

    Provided By Carnegie Mellon University

  • White Papers // Aug 2012

    A Case for Small Row Buffers in Non-Volatile Main Memories

    DRAM-based main memories have read operations that destroy the read data, and as a result, must buffer large amounts of data on each array access to keep chip costs low. Unfortunately, system-level trends such as increased memory contention in multi-core architectures and data mapping schemes that improve memory parallelism lead...

    Provided By Carnegie Mellon University

  • White Papers // Jun 2012

    Hadoop's Adolescence: A Comparative Workload Analysis from Three Research Clusters

    The authors analyze Hadoop workloads from three different research clusters from an application-level perspective, with two goals: explore new issues in application patterns and user behavior and understand key performance challenges related to IO and load balance. Their analysis suggests that Hadoop usage is still in its adolescence. They see...

    Provided By Carnegie Mellon University

  • White Papers // May 2012

    Shingled Magnetic Recording for Big Data Applications

    Modern Hard Disk Drives (HDDs) are fast approaching the super-paramagnetic limit forcing the storage industry to look for innovative ways to transition from traditional magnetic recording to heat-assisted magnetic recording or bit-patterned magnetic recording. Shingled Magnetic Recording (SMR) is a step in this direction as it delivers high storage capacity...

    Provided By Carnegie Mellon University

  • White Papers // May 2012

    Distributed Directories using Giga+ and PVFS

    There is growing set of large-scale data-intensive applications that require file system directories to store millions to billions of files in each directory and to sustain hundreds of thousands of concurrent directory operations per second. Unfortunately, most cluster file systems are unable to provide this level of scale and parallelism....

    Provided By Carnegie Mellon University

  • White Papers // May 2012

    Concurrent Systematic Testing at Scale

    Systematic testing, first demonstrated in small, specialized cases 15 years ago, has matured sufficiently for large-scale systems developers to begin to put it into practice. With actual deployment comes new, pragmatic challenges to the usefulness of the techniques. In this paper the authors are concerned with scaling dynamic partial order...

    Provided By Carnegie Mellon University

  • White Papers // Jul 2010

    Virus Propagation on Time-Varying Networks: Theory and Immunization Algorithms

    In this paper, the authors analytically studied virus-spreading (specifically the SIS model) on arbitrary, time-varying graphs. Given a set of T alternating graphs, modeling e.g. the day/night pattern of human behavior, they ask: what is the epidemic threshold? And what are the best-k nodes to immunize to defend against an...

    Provided By Carnegie Mellon University

  • White Papers // Aug 2009

    Chip-Level Redundancy in Distributed Shared-Memory Multiprocessors

    Distributed Shared-Memory (DSM) multiprocessors provide a scalable hardware platform, but lack the necessary redundancy for mainframe-level reliability and availability. Chip-level redundancy in a DSM server faces a key challenge: the increased latency to check results among redundant components. To address performance overheads, the authors propose a checking filter that reduces...

    Provided By Carnegie Mellon University

  • White Papers // Aug 2011

    Investigating the Viability of Bufferless NoCs in Modern Chip Multi-Processor Systems

    Chip Multi-Processors (CMP) are quickly growing to dozens and potentially hundreds of cores, and as such the design of the interconnect for on chip resources has become an important field of study. Of the available topologies, tiled mesh networks are an appealing approach in tiled CMPs, as they are relatively...

    Provided By Carnegie Mellon University

  • White Papers // Jun 2011

    A Loadable Task Execution Recorder for Hierarchical Scheduling in Linux

    In this paper, the authors present a Hierarchical Scheduling Framework (HSF) recorder for Linux-based operating systems. The HSF recorder is a loadable kernel module that is capable of recording tasks and servers without requiring any kernel modifications. Hence, it complies with the reliability and stability requirements in the area of...

    Provided By Carnegie Mellon University

  • White Papers // Sep 2010

    Scheduling Parallel Real-Time Tasks on Multi-Core Processors

    Massively multi-core processors are rapidly gaining market share with major chip vendors offering an ever increasing number of cores per processor. From a programming perspective, the sequential programming model does not scale very well for such multi-core systems. Parallel programming models such as OpenMP present promising solutions for more effectively...

    Provided By Carnegie Mellon University

  • White Papers // Jun 2012

    ExSched: An External CPU Scheduler Framework for Real-Time Systems

    Scheduling theory and algorithms have been well studied in the real-time systems literature. Many useful approaches and solutions have appeared in different problem domains. While their theoretical effectiveness has been extensively discussed, the community is now facing implementation challenges that show the impact of the algorithms in practice. In this...

    Provided By Carnegie Mellon University

  • White Papers // Jun 2011

    Resource Sharing in GPU-Accelerated Windowing Systems

    Recent windowing systems allow graphics applications to directly access the Graphics Processing Unit (GPU) for fast rendering. However, application tasks that render frames on the GPU contend heavily with the windowing server that also accesses the GPU to blit the rendered frames to the screen. This resource-sharing nature of direct...

    Provided By Carnegie Mellon University

  • White Papers // Mar 2012

    Towards Adaptive GPU Resource Management for Embedded Real-Time Systems

    In this paper, the authors present two conceptual frameworks for GPU applications to adjust their task execution times based on total workload. These frameworks enable smart GPU resource management when many applications share GPU resources while the workloads of those applications vary. Application developers can explicitly adjust the number of...

    Provided By Carnegie Mellon University

  • White Papers // Nov 2006

    Fast Random Walk with Restart and Its Applications

    The authors propose fast solutions to this problem. The heart of their approach is to exploit two important properties shared by many real graphs: linear correlations and block-wise, community-like structure. They exploit the linearity by using low-rank matrix approximation and the community structure by graph partitioning, followed by the Sherman-Morrison...

    Provided By Carnegie Mellon University

  • White Papers // Feb 2014

    SpringFS: Bridging Agility and Performance in Elastic Distributed Storage

    The elastic storage systems can be expanded or contracted to meet current demand, allowing servers to be turned off or used for other tasks. However, the usefulness of an elastic distributed storage system is limited by its agility: how quickly it can increase or decrease its number of servers. Due...

    Provided By Carnegie Mellon University

  • White Papers // Jan 2014

    Toward Strong, Usable Access Control for Shared Distributed Data

    As non-expert users produce increasing amounts of personal digital data, usable access control becomes critical. Current approaches often fail, because they insufficiently protect data or confuse users about policy specification. This paper presents penumbra, a distributed file system with access control designed to match users' mental models while providing principled...

    Provided By Carnegie Mellon University

  • White Papers // Dec 2013

    Tetrisched: Space-Time Scheduling for Heterogeneous Datacenters

    Tetrisched is a new scheduler that explicitly considers both job-specific preferences and estimated job runtimes in its allocation of resources. Combined, this information allows tetrisched to provide higher overall value to complex application mixes consolidated on heterogeneous collections of machines. Job-specific preferences, provided by tenants in the form of composable...

    Provided By Carnegie Mellon University

  • White Papers // Nov 2013

    More Effective Distributed ML via a Stale Synchronous Parallel Parameter Server

    The authors propose a parameter server system for distributed ML, which follows a Stale Synchronous Parallel (SSP) model of computation that maximizes the time computational workers spend doing useful work on ML algorithms, while still providing correctness guarantees. The parameter server provides an easy-to-use shared interface for read/write access to...

    Provided By Carnegie Mellon University