Browsing LCS Publications by Title

Now showing items 1022-1041 of 1163

    • A Stream Compiler for Communication-Exposed Architectures 

      Gordon, Michael; Thies, William; Karczmarek, Michael; Wong, Jeremy; Hoffmann, Henry; e.a. (2002-03)
      With the increasing miniturization of transistors, wire delays are becoming a dominant factor in microprocessor performance. To address this issue, a number of emerging architectures contain replicated processing units ...

    • StreamIT: A Complier for Streaming Applications 

      Thies, William F.; Karczmarek, Michael; Gordon, Michael; Maze, David; Wong, Jeremy; e.a. (2002-02)
      Streaming programs represent an increasingly important and widespread class of applications that holds unprecedented opportunitie sfor high-impact compiler technology. Unlike sequential programs with obscured dependence ...

    • StreaMIT: A Language for Streaming Applications 

      Thies, William F.; Karczmarek, Michael; Amarasinghe, Saman (2001-08)
      We characterize high-performance streaming applications as a new and distinct domain of programs that is becoming increasingly important. The StreaMIT language provides novel high-level representations to improve programmer ...

    • Strength Reduction of Integer Division and Modulo Operations 

      Amarasinghe, Saman; Lee, Walter; Greenwald, Ben (1999-11)
      Integer division, modulo, and remainder operations are expressive and useful operations. They are logical candidates to express complex data accesses such as the wrap-around behavior in queues using ring buffers, array ...

    • Stress: A Problem-oriented Language for Structural Engineering 

      Biggs, John M.; Logcher, Robert D. (1964-031)
      STRESS is a general purpose programming system for the analysis of structures. Compared to most other structural programs it has three distinguishing characteristics: (1) The input language is that of the structural ...

    • Stride Scheduling: Deterministic Proportional- Share Resource Management 

      Waldspurger, Carl A.; Weihl, William E. (1995-06)
      This paper presents stride scheduling, a deterministic scheduling technique that efficiently supports the same flexible resource management abstractions introduced by lottery scheduling. Compared to lottery scheduling, ...

    • String-matching and Other Products 

      Fischer, Michael J.; Paterson, Michael S. (1974-01)
      The string-matching problem considered here is to find all occurrences of a given pattern as a substring of another longer string. When the pattern is simply a given string of symbols, there is an algorithm due to Morris, ...

    • A Structure Memory for Data Flow Computers 

      Ackerman, William B. (1977-08)
      A data flow computer is one which achieves enormous concurrency of instruction execution through a machine architecture that acts directly on a data dependency graph of the program.

    • The Structure of Near-minimum Edge Cuts 

      Benczúr, András A.

    • Structured Video: A Data Type with Content-based Access 

      Duda, Andrzej; Weiss, Ron (1993-09)
      We describe structured video, a general video data model allowing free form annotation, composition, and content-based access to video segments. The structured video abstraction provides an efficient means of organizing ...

    • A Study of Backoff Barrier Synchronization 

      Cherian, Mathews Malieakkal (1989-06)
      Shared-memory multiprocessors commonly use shared variables for synchronization. Simulations of real parallel applications show that large-scale cache-coherent multiprocessors suffer significant amounts of invalidation ...

    • Subexponential Parameterized Algorithms on Graphs of Bounded Genus and H-minor-free Graphs 

      Demaine, Erik D.; Fomin, Fedor V.; Hajiaghayi, Mohammad Taghi; Thilikos, Dimitrios M. (2003-06)
      We introduce a new framework for designing fixed-parameter algorithms with subexponential running time---2^O(sqrt k) n^O(1). Our results apply to a broad family of graph problems, called bidimensional problems, which ...

    • The Subgraph Homeomorphism Problem 

      LaPaugh, Andrea Suzanne (1978-02)
      The problem investigated in this thesis is that of finding homeomorphic images of a given graph, called the pattern graph, in a larger graph. A homeomorphism is a pair of mappings, (v,a), suc that v maps the nodes of the ...

    • Sublinear-time Parallel Algorithms for Matching and Related Problems 

      Goldberg, Andrew V.; Plotkin, Serge A.; Vaidya, Pravin (1988-06)
      This paper presents the first sublinear-time deterministic parallel algorithms for bipartite matching and several related problems, including maximal node-disjoint paths, depth-first search, and flows in zero-one networks. ...

    • The Substantive Use of Computers for Intellectual Activities 

      Goldstein, Robert C. (1971-04)

    • Super-exponential Complexity of Presburger Arithmetic 

      Fischer, Michael J.; Rabin, Michael O. (1974-02)
      Lower bounds are established on the computational complexity of the decision problem and on the inherent lengths of proofs for two classical decidable theories of logic: the first order theory of the real numbers under ...

    • Supporting Organizational Problem Solving with a Workstation 

      Barber, Gerald R. (1982-07)
      This paper describes an approach to supporting work in the office. Using and extending ideas from the field of Artificial Intelligence (AI) we describe office work as a problem solving activity. A knowledge embedding ...

    • Surfaces for Computer-aided Design of Space Forms 

      Coons, Steven A. (1967-06)
      The design of airplanes, ships, automobiles, and so-called ""sculptured parts"" involves the design, delineation, and mathematical description of bounding surfaces. A method is described which makes possible the description ...

    • A Survey of Active Network Research 

      Tennenhouse, David L.; Smith, Jonathan M.; Sincoskie, W. David; Wetherall, David J.; Minden, Gary J.
      Active networks are a novel approach to network architecture in which the switches of the network perform customized computations on the messages flowing through them. This approach is motivated by both lead user applications, ...

    • A Survey of Algorithms for Integrating Wafer-scale Systolic Arrays 

      Leighton, Tom; Leiserson, Charles (1986-05)
      VLSI technologists are fast developing wafer-scale integration. Rather than partitioning a silicon wafer into chips as is usually done, the idea behind wafer-scale integration is to assemble an entire system (or network ...