A CONSTANT TIME ALGORITHM FOR REDUNDANCY ELIMINATION IN TASK GRAPHS ON PROCESSOR ARRAYS WITH RECONFIGURABLE BUS SYSTEMS
The task or precedence graph formalism is a practical tool to study algorithm parallelization. Redundancy in such task graphs gives rise to numerous avoidable inter-task dependencies which invariably complicates the process of parallelization. In this paper we present an O(1) time algorithm for the elimination of redundancy in such graphs on Processor Arrays with Reconfigurable Bus Systemusing O(n4) processors, The previous parallel algorithm available in the literature for redundancy elimination in task graphs takes O(n2) time using O(n) processors.
Abstract To combat against persistent sex offenders, recent laws call for the use of the GPS technology to monitor their movements. In [1] , it has been proposed the adoption of a Spatio-Temporal DataBase (S-T DB) for archiving this type of complex data, besides traditional ones (i.e., data about their home, (pending) crimes, and sensible areas). In the present paper we discuss investigative strategies that can be easily implemented on top of such a kind of database by taking advantage of the history of the movements of sex offenders. As implementation platform, the SECONDO DB Management System (DBMS) is adopted since it supports a data type about moving objects as well as a reach set of spatio-temporal operators to query such complex data [2] .