UScholar Works
 
Filters: Department: "School of Computing" Collection: "ir_uspace" Type: "Text" Date: "1992"
1 - 25 of 7
Number of results to display per page
CreatorTitleDescriptionSubjectDate
1 A distributed garbage collection algorithmConcurrent Scheme extends the Scheme programming language, providing parallel program execution on a distributed network. The Concurrent Scheme environment requires a garbage collector to reclaim global objects; objects that exist in a portion of the global heap located on the node that created them...Concurrent Scheme; Garbage collection algorithm1992
2 Sobh, Tarek M.A dynamic framework for intelligent inspectionCAD (Computer Aided Design) typically involves the design, manufacture and inspection of a mechanical part. The problem of reverse engineering is to take an existing mechanical part as the point of departure and to inspect or produce a design, and perhaps a manufacturing process, for the part. We pr...CAD; Discrete event dynamic systems; DEDS1992
3 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
4 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
5 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
6 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
7 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
1 - 25 of 7