Now showing items 192-211 of 297

    • Pacer: Taking the Guesswork Out of Live Migrations in Hybrid Cloud Computing 

      Zheng, Jie; Ng, T. S. Eugene; Sripanidkulchai, Kunwadee; Liu, Zhaolei (2013-10-01)
      Hybrid cloud computing, where private and public cloud resources are combined and applications can migrate freely, ushers in unprecedented flexibility for businesses. To unleash the benefits, commercial products already ...
    • Parallel Flow-Sensitive Points-to Analysis 

      Zhao, Jisheng; Burke, Michael G.; Sarkar, Vivek (2017-02-01)
      Points-to analysis is a fundamental requirement for many program analyses, optimizations, and debugging/verification tools. However, finding an effective balance between performance, scalability and precision in points-to ...
    • Parsimonious Inference of Hybridization in the Presence of Incomplete Lineage Sorting 

      Yu, Yun; Barnett, R. Matthew; Nakhleh, Luay (2013)
      Hybridization plays an important evolutionary role in several groups of organisms. A phylogenetic approach to detect hybridization entails sequencing multiple loci across the genomes of a group of species of interest, ...
    • Performance Analysis and Optimization of a Hybrid Seismic Imaging Application 

      Paul, Sri Raj; Araya-Polo, Mauricio; Mellor-Crummey, John; Hohl, Detlef (2016)
      Applications to process seismic data are computationally expensive and, therefore, employ scalable parallel systems to produce timely results. Here we describe our experiences of using performance analysis tools to gain ...
    • Performance Characterization of the FreeBSD Network Stack 

      Kim, Hyong-youb; Rixner, Scott (2005-06-02)
      This paper analyzes the behavior of high-performance web servers along three axes: packet rate, number of connections, and communication latency. Modern, high-performance servers spend a significant fraction of time executing ...
    • Planarization of Graphs Embedded on Surfaces 

      Djidjev, Hristo N.; Venkatesan, Shankar M. (1995-06-02)
      A planarizing set of a graph is a set of edges or vertices whose removal leaves a planar graph. It is shown that if G is an n vertex graph of maximum degree d and orientable genus g, then there exists a planarizing set of ...
    • Plinko: Building Provably Resilient Forwarding Tables 

      Cox, Alan L.; Rixner, Scott; Stephens, Brent (2013-07-18)
      This paper introduces Plinko, a network architecture that uses a novel forwarding model and routing algorithm to build networks with forwarding paths that, assuming arbitrarily large forwarding tables, are provably resilient ...
    • Polymorphism for Imperative Languages without Imperative Types 

      Wright, Andrew (1993-02-18)
      The simple and elegant Hindley/Milner polymorphic type discipline is the basis of the type system of Standard ML, but ML's imperative features are a blight on this otherwise clean landscape. Polymorphism and imperative ...
    • Portable Techniques to Find Effective Memory Hierarchy Parameters 

      Cooper, Keith D.; Sandoval, Jeffrey (2011-12-13)
      Application performance on modern microprocessors depends heavily on performance related characteristics of the underlying architecture. To achieve the best performance, an application must be tuned to both the target-processor ...
    • Power Mode Scheduling for Ad Hoc Network Routing 

      PalChaudhuri, Santashil (2002-04-27)
      An ad hoc network is a group of mobile wireless nodes that cooperatively form a network among themselves without any fixed infrastructure. Each node in the ad hoc network forwards packets for other nodes, to allow nodes ...
    • Practical Soft Typing 

      Wright, Andrew (1994-08)
      Soft typing is an approach to type checking for dynamically typed languages. Like a static type checker, a soft type checker infers syntactic types for identifiers and expressions. But rather than reject programs containing ...
    • Practical Techniques to Augment Dependence Analysis in the Presence of Symbolic Terms 

      Goff, Gina (1997-05)
      Dependence analysis is an indispensable tool in the automatic vectorization and parallelization of sequential programs, but performing symbolic dependence analysis can be costly and may fail to resolve many unknown terms. ...
    • Predicting protein-ligand interactions from primary structure 

      Bandyopadhyay, Raj; Matthews, K; Subramanian, D; Tan, X-X (2002-02-15)
      One of the key challenges in the post-genomic era is to understand protein-ligand interactions on a large scale. The question is: Given the primary structures of a protein and a ligand, how well can we computationally ...
    • Present but Unreachable: Reducing Persistentlatent Secrets in HotSpot JVM 

      Pridgen, Adam; Garfinkel, Simson L.; Wallach, Dan S. (2017)
      Applications that manage sensitive secrets, including cryptographic keys, are typically engineered to overwrite the secrets in memory once they’re no longer necessary, offering an important defense against forensic attacks ...
    • Probabilistic Clock Synchronization Service in Sensor Networks 

      Johnson, David B.; PalChaudhuri, Santashil; Saha, Amit (2003-04-16)
      Recent advances in technology have made low cost, low power wireless sensors a reality. Clock synchronization is an important service in any distributed system, including sensor network systems. Applications of clock ...
    • Programming Languages for Reusable Software Components 

      Flatt, Matthew (1999-07-20)
      Programming languages offer a variety of constructs to support code reuse. For example, functional languages provide function constructs for encapsulating expressions to be used in multiple contexts. Similarly, object-oriented ...
    • Publication Culture in Computing Research 

      Mehlhorn, Kurt; Vardi, Moshe Y.; Herbstritt, Marc (2012)
      The dissemination of research results is an integral part of research and hence a crucial component for any scientific discipline. In the area of computing research, there have been raised concerns recently about its ...
    • Puppeteer: Component-based Adaptation for Mobile Computing 

      Lara, Eyal de; Wallach, Dan S.; Zwaenepoel, Willy (2000-07-06)
      Puppeteer is a system for adapting component-based applications in mobile environments. Puppeteer takes advantage of the component-based nature of the applications to perform adaptation without modifying the applications. ...
    • RCMP: A System Enabling Efficient Re-computation Based Failure Resilience for Big Data Analytics 

      Dinu, Florin; Ng, T. S. Eugene (2013-04-30)
      Multi-job I/O-intensive big-data computations can suffer a significant performance hit due to relying on data replication as the main failure resilience strategy. Data replication is inherently an expensive operation for ...