We compare the accuracy of several single and combination part-of-speech tagging methods applied to Polish and evaluated on the modified corpus of Frequency Dictionary of Contemporary Polish (m-FDCP). three well known...
详细信息
ISBN:
(纸本)9783642143892
We compare the accuracy of several single and combination part-of-speech tagging methods applied to Polish and evaluated on the modified corpus of Frequency Dictionary of Contemporary Polish (m-FDCP). three well known combination methods (weighted voting, distributed voting, and stacked) are analyzed, as well as two new weighted voting methods: MorphCatPrecision and AmbClassPrecision methods are proposed. the MorphCatPrecision method achieves the highest accuracy among all considered weighted voting methods. the best combination method achieves 11.9% error reduction with respect to the best baseline tagger. We report also the statistical significance of the difference in accuracy between various methods measured by means of the McNemar test. Selection of the best algorithms was conducted on a multiprocessor supercomuter due to the high time and memory requirements of most of these algorithms.
parallel database technology has already shown its efficiency in supporting high-performance Online Analytical processing (OLAP) applications. this scenario implies achieving query optimization over relational Data Wa...
详细信息
ISBN:
(纸本)9783642131189
parallel database technology has already shown its efficiency in supporting high-performance Online Analytical processing (OLAP) applications. this scenario implies achieving query optimization over relational Data Warehouses (RDW) on top of which typical OLAP functionalities, such as roll-up, drill-down and aggregate query answering, can be implemented. As a result, it follows the emerging need for a comprehensive methodology able to support the design of RDW over parallel and distributed environments in all the phases, including data partitioning, fragment allocation, and data replication. Existing design approaches have an important limitation: fragmentation and allocation phases are performed in an isolated manner. In order to overcome this limitation, in this paper we propose a new methodology for designing parallel RDW over distributed environments, for query optimization purposes. the methodology is illustrated on database clusters, as a noticeable case of distributed environments. Contrary to state-of-the-art approaches where allocation is performed after fragmentation, in our approach we propose allocating fragments just during the partitioning phase. Also, a naive replication algorithm that takes into account the heterogeneous characteristics of our reference architecture is proposed.
SIMD architectures are ubiquitous in general purpose and embedded processors to achieve future multimedia performance goals. However, limited to on chip resources and off-chip memory bandwidth, current SIMD extension ...
详细信息
ISBN:
(纸本)9783642131189
SIMD architectures are ubiquitous in general purpose and embedded processors to achieve future multimedia performance goals. However, limited to on chip resources and off-chip memory bandwidth, current SIMD extension only works on short sets of SIMD elements. this leads to large parallelization overhead for small loops in multimedia applications such as loop handling and address generation. this paper presents SIMD-Vector (SV) architecture to enhance SIMD parallelism exploration. It attempts to gain the benefits of both SIMD instructions and more traditional vector instructions which work on numerous values. Several instructions are extended that allows the programmer to work on large vectors of data and those large vectors are executed on a smaller SIMD hardware by a loop controller. To preserve the register file size for holding much longer vectors, we introduce a technique that the long vector references are performed on only one SIMD register in many iterations. We provide a detailed description of the SV architecture and its comparison with traditional vector architecture. We also present a quantitative analysis of the dynamic instruction size decrease and performance improvement of SV architecture.
Available GPUs provide increasingly more processing power especially for multimedia and digital signal processing. Despite the tremendous progress in hardware and thus processing power, there are and always will be ap...
详细信息
ISBN:
(纸本)9783642143892
Available GPUs provide increasingly more processing power especially for multimedia and digital signal processing. Despite the tremendous progress in hardware and thus processing power, there are and always will be applications that require using multiple GPUs either running inside the same machine or distributed in the network due to computational intensive processingalgorithms. Existing solutions for developing applications for GPUs still require a lot of hand-optimization when using multiple GPUs inside the same machine and provide in general no support for using remote GPUs distributed in the network. In this paper we address tins problem and show that an open distributed multimedia middleware, like the Network-Integrated Multimedia Middleware (NMM), is able (1) to seamlessly integrate processing components using GPUs while completely hiding GPU specific issues from the application developer, (2) to transparently combine processing components using GPUs or CPUs, and (3) to transparently use local and remote GPUs for distributed processing.
the longest increasing subsequence (LIS) problem is a classical problem in theoretical computer science and mathematics. Most existing parallelalgorithms for this problem have very restrictive slackness conditions wh...
详细信息
ISBN:
(纸本)9783642143892
the longest increasing subsequence (LIS) problem is a classical problem in theoretical computer science and mathematics. Most existing parallelalgorithms for this problem have very restrictive slackness conditions which prevent scalability to large numbers of processors. Other algorithms are scalable, but not work-optimal w.r.t. the fastest sequential algorithm for the LIS problem, which runs in time O(n log n) for in numbers in the comparison-based model. In this paper, we propose a new parallel algorithm for the US problem. Our algorithm solves the more general problem of semi-local comparison of permutation strings of length it in time O(n(1.5)/p) on p processors, has scalable communication cost of O(n/ root p) and is synchronisation-efficient. Furthermore, we achieve scalable memory cost, requiring O(n/ root p) of storage on each processor. When applied to LIS computation, this algorithm is superior to previous approaches since computation, communication, and memory costs are all scalable.
Time-consuming cycle-accurate MPSoC simulation is often needed for debugging and verification. Its practicability is put at risk by the growing MPSoC complexity. this work presents a conservative synchronous parallel ...
详细信息
ISBN:
(纸本)9781605589053
Time-consuming cycle-accurate MPSoC simulation is often needed for debugging and verification. Its practicability is put at risk by the growing MPSoC complexity. this work presents a conservative synchronous parallel simulation approach along with a SystemC framework to accelerate tightly-coupled MPSoC simulations on multi-core hosts. Key contribution is the implementation strategy, which utilizes techniques from the high-performance computing domain. Results show speed-ups of up to 4.4 on four host cores.
A new parallel programming framework for DNA sequence alignment in homogeneous multi-core processor architectures is proposed. Contrasting with traditional coarse-grained parallel approaches, that divide the considere...
详细信息
ISBN:
(纸本)9780769539676
A new parallel programming framework for DNA sequence alignment in homogeneous multi-core processor architectures is proposed. Contrasting with traditional coarse-grained parallel approaches, that divide the considered database in several smaller subsets of complete sequences to be aligned withthe query sequence, the presented methodology is based on a slicing procedure of boththe query and the database sequence under consideration in several tiles/chunks that are concurrently processed by the several cores available in the multi-core processor. the obtained experimental results have proven that significant accelerations of traditional biological sequence alignment algorithms can be obtained, reaching a speedup that is linear withthe number of available processing cores and very close to the theoretical maximum.
In this paper, a general overview of Self-Organizing Networks (SON), and the rationale and state-of-the-art of wireless SON are first presented. the technical and business requirements are then briefly treated, and th...
详细信息
ISBN:
(纸本)9781424463633
In this paper, a general overview of Self-Organizing Networks (SON), and the rationale and state-of-the-art of wireless SON are first presented. the technical and business requirements are then briefly treated, and the research challenges within the field of SON are highlighted. thereafter, the relation between SON and Cognitive Networks (CN) is covered. At last, the application of Algorithmic Information theory (AIT) as a possible theoretical tool to support SON in addressing the growing complexity of networks is discussed.
the considerable computation time of a practical application of sequential algorithms for simulating thermal and flow distribution in pipe networks is the motivating factor to study their parallel implementation the m...
详细信息
ISBN:
(纸本)9783642144028
the considerable computation time of a practical application of sequential algorithms for simulating thermal and flow distribution in pipe networks is the motivating factor to study their parallel implementation the mathematical model formulated and studied in the paper requires the solution of a set of nonlinear equations, which are solved by the Newton-Raphson method An object-oriented solver automatically formulates the equations for networks of an arbitrary topology the hydraulic model that is chosen as a benchmark consists of nodal flows and loop equations A general decomposition algorithm for analysis of flow and temperature distribution in a pipe network is presented, and results of speedup of its parallel implementation are demonstrated
the proceedings contain 104 papers. the special focus in this conference is on parallelprocessing. the topics include: A parallel implementation of the Jacobi-Davidson eigensolver and its application in a plasma turb...
ISBN:
(纸本)9783642152764
the proceedings contain 104 papers. the special focus in this conference is on parallelprocessing. the topics include: A parallel implementation of the Jacobi-Davidson eigensolver and its application in a plasma turbulence code;scheduling parallel eigenvalue computations in a quantum chemistry code;Scalable parallelization strategies to accelerate NuFFT data translation on multicores;multicore and Manycore Programming;javaSymphony: A programming and execution environment for parallel and distributed many-core architectures;scalable producer-consumer pools based on elimination-diffraction trees;productivity and performance: Improving consumability of hardware transactional memory through a real-world case study;exploiting fine-grained parallelism on cell processors;optimized on-chip-pipelined mergesort on the cell/B.E.;transactional mutex locks;Near-optimal placement of MPI processes on hierarchical NUMA architectures;parallel enumeration of shortest lattice vectors;A parallel GPU algorithm for mutual information based 3D nonrigid image registration;Multi-GPU and multi-CPU parallelization for interactive physics simulations;Long DNA sequence comparison on multicore architectures;adaptive fault tolerance for many-core based space-borne computing;Maestro: Data orchestration and tuning for openCL devices;multithreaded Geant4: Semi-automatic transformation into scalable thread-parallel software;parallel exact time series motif discovery;optimized dense matrix multiplication on a many-core architecture;exceptions for algorithmic skeletons;a language-based tuning mechanism for task and pipeline parallelism;A study of a software cache implementation of the OpenMP memory model for multicore and manycore architectures;Programming CUDA-based GPuS to simulate two-layer shallow water flows;theory and algorithms for parallel computation;analysis of multi-organization scheduling algorithms;Area-maximizing schedules for series-parallel DAGs;parallel Selection by Regular Sampling;a
暂无评论