It is the purpose of this paper to present some practical security issues related to National High Performance computing Environment (NHPCE), the computational grid. Based on the security requirements of NHPCE we disc...
详细信息
ISBN:
(纸本)0780378407
It is the purpose of this paper to present some practical security issues related to National High Performance computing Environment (NHPCE), the computational grid. Based on the security requirements of NHPCE we discuss some existing distributed security technologies we used and point out why they are not enough. Then the key issues of NHPCE and its corresponding solutions to these problems are analyzed. Lastly we put forward our final solution.(8).
This paper introduces the numerical parallel computation of geometrical ray-tracing. By analyzing the model of ray-tracing and using some parallel techniques, such as strategy of "Divide and Conquer" to desi...
详细信息
ISBN:
(纸本)0780378407
This paper introduces the numerical parallel computation of geometrical ray-tracing. By analyzing the model of ray-tracing and using some parallel techniques, such as strategy of "Divide and Conquer" to design a geometrical ray-tracing parallel program with MPI mode. The numerical simulation computation results of parallel program on PC-cluster platform and HPC (high performance computer) with DSM structure both show a great increase of computing speed and speedup ratio, the algorithm is proved efficient.
Semantic annotation plays a central role in building Semantic Web, which in general could be completed by committing a web resource to a domain ontology. However, there exist many circumstances in which semantic annot...
详细信息
ISBN:
(纸本)0780378407
Semantic annotation plays a central role in building Semantic Web, which in general could be completed by committing a web resource to a domain ontology. However, there exist many circumstances in which semantic annotation needs more than one ontologies In this paper, we propose an approach based distributed Description Logics(DDL) with intention to deal with these circumstances, in which ontologies form a distributed system, and no extra conditions and. changes are imposed to those component ontologies.
Using parallel Geographic Image Processing System, the flooding disaster will be monitoring and evaluating in time. Using ParGIP to establish background database and process RS images, we can get the losses of the dis...
详细信息
ISBN:
(纸本)0780378407
Using parallel Geographic Image Processing System, the flooding disaster will be monitoring and evaluating in time. Using ParGIP to establish background database and process RS images, we can get the losses of the disaster by overlaying operation in 24 hours. According to the experiment in the Poyang Lake region, this method can promote the speed and the efficiency of the monitoring and evaluating of flooding disaster to several times.
This paper proposes an approach to the design of distributedparallelcomputing systems based on the concept of reflective middleware, skeleton parallel programming and object-oriented software engineering. In the app...
详细信息
ISBN:
(纸本)0780378407
This paper proposes an approach to the design of distributedparallelcomputing systems based on the concept of reflective middleware, skeleton parallel programming and object-oriented software engineering. In the approach, the programmer does not need to be bothered by the architectural details. Furthermore, the approach provides support for the mostly used parallel paradigms, which will ease the onerous work for the programmer to construct the parallelism. It offers a method for the user to map the programming design seamlessly to the real environment.
We present an automatic parallelization scheme involving extracting inter-block parallelism within sequential programs, scheduling block graphs, and generating appropriate target codes for message passing multiprocess...
详细信息
ISBN:
(纸本)0780378407
We present an automatic parallelization scheme involving extracting inter-block parallelism within sequential programs, scheduling block graphs, and generating appropriate target codes for message passing multiprocessors. Compared with existing parallelization compilers, it is capable of exploiting more parallelism because potential parallelism existing within blocks is take into consideration.
We compare the performance of the Treadmarks DSM system with two popular message passing systems (PVM and MPI). The comparison is done on 1, 2, 4, 8, 16, 24, and 32 nodes. applications are chosen to represent three cl...
详细信息
ISBN:
(纸本)0780378407
We compare the performance of the Treadmarks DSM system with two popular message passing systems (PVM and MPI). The comparison is done on 1, 2, 4, 8, 16, 24, and 32 nodes. applications are chosen to represent three classes of problems: loosely synchronous, embarrassingly parallel, and synchronous. The results show DSM has similar performance to message passing for the embarrassingly parallel class. However, the performance of DSM is lower than PVM and MPI for the synchronous and loosely synchronous classes of problems. An analysis of the reasons is presented.
Due to the increased complexity of applications, the distributed hierarchy architecture of clusters and the deficiency of efficient compiling strategies, developing efficient applications for large-scale scientific an...
详细信息
ISBN:
(纸本)0780378407
Due to the increased complexity of applications, the distributed hierarchy architecture of clusters and the deficiency of efficient compiling strategies, developing efficient applications for large-scale scientific and engineering computing on clusters is difficult. Our strategy to address this problem is to extend a generic data-parallel programming environment with an extensible component library. A component is a reusable routine that can be called by an alias in applications to perform some specific computation. All algorithmic and programming complexity as well as the specialized knowledge required to implement and optimize the computation are encapsulated in the routine. The alias is provided to the programming model as an extended operator for end users to develop new applications. Programmers use data-parallel construct and high-level operators to specify applications and its parallelism, and rely on sophisticated implementations of these programming systems to ensure that applications achieve high performance.
Online Analytical Processing (OLAP) is a critical component of data warehouse. Most of today's OLAP applications work on data warehouses with a centralized structure in which a single database contains huge amount...
详细信息
ISBN:
(纸本)0780378407
Online Analytical Processing (OLAP) is a critical component of data warehouse. Most of today's OLAP applications work on data warehouses with a centralized structure in which a single database contains huge amounts of data. A range query is a very popular and important operation on OLAP data cube in finding trends or relations between attributes. Methods of computing range query in a centralized data warehouse environment have been well studied. But to the best of our knowledge, there is no literature to date to discuss how to deal with the range query in a PC cluster-based parallel data warehouse. In this paper, we present a parallel data cube storage structure, called parallel hierarchical data cube(PHDC). The analytical results show that PHDC may achieve better load-balance and optimum speed-up for range sum queries.
A parallel Strength Pareto Multi-objective Evolutionary Algorithm (PSPMEA) is proposed. PSPMEA is a parallelcomputing model designed for solving Pareto-based multi-objective optimization problems by using an evolutio...
详细信息
ISBN:
(纸本)0780378407
A parallel Strength Pareto Multi-objective Evolutionary Algorithm (PSPMEA) is proposed. PSPMEA is a parallelcomputing model designed for solving Pareto-based multi-objective optimization problems by using an evolutionary procedure. In this procedure, both global parallelization and island parallel evolutionary algorithm models are used. Each subpopulation evolves separately with different crossover and mutation probability, but they exchange individuals in the elitist archive. The benchmark problems numerical experiment results demonstrate that the proposed method can rapidly converge to the Pareto optimal front and spread widely along the front.
暂无评论