Metadata in a paralleldistributed database contains information about table fragmentation,physical storage distribution,and access control *** is essential to query processing and security policy *** in a parallel di...
详细信息
Metadata in a paralleldistributed database contains information about table fragmentation,physical storage distribution,and access control *** is essential to query processing and security policy *** in a paralleldistributed database is usually stored in the form of system tables,it can be replicated through out every site in the system in order to improve performance and availability. Changes to the metadata should be aware by every site with acceptable delay and *** this paper,a novel method is proposed to deal with the problem of metadata synchronization in paralleldistributed databases.A locking mechanism is devised to coordinate different database operations,it can postpone data moving operations and carries out propagation only when *** with existing methods,it dramatically reduces the communication between different sites,such that situations can be avoided in which all sites require updates simultaneously and a large portion of network bandwidth is consumed at a *** results show the superiority of the proposed method over the others.
In this paper, we propose a controller-assisted distributed (CAD) load-balancing mechanism for the ZigBee network containing multiple personal area networks (PANs). Shifting the enforcement part from the central contr...
详细信息
In this paper, we propose a controller-assisted distributed (CAD) load-balancing mechanism for the ZigBee network containing multiple personal area networks (PANs). Shifting the enforcement part from the central controller to PANs, each PAN in CAD maintains its load status whereas the central controller simply maintains node numbers of PANs and a list of switch pairs which each is formed from two nodes nearby in different PANs, denoting a possible load switch between the two PANs. Upon perceiving a network unbalanced, the controller just provides a heavy-loaded PAN a switch pair and an offload threshold so that the PAN enforces the offload of a sub tree onto a neighbor PAN. The number of nodes in sub tree may be exactly smaller than the threshold due to maintenance situation in PAN. Simulation results show that CAD achieves a same load balancing result as a centralized method which outperforms other methods, yet costing fewer control messages.
A novel algorithm called "edge-preserving pixel-level interpolation by triangulation" is proposed for interpolating the image. This algorithm can be used in arbitrary resolution enhancement and solve the pro...
详细信息
A novel algorithm called "edge-preserving pixel-level interpolation by triangulation" is proposed for interpolating the image. This algorithm can be used in arbitrary resolution enhancement and solve the problem of edge preserving in interpolating the input image. It is simpler than other conventional methods and is adaptable to a various image process. The basic idea is to first estimate the direction of edge in a small region and then use different way to deal with each situation. The most essential point is to maintain the parallelism of lines around edges. Two concepts have been considered in interpolating process: (1) edge direction confirm (2) parallel line preserved. Good experiments results showing the effectiveness of edge preserving and its superiority to other methods are also included.
This paper proposes a cyclic load balancing strategy to parallel Fuzzy C-Means cluster analysis algorithm. The problem is to minimize the total time cost and maximize the parallelprocessing efficiency when a subset o...
详细信息
This paper proposes a cyclic load balancing strategy to parallel Fuzzy C-Means cluster analysis algorithm. The problem is to minimize the total time cost and maximize the parallelprocessing efficiency when a subset of clusters is distributed over a set of processors cores on shared memory architecture. The parallel Fuzzy C - Means (FCM) cluster analysis algorithm is composed by two distinct parts. The two distinct parts are; first: the cluster analysis whereby using the FCM algorithm to calculate the cluster centers and second: the evaluation of the subset of clusters whereby using the cluster validity functions to produce the result of the optimal cluster. The experimental result shows that the cyclic load balanced parallel FCM cluster analysis algorithm presents good speed up especially when the size of clusters is large as compared to the parallel FCM cluster analysis algorithm.
This paper presents a hardware-supported resource management methodology for massively parallel processor arrays. It enables processing elements to autonomously explore resource availability in their neighborhood. To ...
详细信息
This paper presents a hardware-supported resource management methodology for massively parallel processor arrays. It enables processing elements to autonomously explore resource availability in their neighborhood. To support resource exploration, we introduce specialized controllers, which can be attached to each of the processing elements. We propose different types of architectures for the exploration controller: fast FSM-based designs as well as flexible programmable controllers. These controllers allow to implement different distributed resource exploration strategies in order to enable parallel programs the exploration and reservation of available resources according to different application requirements. Hardware cost evaluations show that the cost of the simplest implementation of our programmable controller is comparable to our FSM-based implementations, while offering the flexibility for implementing different exploration strategies. We show that the proposed distributed approach can achieve a significant speedup in comparison with centralized resource exploration methods.
This paper focuses on the near real-time implementation of end-to-end 3DTV System. It is specially designed for the generation of high-quality disparity map and depth-image-based rendering (DIBR) on the graphics proce...
详细信息
This paper focuses on the near real-time implementation of end-to-end 3DTV System. It is specially designed for the generation of high-quality disparity map and depth-image-based rendering (DIBR) on the graphics processing unit (GPU) through CUDA (Compute Unified Device Architecture) API. We propose our novel methods including a kind of stereo matching with adaptive windows and an asymmetric edge adaptive filter (AEAF) for industrial application. These algorithms are structured in a way that exposes as much data parallelism as possible and the power of shared memory and data parallel programming in GPU is exploited. We evaluate our proposed methods and implementation based on the benchmark Middlebury and the experiment results show that our method is suitable for application on the trade-off among accuracy and execution speed. Running on an NVIDIA Quadro FX4800 graphics card, for each 480x375 stereo images with 60 disparity levels, the proposed system reaches about 146ms for stereo matching and reaches the speed of DIBR 5.7ms for rendering 1 view or 14ms for rendering 8 views.
In this paper, error performances of distributedparallel concatenated (turbo) coded relay/cooperative systems, whose component codes are recursive space-time trellis codes are investigated over cascaded fading channe...
详细信息
In this paper, error performances of distributedparallel concatenated (turbo) coded relay/cooperative systems, whose component codes are recursive space-time trellis codes are investigated over cascaded fading channels. Two separate systems with one and two relays are considered. In the first system, the relay uses “decode and forward” method while in the second one, the relays use “amplify and forward” and decode and forward methods. Computer simulations are performed under the double Rayleigh fading channel assumption and the superiority of the distributed turbo coded systems is presented.
A set of camera selection templates, using simple rules based on a local (camera) level metric, are implemented for a twelve camera inward-looking distributed smart camera network. The local metric represents the qual...
详细信息
A set of camera selection templates, using simple rules based on a local (camera) level metric, are implemented for a twelve camera inward-looking distributed smart camera network. The local metric represents the quality of detection for a given camera node of the target-of-interest and is based on a measurable target parameter. To understand the effectiveness of the camera selections, an analytical framework consisting of a global (system) level metric has been designed. The camera selection methods are able to maintain a desirable global metric performance while using a subset of the total cameras available. This is true even when the system undergoes perturbation by the loss of a single camera or by a single occluding target.
The method particle image velocimetry (PIV) measures particle velocities in natural sciences and engineering based on the determination of the optical flow. Classical PIV requires capturing the particles twice with sh...
详细信息
The method particle image velocimetry (PIV) measures particle velocities in natural sciences and engineering based on the determination of the optical flow. Classical PIV requires capturing the particles twice with short delay and with very short exposure time which exceeds the frame rate and the shutter speed of typical imaging systems. Thus, the exposure time is realized with illumination bursts based on double pulse lasers and imaging systems capable of high frame rates are used for capturing the particles. In order to relax PIV measurements, a filter technique is presented that generates both snapshots out of only one single image. This image is captured with a standard imaging system with standard exposure times which relaxes the constrains of the PIV measurement setup significantly. The filter technique is based on spatial filters and its computational complexity is independent from the image content. It also enables the integration of the technique into embedded architectures for real-time PIV. The functionality is demonstrated by taking the example of a particle-based manufacturing process and the measuring error caused by the filter technique is analyzed.
Metadata in a paralleldistributed database contains information about table fragmentation, physical storage distribution, and access control policies. It is essential to query processing and security policy enfor...
详细信息
Metadata in a paralleldistributed database contains information about table fragmentation, physical storage distribution, and access control policies. It is essential to query processing and security policy enforcement Metadata in a paralleldistributed database is usually stored in the form of system tables, it can be replicated through out every site in the system in order to improve performance and availability. Changes to the metadata should be aware by every site with acceptable delay and consistency. In this paper, a novel method is proposed to deal with the problem of metadata synchronization in paralleldistributed databases. A locking mechanism is devised to coordinate different database operations, it can postpone data moving operations and carries out propagation only when necessary. Compared with existing methods, it dramatically reduces the communication between different sites, such that situations can be avoided in which all sites require updates simultaneously and a large portion of network bandwidth is consumed at a burst. Experiment results show the superiority of the proposed method over the others.
暂无评论