University of Washington

Displaying 1-40 of 159 results

  • White Papers // Jan 2015

    High-Performance Carry Chains for FPGAs

    Carry chains are an important consideration for most computations, including FPGAs. Current FPGAs dedicate a portion of their logic to support these demands via a simple ripple carry scheme. In this paper, the authors demonstrate how more advanced carry constructs can be embedded into FPGAs, providing significantly higher performance carry...

    Provided By University of Washington

  • White Papers // Nov 2014

    Authenticated Encryption: How Reordering Can Impact Performance

    "In this paper, the authors look at authenticated encryption schemes from a new perspective. As opposed to focusing solely on the ""Security"" implications of the different methods for constructing authenticated encryption schemes, they investigate the effect of the method used to construct an authenticated encryption scheme on the ""Performance"" of...

    Provided By University of Washington

  • White Papers // Mar 2014

    GraphChiDB: Simple Design for a Scalable Graph Database System - On Just a PC

    The authors propose a new data structure, Parallel Adjacency Lists (PAL), for efficiently managing graphs with billions of edges on disk. The PAL structure is based on the graph storage model of GraphChi, but they extend it to enable online database features such as queries and fast insertions. In addition,...

    Provided By University of Washington

  • Webcasts // Jun 2012

    The Journey of the Entrepreneur

    In this webcast, the presenter shares stories from the trenches, lessons learned and insights about what it takes for a promising technology to become an innovation that changes the world.

    Provided By University of Washington

  • Webcasts // Jun 2012

    Photo Tourism at Google

    Two years ago, researcher Steve Seitz created a new 3D computer vision group in Google's Seattle office. In this webcast, the presenter discusses what the group has been up to, including Picasa face movies, MapsGL, and the newest feature called Photo Tours.

    Provided By University of Washington

  • Webcasts // Jun 2012

    Hogwild for Machine Learning on Multicore

    In this webcast, the presenter provides both theoretical and experimental evidence demonstrating the achievement of linear speedups on multi-core workstations on several benchmark optimization problems. Stochastic Gradient Descent (SGD) is a popular optimization algorithm for solving data-driven machine learning problems such as classification, model selection, sequence labeling, and recommendation.

    Provided By University of Washington

  • White Papers // May 2012

    Verification Games: Making Verification Fun

    Program verification is the only way to be certain that a given piece of software is free of (certain types of) errors - errors that could otherwise disrupt operations in the field. To date, formal verification has been done by specially-trained engineers. Labor costs have heretofore made formal verification too...

    Provided By University of Washington

  • White Papers // May 2012

    Inference and Checking of Object Ownership

    Ownership type systems describe a heap topology and enforce an encapsulation discipline; they aid in various program correctness and understanding tasks. However, the annotation overhead of ownership type systems has hindered their widespread use. The authors present a unified framework for specification, type inference and type checking of ownership type...

    Provided By University of Washington

  • Webcasts // Mar 2012

    Crowd Computation: Social Computing and Mass Disruption

    In this webcast, the presenter describes several ways in which members of the social media crowd act to shape the information space through their actions and interactions within the space.

    Provided By University of Washington

  • Webcasts // Mar 2012

    Advancing Computer Vision by Leveraging Humans

    This discussion on human-centered contributions to computing describes recent efforts in expanding the roles humans play in advancing computer vision. In the first part of this webcast, the presenter describes the recently-introduced "Human-debugging" paradigm. It allows for identification of weak-links in machine vision approaches that require further research. In the...

    Provided By University of Washington

  • Webcasts // Mar 2012

    Predicting the Present With Google Trends

    In this webcast, the presenter explains how to use Google Trends data to measure the state of the economy in various sectors, and discuss some of the implications for research and policy.

    Provided By University of Washington

  • Webcasts // Mar 2012

    Parallel Programmability for High Performance Computing

    In this webcast, the presenter describes Chapel, an emerging language from Cray, Inc., that strives to address challenges to parallel programmability by making it more productive for both High Performance Computing (HPC) and mainstream programmers.

    Provided By University of Washington

  • Webcasts // Mar 2012

    Adventures in Scaling the Multicore Memory Wall

    In this webcast, the presenter covers three different approaches to multicore cache management that can help bridge the "Memory wall." If the application thread mapping and the cache topology are both static (i.e., do not change during runtime), then compiler enhancements that support cache topology-aware code optimization can be used...

    Provided By University of Washington

  • Webcasts // Mar 2012

    Optimizing Human Computation

    In this webcast, the presenter describes crowdsourcing work on two fronts. First, Crowd Algorithms, which view the crowd as data processors to design human computation versions of fundamental algorithms like sort, filter, and search, where the basic operations are done by people. Second, Declarative Crowdsourcing which views the crowd as...

    Provided By University of Washington

  • White Papers // Mar 2012

    User-Driven Access Control: Rethinking Permission Granting in Modern Operating Systems

    Modern client platforms, such as iOS, Android, Windows Phone, Windows 8, and web browsers, run each application in an isolated environment with limited privileges. A pressing open problem in such systems is how to allow users to grant applications access to user-owned resources, e.g., to privacy- and cost-sensitive devices like...

    Provided By University of Washington

  • White Papers // Feb 2012

    FPGA-Based Pulse Pile-Up Correction

    Modern Field Programmable Gate Arrays (FPGAs) are capable of performing complex discrete signal processing algorithms with clock rates well above 100MHz. This, combined with FPGA's low expense, ease of use and selected dedicated hardware make them an ideal technology for a data acquisition system for a Positron Emission Tomography (PET)...

    Provided By University of Washington

  • Webcasts // Feb 2012

    GraphLab: A Distributed Abstraction for Machine Learning

    Today, machine learning (ML) methods play a central role in industry and science. In this webcast, the presenter describes the GraphLab framework, which naturally expresses asynchronous, dynamic graph computations that are key for state-of-the-art ML algorithms.

    Provided By University of Washington

  • Webcasts // Feb 2012

    Document Discovery: Advancing Research With Large Knowledge Networks

    By putting the world's scholarly literature online, publisher websites and digital archives have made millions articles instantly available anywhere, any time, in digital form. In this webcast, the presenter describes new approaches to measuring, mapping and evaluating documents are creating new forms of value that can be derived from the...

    Provided By University of Washington

  • White Papers // Jan 2012

    Type-Directed Completion of Partial Expressions

    Modern programming frameworks provide enormous libraries arranged in complex structures, so much so that a large part of modern programming is searching for APIs that "Surely exist" somewhere in an unfamiliar part of the framework. The authors present a novel way of phrasing a search for an unknown API: the...

    Provided By University of Washington

  • Webcasts // Dec 2011

    Towards Balanced, Data-Intensive Scalable Computing

    While many interesting systems are able to scale linearly with additional servers, per-server performance can lag behind per-server capacity by more than an order of magnitude. In this webcast, the presenter will presents Themis, a runtime supporting highly-efficient data-intensive computing.

    Provided By University of Washington

  • Webcasts // Dec 2011

    Computer Science and Engineering Distinguished Lecturer Series-Internet-Scale Storage

    The pace of innovation in data center design has been rapidly accelerating over the last 5 years, driven by the mega-service operators. In this webcast, the presenter will take apart a high-scale cloud service data center, looking at power distribution from high voltage to the server, compute and storage, networking,...

    Provided By University of Washington

  • Webcasts // Dec 2011

    Cooperative Concurrency for a Multicore World

    Multi-threaded programs are notoriously prone to unintended interference between concurrent threads. To address this problem, these presenters argue that yield annotations in the source code should document all thread interference, and they present a type system for verifying the absence of undocumented interference.

    Provided By University of Washington

  • Webcasts // Dec 2011

    Using Surrogate Benchmarks to Project the Performance of HPC Applications

    Performance projections of High Performance Computing (HPC) applications onto various hardware platforms are important for hardware vendors and HPC users. The projections aid hardware vendors in the design of future systems and help HPC users with system procurement.

    Provided By University of Washington

  • Webcasts // Nov 2011

    Full Duplex Wireless

    In this webcast, the presenter describing that a full-duplex radio - a radio that can receive and transmit simultaneously on the same frequency, like a two-lane bridge - can be built using commodity, off-the-shelf components. Full duplex has the potential to revolutionize a large number of wireless systems.

    Provided By University of Washington

  • White Papers // Aug 2011

    Energy-Efficient Low Power Listening for Wireless Sensor Networks in Noisy Environments

    Low Power Listening (LPL) is a common MAC layer technique for reducing energy consumption in wireless sensor networks, where nodes periodically wake up to sample the wireless channel for activity. However, LPL is highly susceptible to false wakeups caused by environmental noise being detected as energy on the channel, causing...

    Provided By University of Washington

  • White Papers // Aug 2011

    New Directions for Self-Destructing Data Systems

    This paper seeks to advance the state of the art in practical self-destructing data systems that secure sensitive data from disclosure in the highly mobile, social-networked, cloud-computing world. The authors' work facilitates the automatic, timed, and simultaneous destruction of all copies of a self-destructing data object (such as a message...

    Provided By University of Washington

  • White Papers // Aug 2011

    Hierarchical Scheduling for Multicores With Multilevel Cache Hierarchies

    To achieve good performance, programs must exploit locality in its memory references, i.e., it must utilize its caches effectively. For machines with a single processor or core, there is a rich history of work on external memory and hierarchical memory models and algorithms, all aimed at reducing the number of...

    Provided By University of Washington

  • White Papers // Aug 2011

    User Centered Design and Evaluation of an Eye Movement-Based Biometric Authentication System

    Biometric authentication systems offer advantages over knowledge-based and token-based systems because the authors do not require users to remember anything or carry a physical object. However, usability and acceptability issues have often been neglected in favor of optimizing technical performance. They present on the design and development of a novel...

    Provided By University of Washington

  • White Papers // Jul 2011

    Efficient Deadlock Avoidance for Streaming Computation With Filtering

    Parallel streaming computation has been studied extensively, and many languages, libraries, and systems have been designed to support this model of computation. While some streaming computations send data at a priori predictable rates on every channel between compute nodes, many natural applications lack this property. In particular, the authors consider...

    Provided By University of Washington

  • White Papers // Jun 2011

    DeSEO: Combating Search-Result Poisoning

    The authors perform an in-depth study of SEO attacks that spread malware by poisoning search results for popular queries. Such attacks, although recent, appear to be both widespread and effective. They compromise legitimate Web sites and generate a large number of fake pages targeting trendy keywords. They first dissect one...

    Provided By University of Washington

  • Webcasts // Jun 2011

    How I Learned to Stop Worrying and Trust Mobile Systems

    In this webcast, the presenter explains about "How he learned to stop worrying and trust mobile systems" and Mobile phones have become the eyes and ears of the Internet by placing digital communication, computation, and sensing at the center of nearly all human activity.

    Provided By University of Washington

  • White Papers // May 2011

    Mercury BLASTN Biosequence Similarity Search System: Technical Reference Guide

    The Mercury BLASTN application is a hybrid hardware-software implementation of DNA-to-DNA sequence comparison. It presents an interface similar to that of NCBI BLASTN 2.2 (and indeed uses much of that package's source code internally) but has many changes "Under the hood" to support very large sequence comparisons. Much of Mercury...

    Provided By University of Washington

  • White Papers // May 2011

    Region-Based Dynamic Separation for STM Haskell

    The authors present the first design and implementation of dynamic separation in STM Haskell. Dynamic separation is a recent approach to Software Transactional Memory (STM) that achieves strongly-atomic semantics with performance comparable to that of a weakly-atomic STM. STM Haskell, a lazy-versioning STM library for Haskell, previously supported strongly-atomic semantics...

    Provided By University of Washington

  • White Papers // May 2011

    Operating System Implications of Fast, Cheap, Non-Volatile Memory

    The existence of two basic levels of storage (fast/volatile and slow/non-volatile) has been a long-standing premise of most computer systems, influencing the design of OS components, including file systems, virtual memory, scheduling, execution models, and even their APIs. Emerging resistive memory technologies - such as Phase-Change Memory (PCM) and memristors...

    Provided By University of Washington

  • White Papers // May 2011

    Scheduling-Control Co-Design for WirelessHART Networks

    WirelessHART is an open standard for wireless sensor-actuator networks in process monitoring and control. Recent years have seen initial success in real-world deployment of control systems over WirelessHART networks. Due to stringent bandwidth constraints in WirelessHART networks, it is important to develop a wireless transmission scheduling and control co-design approach...

    Provided By University of Washington

  • White Papers // May 2011

    Efficient Inter-Vehicle Data Dissemination

    Data services for in-vehicle consumption are expected to become a primary driver in the development of future vehicular networks. Due to download rate limitations of present wide-area cellular connectivity such as 3G (the likely "Pipe" to/from vehicles), and direct peer-to-peer data sharing among vehicles can supplement vertical downloading. This paper...

    Provided By University of Washington

  • White Papers // May 2011

    Tunable Static Inference for Generic Universe Types

    Object ownership is useful for many applications, including program verification, thread synchronization, and memory management. However, the annotation overhead of ownership type systems hampers their widespread application. This paper addresses this issue by presenting a tunable static type inference for Generic Universe Types. In contrast to classical type systems, ownership...

    Provided By University of Washington

  • White Papers // May 2011

    Maverick: Providing Web Applications With Safe and Flexible Access to Local Devices

    Web browsers do not yet provide Web programs with the same safe, convenient access to local devices that operating systems provide to native programs. As a result, Web programmers must either wait for the slowly evolving HTML standard to add support for the device classes they want to use, or...

    Provided By University of Washington

  • White Papers // May 2011

    Webcam Image Alignment

    AMOS, The Archive of Many Outdoor Scenes, has been a major project at Washington University. The project focus has been collecting images from webcams all over the world. Images have been logged from thousands of webcams for over 5 years. The large datasets created by AMOS are useful for a...

    Provided By University of Washington

  • White Papers // Apr 2011

    Crunching Large Graphs With Commodity Processors

    Crunching large graphs is the basis of many emerging applications, such as social network analysis and bio-informatics. Graph analytics algorithms exhibit little locality and therefore present significant performance challenges. Hardware multi-threading systems (e.g., Cray XMT) show that with enough concurrency, the authors can tolerate long latencies. Unfortunately, this solution is...

    Provided By University of Washington

  • White Papers // Jul 2009

    Multiple Feedback Algorithm for RFID MAC Protocols

    This paper introduces a new tree-based anti-collision scheme using multiple feedbacks for uplink tag random access in a single-cell scenario. The authors examine MAC efficiency improvements that result from the proposed scheme in terms of Uplink (UL) throughput for emerging Radio Frequency Identification (RFID) networks, and compare it with the...

    Provided By University of Washington

  • White Papers // Apr 2010

    A Smart Sensor Web for Ocean Observation: Fixed and Mobile Platforms, Integrated Acoustics, Satellites and Predictive Modeling

    In many areas of Earth science, including climate change research and operational oceanography, there is a need for near real-time integration of data from heterogeneous and spatially distributed sensors, in particular in-situ and space-based sensors. The data integration, as provided by a smart sensor web, enables numerous improvements, namely, adaptive...

    Provided By University of Washington

  • White Papers // Jul 2009

    Achieving Full Diversity by Selection in Arbitrary Multi-Hop Amplify-and-Forward Relay Networks

    Although several cooperative diversity strategies have been proposed for simple 2-hop multiple-relay networks, practical and efficient strategies that guarantee maximum diversity order for arbitrary, multi-hop amplify-and-forward relay networks are not yet available. In this paper, the maximum achievable diversity order for a given connectivity is shown to be determined by...

    Provided By University of Washington

  • White Papers // Jul 2009

    An Enhanced Multiple-Feedback Algorithm for RFID MAC Protocols

    This paper introduces two new tree-based anti-collision schemes using multiple feedback symbols for uplink tag random access of emerging Radio Frequency Identification (RFID) networks. To this end a uplink (UL) time slot requires an extra time portion called voting field in addition to the packet payload to obtain a slot...

    Provided By University of Washington

  • White Papers // Jan 2010

    Challenges to Physicians' Use of a Wireless Alert Pager

    Pagers, Personal Data Assistants (PDAs) and other devices that have wireless connectivity are becoming a popular method for delivering patient related information to medical decision makers. Although medical informatics research has emphasized the design, and implementation of pagers as event notification mechanisms, researchers have not paid as much attention to...

    Provided By University of Washington

  • White Papers // Apr 2010

    Scalable RFID Systems: A Privacy-Preserving Protocol With Constant-Time Identification

    In RFID literature, most "Privacy-preserving" protocols require the reader to search all tags in the system in order to identify a single tag. In another class of protocols, the search complexity is reduced to be logarithmic in the number of tags, but it comes with two major drawbacks: it requires...

    Provided By University of Washington

  • White Papers // Jan 2011

    The End-to-End Effects of Internet Path Selection

    The path taken by a packet traveling across the Internet depends on a large number of factors, including routing protocols and per-network routing policies. The impact of these factors on the end-to-end performance experienced by users is poorly understood. In this paper, the authors conduct a measurement-based study comparing the...

    Provided By University of Washington

  • White Papers // Apr 2010

    Client + Cloud: Evaluating Seamless Architectures for Visual Data Analytics in the Ocean Sciences

    Science is becoming data-intensive, requiring new software architectures that can exploit resources at all scales: local GPUs for interactive visualization, server-side multi-core machines with fast processors and large memories, and scalable, pay-as-one-go cloud resources. Architectures that seamlessly and flexibly exploit all three platforms are largely unexplored. Informed by a long-term...

    Provided By University of Washington

  • White Papers // Jan 2011

    Modular Verification of Software Components in C

    The authors present a new methodology for automatic verification of C programs against finite state machine specifications. The approach is compositional, naturally enabling one to decompose the verification of large software systems into subproblems of manageable complexity. The decomposition reflects the modularity in the software design. They use weak simulation...

    Provided By University of Washington

  • White Papers // Sep 2010

    Demystifying 802.11n Power Consumption

    This paper report what the authors believe to be the first measurements of the power consumption of an 802.11n NIC across a broad set of operating states (Channel width; transmit power, rates, antennas, MIMO streams, sleep, and active modes). The authors find the popular practice of racing to sleep (By...

    Provided By University of Washington

  • White Papers // May 2009

    Fully Accessible Touch Screens for the Blind and Visually Impaired

    Recent advances in touch screen technology have increased the usability of touch screens for sighted users and prompted a wave of new touch screen-based devices. However, touch screens are still largely inaccessible to blind people because they require the user to visually locate objects on the screen. To address this...

    Provided By University of Washington

  • White Papers // Jan 2011

    A Complete and Efficient Algebraic Compiler for XQuery

    As XQuery nears standardization, more sophisticated XQuery applications are emerging, which often exploit the entire language and are applied to non-trivial XML sources. The authors propose an algebra and optimization techniques that are suitable for building an XQuery compiler that is complete, correct, and efficient. They describe the compilation rules...

    Provided By University of Washington

  • White Papers // Jan 2010

    Throughput Optimization for Multipath Unicast Routing Under Probabilistic Jamming

    The authors present a framework for throughput optimization for multipath unicast routing in wireless networks in the presence of probabilistic jamming. The framework introduces a statistical characterization into the maximum network flow problem to compensate for the reduction in network flow due to the loss of jammed packets. They map...

    Provided By University of Washington

  • White Papers // Feb 2010

    Flow Oriented Channel Assignment for Multi-Radio Wireless Mesh Networks

    The authors investigate channel assignment for a multichannel wireless mesh network backbone, where each router is equipped with multiple interfaces. Of particular interest is the development of channel assignment heuristics for multiple flows. They present an optimization formulation and then propose two iterative flow oriented heuristics for the conflict-free and...

    Provided By University of Washington

  • White Papers // Jul 2009

    CSMA Self-Adaptation Based on Interference Differentiation

    This paper addresses the design challenge of interference mitigation in the emerging High Density (HD) wireless LAN. It is proposed to differentiate interference according to the energy and timing relative to desired signal, and measure Packet Error Rate (PER) locally at transmitter for each type of interference. Then, self-adaptation algorithms...

    Provided By University of Washington

  • White Papers // Dec 2009

    Securing Low-Cost RFID Systems: An Unconditionally Secure Approach

    The authors explore a new direction towards solving the identity authentication problem in RFID systems. They break the RFID authentication process into two main problems: message authentication and random number generation. For parties equipped with a good source of randomness and a secure cryptographic primitive to authenticate messages, the literature...

    Provided By University of Washington

  • White Papers // Jan 2011

    Tradeoffs Between Jamming Resilience and Communication Efficiency in Key Establishment

    The authors address the problem of allowing authorized users, who do not preshare a common key, to effectively exchange key establishment messages over an insecure channel in the presence of jamming and message insertion attacks. In this work, they jointly consider the security and efficiency of key exchange protocols, focusing...

    Provided By University of Washington

  • White Papers // Jul 2009

    Stochastic Modeling of a Single TCP/IP Session Over a Random Loss Channel

    In this paper the authors present an analytical framework for modeling the performance of a single TCP session in the presence of random packet loss. This framework may be applicable to communications channels that cause random packet loss modeled by appropriate statistics of the inter-loss duration. It is shown that...

    Provided By University of Washington

  • White Papers // Aug 2010

    Privacy Versus Scalability in Radio Frequency Identification Systems

    Embedding a Radio Frequency Identification (RFID) tag into individual items enables the unique identification of such items over the wireless medium, without the need for a line-of-sight path. One of the main challenges for the successful commercialization of the RFID technology is the efficient, yet private, identification of low-cost tags...

    Provided By University of Washington

  • White Papers // Jan 2011

    Denali: A Scalable Isolation Kernel

    The Denali project provides system support for running several mutually distrusting Internet services on the same physical infrastructure. For example, this would enable a developer to push dynamic content into third party hosting infrastructure such as content distribution networks. To accomplish this, the authors propose new kernel architecture called an...

    Provided By University of Washington

  • White Papers // Jan 2011

    Containment and Equivalence for an XPath Fragment

    XPath is a simple language for navigating an XML document and selecting a set of element nodes. XPath expressions are used to query XML data, describe key constraints, express transformations, and reference element s in remote documents. This paper studies the containment and equivalence problems for a fragment of the...

    Provided By University of Washington

  • White Papers // Mar 2010

    The Architecture and Implementation of an Extensible Web Crawler

    Many Web services operate their own Web crawlers to discover data of interest, despite the fact that large scale, timely crawling is complex, operationally intensive, and expensive. In this paper, the authors introduce the extensible crawler, a service that crawls the Web on behalf of its many client applications. Clients...

    Provided By University of Washington

  • White Papers // Feb 2011

    Smart Redundancy for Distributed Computation

    Many distributed software systems allow participation by large numbers of untrusted, potentially faulty components on an open network. As faults are inevitable in this setting, these systems utilize redundancy and replication to achieve fault tolerance. In this paper, the authors present a novel "Smart" redundancy technique called iterative redundancy, which...

    Provided By University of Washington

  • White Papers // Jul 2009

    Visual Analytics in Support of Secure Cyber-Physical Systems

    Homeland Security Presidential Directive 7 (HSPD-7), released in 2003, firmly established the term critical infrastructure protection and directed action be taken to identify, prioritize, and address the vulnerabilities to the systems and services that have relevance to the American way and quality of life. Cyber Physical Systems (CPS) are integral...

    Provided By University of Washington

  • White Papers // Jan 2011

    Power Controlled Minimum Frame Length Scheduling in TDMA Wireless Networks With Sectored Antennas

    The authors consider the problem of power controlled minimum frame length scheduling for TDMA wireless networks. Given a set of one-hop transmission requests, the objective is to schedule them in a minimum number of time slots, so that each slot schedule is free of self-interferences and meets desired SINR constraints....

    Provided By University of Washington

  • White Papers // Nov 2009

    Advanced Travel Information System in Heterogeneous Networks

    In order to achieve better road utilization and traffic efficiency, there is an urgent need for a travel information delivery mechanism to assist the drivers in making better decisions in the emerging intelligent transportation system applications. In this paper, the authors propose a relayed multicast scheme under heterogeneous networks for...

    Provided By University of Washington

  • White Papers // Jan 2011

    Linear Programming Models for Jamming Attacks on Network Traffic Flows

    The authors present a new class of network attacks, referred to as flow-jamming attacks, in which an adversary with multiple jammers throughout the network jams packets to reduce traffic flow. They propose a linear programming framework for flow-jamming attacks, providing a foundation for the design of future protocols to mitigate...

    Provided By University of Washington

  • White Papers // Feb 2010

    Prioritized Broadcast Contention Control in VANET

    Reliable and timely multi-hop propagation of messages among vehicles is essential for a safer and greener transportation system. Various broadcast-based forwarding strategies are envisioned for infrastructure-less Vehicle-to-Vehicle (V2V) communications. This paper proposes a prioritized Broadcast Contention Control (PBCC) module/layer that provides reliable and low latency multi-hop connection. The PBCC forwarding...

    Provided By University of Washington

  • White Papers // Jan 2011

    Improving the Reliability of Internet Paths With One-Hop Source Routing

    Recent work has focused on increasing availability in the face of Internet path failures. To date, proposed solutions have relied on complex routing and path monitoring schemes, trading scalability for availability among a relatively small set of hosts. This paper proposes a simple, scalable approach to recover from Internet path...

    Provided By University of Washington

  • White Papers // Feb 2010

    Congestion Control to Achieve Optimal Broadcast Efficiency in VANETs

    In a vehicular network, every vehicle broadcasts update messages that contain location and speed information periodically to its one hop neighbors. The broadcast efficiency measures the average rate at which a vehicle receives these packets from any of its neighbors. As the node density increases, heightened interference lowers broadcast efficiency...

    Provided By University of Washington

  • White Papers // Feb 2011

    Why Undergraduates Should Learn the Principles of Programming Languages

    Undergraduate students obtain important knowledge and skills by studying the pragmatics of programming in multiple languages and the principles underlying programming language design and implementation. These topics strengthen students' grasp of the power of computation, help students choose the most appropriate programming model and language for a given problem, and...

    Provided By University of Washington

  • White Papers // Jun 2010

    Searching the Searchers With SearchAudit John

    Search engines not only assist normal users, but also provide information that hackers and other malicious entities can exploit in their nefarious activities. With carefully crafted search queries, attackers can gather information such as email addresses and misconfigured or even vulnerable servers. The authors present SearchAudit, a framework that identifies...

    Provided By University of Washington

  • White Papers // Mar 2011

    Accelerating SSL with GPUs

    SSL/TLS is a standard protocol for secure Internet communication. Despite its great success, today's SSL deployment is largely limited to security-critical domains. The low adoption rate of SSL is mainly due to high computation overhead on the server side. In this paper, the authors propose Graphics Processing Units (GPUs) as...

    Provided By University of Washington

  • White Papers // Sep 2010

    Comet: An Active Distributed Key-Value Store

    Distributed key-value storage systems are widely used in corporations and across the Internet. The research seeks to greatly expand the application space for key-value storage systems through application-specific customization. The authors designed and implemented Comet, an extensible, distributed key-value store. Each Comet node stores a collection of Active Storage Objects...

    Provided By University of Washington

  • White Papers // Aug 2010

    Intractable Problems in Cryptography

    The authors examine several variants of the Diffie-Hellman and Discrete Log problems that are connected to the security of cryptographic protocols. They discuss the reductions that are known between them and the challenges in trying to assess the true level of difficulty of these problems, particularly if they are interactive...

    Provided By University of Washington

  • White Papers // May 2011

    Operating System Implications of Fast, Cheap, Non-Volatile Memory

    The existence of two basic levels of storage (fast/volatile and slow/non-volatile) has been a long-standing premise of most computer systems, influencing the design of OS components, including file systems, virtual memory, scheduling, execution models, and even their APIs. Emerging resistive memory technologies - such as Phase-Change Memory (PCM) and memristors...

    Provided By University of Washington

  • White Papers // Dec 2010

    Checked Load: Architectural Support for JavaScript Type-Checking on Mobile Processors

    Dynamic languages such as Javascript are the de-facto standard for web applications. However, generating efficient code for dynamically-typed languages is a challenge, because it requires frequent dynamic type checks. The analysis has shown that some programs spend upwards of 20% of dynamic instructions doing type checks, and 12.9% on average....

    Provided By University of Washington

  • White Papers // Nov 2010

    A Limit Study of JavaScript Parallelism

    JavaScript is ubiquitous on the web. At the same time, the language's dynamic behavior makes optimizations challenging, leading to poor performance. In this paper the authors conduct a limit study on the potential parallelism of JavaScript applications, including popular web pages and standard JavaScript benchmarks. They examine dependency types and...

    Provided By University of Washington

  • White Papers // Aug 2009

    Query Containment of Tier-2 Queries Over a Probabilistic Database

    The authors study the containment problem for a query language over probabilistic relational databases that allows queries like "Is the probability that q1 holds greater than 0.2 and the probability that q2 holds greater than 0.6?" where q1 and q2 are Boolean conjunctive queries. In addition to being a fundamental...

    Provided By University of Washington

  • White Papers // Jun 2009

    The Trichotomy of HAVING Queries on a Probabilistic Database

    The authors study the complexity of evaluating aggregate queries on probabilistic databases. The motivation is to manage data produced by integration applications, e.g., data from object reconciliation or information extraction. Standard approaches require that the authors eliminate all uncertainty before any querying can begin, which is expensive in both man-hours...

    Provided By University of Washington