Narrow Results

Much work has been done on the problem of synthesizing a processor array from a system of recurrence equations. Some researchers limit communication to nearest neighbors in the array; others use broadcast. In many cases, neither of the above approaches result in an optimal execution time.

In this paper a technique called bounded broadcast is explored whereby an element of a processor array can broadcast to a bounded number of other processors. This technique is applied to the problems of transitive closure and all-pairs shortest distance, resulting in time complexities that are smaller than those reported previously. In general, the technique can be used to design bounded broadcast systolic arrays for algorithms whose implementation can benefit from broadcasting.

In this paper, we present the design and implementation of a source-to-source High Performance Fortran assistant Tool (HPFT) in DEC 3000 workstations. For a given sequential program written in Fortran 77, the HPFT generates a vectorized, reuse-exploited and/or parallelized version for vector computers. Several new compilation schemes in vectorization, reuse exploitation and multithreading are designed in the HPFT. A performance evaluator is developed for measuring the system performance. The user interface is also designed for the programmer to capture the information related to the compilation and execution of the program. Experimental results based on the Convex C3840 vector computer show that the developed HPFT enhances the system performance and usually reduces the program execution time.

In this paper, a parallel Eulerian hydrocode for the simulation of large scale complicated explosion and impact problem is developed. The data dependency in the parallel algorithm is studied in particular. As a test, the three dimensional numerical simulation of the explosion field in an unlimited atmosphere is performed. The numerical results are in good agreement with the empirical results, indicating that the proposed parallel algorithm in this paper is valid. Finally, the parallel speedup and parallel efficiency under different dividing domain areas are analyzed.

Among the fault localization methods of the coverage-based regression test cases, the ranking of suspiciousness degree is seriously impacted due to the existence of similar test cases, the existence of isolated treatment of each program entity and the coincidental correctness test cases as well as the poor quality of regression test cases, which reduces the efficiency of fault localization. This paper proposes a method that combines the control dependence and data dependence, test cases covering table and test result with vector angular cosine weight to solve the aforesaid problems. Experimental results show that the efficiency of the proposed fault localization of regression test cases is better than that of Tarantula, Jaccard, Ochiai, PPDG and CP methods.

In this paper, a system of nonlinear delay integral equations related to the spread of certain infectious diseases is investigated. Namely, using Perov’s fixed-point theorem, we obtain sufficient conditions for which the system admits a unique positive solution, and provide a numerical algorithm that converges to this solution. Moreover, we establish some comparison theorems, and study the data dependence of solutions.

In this paper, we utilize an inequality involving a coupled multivalued mapping and a singlevalued mapping to obtain a coupled coincidence point theorem. We discuss special conditions under which coupled common fixed point theorems are obtained. The result combines together several ideas prevailing in fixed point theory related studies. There are several corollaries and an illustrative example. In the second part of the paper, we establish a multivalued coupled coincidence point result by putting together several ideas. A contraction through an implicit relation for the coupled mapping is assumed in the main theorem for quadruples of points determined by certain functions. The coupled mapping is also required to satisfy certain dominated conditions which are defined in this paper. In Secs. 3 and 4, we study the data dependence and stability of coupled coincidence point sets, respectively. For describing set distance we use the Hausdorff metric. The work is in the domain of setvalued analysis.

First of all, the typically dynamic workflow systems are introduced, and their main defects that are not able to decide automatically the dependences among data in workflows are analyzed. The reasons resulting in the problem are lack of effective modeling approach and constructing algorithm of dynamic workflow, which are our main research work in this paper. Here, the Petri-Net is adopted to model the dynamic workflows. Based on the model a constructing algorithm of workflow is proposed, and the complexity of the algorithm is analyzed. Lastly, by a computing example the modeling approach and constructing algorithm of dynamic workflow based on Petri-Net are proved to be practical, effective and feasible.