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.
Finding meaningful patterns is one of the most investigated fields of computational biology. Generalized Center String (GCS) problem is one of the problems that were established and Bpriori Algorithms have been proposed to solve GCS. In this paper we present parallel Bpriori Algorithms based on existing approaches. These algorithms are SIMD on Cube-Connected network, where the size of alphabet set...
Biswapped network (BSN) is a recently proposed network model of parallel computing, which is built of 2n copies of an n-node basic network, and its basic network may be hypercube, mesh and other networks, hence we can construct BSN-Hypercube and BSN-Mesh by using hypercube and mesh as basic network. BSN uses a simple rule for connectivity to ensure its regularity and some topological properties of...
Given N matrices A1, A2,...,AN of size NtimesN, the matrix chain product problem is to compute A1timesA2times...timesAN. Given an NtimesN matrix A, the matrix powers problem is to calculate the first N powers of A, that is, A, A2, A3,..., AN. We solve the two problems on distributed memory systems (DMSs) with p processors that can support one-to-one communications in T(p) time. Assume that the fastest...
The three dimensional discrete cosine transform (3D DCT) has been widely used in many applications such as video compression. On the other hand, the k-ary n-cube is one of the most popular interconnection networks used in many recent multicomputers. As direct calculation of 3D DCT is very time consuming, many researchers have been working on developing algorithms and special-purpose architectures...
An optimal tree contraction algorithm for the Boolean hypercube and constant degree hypercubic networks, such as the shuffle exchange or the butterfly network, is presented. The algorithm is based on a recursive approach, uses novel routing techniques, and, for certain small subtrees, simulates optimal PRAM algorithms. For trees of size n, stored in-order on a p processor hypercube, the running time...
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.