the proceedings contain 44 papers. the special focus in this conference is on Data Structure, parallel and Distributed Computing. the topics include: the engineering of some bipartite matching programs;a basic theory ...
ISBN:
(纸本)3540669167
the proceedings contain 44 papers. the special focus in this conference is on Data Structure, parallel and Distributed Computing. the topics include: the engineering of some bipartite matching programs;a basic theory and calculus;static dictionaries supporting rank;multiple spin-block decisions;asynchronous random polling dynamic load balancing;hardness of approximating independent domination in circle graphs;constant-factor approximation algorithms for domination problems on circle graphs;ordered binary decision diagrams as knowledge-bases;the role of common knowledge in pattern formation by autonomous mobile robots;on-line load balancing of temporary tasks revisited;online routing in triangulations;the query complexity of program checking by constant-depth circuits;tree-like resolution is superpolynomially slower than dag-like resolution for the pigeonhole principle;efficient approximation algorithms for multi-label map labeling;approximation algorithms in batch processing;parallelalgorithms for shortest paths and related problems on trapezoid graphs;approximation algorithms for some clustering and classification problems;how many people can hide in a terrain?;an online relocation problem on graphs;survivable networks with bounded delay;energy-efficient initialization protocols for ad-hoc radio networks;constructing the suffix tree of a tree with a large alphabet;further improved;a linear time algorithm for recognizing regular boolean functions;station layouts in the presence of location constraints;reverse center location problem;performance comparison of linear sieve and cubic sieve algorithms for discrete logarithms over prime fields and a new approximation algorithm for the capacitated vehicle routing problem on a tree.
In this paper, we have designed an efficient parallel algorithm for performing 3 D image reconstruction. In our framework, we have considered 3 D image to be reconstructed from a series of 2 D images, produced using U...
详细信息
In this paper, we have designed an efficient parallel algorithm for performing 3 D image reconstruction. In our framework, we have considered 3 D image to be reconstructed from a series of 2 D images, produced using Ultrasonography, Computer Tomography, etc. the paper discusses a general parallel algorithm for 3 D image reconstruction over CRCW, CREW and EREW PRAM models. We have developed efficient implementations of this algorithm over a vector machines, a distributed system comprising of a cluster of Work Stations and various interconnection network like mesh network and reconfigurable bus network. the performance of the above algorithms are tested using simulation experiments performed for 3 D image reconstruction of the vitreous region of the eye using ophthalmic ultrasonograms. A novel approximation scheme has also been proposed for a drastic improvement in performance for specific kinds of image. Results indicate the time complexities of the algorithms are in resonance with expected theoretical values and image obtained has a uncompromising level of accuracy.
the main contribution of this work is to propose a number of broadcast efficient VLSI architectures for computing the sum and the prefix sums of a wk-bit, k ≥ 2, binary sequence using, as basic building blocks, linea...
详细信息
In this work we present a procedure for automatic parallel code generation in the case of algorithms described through Set of Affine Recurrence Equations (SARE); starting from the original SARE description in an N-dim...
详细信息
In this work we present a procedure for automatic parallel code generation in the case of algorithms described through Set of Affine Recurrence Equations (SARE); starting from the original SARE description in an N-dimensional iteration space, the algorithm is converted into a parallel code for an m-dimensional distributed memory parallel machine (m
A fully parallel iterative thinning algorithm called MB2 is presented. It favourably competes withthe best known algorithms regarding homotopy, mediality, thickness, rotation invariance and noise immunity, while feat...
详细信息
A fully parallel iterative thinning algorithm called MB2 is presented. It favourably competes withthe best known algorithms regarding homotopy, mediality, thickness, rotation invariance and noise immunity, while featuring a speed improvement by a factor of two or more owing to a smaller number of operations to perform. MB2 is grounded on a simple physics-based thinning principle that conveys both quality, efficiency and conceptual clarity. It is particularly suited to data parallel execution.
In this paper we present a load adaptive parallel algorithm and implementation to compute 2D Discrete Wavelet Transform (DWT) on multithreading machines. In a 2D DWT computation, the problem sizes reduces at every dec...
详细信息
In this paper we present a load adaptive parallel algorithm and implementation to compute 2D Discrete Wavelet Transform (DWT) on multithreading machines. In a 2D DWT computation, the problem sizes reduces at every decomposition level and the lengths of the emerging computation paths also vary. the parallel algorithm proposed in this paper dynamically scales itself to the varying problem size. Experimental results are reported based on the implementations of the proposed algorithm on a 2D node multithreading emulation platform, EARth-MANNA. We show that multithreading implementations of the proposed algorithm are at least 2 times faster than the MPI based message passing implementations reported in the literature. We further show that the proposed algorithm and implementations scale linearly with respect to problem and machine sizes.
Discretization of image restoration problems often leads to a discrete inverse ill-posed problem: the discretized operator is so badly conditioned that it can be actually considered as undetermined. In this case one s...
详细信息
the crossbreeding between advanced microprocessor design and Field Programmable Gate AI-rays (FPGAs) has produced the Field Programmable Processor Array: code named FPPA. the first integrated version has been targeted...
详细信息
ISBN:
(纸本)0769500439
the crossbreeding between advanced microprocessor design and Field Programmable Gate AI-rays (FPGAs) has produced the Field Programmable Processor Array: code named FPPA. the first integrated version has been targeted for low power consumption parallelprocessing. the FPPA is composed of a 10x10 array of RISC microcontrollers offering up to 500 MIPS at 5 MHz for processors (20 MHz for communications). the very low power feature of the core processor results in a I Watt power consumption for the whole array at 5 MHz and makes it particularly interesting for portable devices that require quite complex algorithms. In addition, FPPA principle, i.e., fault-tolerant large array of cells interconnected with an asynchronous communication scheme, is applicable on alternative structures for the cell architecture.
In this paper we present a load adaptive parallel algorithm and implementation to compute 2D Discrete Wavelet Transform (DWT) on multithreading machines. In a 2D DWT computation, the problem sizes reduces at every dec...
详细信息
In this paper we present a load adaptive parallel algorithm and implementation to compute 2D Discrete Wavelet Transform (DWT) on multithreading machines. In a 2D DWT computation, the problem sizes reduces at every decomposition level and the lengths of the emerging computation paths also vary. the parallel algorithm proposed in this paper, dynamically scales itself to the varying problem size. Experimental results are reported based on the implementations of the proposed algorithm on a 20 node multithreading emulation platform, EARth-MANNA. We show that multithreading implementations of the proposed algorithm are at least 2 times faster than the MPI based message passing implementations reported in the literature. We further show that the proposed algorithm and implementations scale linearly with respect to problem and machine sizes.
this paper contains the description of the implementation of the weighted distance transform for digital image analysis on a two-processor shared memory computer. the computer is a SMP (symmetric multiprocessing) comp...
详细信息
this paper contains the description of the implementation of the weighted distance transform for digital image analysis on a two-processor shared memory computer. the computer is a SMP (symmetric multiprocessing) computer and the algorithm is implemented using POSIX threads.
暂无评论