|
|
Creator | Title | Description | Subject | Date |
| 51 |
 |
Guilkey, James Edward | Improved velocity projection for the Material Point Method | The standard velocity projection scheme for the Material Point Method (MPM) and a typical form of the GIMP Method are examined. It is demonstrated that the fidelity of information transfer from a particle representation to the computational grid is strongly dependent on particle density and locati... | Material Point Method; GIMP Method; Meshless methods; Velocity projection; Solid mechanics | 2007 |
| 52 |
 |
Lindstrom, Gary E. | The key node method: a highly-parallel alpha-beta algorithm | A new parallel formulation of the alpha-beta algorithm for minimax game tree searching is presented. Its chief characteristic is incremental information sharing among subsearch processes in the form of "provisional" node value communication. Such "eager" communication can offer the double benefit of... | Key node method; Alpha-beta algorithm; Minimax; Game tree searching | 1983 |
| 53 |
 |
Regehr, John | The problems you're having may not be the problems you think you're having: results from a latency study of windows NT | This paper is intended to catalyze discussions on two intertwined systems topics. First, it presents early results from a latency study of Windows NT that identifies some specific causes of long thread scheduling latencies, many of which delay the dispatching of runnable threads for tens of millisec... | | 1999-01-01 |
| 54 |
 |
Wright, Kristin | Using reliable multicast for caching and collaboration within the world wide web | The World Wide Web has become an important medium for information dissemination. One model for synchronized information dissemination within the Web is webcasting in which data are simultaneously distributed to multiple destinations. The Web's traditional unicast client/server communication model su... | caching; collaboration | 1999 |
| 55 |
 |
Gu, Jun | Fast structured design of VLSI circuits | We believe that a structured, user-friendly, cost-effective tool for rapid implementation of VLSI circuits which encourages students to participate directly in research projects are the key components in digital integrated circuit (IC) education. In this paper, we introduce our VLSI education activ... | VLSI circuits; Rapid implementation | 1988 |
| 56 |
 |
Regehr, John | Inferring scheduling behavior with hourglass | Although computer programs explicitly represent data values, time values are usually implicit. This makes it difficult to analyze and debug real-time programs whose correctness depends partially on the time at which results are computed. This paper shows how to use Hourglass, an instrumented, synthe... | | 2002-01-01 |
| 57 |
 |
Carter, John B. | Reducing consistency traffic and cache misses in the avalanche multiprocessor | For a parallel architecture to scale effectively, communication latency between processors must be avoided. We have found that the source of a large number of avoidable cache misses is the use of hardwired write-invalidate coherency protocols, which often exhibit high cache miss rates due to exces... | Consistency traffic; Cache misses; Parallel architecture; Communication latency | 1995 |
| 58 |
 |
Hoogenboom, Peter J. | Semantic definition of a subset of the structured query language (SQL) | SQL is a relational database definition and manipulation language. Portions of the manipulation language are readily described in terms of relational algebra. The semantics of a subset of the SQL select statement is described. The select statement allows the user to query the database. The select st... | | 1991 |
| 59 |
 |
Kessler, Robert R. | DPOS: A metalanguage and programming environment for parallel processors | The complexity and diversity of parallel programming languages and computer architectures hinders programmers in developing programs and greatly limits program portability. All MIMD parallel programming systems, however, address common requirements for process creation, process management, and inte... | DPOS; MIMD parallel programming | 1990 |
| 60 |
 |
Johnson, Christopher R.; Parker, Steven G.; Hansen, Charles D. | Interactive simulation and visualization | Most of us perform data analysis and visualization only after everything else is finished, which often means that we don't discover errors invalidating the results of our simulation until postprocessing. A better approach would be to improve the integration of simulation and visualization into the... | Computational steering; Interactive simulation; Isosurfaces | 1999 |
| 61 |
 |
Carter, John B. | Supporting persistent C++ objects in a distributed storage system | We have designed and implemented a C++ object layer for Khazana, a distributed persistent storage system that exports a flat shared address space as its basic abstraction. The C++ layer described herein lets programmers use familiar C++ idioms to allocate, manipulate, and deallocate persistent share... | persistent C++ objects; distributed storage; Khazana; flat shared address space | 1999 |
| 62 |
 |
Davis, Alan L. | A characterization of parallel systems | a taxonomy for parallel processing systems is presented which has some advantages over previous taxonomies. The taxonomy characterizes parallel processing systems using four parameters: topology, communication, granularity, and operation. These parameters and used repetitively in a hierarchical fash... | Parallel systems | 1980 |
| 63 |
 |
Hoogenboom, Peter J. | System performance advisor user guide | The usage of the System Performance Advisor (SPA) expert system is described. Documentation of SPA system commands, system variables, diagnostic rules is given. Information on how to run the SPA system is discussed. In addition, an overview of how SPA searches for problems is supplied. The purpose o... | System Performance Advisor; SPA; User guide | 1991 |
| 64 |
 |
Gopalakrishnan, Ganesh | Case studies in symbolic model checking | The need to formally verify hardware and software systems before they are deployed the real world has been recognized for several decades now. This is especially true of concurrent systems that are even more difficult to debug than sequential systems. For example, many of the protocols that get emp... | Symbolic model checking; Hardware verification; Software verification | 1994 |
| 65 |
 |
Gopalakrishnan, Ganesh | Dynamic reordering of high latency transactions in time-warp simulation using a modified micropipeline | Time warp based simulation of discrete-event systems is an efficient way to overcome the synchronization overhead during distributed simulation. As computations may proceed beyond synchronization barriers in time warp, multiple checkpoints of state need to be maintained to be able to rollback inva... | Asynchronous design; Micropipelines; Dynamic instruction reordering; Time warp simulations | 1992 |
| 66 |
 |
Balasubramonian, Rajeev | Microarchitectural techniques to reduce interconnect power in clustered processors | The paper presents a preliminary evaluation of novel techniques that address a growing problem - power dissipation in on-chip interconnects. Recent studies have shown that around 50% of the dynamic power consumption in modern processors is within on-chip interconnects. The contribution of interc... | Microarchitectural techniques; Interconnect power; Clustered processors; On-chip | 2004 |
| 67 |
 |
Yang, Yue; Gopalakrishnan, Ganesh; Lindstrom, Gary E.; Slind, Konrad Lee | Nemos: a framework for axiomatic and executable specifications of memory consistency models | Conforming to the underlying memory consistency rules is a fundamental require- ment for implementing shared memory systems and writing multiprocessor programs. In order to promote understanding and enable automated verification, it is highly desir- able that a memory model specification be both ... | Nemos; Shared memory systems | 2003 |
| 68 |
 |
Fujimoto, Richard M. | Systolic array synthesis by static analysis of program dependencies | We present a technique for mapping recurrence equations to systolic arrays. While this problem has been studied in fairly great detail, the recurrence equations that are analysed here are a generalization of those studied previously. In a n earlier paper (14] we have showed how systolic arrays can b... | Systolic array synthesis; static analysis; program dependencies; recurrence equations | 1986 |
| 69 |
 |
Lindstrom, Gary E. | Type-safe composition of object modules | We describe a facility that enables routine type-checking during the linkage of external declarations and definitions of separately compiled programs in ANSI C. The primary advantage of our server-style type-checked linkage facility is the ability to program the combination of object modules via a s... | object modules; ANSI C; Type-safe; type-checking | 1994 |
| 70 |
 |
Evans, John | A distributed object-oriented graphical programming system | This report presents the design of a distributed parallel object system (DPOS) and its implementation using a graphical editing interface. DPOS brings together concepts of object-oriented programming and graphical programming with aspects of modern functional languages. Programs are defined as netwo... | Distributed parallel object system; DPOS | 1990 |
| 71 |
 |
Hibler, Michael J. | Microkernels meet recursive virtual machines (draft. May 10, 1996)) | This paper describes a novel approach to providing modular and extensible operating system functionality, and encapsulated environments, based on a synthesis of micro-kernel and virtual machine concepts. We have developed a virtualizable architecture that allows recursive virtual machines (virtual m... | Microkernels; Virtual machines; Operating system functionality | 1996 |
| 72 |
 |
Carter, John B. | Using khazana to support distributed application development | One of the most important services required by most distributed applications is some form of shared data management, e.g., a directory service manages shared directory entries while groupware manages shared documents. Each such application currently must implement its own data management mechanisms,... | Khazana; Distributed applications; Development | 1999 |
| 73 |
 |
Lindstrom, Gary E. | Abstract semantics for functional constraint programming | A denotational semantics is given for a lazy functional language with monotonic side-effects arising from the unification of singly-bound logical variables. The semantics is based on a Scott-style information system, which elegantly captures the notion of "constraint additin" inherent in unificati... | Abstract semantics | 1989 |
| 74 |
 |
Regehr, John | Augmented CPU reservations: towards predictable execution on general-purpose operating systems | One problem with performing soft real-time computations on general-purpose operating systems is that these OSs may spend significant amounts of time in the kernel instead of performing work on behalf of the application that is nominally scheduled: the OS effectively steals time from the running appl... | | 2001-01-01 |
| 75 |
 |
Freire, Juliana | Combining scheduling strategies in tabled evaluations | Tabled evaluations ensure termination for Datalog programs by distinguishing calls to tabled subgoals. Given several variant subgoals in an evaluation, only the first (the generator) will use program clause resolution, the rest (consumers) must perform answer resolution using answers computed by th... | SLG; SLG-WAM; Tabling; Local scheduling; Batched scheduling | 1997 |
