Filters: Collection: "ir_uspace"
| Creator | Title | Description | Subject | Date | ||
|---|---|---|---|---|---|---|
| 276 |
 |
Panangaden, Prakash | Verification of systolic arrays: a stream functional approach | We illustrate that the verification of systolic architectures can be carried out using techniques developed in the context of verification of programs. This is achieved by a decomposition of the original problem into separately proving the correctness of the data representation and of the individual... | Verification; systolic arrays; stream function | 1985 |
| 277 |
 |
Panangaden, Prakash | A category theoretic formalism for abstract interpretation | We 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 functions | 1984 |
| 278 |
 |
Brunvand, Erik L. | A correctness criterion for asynchronous circuit validation and optimization | In 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 validation | 1992 |
| 279 |
 |
Sobh, Tarek M.; Henderson, Thomas C. | A dynamic recursive structure for intelligent exploration | We suggest a new approach for inspection and reverse engineering applications. In particular, we investigate the use of discrete event dynamic systems (DEDS) to guide and control the active exploration and sensing of mechanical parts for industrial inspection and reverse engineering. We introduce dy... | Intelligent exploration; Discrete event dynamic systems; DEDS; Dynamic recursive finite state machines; DRFSM | 1992 |
| 280 |
 |
Whitaker, Ross T. | A fast iterative method for a class of Hamilton-Jacobi equations on parallel systems | In this paper we propose a novel computational technique, which we call the Fast Iterative Method (FIM), to solve a class of Hamilton- Jacobi (H-J) equations on massively parallel systems. The proposed method manages the list of active nodes and iteratively updates the solutions on those nodes u... | Fast Iterative Method; FIM; Parallel systems | 2007 |
| 281 |
 |
Shirley, Peter S.; Gooch, Bruce | Artistic vision: painterly rendering using computer vision techniques | We present a method that takes a raster image as input and produces a painting-like image composed of strokes rather than pixels. Unlike previous automatic painting methods, we attempt to keep the number of brush-stroke small. This is accomplished by first segmenting the image into features, finding... | Painting-like image; Raster image; Painterly rendering | 2000 |
| 282 |
 |
Davis, Alan L. | Data driven nets: a maximally concurrent, procedural, parallel process representation for distributed control systems | A procedural parallel process representation, known as data-driven nets is described. The sequencing mechanism of the data-driven representation is based on the principle of data dependency. Operations are driven into action by the arrival of the required working set of input operands. Execution of ... | Data driven nets | 1978 |
| 283 |
 |
Jacobson, Hans | Design and validation of a simultaneous multi-threaded DLX processor | Modern day computer systems rely on two forms of parallelism to achieve high performance, parallelism between individual instructions of a program (ILP) and parallelism between individual threads (TLP). Superscalar processors exploit ILP by issuing several instructions per clock, and multiprocessors... | DLX processor; Validation | 1999 |
| 284 |
 |
Bruderlin, Beat | Detecting ambiguities: an optimistic approach to robustness problems in computational geometry | Computational geometry algorithms deal with geometric objects, usually represented by coordinates in an n-dimensional Euclidean space. Most efficient algorithms implement geometric operations as floating point arithmetic operations on the coordinates. Since floating point numbers can only approxima... | Ambiguities; Computational geometry; Robustness problems | 1990 |
| 285 |
 |
Thompson, William B. | Geometric reasoning for map-based localization | An essential aspect of map-based navigation is the determination of an agent's current location based on sensed data from the environment. Formally, this amounts to specifying the current viewpoint in some world model coordinate system. This localization process has two distinct components: one invo... | Map-based localization; Map-based navigation; Geometric reasoning | 1996 |
| 286 |
 |
Cohen, Elaine | Hidden curve removal for free form surfaces | This paper describes a hidden curve algorithm specifically designed for sculptured surfaces. A technique is described to extract the visible curves for a given scene without the need to approximate the surface by polygons. This algorithm produces higher quality results than polygon based algorithms,... | Hidden curves; Free form surfaces; Sculptured surfaces | 1989 |
| 287 |
 |
Gopalakrishnan, Ganesh | Implementing functional programs using mutable abstract data types | We study the following problem in this paper. Suppose we have a purely functional program that uses a set of abstract data types by invoking their operations. Is there an order of evaluation of the operations in the program that preserves the applicative order of evaluation semantics of the program... | Functional programs; Mutable abstract data; Abstract data types | 1987 |
| 288 |
 |
Carter, John; Susarla, Sai R. | Khazana An infrastructure for building distributed services | Essentially all distributed systems?? applications?? and services at some level boil down to the problem of man aging distributed shared state Unfortunately?? while the problem of managing distributed shared state is shared by many applications?? there is no common means of managing the data ... | Khazana; Distributed shared state | 1998 |
| 289 |
 |
Carter, John B. | Khazana an infrastructure for building distributed services | Essentially all distributed systems, applications and service at some level boil down to the problem of managing distributed shared state. Unfortunately, while the problem of managing distributed shared state is shared by man applications, there is no common means of managing the data - every applic... | Khazana; Distributed shared state | 1998 |
| 290 |
 |
Orr, Douglas B. | OMOS - An object server for program execution | The benefits of object-oriented programming are well known, but popular operating systems provide very few object-oriented features to users, and few are implemented using object-oriented techniques themselves. In this paper we discuss a mechanism for applying object-oriented programming concepts to... | OMOS; Object server | 1992 |
| 291 |
 |
Boulos, Solomon; Shirley, Peter S. | Packet-based whitted and distribution ray tracing | Much progress has been made toward interactive ray tracing, but most research has focused specifically on ray casting. A common approach is to use ?packets? of rays to amortize cost across sets of rays. Little is known about how well packet-based techniques will work for reflection and refractio... | Packet-based whitted ray tracing; Distribution ray tracing; Interactive ray tracing | 2006-11-10 |
| 292 |
 |
Gopalakrishnan, Ganesh | Performance analysis and optimization of asynchronous circuits | Asynchronous/Self-timed circuits are beginning to attract renewed attention as promising means of dealing with the complexity of modern VLSI designs. However, there are very few analysis techniques or tools available for estimating the performance of asynchronous circuits. In this paper we adapt th... | Asynchronous circuits; Performance analysis; Optimization; VLSI circuits | 1994 |
| 293 |
 |
Sivaraj, Hemanthkumar; Gopalakrishnan, Ganesh | Random walk based heuristic algorithms for distributed memory model checking | Model checking techniques suffer from the state space explosion problem: as the size of the system being verified increases, the total state space of the system increases exponentially. Some of the methods that have been devised to tackle this problem are partial order reduction, symmetry reducti... | Model checking; Distributed memory | 2003-01-29 |
| 294 |
 |
Mecklenburg, Robert | STORY: A hierarchical animation and storyboarding system for alpha-1 | We introduce an integrated animation and storyboarding system that simplifies the creation and refinement of computer generated animations. The framework models both the process and product of an animated sequence, making animation more accessible for communication and as an art form. The system a... | STORY; storyboarding system; animation system; computer generated animations | 1993 |
| 295 |
 |
Gopalakrishnan, Ganesh | The 'test model-checking' approach to the verification of formal memory models of multiprocessors | We 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; Checking | 1998 |
| 296 |
 |
Gopalakrishnan, Ganesh | The 'Test model-checking' approach to the verification of formal memory models of multiprocessors | We 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; Verification | 1998 |
| 297 |
 |
Brunvand, Erik L. | A cell set for self-timed design using actel FPGAs | Asynchronous 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; FPGA | 1991 |
| 298 |
 |
Carter, John | A collective approach to harness idle resources | We 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 nodes | 2008 |
| 299 |
 |
Evans, John; Kessler, Robert R. | A communication-ordered task graph allocation algorithm | The 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 model | 1992 |
| 300 |
 |
Zhang, Lixin | A comparison of online superpage promotion mechanisms | The 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; TLB | 1999 |