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.
Almost Regular Permutation (ARP) and Quadratic Permutation Polynomials (QPP) are two common types of inter-leavers for parallel turbo decoding. However, for a turbo decoder using such an interleaver, previous memory-mapping schemes are applicable only if, P, the number of processors used, divides L, the interleaver length, and P satisfies various other constraints. In this paper, we introduce a novel...
A new parallel algorithm for the maximal independent set problem (MIS) is constructed. It runs in O(log4 n) time when implemented on a linear number of EREW-processors. This is the first deterministic algorithm for MIS whose running time is polylogarithmic and whose processor-time product is optimal up to a polylogarithmic factor.
We consider the relative power of concurrentwrite PRAMs when the number of processors (and input variables) is fixed at n, and infinite shared memory is allowed. Several different models (COMMON, ARBITRARY, PRIORITY) have been used for algorithm design in the literature; these models differ in their method of write-conflict resolution. Recent work in separating these models ([FRW1,2,3], [LY]) has...
We consider PRAM's with arbitrary computational power for individual processors, infinitely large shared memory and "priority" writeconflict resolution. The main result is that sorting n integers with n processors requires Ω(√log n) steps in this strong model. We also show that computing any symmetric polynomial (e.g. the sum or product) of n integers requires exactly log2n steps, for any...
An ear-decomposition of a digraph is a representation of it as the union of (open or closed) directed paths, each having its endpoints in common with the union of the previous paths but nothing else. We prove that finding an ear-decomposition of a strongly directed graph is in NC, i.e. an eardecomposition can be constructed in parallel in polylog time, using a polynomial number of processors. Using...
We present here a class of probabilistic algorithms with which one can estimate the number of distinct elements in a collection of data (typically a large file stored on disk) in a single pass, using only 0(1) auxiliary storage and 0(1) operations per element. We precisely quantify the accuracy-storage trade-offs: for instance a typical accuracy of about 5% can be achieved using only 256 binary words,...
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.