In this work, a new methodology for computing unsteady flow problems is presented. this method treats the temporal direction identically to the spatial directions, transforming a 2- or 3- dimensional time-marching pro...
详细信息
Airborne SAR remote sensing image has the characteristic of large data volume and computation burden, so the processing needs very large computer memory and stronger computation ability. Based on the introduction of t...
详细信息
ISBN:
(纸本)0780378407
Airborne SAR remote sensing image has the characteristic of large data volume and computation burden, so the processing needs very large computer memory and stronger computation ability. Based on the introduction of the SAR image processing procedure, this paper studies the SAR image processing using computer parallel computation technology. the parallel processing mechanism is based on the parallel computer cluster operation and the large virtual shared memory technology. In the Client/Server architecture based SAR image parallel system, agent based network communication plays an important role in the computer performance monitor and burden distribution. In the end, the application of the SAR image parallel processing system in the disaster monitor and assessment system is introduced. the application result illustrates the high efficiency of the system and the feasibility of our research.
In this paper, a fast three-dimensional algorithm for the calculation of the three-dimensional inverse discrete cosine transform (3-D IDCT) is introduced. the derivation of the algorithm is presented and its arithmeti...
详细信息
ISBN:
(纸本)0780378407
In this paper, a fast three-dimensional algorithm for the calculation of the three-dimensional inverse discrete cosine transform (3-D IDCT) is introduced. the derivation of the algorithm is presented and its arithmetic complexity is analysed and compared to that of the familiar row-column-frame (RCF) method. the proposed algorithm is found to reduce the number of multiplications by about 41%, whilst keeping the number of additions the same. Also, based on computer run-time, it is found to reduce the time involved in calculating the 3-D IDCT significantly. this makes the developed algorithm more suitable for 3-D image and video compression decoders involving the 3-D IDCTs.
this paper provides a high performance interconnection network that can provide high bandwidth and low latency communication on a custom gigabit crossbar network. this implementation consists of the high-speed switch ...
详细信息
ISBN:
(纸本)0780378407
this paper provides a high performance interconnection network that can provide high bandwidth and low latency communication on a custom gigabit crossbar network. this implementation consists of the high-speed switch th-Switch, the VIA-supported NIC th-NIC and protocol software th-VIA complied with VIA. th-Switch uses circuit-switching technique instead of packet-switching to reduce the communication latency. the design and implementation of th-Net's communication mechanism is based on the VIA specification that the data transferring can be performed directly at the user application level, bypassing the operating system kernel, to reduce the communication overhead. the design and implementation details are discussed in this paper.
In this paper we present an efficient method for 3-D parallel digital filtering using a new parallel filtering algorithm based on the 3-D vector radix fast Hartley transform (3-D VR FHT). this method is suitable for h...
详细信息
ISBN:
(纸本)0780378407
In this paper we present an efficient method for 3-D parallel digital filtering using a new parallel filtering algorithm based on the 3-D vector radix fast Hartley transform (3-D VR FHT). this method is suitable for high resolution/high speed image/video processing. the 3-D parallel algorithm is highly parallel and efficient as it overcomes the overhead and performance limitations of the block filtering method by eliminating the overlapping segments and boundary conditions in parallel filtering applications. It also lifts the restrictions on the input size for high performance in the block-filtering algorithm, as boththe 3-D input data and impulse response of the system are segmented into smaller subsections. these subsections are independent and can be simultaneously processed. the algorithm's structure and mathematical derivation are given and the performance of the algorithm is tested and presented using a parallel processing system with 4-DSP processors.
Self-stabilization is a theoretical framework of non-masking fault-tolerant distributed algorithms. In this paper, we investigate self-stabilizing distributed solutions to the minimal k-redundant dominating set (MRDS)...
详细信息
ISBN:
(纸本)0780378407
Self-stabilization is a theoretical framework of non-masking fault-tolerant distributed algorithms. In this paper, we investigate self-stabilizing distributed solutions to the minimal k-redundant dominating set (MRDS) problem in tree networks. the MRDS problem is a generalization of the well-known dominating set problem in graph theory. For a graph G=(VE), a set M subset of or equal to V is a k-redundant dominating set of G if and only if each vertex not in M is adjacent to at least k vertices in M. We propose a self-stabilizing distributed algorithm that solves the MRDS problem for anonymous tree networks.
Given n malleable and non-preemptable parallel jobs that arrive for execution at time 0, we examine and compare two job scheduling strategies that allocate m identical processors among the n competing jobs. In all cas...
详细信息
ISBN:
(纸本)0780378407
Given n malleable and non-preemptable parallel jobs that arrive for execution at time 0, we examine and compare two job scheduling strategies that allocate m identical processors among the n competing jobs. In all cases, n less than or equal to m. the first strategy is based on the heuristic paradigm of equipartitioning, and the second is based on the notion of marginal analysis. Equipartitioning uses no a priori information when processor allocations are made to parallel jobs. Marginal analysis, on the other hand, assumes full a priori information in order to maximize processor utility. In this paper, we compare both strategies with respect to average time-to-completion (system performance) and overall time-to-completion (system efficiency). Using a simple job model characterized by sequential time-to-completion and degree of parallelism, it is demonstrated via simulation that in most cases, the uninformed strategy of equipartitioning outperforms marginal analysis with respect to system performance and without a commensurate degradation in system efficiency.
H.26L is an emerging video encoding standard proposed by ITU, which goal is for video communication and multicast in low bit rate conditions. this paper gives detailed analysis and performance tests for the parallelis...
详细信息
ISBN:
(纸本)0780378407
H.26L is an emerging video encoding standard proposed by ITU, which goal is for video communication and multicast in low bit rate conditions. this paper gives detailed analysis and performance tests for the parallelism of the H.26L video encoder test model long-term (TML8.0). Based on these tests, several parallel schedule strategies are discussed in different aspects, and the optimal one is selected and implemented by using MPI. At last, experiment results on Dawning-2000 MPP machines with different processors are given. the analysis and simulation results show that the H.26L has a good parallel performance and scalability on slice layer, and parallelcomputing can greatly speed up the processing of H.26L encoder. the experiment methods and results can be applied to many parallel systems for H.26L video processing.
this paper presents the design and experimental evaluation of two dynamic load partitioning and balancing strategies for parallel Structured Adaptive Mesh Refinement (SAMR) applications: the Level-based Partitioning A...
详细信息
ISBN:
(纸本)354040788X
this paper presents the design and experimental evaluation of two dynamic load partitioning and balancing strategies for parallel Structured Adaptive Mesh Refinement (SAMR) applications: the Level-based Partitioning Algorithm (LPA) and the Hierarchical Partitioning Algorithm (HPA). these techniques specifically address the computational and communication heterogeneity across refinement levels of the adaptive grid hierarchy underlying these methods. An experimental evaluation of the partitioning schemes is also presented.
this paper describes a distributed video transcoding system that can transcode an MPEG-2 video file into various video coding formats with different rates, and its application to grid delivery of video. the transcoder...
详细信息
ISBN:
(纸本)0780381149
this paper describes a distributed video transcoding system that can transcode an MPEG-2 video file into various video coding formats with different rates, and its application to grid delivery of video. the transcoder divides the MPEG-2 file into small segments along the time axis and transcodes them in parallel at transcoding nodes. To cope with heterogeneity and time-varying performance of transcoding processors in grid computing environment, dynamic scheduling algorithm are proposed. the simulation results demonstrate that the proposed dynamic scheduling algorithm can decrease total transcoding time by 30% in uniform performance fluctuation environment, compared with static scheduling.
暂无评论