A distributed graphics programming language called DGLa is presented, which facilitates the development of distributed graphics application. Facilities for distributed programming and graphics support are included in it. It not only supports synchronous and asynchronous communication but also provides programmer with multiple control mechanism for process communication. The graphics support of DGLa is powerful, for both sequential graphics library and parallel graphics library are provided. The design consi…

In this papaert an INTEGRAL CURVE ALGORITHM is preselited, which turns the intersection curve of surfaces into the form of integral one and then uses "PREDICTORCORRECTOR" technique to evaluate the intersection of surfaces.No matter how the surfaces are defined, the method always deaIs with the intersection curves in the same wny. To find a point on the curve one need only to calculate the JACOBI determinants of "PREDICTOR point" and "CORRECToR point" while the second order precision is guatanteed. Thus, not…

Creating and rendering intermediate geometric primitives is one of the approaches to visualize data sets in 3D space. Some algorithms have been developed to construct isosurface from uniformly distributed 3D data sets. These algorithms assume that the function value varies linearly along edges of each cell. But to irregular 3D data sets, this assumption is inapplicable. Moreover, the depth sorting of cells is more complicated for irregular data sets, which is indispensable for generating isosurface images o…

This paper uses timed Petri net to model and analyze the problem of instructionlevel loop scheduling with resource constraints, which has been proven to be an NP complete problem. First, we present a new timed Petri net model to integrate functional unit allocation, register allocation and spilling ilno a unified theoretical framework.Then we develop a state subgraph, called Register Allocation Solution Graph, which can effectively describe the major behavior of our new model. The maill property of this sta…

Declarative Programming Languages (DPLs) apply a process model of Horn claun es such as PARLOG[8] or a reduction model of A-calculus such as SML[7] and are) in principle, well suited to multiprocessor implemelltation. However, the performance of a parallel declarative program can be impaired by a mismatch between the parallelism available in an application and the parallelism available in the architecture. A particularly attractive solution is to automatically match the parallelism of the program to the par…

This paper presents a parameterized instruction scheduling algorithm based on machine description table for TH-RISC system, having a (3-5) stages pipeline structure.It would provide considerable fiexibility for instruction scheduling, improving execution efficiency for rapidly upgrading RISC machines. Alld, using this instruction scheduler as a tool, the effect of several methods for solving instruction interlock problem has been analyzed. Finally, a high performance approach combining the hardware feasibil…

The relation between generalized resolution and NC-resolution is discussed. The proof of the completeness of NC linear resolution is then given. The incompleteness of NC lock resolution is also presented, thus the conclusion in [3] of" a simple completeness- preserving restriction" is shown to be wrong.

WITS-Math is a mathematical equation formatting tool in WITS, a multilingual document preparation environment. WITS-Math includes a library manager and an equation formatter. The main task of WITS-Math is to format diversities of mathematical equations and organize them into an equation library used by other tools in the WITS environment.WITS-Math is a direct manipulation mathematics editor. It uses syntax directed markup language as the internal representation, alld provides an interactive WYSIWYG interfac…

This paper introduces a new way of prefix code translation. It helps to finish the whole translation by mapping once (only one comparison instruction is needed for getting the length of prefix code), and returns the original data and the length of prefix code element. The decoding time is only about four times as many as the time accessing original data directly.

A global design for testability algorithm is offered in this paper. First, a test point candidate set is obtained to simplify the test point placemellt problem; the principle of selective tracing is offered to get a sequential test point placement solution, which is used as the initial solution of the global algorithm. Using this initial value, a branch & bound algorithm is then offered to obtain a global design for testability solution. Finally,a new test length analyser is offered to evaluate the global d…