We propose a parallel architecture for the implementation of the embedded zerotree wavelet (EZW) algorithm, based on the depth-first search (DFS) bit stream (BS) architecture. Using the depth-first search of the wavel...
详细信息
We propose a parallel architecture for the implementation of the embedded zerotree wavelet (EZW) algorithm, based on the depth-first search (DFS) bit stream (BS) architecture. Using the depth-first search of the wavelet coefficient tree, the wavelet coefficients in the coefficient tree are first partitioned into independent sub-trees. In the case of full parallelism, each of the sub-trees is processed by an independent processor. the output from each processor is then multiplexed back into a single output bit stream. While the output bit stream from each sub-tree processor is in the depth-first search format, the overall multiplexed output bit stream represents the search of the sub-trees in parallel. the implementation of each of the sub-tree EZW processor is based on the DFS BS architecture, which accepts the bits of the coefficients in decreasing order of significance from a sub-tree. All the bits in a significant bit plane are processed to produce the output bit stream from the architecture in one scan of the sub-trees. the rise of the DFS BS structure also makes it possible for partial parallelism where a sub-tree processor can process two or more sub-trees in sequence. this provides flexibility for the design of the overall processor optimally to match the speed of the overall input bit stream. the emphasis in this paper is on the parallelprocessing aspect of the DFS BS architecture. A sub-tree processor can be easily modified to perform any improved EZW algorithm, and the multiplexer for the output bit streams from the processors can be modified to produce the format of the EZW algorithm based on other tree searching schemes similar to the SPIHT algorithm.
One of the problems with using parallel Paradigms to program parallelarchitectures is the choice of the paradigm which is best suited to the characteristics of the program to be developed/parallelized, and of the tar...
详细信息
ISBN:
(纸本)3540663630
One of the problems with using parallel Paradigms to program parallelarchitectures is the choice of the paradigm which is best suited to the characteristics of the program to be developed/parallelized, and of the target architecture, in terms of performance of the parallel implementation. Another problem arising withparallelization of legacy codes is the attempt to minimize the effort needed for program comprehension, and thus to achieve the minimum restructuring of the sequential code when producing the parallel version. In this paper we address these issues for the Divide and Conquer class of algorithms/programs.
this paper describes a parallel architecture for a variety of algorithms for video compression. It has been designed to meet the requirements of encoding and decoding according to the ITU-T standard H.263. the archite...
详细信息
ISBN:
(纸本)3540664432
this paper describes a parallel architecture for a variety of algorithms for video compression. It has been designed to meet the requirements of encoding and decoding according to the ITU-T standard H.263. the architecture is an implementation of the instruction systolic array (ISA) model which combines the simplicity of systolic arrays withthe flexibility of a programmable parallel computer. Although the parallel accelerator unit is implemented on no more than 9 mm(2) of silicon it suffices to meet the compression rate necessary to send a compressed video stream through a standard ISDN terminal interface.
the proceedings contain 59 papers. the special focus in this conference is on parallel Computing in Regular Structures. the topics include: Analytical modeling of parallel application in heterogeneous computing enviro...
ISBN:
(纸本)3540663630
the proceedings contain 59 papers. the special focus in this conference is on parallel Computing in Regular Structures. the topics include: Analytical modeling of parallel application in heterogeneous computing environments;skeletons and transformations in an integrated parallel programming environment;sequential unification and aggressive lookahead mechanisms for data memory accesses;a coordination model and facilities for efficient parallel computation;parallelizing of sequential programs on the basis of pipeline and speculative features of the operators;kinetic model of parallel data processing;PSA approach to population models for parallel genetic algorithms;highly accurate numerical methods for incompressible 3D fluid flows on parallelarchitectures;dynamic task scheduling with precedence constraints and communication delays;two-dimensional scheduling of algorithms with uniform dependencies;consistent lamport clocks for asynchronous groups with process crashes;comparative analysis of learning methods of cellular-neural associative memory;emergence and propagation of round autowave in cellular neural network;routing and embeddings in super cayley graphs;implementing cellular automata based models on parallelarchitectures;overview, design innovations, and preliminary results;implementing model checking and equivalence checking for time petri nets by the RT-MEC tool;learning concurrent programming;the speedup performance of an associative memory based logic simulator;a high-level programming environment for distributed memory architectures;virtual shared files;an object oriented environment to manage the parallelism of the FIIT applications;performance studies of shared-nothing parallel transaction processing systems;synergetic tool environments and logically instantaneous communication on top of distributed memory parallel machines.
Newer and newer parallelarchitectures being developed raise a strong demand for high-level and programmer-friendly parallel tools. We show some results regarding mining of association rules, a well-known Data Mining ...
详细信息
ISBN:
(纸本)3540664432
Newer and newer parallelarchitectures being developed raise a strong demand for high-level and programmer-friendly parallel tools. We show some results regarding mining of association rules, a well-known Data Mining algorithm, which we ported from sequential to parallel within the PQE2000/SkIE environment. the main goals achieved are the low effort spent in parallelizing the code, the machine independence of the application produced, source code portability and performance portability. Here we report test results for the same parallel program on three different architectures.
We have developed research and production architectures for the automatic processing of checks. the research architecture is flexible and allows rapid prototyping of image preprocessing, document analysis, recognition...
详细信息
One of the most important problems in data mining is discovery of association rules in large database. We had proposed parallelalgorithms for mining generalized association rules with classification hierarchy. In thi...
详细信息
ISBN:
(纸本)3540664432
One of the most important problems in data mining is discovery of association rules in large database. We had proposed parallelalgorithms for mining generalized association rules with classification hierarchy. In this paper, we implemented the proposed algorithms on a large scale PC cluster which consists of one hundred PCs interconnected by an ATM switch, and analyzed the performance of our algorithms using a large amount of transaction dataset. Performance evaluations show our parallelalgorithms are effective for handling skew for such large scale parallel systems.
PAMIHR: a parallel adaptive routine for the approximate computation of a multidimensional integral over a hyperrectangular region is described. the software is designed to efficiently run on a MIMD distributed memory ...
详细信息
ISBN:
(纸本)3540664432
PAMIHR: a parallel adaptive routine for the approximate computation of a multidimensional integral over a hyperrectangular region is described. the software is designed to efficiently run on a MIMD distributed memory environment, and it's based on the widely diffused communication system BLACS. PAMIHR, further, gives special attention to the problems of scalability and of load balancing among the processes.
the development of skeleton tools constitutes an alternative to cover the gap between current parallelarchitectures and sequential programmers. Its contruction involves formal models, paradigms and methologies. Based...
详细信息
ISBN:
(纸本)3540664432
the development of skeleton tools constitutes an alternative to cover the gap between current parallelarchitectures and sequential programmers. Its contruction involves formal models, paradigms and methologies. Based in the automata theory we have developed a formal model for parallel Dynamic Programming over pipeline networks. this model makes up a paradigm which is the core of skeleton tools oriented to the Dynamic Programming Technique. Following the methodology coerced by the model, we present a tool that provides the user withthe ability to obtain parallel programs adapted to the parallel architecture. the efficiency is contrasted on three current parallel platforms: Gray T3E, IBM SP2 and SG Origin 2000.
暂无评论