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.
This paper proposes three efficient parallel algorithms for computing the range-join of two relations on two-dimensional n x m mesh-connected computers, where n and m are the numbers of the rows and columns respectively. After sorting all subsets of both relations, all proposed algorithms permute all sorted subsets of one relation to each processor in the computers, where they are joined with the...
Double loop computer networks are widely used in the design and implementation of local area networks and parallel processing architectures. However, the embedding problems on double-loop networks have not been well studied due to the complexity of double-loop networks. Since the traditional L-shape, designed to compute the diameter of double-loop networks, is not efficient to solve embedding problems,...
Wireless Sensor Networks (WSN for short) have been widely used for data collecting and processing in various applications. This paper studies the problem of how to efficiently realize matrix multiplication on a WSN. Based on a widely accepted model of WSNs, we show the lower bound on the number of parallel steps needed by any algorithm for ntimesn matrix multiplication on a WSN of n2 sensors with...
The range-join of sets R and S is defined to be the set containing all tuples (r, s) that satisfy e 1 ≤ r - s ≤ e 2 where r R,s S, e 1 and e 2 are fixed constants. This paper proposes an efficient parallel range-join algorithm in hypercubes. To compute the range-join of two sets R and S on a hypercube of p processors (p ≤ R = m ≤ S = n), the proposed...
The range-join of sets R and S is defined to be the set containing all tuples (r, s) that satisfy e 1 ≤ r-s ≤e 2 where r R, s S, e 1 and e 2 are fixed constants. This paper proposes an efficient parallel range-join algorithm in hypercubes. To compute the range-join of two sets R and S on a hypercube of p processors (p≤ R =m≤ S =n), the proposed...
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.