1 - 25 of 989
Number of results to display per page
CreatorTitleDescriptionSubjectDate
1 Gopalakrishnan, GaneshThe 'test model-checking' approach to the verification of formal memory models of multiprocessorsWe offer a solution to the problem of verifying formal memory models of processors by com bining the strengths of model checking and a formal testing procedure for parallel machines We characterize the formal basis for abstracting the tests into test automata and associated memory rule safety p...Formal memory models; Shared memory multiprocessors; Formal testing; Model; Checking1998
2 Gopalakrishnan, GaneshThe 'Test model-checking' approach to the verification of formal memory models of multiprocessorsWe offer a solution to the problem of verifying formal memory models of processors by combining the strengths of model-checking and a formal testing procedure for parallel machines. We characterize the formal basis for abstracting the tests into test automata and associated memory rule safety proper...Test Model-checking; Formal memory; Verification1998
3 Henderson, Thomas C.2-D scene analysis using split-level relaxationWe present a new method for applying multiple semantic constraints based on discrete relaxation. A separate graph is maintained for each constraint relation and used in parallel to achieve a consistent labeling. This permits both local and global analysis without recourse to complete graphs. Here l...Discrete relaxation; Split-level relaxation1985
4 Bhanu, Bir3-D model building for computer visionThis paper presents a Computer-Aided Geometric Design (CAGD) based approach for building 3-D models which can be used for the recognition of 3-D objects for industrial machine vision applications. The objects are designed using the Alpha_1 CAGD system developed at the University of Utah. A new metho...CAGD; 3-D models; Machine vision1985
5 Gooch, Amy A.; Gooch, Bruce; Willemsen, Peter; Kniss, Joe; Riesenfeld, Richard F.; Shirley, Peter S.3D Line textures and the visualization of confidence in ArchitectureThis work introduces a technique for interactive walkthroughs of non-photorealistically rendered (NPR) scenes using 3D line primitives to define architectural features of the model, as well as indicate textural qualities. Line primitives are not typically used in this manner in favor of texture ma...Presentation graphics; Interactive walkthroughs2007
6 Poeppelmeier, Charles ChristianA boolean sum interpolation scheme to random data for computer aided geometric designThis thesis presents a new imterpolation function for randomly distributed data. The new interpolation function is capable of exactly reproducing quadratic surfaces. The new function is developed, through boolean sum theory, from Shepard's two dimensional interpolation functions and the Barnhill-Gre...Computer-aided geometric design; CAGD; Barnhill-Gregory; Interpolation functions1975
7 Balasubramonian, RajeevA case for increased operating system support in chip multi-processorsWe identify the operating system as one area where a novel architecture could significantly improve on current chip multi-processor designs, allowing increased performance and improved power efficiency. We first show that the operating system contributes a non-trivial overhead to even the most com...2005
8 Brunvand, Erik L.A case for increased operating system support in chip multi-processorsWe identify the operating system as one area where a novel architecture could significantly improve on current chip multi-processor designs, allowing increased performance and improved power efficiency. We first show that the operating system contributes a non-trivial overhead to even the most com...2005
9 Panangaden, PrakashA category theoretic formalism for abstract interpretationWe present a formal theory of abstract interpretation based on a new category theoretic formalism. This formalism allows one to derive a collecting semantics which preserves continuity of lifted functions and for which the lifting functon is itself continuous. The theory of abstract interpretation i...Formal theory; Theoretic formalism; Lifted functions1984
10 Brunvand, Erik L.A cell set for self-timed design using actel FPGAsAsynchronous or self-timed systems that do not rely on a global clock to keep system components synchronized can offer significant advantages over traditional clocked circuits in a variety of applications. However, these systems require that suitable self-timed circuit primitives are available for b...Self-timed systems; Actel field programmable gate arrays; FPGA1991
11 Davis, Alan L.A characterization of parallel systemsa 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 systems1980
12 Mathew, Binu K.; Davis, AlA characterization of visual feature recognitionNatural human interfaces are a key to realizing the dream of ubiquitous computing. This implies that embedded systems must be capable of sophisticated perception tasks. This paper analyzes the nature of a visual feature recognition workload. Visual feature recognition is a key component of a numb...Visual feature recognition; Human interfaces2003-09-03
13 Chen, Yang; Regehr, JohnA code size microbenchmark for CMotivation ? No compilers could always generate smaller code than others ? Hand-optimized code is often hard to understand ? Programmers tend to write readable code and trust compilers generate fast and compact code for them ? There is a plenty of room for improving compiler optimizations Our ...
14 Carter, JohnA collective approach to harness idle resourcesWe propose a collective approach for harnessing the idle resources (cpu, storage, and bandwidth) of nodes (e.g., home desktops) distributed across the Internet. Instead of a purely peer-to-peer (P2P) approach, we organize participating nodes to act collectively using collective managers (CMs). Pa...Idle resources; Computer nodes2008
15 Kessler, Robert R.A communication-ordered task graph allocation algorithmThe inherently asynchronous nature of the data flow computation model allows the exploitation of maximum parallelism in program execution. While this computational model holds great promise, several problems must be solved in order to achieve a high degree of program performance. The allocation and ...Task graph allocation algorithm1992
16 Evans, John; Kessler, Robert R.A communication-ordered task graph allocation algorithmThe inherently asynchronous nature of the data flow computation model allows the exploitation of maximum parallelism in program execution?? While this computational model holds great promise several problems must be solved in order to achieve a high degree of program performance?? The allocation...Data flow computation model1992
17 McDirmid, Sean; Eide, Eric Norman; Hsieh, Wilson C.A comparison of Jiazzi and AspectJ for feature-wise decompositionFeature-wise decomposition is an important approach to building configurable software systems. Although there has been research on the usefulness of particular tools for featurewise decomposition, there are not many informative comparisons on the relative effectiveness of different tools. In this...Jiazzi; AspectJ; Feature-wise decomposition2004-03-23
18 Brunvand, Erik L.A comparison of modular self-timed design stylesState-machine sequencing methods in modular 2-phase and 4-phase asynchronous handshake control are compared. Design styles are discussed, and the sequencers are tested against each other using a medium-scale minicomputer test design implemented in FPGAs. Seven 4-phase sequencers are tested. In these...Self-timed; State-machine sequencing; Asynchronous handshake control1995
19 Zhang, LixinA comparison of online superpage promotion mechanismsThe amount of data that a typical translation lookaside buffer (TLB) can map has not kept pace with the growth in cache sizes and application footprints. As a result, the cost of handling TLB misses limits the performance of an increasing number of applications. The use of superpages, multiple adjac...Superpages; Translation lookaside buffer; TLB1999
20 Brunvand, Erik L.; Smith, Kent F.A comparison of self-timed design using FPGA, CMOS, and GaAs technologiesAsynchronous or self-timed systems that do not rely on U global clock to keep system components synchronized can offer significant advantages over traditional clocked circuits in a variety of applications. One advantage is that because of the separation of timing, from, functionality in these sys...1992
21 Carter, John B.A comparison of software and hardware synchronization mechanisms for distributed shared memory multiprocessorsEfficient synchronization is an essential component of parallel computing. The designers of traditional multiprocessors have included hardware support only for simple operations such as compare-and-swap and load-linked/store-conditional, while high level synchronization primitives such as locks, bar...Hardware locks1996
22 Gopalakrishnan, GaneshA compositional model for synchronous VLSI systemsCurrently available hardware specification languages have two serious deficiencies: (i) inadequate protocol definition capabilities; (ii) lack of a compositional model. We now explain these in more detail.Very large scale integration; VLSI systems1987
23 Henderson, Thomas C.A control paradigm for general purpose manipulation systemsMechanical end effectors capable of dextrous manipulation are now a reality. Solutions to the high level control issues, however, have so far proved difficult to formulate. We propose a methodology for control which produces the functionality required for a general purpose manipulation system. It is...Manipulation systems1987
24 Brunvand, Erik L.A correctness criterion for asynchronous circuit validation and optimizationIn order to reason about the correctness of asynchronous circuit implementations and specifications, Dill has developed a variant of trace theory [1]. Trace theory describes the behavior of an asynchronous circuit by representing its possible executions as strings called "traces" A useful relatio...Asynchronous circuits; Circuit optimizations; Formal verification of hardware; Trace theory; Asynchronous circuit validation1992
25 Gopalakrishnan, GaneshA correctness criterion for asynchronous circuit validation and optimizationWe propose a new relation C. called strong conformance in the context of Dill's trace theory, and define B Q A to be true exactly when B conforms to A and the success set of B contains the success set of A. When B C. A, module B operated in module A's maximal environment AM (i.e. B || AM) exhibits a...Validation; Optimization1992
1 - 25 of 989