Reactive spin-lock algorithmsthat can automatically adapt to contention variation on the lock have received great attention in the field of multiprocessor synchronization, since they can help applications achieve goo...
详细信息
In this paper, we propose an associative parallel algorithm for updating a minimum spanning tree when a vertex and all its incident edges axe deleted from the underlying graph. this algorithm is represented as the cor...
详细信息
ISBN:
(纸本)3540281266
In this paper, we propose an associative parallel algorithm for updating a minimum spanning tree when a vertex and all its incident edges axe deleted from the underlying graph. this algorithm is represented as the corresponding procedure implemented on a model of associative parallel systems of the SIMD typo with vertical data processing (the STAR-machine). We justify the correctness of this procedure and evaluate its time complexity.
In this paper, a parallel algorithm for data clustering is presented on a multi-computer with star topology. this algorithm is fast and requires a small amount of memory per processing element, which makes it even sui...
详细信息
ISBN:
(纸本)3540292357
In this paper, a parallel algorithm for data clustering is presented on a multi-computer with star topology. this algorithm is fast and requires a small amount of memory per processing element, which makes it even suitable for SIMD implementation. the proposed parallel algorithm completes in O(K + S-2 - T-2) steps for a clustering problem of N data patterns with M features per pattern and K clusters, where N.M = S!, KM = T!, and M = R!, on a s-star interconnection network.
作者：
Schikuta, EUniv Vienna
Res Lab Computat Techol & Appl Inst Knowledge & Business Engn A-1010 Vienna Austria
We developed a concise but comprehensive analytical model for the well-known sort merge Join algorithm on cost effective cluster architectures. We try to concentrate on a limited number of characteristic parameters to...
详细信息
ISBN:
(纸本)3540292357
We developed a concise but comprehensive analytical model for the well-known sort merge Join algorithm on cost effective cluster architectures. We try to concentrate on a limited number of characteristic parameters to keep the analytical model clear and focused. We believe that a meaningful model can be built upon only three characteristic parameter sets, describing main memory size, the I/O bandwidth and the disk bandwidth. We justify our approach by a practical implementation and a comparison of the theoretical to real performance values.
I/O for parallel and distributed systems has drawn increasing attention over the past decade as it has become apparent that I/O performance, rather than CPU performance, may be the key limiting factor in the performan...
详细信息
Presents the introductory welcome message from the conference proceedings. May include the conference officers' congratulations to all involved withthe conference event and publication of the proceedings record.
Presents the introductory welcome message from the conference proceedings. May include the conference officers' congratulations to all involved withthe conference event and publication of the proceedings record.
Withthe increasing importance of multiple multiplatform remote sensing missions, digital image registration has been applied into many fields, and specially plays a very important role in remotely sensed data process...
详细信息
ISBN:
(纸本)3540292357
Withthe increasing importance of multiple multiplatform remote sensing missions, digital image registration has been applied into many fields, and specially plays a very important role in remotely sensed data processing. Firstly a brief introduction of existing parallel methods of wavelet-based global registration is given. And then the communication optimization for GP method is described. the optimized algorithm is named Group-Optimized-parallel (GOP for short). To find out the reason of occasionally lower efficiency of GOP than other methods, a more careful analysis is presented in theory and proved in experiments. Moreover, we give a quantitative criterion, called Remainder Items, to choose the best solution in different input conditions.
the low-cost and availability of network of workstations have made them attractive solution for high performance computing. Striking progress of network technology is enabling high-performance global computing, with t...
详细信息
Large scale distributed computing infrastructure captures the use of high number of nodes, poor communication performance and continously varying resources that are not available at any time. In this paper, we focus o...
详细信息
ISBN:
(数字)9783540320715
ISBN:
(纸本)3540292357
Large scale distributed computing infrastructure captures the use of high number of nodes, poor communication performance and continously varying resources that are not available at any time. In this paper, we focus on the different tools available for mining traces of the activities of such aforementioned architecture. We propose new techniques for fast management of a frequent itemset mining parallel algorithm. the technique allow us to exhibit statistical results about the activity of more that one hundred PCs connected to the web.
暂无评论