Now showing items 879-898 of 1769

    • Measuring Proxy Performance with the Wisconsin Proxy 

      Almeida, Jussara; Cao, Pei (University of Wisconsin-Madison Department of Computer Sciences, 1998)
    • A Mechanism for Efficient Debugging of Parallel Programs 

      Miller, Barton P; Choi, Jong-Deok (University of Wisconsin-Madison Department of Computer Sciences, 1988)
    • Mechanisms for Concurrency Control and Recovery in Prolog - A Proposal 

      Carey, Michael J; DeWitt, David J; Graefe, Goetz (University of Wisconsin-Madison Department of Computer Sciences, 1984)
    • Mechanisms for Cooperative Shared Memory 

      Wood, David A; Falsafi, Babak; Larus, James R; Lewis, James C; Palacharla, Subbarao; Chandra, Satish; Hill, Mark D; Lebek, Alvin R; Mukherjee, Shubhendu S; Reinhardt, Steven K (University of Wisconsin-Madison Department of Computer Sciences, 1993)
    • Mechanisms for Parallelism Specialization for the DySER Architecture 

      Sankaralingam, Karthikeyan; Nowatzki, Tony; Ho, Chen-Han; Govindaraju, Venkatraraman (University of Wisconsin-Madison Department of Computer Sciences, 2012-06-13)
      Specialization is a promising direction for improving processor energy efficiency. With functionality specialization, hardware is designed for application-specific units of computation. With parallelism specialization, ...
    • Medial-Axis-Based Shape Smoothing 

      Ho, Seng-Beng; Dyer, Charles R (University of Wisconsin-Madison Department of Computer Sciences, 1984)
    • Memory Access Dataflow 

      Sankaralingam, Karthikeyan; Kim, Sung Jin; Ho, Chen-Han (2014-03-07)
      Specialization and accelerators are an effective way to address the slowdown of Dennard scaling. For a family of accelerators like DySER, NPU, CE, and SSE acceleration that rely on a high performance processor to interface ...
    • Memory Extension Techniques for Mini-Computers 

      Poppendieck, Mary; Desautels, Edouard (University of Wisconsin-Madison Department of Computer Sciences, 1976)
      The address range of mini-computers purchased two to three years ago was typically 32K words. Many owners of these computers are realizing that this is no longer adequate for their application. Various methods of extending ...
    • Memory Extension Techniques for Mini-Computers 

      Poppendieck, Mary; Desautels, Edward (University of Wisconsin-Madison Department of Computer Sciences, 1976)
    • A Memory Net Structure: Present Implementation and a Proposed Language 

      Shapiro, Stuart C. (University of Wisconsin-Madison Department of Computer Sciences, 1968)
      A memory net structure has been designed which is particularly useful for storing, processing, and retrieving information of the type used in semantic analysis of natural language, question answering and theorem proving. ...
    • Memory System Design for Bus Based Multiprocessors 

      Chiang, Men-Chow (University of Wisconsin-Madison Department of Computer Sciences, 1992)
    • Memory Systems for Parallel Programming 

      Richards, Bradley E (University of Wisconsin-Madison Department of Computer Sciences, 1996)
    • Memory-Adaptive External Sorting 

      Pang, Hwee Hwa; Carey, Michael J; Livny, Miron (University of Wisconsin-Madison Department of Computer Sciences, 1993)
    • MemRx: "What-If" Performance Predictions for Varying Memory Size 

      Jones, Stephen T.; Arpaci-Dusseau, Andrea; Arpaci-Dusseau, Remzi (University of Wisconsin-Madison Department of Computer Sciences, 2006)
      Understanding and managing complex computer systems is quickly becoming intractable for an unaided administrator. Questions about how to provision server and distributed systems or how workload changes will affect system ...
    • Meta-Compiling Text Grammars as a Model for Human Behavior 

      Klein, Sheldon (University of Wisconsin-Madison Department of Computer Sciences, 1975)
      A survey of work with the meta-symbolic simulation system in generating murder mysteries, and in generating fairytales from text gramar models of Propp and Levi-Strauss. Also, a formulation of a theory of text grammars ...
    • Meta-Symbolic Simulation System (Messy) User Manual with Forward: The History of Messy 

      Appelbaum, Matthew; Klein, Sheldon (University of Wisconsin-Madison Department of Computer Sciences, 1976)
      User manual for the meta-symbolic simulation system that includes a behavioral simulation programming language that models, generates and manipulates events in the notation of a semantic network that changes through time, ...
    • Metadata-Based Parallelization of Program Instrumentation 

      Allen, Matthew D.; Sohi, Gurindar S. (University of Wisconsin-Madison Department of Computer Sciences, 2007)
      Program instrumentation has a wide variety of useful applications, but tool writers must overcome the challenge of substantial overheads caused by introducing additional code and data into a program. This paper observes ...
    • A Method for Symbolic Computation 

      Reps, Thomas; Thakur, Aditya (2011-12)
      In 1979, Cousot and Cousot gave a specification of the ?best? (most-precise) abstract transformer possible for a given concrete transformer and a given abstract domain. Unfortunately, their specification does not lead to ...
    • A Method for Symbolic Computation of Abstract Operations 

      Thakur, Aditya; Reps, Thomas (2012-02)
      In 1979, Cousot and Cousot gave a specification of the best (most-precise) abstract transformer possible for a given concrete transformer and a given abstract domain. Unfortunately, their specification does not lead to an ...
    • The Method of Christopherson for Solving Free Boundary Problems for Infinite Journal Bearings by Means of Finite Differences 

      Cryer, Colin W. (University of Wisconsin-Madison Department of Computer Sciences, 1969)