Filters: Date: "1991" Department: "Computing, School of" Format: "application/pdf" Collection: "ir_uspace"
1 - 25 of 16
| Creator | Title | Description | Subject | Date | ||
|---|---|---|---|---|---|---|
| 1 |
 |
Starkey, Mike | A lisp-based occam interpreter | The OCCAM programming language is an implementation of Communicating Sequential Processes and is used in a number of different areas. These areas usually require explicitly describing small-grain paralleslism. OCCAM programs formed by such descriptions can be tested for correctness by executing the... | Lisp-based; Occam interpreter | 1991 |
| 2 |
 |
Gopalakrishnan, Ganesh | Efficient symbolic simulation based verification using the parametric form of boolean expressions (rev.) | We present several new techniques to make symbolic simulation based verification efficient. These techniques hinge on the use of the parametric form of a boolean expression (e.g. the parametric form for the boolean expression XQ V -<xi is the equivalent expression 3a b . (XQ = a V 6) A (xi = b), whe... | Symbolic simulation; Verification | 1991 |
| 3 |
 |
Cohen, Elaine | Error bounded variable distance offset operator for free from curves and surfaces | Most offset approximation algorithms for freeform curves and surfaces may be classified into two main groups. The first approximates the curve using simple primitives such as piecewise arcs and lines and then calculates the (exact) offset operator to this approximation. The second offsets the contro... | Error bounded; Freeform curves | 1991 |
| 4 |
 |
Gopalakrishnan, Ganesh | From process-oriented functional specifications to efficient asynchronous circuits | A methodology for high-level synthesis and performance optimization of asynchronous circuits is described. A specification language called hopCP which is based on a simple extension to classical flow graphs is introduced. The extension involves the addition of expression actions to a flow graph, to ... | Synthesis; Performance optimization | 1991 |
| 5 |
 |
Cotter, Neil E. | Generality Vs. speed of convergence in the cart-pole balancer | This paper compares the speed of convergence to an optimal solution of four controllers for the problem of balancing a pole on a cart. We demonstrate that controllers whose design is tailored specifically to the cart-pole problem (i.e. less general) converge more rapidly to an optimal solution. How... | Cart-pole balancer; Generality; Speed of convergence | 1991 |
| 6 |
 |
Gopalakrishnan, Ganesh | Hierarchical action refinement: a methodology for compiling asynchronous circuits from a concurrent HDL | A hardware specification formalism called hopCP is introduced, hopCP provides an uniform notation t o describe the causal relationships between a set of nonatomic actions which capture the computational, concurrency, control and communication aspects of hardware behavior. A systematic approach to sy... | Hierarchical action refinement; Hardware specification formalism; hopCP | 1991 |
| 7 |
 |
Gopalakrishnan, Ganesh | hopCP: A concurrent hardware description language | hopCP is a language for the specification, simulation, and synthesis of hardware systems. hopCP captures the behavior of a hardware system by specifying the causal relationships between actions that the system can perform. No specific timing discipline is implied by a hopCP specification. Hence, hop... | hopCP; Hardware systems | 1991 |
| 8 |
 |
Lindstrom, Gary E. | Modularity meets inheritance | We "unbundle" several roles of classes in existing languages, by providing a suite of operators independently controlling such effects as combination, modification, encapsulation, name resolution, and sharing, all on the single notion of module. All module operators are forms of inheritance. Thus, ... | Modularity; Jigsaw computer tool | 1991 |
| 9 |
 |
Henderson, Thomas C. | Parallel path consistency | Filtering algorithms are well accepted as a means of speeding up the solution of the consistent labeling problem (CLP). Despite the fact that path consistency does a better job of filtering than arc consistency, AC is still the preferred technique because it has a much lower time complexity. We ar... | Filtering algorithms; Parallel paths; Consistency; Consistent labeling problem; CLP | 1991 |
| 10 |
 |
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 | |
| 11 |
 |
Gopalakrishnan, Ganesh | Static analysis techniques for the synthesis of efficient asynchronous circuits | In the context of deriving asynchronous circuits from high-level descriptions, determining whether two actions are potentially concurrent (overlapped execution) or serial (non-overlapped execution) has several advantages. This knowledge can be utilized to efficiently implement shared variables, sup... | Static analysis; Synthesis | 1991 |
| 12 |
 |
Starkey, Mike | Switchbox routing by pattern matching | Many good algorithms have been designed that provide good solutions to the wire routing problem in VLSI. Unfortunately, many of these algorithms only consider a small subset of different parameters such as number of layers, routability of layers and technology. We believe that these algorithms can b... | Switchbox routing; pattern matching; wire routing problem; VLSI | 1991 |
| 13 |
 |
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 |
| 14 |
 |
Starkey, Mike | Transforming disfigured and disoriented areas into routable switchboxes | Routing an entire circuit requires partitioning the circuit (routing area) into smaller, localized routing areas. Using non-rectangular, rotated switchbox shapes (and therefore non-manhattan routing layout) has the potential to simplify the partitioning of the circuit into routable areas and to use ... | Disfigured areas; Disoriented areas; routable switchboxes | 1991 |
| 15 |
 |
Lindstrom, Gary E. | Using a functional language and graph reduction to program multiprocessor machines or functional control of imperative programs | This paper describes an effective means for programming shared memory multiprocessors whereby a set of sequential activities are linked together for execution in parallel. The glue for this linkage is provided by a functional language implemented via graph reduction and demand evaluation. The full ... | shared memory multiprocessors; Programming; functional language; graph reduction; Demand evaluation | 1991 |
| 16 |
 |
Gopalakrishnan, Ganesh | Verification of regular arrays by symbolic simulation | Many algorithms have an efficient hardware formulation as a regular array of cells, which can be implemented in VLSI as regular circuit structures. Bit-sliced microprocessors, pattern matching circuits, associative cache memories, Hue-grain systolic arrays, and embedded memory-with-logic structure... | Verification; regular arrays; symbolic simulation | 1991 |
1 - 25 of 16