A b-coloring of a graph is a proper coloring where each color admits at least one node (called dominating node) adjacent to every other used color. Such a coloring gives a partitioning of the graph. in clusters for wh...
详细信息
ISBN:
(纸本)9783540680673
A b-coloring of a graph is a proper coloring where each color admits at least one node (called dominating node) adjacent to every other used color. Such a coloring gives a partitioning of the graph. in clusters for which every cluster has a clusterhead (the dominating node) adjacent to each other cluster. Such a decomposition is very interesting for large distributed systems, networks,... In this paper we present a distributed algorithm to compute a b-coloring of a graph, and we propose an application for the routing in networks to illustrate our algorithm.
A debugger is a crucial part of any programming system, and is especially crucial for those supporting a parallel programming paradigm, like OpenMP. A parallel, relaxed-consistency, distributed shared memory (DSM) sys...
详细信息
ISBN:
(纸本)9783540680673
A debugger is a crucial part of any programming system, and is especially crucial for those supporting a parallel programming paradigm, like OpenMP. A parallel, relaxed-consistency, distributed shared memory (DSM) system presents unique challenges to a debugger for several reasons: 1) the local copies of a given variable are not always consistent between distributed machines, so directly accessing the variable in the local memory by the debugger won't always work as expected;2) if the DSM and debugger both modify page protections, they will likely interfere with each other;and 3) since a large number of SIGSEGVs occur as part of the normal operation of a DSM program, a program error producing a SIGSEGV may be missed. In this paper, we discuss these problems and propose solutions.
this work describes an adaptive parallel pipeline skeleton which maps pipeline stages to the best processors available in the system and clears dynamically emerging performance bottlenecks at run-time by re-mapping af...
详细信息
ISBN:
(纸本)9783540680673
this work describes an adaptive parallel pipeline skeleton which maps pipeline stages to the best processors available in the system and clears dynamically emerging performance bottlenecks at run-time by re-mapping affected stages to other processors. It is implemented in C and MPI and evaluated on a non-dedicated heterogeneous Linux cluster. We report upon the skeleton's ability to respond to an artificially generated variation in the background load across the cluster.
this paper presents an approach to texture segmentation by thresholding based on compactness measures of fuzzy sets to determine thresholds of an ill-defined image. the extension of fuzziness in the texture feature sp...
详细信息
ISBN:
(纸本)1864352094
this paper presents an approach to texture segmentation by thresholding based on compactness measures of fuzzy sets to determine thresholds of an ill-defined image. the extension of fuzziness in the texture feature space provides more meaningful results than by considering fuzziness in gray scale domain. the effectiveness of the algorithm is demonstrated by comparison with other traditional non-fuzzy methods or the controversial fuzzy method in gray scale alone. In addition, the efficiency of our algorithm is further improved by parallel implementation using distributed shared memory workstations.
In this paper we introduce and evaluate two prefetching techniques to improve the performance of Java applications executed on the grid. these techniques are experimentally evaluated on two grid environments, by runni...
详细信息
ISBN:
(纸本)9783540680673
In this paper we introduce and evaluate two prefetching techniques to improve the performance of Java applications executed on the grid. these techniques are experimentally evaluated on two grid environments, by running test applications on two different grid deployment configurations. Our testbed is SUMA/G, a grid platform specifically targeted at executing Java bytecode on Globus grids. the experimental results show that these techniques can be effective on improving the performance of applications run on the grid, especially for compute intensive scientific applications.
As the Internet of Vehicles (IoV) becomes flourishing and the data generated by sensors be ubiquitous, there exist various kinds of IoV applications with different performance requirements. Hence, different distribute...
详细信息
ISBN:
(纸本)9781538637906
As the Internet of Vehicles (IoV) becomes flourishing and the data generated by sensors be ubiquitous, there exist various kinds of IoV applications with different performance requirements. Hence, different distributed data processing systems (DDPS) clusters will coexist, e.g., a stream processing system cluster for real-time tasks and a batch one for statistics based data mining tasks, to meet the requirements of such IoV applications. However, it is not an economical or convenient way to maintain varied systems clusters, as the developers and/or administrators have to be familiar with all of these DDPSs, and of course, the deployment of multiple DDPS means a waste of resources compared to the deployment of one DDPS. Based on these observations, this paper proposes the TDAG as a solution. TDAG allows users to adjust the data processing from the streaming style to the batch style by encapsulating the input data with specific packing strategies. We have implemented TDAG in a prototype called TStream. the experimental tests show that our TStream is both effective and efficient.
Clustering plays an essential role in large-volume data analysis areas such as bioinformatics, statistic, pattern recognition and so on. K-means is one of most effective clustering algorithms, which is relatively easy...
详细信息
ISBN:
(纸本)9781538637906
Clustering plays an essential role in large-volume data analysis areas such as bioinformatics, statistic, pattern recognition and so on. K-means is one of most effective clustering algorithms, which is relatively easy to implement. Most real world applications usually involve a huge amount of data. thus, how to improve applications' efficiency while maintaining accuracy becomes a significant and considerable issue. In this paper, a K-means clustering algorithm, which uses heterogeneous parallel computing technology on Computing processing elements and distributed computing technology, is proposed. this algorithm is applied in unique Sunway architecture based on "Sunway TaihuLight" Supercomputer-the world's fastest supercomputer with peak performance over 100PFLOPS. the testing results suggest that this improved algorithm is stable, fast and efficient. Conclusively, it has a great improvement in computation performance, especially with large volumes of data.
We present in this paper a novel load balancing and rescheduling approach based on the concept of the Sandpile cellular automaton: a decentralized multi-agent system working in a critical state at the edge of chaos. O...
详细信息
We present in this paper a novel load balancing and rescheduling approach based on the concept of the Sandpile cellular automaton: a decentralized multi-agent system working in a critical state at the edge of chaos. Our goal is providing fairness between concurrent job submissions in highly parallel and distributed environments such as currently built cloud computing systems by minimizing slowdown of individual applications and dynamically rescheduling them to the best suited resources. the algorithm design is experimentally validated by a number of numerical experiments showing the effectiveness and scalability of the scheme in the presence of a large number of jobs and resources and its ability to react to dynamic changes in real time. (C) 2016 Elsevier B.V. All rights reserved.
From the very beginning of the CUDA technology, it was essential to apply state-of-the-art optimization techniques. Only then was it possible to fully utilize the enormous computational power of graphic processing uni...
详细信息
ISBN:
(纸本)9781665435741
From the very beginning of the CUDA technology, it was essential to apply state-of-the-art optimization techniques. Only then was it possible to fully utilize the enormous computational power of graphic processing units. However, withthe development of the CUDA architecture, the impact of typical optimization techniques on software performance has changed significantly. this article shows how the impact of several optimization techniques on the performance of the image filtering algorithm has changed for the subsequent generations of CUDA architecture. then, based on the results obtained, it attempts to answer whether tedious and time-consuming optimization of the CUDA software is still necessary.
Construction of a backbone architecture is an important issue in mobile ad hoc networks(MANET)s to ease routing and resource management. We propose a new fully distributed algorithm for backbone formation in MANETs th...
详细信息
ISBN:
(纸本)9783540680673
Construction of a backbone architecture is an important issue in mobile ad hoc networks(MANET)s to ease routing and resource management. We propose a new fully distributed algorithm for backbone formation in MANETs that constructs a directed ring architecture. We show the operation of the algorithm, analyze its message complexity and provide results in the simulation environment of ns2. Our results conform that the algorithm is scalable in terms of its running time and round-trip delay against mobility, surface area, number of nodes and number of clusterheads.
暂无评论