Leadership-scale scientific simulations running as tens of thousands of tightly-coupled MPI processes are vulnerable to interruption due to a single process or node failure. Due to the dependence of each state calcula...
详细信息
Withthe development of internet technologies, internet has been more complexly consisted of a large amount of Web documents, science technology documents, data-base and etc. distributed retrieval system is more requi...
详细信息
ISBN:
(纸本)9780769530499
Withthe development of internet technologies, internet has been more complexly consisted of a large amount of Web documents, science technology documents, data-base and etc. distributed retrieval system is more required to support effective retrieval and management about a large amount of Web documents, science technology documents and etc. distributed retrieval system has to support for user to search quickly and exactly. A distributed retrieval system has to support for DB manager to manage easily. So we have developed the distributed retrieval system called dKRISTAL(1) which finds indexing files and manages database system in real time. We have developed new dKRISTAL system which can support searching and managing database. We measured the integrated search speed of distributed retrieval system. Also this system effectively manages documents at real-time. this paper made an experiment using a large mount of science technology information system and Web documents using dKRISTAL. this paper analyzed the result of experiment.
When datasets are distributed on different sources, finding out their intersection while preserving the privacy of the datasets is a widely required task. In this paper we address the Privacy Preserving Set Intersecti...
详细信息
ISBN:
(纸本)9780769530499
When datasets are distributed on different sources, finding out their intersection while preserving the privacy of the datasets is a widely required task. In this paper we address the Privacy Preserving Set Intersection (PPSI) problem, in which each of the N parties learns no elements other than the intersection of their N private datasets. We propose an efficient protocol in the malicious model, where the adversary may control arbitrary number of parties and execute the protocol for its own benefit. A related work in [12] has a correctness probability of (N-1/N)(N) (N is the size of the encryption scheme's plaintext space), a computation complexity of O(N(2)S(2)lgN) (S is the size of each party's data set). Our PPSI protocol in the malicious model has a correctness probability of (N-1/N)(N-1), and achieves a computation cost of O(c(2)S(2)lgN) (c is the number of malicious parties and c <= N-1).
In distributed virtual environments (DVEs), maintaining a consistent view of the virtual world among all users is a primary task. Due to the resource limitations such as network capacity and computational power, the c...
详细信息
A real-time parallel application can be divided into a number of tasks and executed concurrently on distinct nodes of a distributed System (DS). distributed System Reliability (DSR) can be defined as the probability t...
详细信息
ISBN:
(纸本)9781467351652;9780769549149
A real-time parallel application can be divided into a number of tasks and executed concurrently on distinct nodes of a distributed System (DS). distributed System Reliability (DSR) can be defined as the probability that all the tasks in the system run successfully. Due to different hazard rates of nodes and links, DSR critically depends on the optimal allocation of these tasks onto the available nodes. In this paper, we have presented a mathematical model for analyzing DSR in a DS on which hard real-time periodic tasks are executed. In addition, to maximize reliability besides satisfying the constraints, we have proposed an offline task allocation algorithm. the algorithm is a new swarm intelligence approach based on Ant Colony Optimization (ACO). For evaluating the algorithm, ACO is compared with Honey Bee Mating Optimization (HBMO) and Particle Swarm Optimization (PSO). Simulation results manifest that ACO produces better solutions than PSO and HBMO. Meanwhile, it leads to shorter execution time. the results also reveal the flexibility and scalability of the proposed algorithm.
this paper analyze the parallelcomputing environment overhead of OpenMP for loop with multi-core processors including the case of data-race. the different solutions of data-race are discussed in present paper, such a...
详细信息
the performance of paralleldistributed data management systems becomes increasingly important withthe rise of Big Data. parallel joins have been widely studied both in the parallel processing and the database commun...
详细信息
ISBN:
(纸本)9780769550886
the performance of paralleldistributed data management systems becomes increasingly important withthe rise of Big Data. parallel joins have been widely studied both in the parallel processing and the database communities. Nevertheless, most of the algorithms so far developed do not consider the data skew, which naturally exists in various applications. State of the art methods designed to handle this problem are based on extensions to either of the two prevalent conventional approaches to parallel joins - the hash-based and duplication-based frameworks. In this paper, we introduce a novel parallel join framework, query-based distributed join (QbDJ), for handling data skew on distributed architectures. Further, we present an efficient implementation of the method based on the asynchronous partitioned global address space (APGAS) parallel programming model. We evaluate the performance of our approach on a cluster of 192 cores (16 nodes) and datasets of 1 billion tuples with different skews. the results show that the method is scalable, and also runs faster with less network communication compared to state-of-art PRPD approach in [1] under high data skew.
the management of huge amounts of data distributed across multiple sites has become a necessity more and more demanding. Peer-to-peer systems (P2P) can afford the requirements of managing, indexing, searching and anal...
详细信息
ISBN:
(纸本)9781467394734
the management of huge amounts of data distributed across multiple sites has become a necessity more and more demanding. Peer-to-peer systems (P2P) can afford the requirements of managing, indexing, searching and analyzing data with scalability and self-organization. Until now, most efforts have focused primarily on improving the number of hops and structure maintenance messages. However, the non-uniform distribution of data and the hierarchical structures, together with heavy load, can cause unbalanced traffic load. In this paper we improve our previous work on the overlay structure G-Grid, merging it with a Small World network. the Small World networks make a compromise between order and randomness, they are derived from social networks and show an almost uniform traffic distribution. Experiments show how this new hybrid structure obtains the best performance in traffic distribution.
this paper describes the use of standard Linux® [1] and Open Source software to produce an environment to support parallel scientific applications on High Performance Computers (HPC). the goals of this approach a...
详细信息
ISBN:
(纸本)980656068X
this paper describes the use of standard Linux® [1] and Open Source software to produce an environment to support parallel scientific applications on High Performance Computers (HPC). the goals of this approach are to maximize the HPC resources delivered to the application, to improve system stability and predictability, and to reduce software management burdens. the simplicity of this approach provides an additional benefit. the paper presents the reader with background, motivations, and a discussion of advantages and drawbacks of the light-os.
A new mathematical morphology-based algorithm is proposed to achieve automatic center location of non-eye typhoon. the center of a non-eye typhoon is near the geometric center of the cloud system and has higher temper...
详细信息
ISBN:
(纸本)0780378407
A new mathematical morphology-based algorithm is proposed to achieve automatic center location of non-eye typhoon. the center of a non-eye typhoon is near the geometric center of the cloud system and has higher temperature. For each infrared satellite cloud image, the locating procedures are as follows: a) noises filtering, b) main cloud systems segmenting, c) center locating and d) multispectral image verification. the algorithms are based on operations of mathematical morphology, and designed in IBM SP2 massively parallel computer. the experiment results show that the algorithm locates the centers of most non-eye typhoons successfully and achieves faster, more precise and non-human interactive non-eye typhoon center positioning.
暂无评论