The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Equivalent rotation of tree can change the cost-effective of tree operation, which can reduce operating complexity of tree elements by consuming a little space. Through analyzing rotation transformation between any two binary trees deeply and introducing PRAM model, a kind of rotation transformation parallel algorithm about binary tree based on PRAM model is put forward in the paper. The algorithm...
In this paper, the problem of A-order of binary tree is studied with the PRAM(Parallel Random Access Machine) model of parallel computation and a parallel algorithm for A-order of binary tree is proposed. The process of the parallel algorithm is proceed with detailed description and verified analysis with an application instance. The parallel algorithm of A-order of binary tree provides using and...
The pyramid network is one of the most important interconnection topologies used as hardware architecture or software data structure. It has a combined tree-mesh structure making it suitable for solving many parallel problems and applications. This paper proposes a parallel algorithm for Hermite Interpolation on the Pyramid network which has at least N nodes. The proposed algorithm has 3 phases: initialization,...
Data cube construction is a commonly used operation in data warehouses. Because of the volume of data that is stored and analyzed in a data warehouse and the amount of computation involved in data cube construction, it is natural to consider parallel machines for this operation. We address a number of algorithmic issues in parallel data cube construction. First, we present an aggregation tree for...
In this paper, a new data structure called string-queue is proposed in order to implement more efficiently the selection rule and the elimination rule of the general branch-and-bound algorithm. A new general parallel branch-and-bound algorithm on a distributed memory multiprocessor system is also presented. Its communication complexity in single iteration is down to its lower bound O(p) on a 2D mesh...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.