Now showing items 21-40 of 244

    • TCP: Improving Startup Dynamics by Adaptive Timers and Congestion Control 

      Aron, Mohit; Druschel, Peter (1998-06-03)
      This paper studies the startup dynamics of TCP on both high as well as low bandwidth-delay network paths and proposes a set of enhancements that improve both the latency as well as throughput of relatively short TCP ...
    • Reducing the Impact of Spill Code 

      Harvey, Timothy J. (1998-07-24)
      All graph-coloring register allocators rely on heuristics to arrive at a "good" answer to the NP-complete problem of register allocation, resulting in suboptimal code due to spill code. We look at a post-pass to the allocator ...
    • Hybrid Dixon Resultants 

      Chionh, Eng-Wee; Goldman, Ronald; Zhang, Ming (1998-05-13)
      Dixon [1908] describes three distinct homogeneous determinant representations for the resultant of three bivariate polynomials of bidegree(m,n). These Dixon resultants are the determinants of matrices of orders 6mn, 3mn ...
    • Techniques for Efficient Cell-Level ATM Simulations 

      Aron, Mohit; Brakmo, Lawrence (2000-02)
      This paper investigates the efficiency of a network simulator in simulating ATM networks with UBR service and compares it to the the efficiency of simulating conventional packet networks. A network simulator can be highly ...
    • Memento: A Collaborative, Semantic-Based Infrastructure for Building Assistants 

      Baker, Donald (1998-03-02)
      Memento is a software infrastructure to support the construction and evolution of assistant applications (or assistants) that act as adjuncts to the human mind. Each assistant embodies an effective understanding of some ...
    • 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. ...
    • Verification of Open Systems 

      Vardi, Moshe Y. (1998-04-04)
      In computer system design, we distinguish between closed and open systems. A closed system is a system whose behavior is completely determined by the state of the system. An open system is a system that interacts with its ...
    • Scalability and Data Placement on SGI Origin 

      Chauhan, Arun; Ding, Chen; Sheraw, Berry (1998-04-01)
      Cache-coherent non-uniform memory access (ccNUMA) architectures have attracted lots of academic and industry interests as a promising direction to large scale parallel computing. Data placement has been used as a major ...
    • 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 ...
    • Module Checking 

      Kupferman, Orna; Vardi, Moshe Y.; Wolper, Pierre (1998-02-22)
      In computer system design, we distinguish between closed and open systems. A closed system is a system whose behavior is completely determined by the state of the system. An open system is a system that interacts with its ...
    • Relating Linear and Branching Model Checking 

      Kupferman, Orna; Vardi, Moshe Y. (1998-06-08)
      The difference in the complexity of branching and linear model checking has been viewed as an argument in favor of the branching paradigm. In particular, the computational advantage of CTL model checking over LTL model ...
    • 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 ...
    • The List Update ProblemImproved Bounds for the Counter Scheme 

      Hofri, Micha; Shachnai, Hadas (1998-02-02)
      We consider the problem of dynamic reorganization of a linear list, where requests for the elements are generated randomly with fixed, unknown probabilities. The objective is to obtain the smallest expected cost per access. ...
    • Three Approaches to Building Curves and Surfaces in Computer Aided Geometric Design 

      Habib, Ayman W. (1997-05)
      Modeling free-form curves and surfaces is one of the fundamental problems in computer aided geometric design. To solve this problem, several modeling techniques have been proposed. Three of these techniques, are investigated. ...
    • An Integrated Compile-Time/Run-Time Software Distributed Shared Memory System 

      Cox, Alan; Dwarkadas, Sandhya; Zwaenepoel, Willy (1997-11-17)
      High Performance Fortran (HPF), as well as its predecessor FortranD,has attracted considerable attention as a promising language for writing portable parallel programs for a wide variety of distributed-memory architectures. ...
    • Saddle points in random matrices: analysis of Knuth search algorithms 

      Hofri, Micha; Jacquet, Philippe (1997-12-22)
      In this note we present an analysis of algorithms for finding saddle points in a random matrix, presented by Donald E. Knuth as exercise 1.3.2-12 in The Art of Computer Programming. We estimate the average computing costs ...
    • Improving TLB Miss Handling with Page Table Pointer Caches 

      Wu, Michael; Zwaenepoel, Willy (1997-12-16)
      Page table pointer caches are a hardware supplement for TLBs that cache pointers to pages of page table entries rather than page table entries themselves. A PTPC traps and handles most TLB misses in hardware with low ...
    • Compiling Stencils in High Performance Fortran 

      Brickner, R. Gregg; Kennedy, Ken; Mellor-Crummey, John; Roth, Gerald H. (1997-11-12)
      For many Fortran90 and HPF programs performing dense matrix computations, the main computational portion of the program belongs to a class of kernels known as stencils. Stencil computations are commonly used in solving ...
    • 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 ...
    • IO-Lite: A unified I/O buffering and caching system 

      Druschel, Peter; Pai, Vivek; Zwaenepoel, Willy (1997-10-27)
      This paper presents the design, implementation, and evaluation ofIO-Lite, a unified I/O buffering and caching system. IO-Lite unifies all buffering and caching in the system, to the extent permitted by the hardware. In ...