Now showing items 53-72 of 297

    • C++.T Formalization in Isar 

      Siek, Jeremy G.; Taha, Walid (2005-12-16)
      A formal account of C++ templates, including the compile-time and run-time semantics. The main result is a proof of type safety. The proof is written in the Isar proof language and can be mechanically verified using the ...
    • Cache Coherence Using Local Knowledge 

      Darnell, Ervan (1995-04-01)
      Hiding memory latency is critical in modern machines. Typically, machines have used cache and addressed the ensuing cache coherence problem with hardware or VM-based strategies that rely on global inter-cache communicati ...
    • Cache Management in Scalable Network Servers 

      Pai, Vivek (2000-07-13)
      For many users, the perceived speed of computing is increasingly dependent on the performance of network server systems, underscoring the need for high performance servers. Cost-effective scalable network servers can be ...
    • Circular polarization dependent cyclotron resonance in large-area graphene in ultrahigh magnetic fields 

      Booshehri, L.G.; Mielke, C.H.; Rickel, D.G.; Crooker, S.A.; Zhang, Q.; Ren, L.; Haroz, E.H.; Rustagi, A.; Stanton, C.J.; Jin, Z.; Sun, Z.; Yan, Z.; Tour, J.M.; Kono, J. (2012)
      Using ultrahigh magnetic fields up to 170 T and polarized midinfrared radiation with tunable wavelengths from 9.22 to 10.67 μm, we studied cyclotron resonance in large-area graphene grown by chemical vapor deposition. ...
    • Classes and Mixins 

      Felleisen, Matthias; Flatt, Matthew; Krishnamurthi, Shriram (1999)
      While class-based object-oriented programming languages provide a flexible mechanism for re-using and managing related pieces of code, they typically lack linguistic facilities for specifying a uniform extension of many ...
    • Coarse-Grained Conformational Sampling of Protein Structure Improves the Fit to Experimental Hydrogen-Exchange Data 

      Devaurs, Didier; Antunes, Dinler A.; Papanastasiou, Malvina; Moll, Mark; Ricklin, Daniel; Lambris, John D.; Kavraki, Lydia E. (2017)
      Monitoring hydrogen/deuterium exchange (HDX) undergone by a protein in solution produces experimental data that translates into valuable information about the protein's structure. Data produced by HDX experiments is often ...
    • Combinatorial Clustering of Residue Position Subsets Predicts Inhibitor Affinity across the Human Kinome 

      Bryant, Drew H.; Moll, Mark; Finn, Paul W.; Kavraki, Lydia E. (2013)
      The protein kinases are a large family of enzymes that play fundamental roles in propagating signals within the cell. Because of the high degree of binding site similarity shared among protein kinases, designing drug ...
    • Combining Analysis, Combining Optimizations 

      Click, Clifford Noel, Jr. (1995-02)
      This thesis presents a framework for describing optimizations. It shows how to combine two such frameworks and how to reason about the properties of the resulting framework. The structure of the framework provides insight ...
    • Combining Particles and Waves for Fluid Animation 

      Hall, Mark (1992-04)
      Modeling fluid motion is a problem largely unsolved by traditional modeling techniques. Animation of fluid motion has been possible only in special cases, falling into one of two general categories. Upper surface representations ...
    • COMMA: Coordinating the Migration of Multi-tier Applications 

      Liu, Zhaolei; Ng, T. S. Eugene; Sripanidkulchai, Kunwadee; Zheng, Jie (2014-11-24)
      Multi-tier applications are widely deployed in today’s virtualized cloud computing environments. At the same time, management operations in these virtualized environments, such as load balancing, hardware maintenance, ...
    • Commit Phase Variations in Timestamp-based Software Transactional Memory 

      Zhang, Rui; Budimli?, Zoran; Scherer, William N., III (2008-02-11)
      Timestamp-based Software Transactional Memory (STM) validation techniques use a global shared counter and timestamping of objects being written to reason about sequencing of transactions and their linearization points, ...
    • Communication Generation for Data-Parallel Languages 

      Sethi, Ajay (1996-12)
      Data-parallel languages allow programmers to use the familiar machine-independent programming style to develop programs for multiprocessor systems. These languages relieve users of the tedious task of inserting interprocessor ...
    • Communication Optimizations for Distributed-Memory X10 Programs 

      Barik, Rajkishore; Budimlić, Zoran; Grove, David; Peshansky, Igor; Sarkar, Vivek; Zhao, Jisheng (2010-04-10)
      X10 is a new object-oriented PGAS (Partitioned Global Address Space) programming language with support for distributed asynchronous dynamic parallelism that goes beyond past SPMD message-passing models such as MPI and SPMD ...
    • Compilation Order Matters: Exploring the Structure of the Space of Compilation Sequences Using Randomized Search Algorithms 

      Almagor, L.; Cooper, Keith D.; Grosul, Alexander; Harvey, Timothy J.; Reeves, Steven W.; Subramanian, Devika; Torczon, Linda; Waterman, Todd (2004-06-18)
      Most modern compilers operate by applying a fixed sequence of code optimizations, called a compilation sequence, to all programs. Compiler writers determine a small set of good, general-purpose, compilation sequences by ...
    • Compiler Support for Machine-Independent Parallelization of Irregular Problems 

      von Hanxleden, Reinhard (1994-12-01)
      Data-parallel languages, such as HIGH PERFORMANCE FORTRAN or FORTRAND, provide a machine-independent data-parallel programming paradigm in which the applications programmer uses a dialect of a sequential language annotated ...
    • Compiler Support for Software Prefetching 

      McIntosh, Nathaniel (1998-03-02)
      Due to the growing disparity between processor speed and main memory speed, techniques that improve cache utilization and hide memory latency are often needed to help applications achieve peak performance. Compiler-directed ...
    • Compiler Support for Work-Stealing Parallel Runtime Systems 

      Raman, Raghavan; Zhao, Jisheng; Budimlić, Zoran; Sarkar, Vivek (2010-03-03)
      Multiple programming models are emerging to address an increased need for dynamic task parallelism in multicore shared-memory multiprocessors. Examples include OpenMP 3.0, Java Concurrency Utilities, Microsoft Task Parallel ...
    • Compiling dynamic languages via typed functional languages 

      Bandyopadhyay, Raj; Taha, Walid (2007-10-19)
      Dynamic languages enable rapid prototyping, while statically typed languages offer early error-detection and efficient execution. As a result, the usual practice in software development is to build a prototype in a dynamic ...
    • Compiling for Software Distributed-Shared Memory Systems 

      Zhang, Kai (2000-04-03)
      In this thesis, we explore the use of software distributed shared memory (SDSM) as a target communication layer for parallelizing compilers. ForSDSM to be effective for this purpose it must efficiently support both regular ...
    • Compiling Parallel Matlab for General Distributions Using Telescoping Languages 

      Fletcher, Mary; Jin, Guohua; Kennedy, Ken; McCosh, Cheryl (2006-10-31)
      Matlab is one of the most popular computer languages for technical and scientific programming. However, until recently, it has been limited to running on uniprocessors. One strategy for overcoming this limitation is to ...