the automatic recognition of geometric constraints in virtual assembly and maintenance operations relies in the determination of intersecting surfaces between virtual prototypes. this is a key challenge in many virtua...
详细信息
ISBN:
(纸本)0769521525
the automatic recognition of geometric constraints in virtual assembly and maintenance operations relies in the determination of intersecting surfaces between virtual prototypes. this is a key challenge in many virtual prototype applications, where it is necessary to find collisions precisely and interactively. this paper presents a novel algorithm to determine intersecting surfaces at interactive speed in a virtual prototyping environment. the proposed algorithm is based on the Overlapping Axis-Aligned Bounding Box (OAABB). the OAABB concept is used effectively to eliminate the number of surfaces that cannot intersect and improve performance. the algorithm also facilitates the implementation using parallelcomputing methods. OpenMP is used, taking advantage of shared memory multiple processors and reducing the overall time complexity of the collision detection algorithm. To achieve an efficient parallel simulation, it is necessary to provide an efficient load balancing scheme. Our experiences in parallelising the code to achieve a better work distribution are also described. Results show that the proposed collision detection achieves interactive rates in real industrial applications as desired Keywords: parallelapplications, shared memory multiprocessors, OpenMP, collision detection, virtual prototype environments.
the increasing presence of mobile and ubiquitous applications has created a need for distributed systems and applicationsthat are dynamic and can efficiently adapt to changes in Quality of Service (QoS), resource ava...
详细信息
ISBN:
(纸本)0769521525
the increasing presence of mobile and ubiquitous applications has created a need for distributed systems and applicationsthat are dynamic and can efficiently adapt to changes in Quality of Service (QoS), resource availability, user requirements and location of mobile nodes. this is done by dynamically reconfiguring system components. Reconfiguration should be done with minimal effect on system performance. A crucial issue is to determine what types of changes and how much change characterizes the need for reconfiguration, and what is the cost (in terms of resource usage) incurred on the system. We propose a reconfiguration framework based on policies and illustrate our initial prototype.
An effective approach to accelerate applications is to execute them in parallel. there are value localities in values of program variables. Data value reuse is able to enhance performance in applications by canceling ...
详细信息
ISBN:
(纸本)3540240136
An effective approach to accelerate applications is to execute them in parallel. there are value localities in values of program variables. Data value reuse is able to enhance performance in applications by canceling same calculations. We propose the use of data value reuse and speculative parallelism with software to execute existing sequential applications in parallel. this study profiles value localities that exist in method arguments of benchmark programs, and evaluates performance improvements by applying data value reuse and speculative parallelism.
作者：
Kim, HKorea Univ
Grad Sch Informat Secur Seoul 136701 South Korea
We present parallel algorithms for the process of the biorthogonal wavelet transform(BWT). We have constructed processing elements (PEs) for the decomposition and reconstruction of the BWT to minimize computational op...
详细信息
ISBN:
(纸本)3540240136
We present parallel algorithms for the process of the biorthogonal wavelet transform(BWT). We have constructed processing elements (PEs) for the decomposition and reconstruction of the BWT to minimize computational operations. they can be performed using only integer shift and superposition operations;therefore, they may be applied to the implementation of image compression standards based on BWT, such as JPEG2000.
the new principals of organization of parallel input-output of the optical information in the personal computer from the fiber-optical measuring lines are considered. the device has block structure and has two mode of...
详细信息
ISBN:
(纸本)0819453226
the new principals of organization of parallel input-output of the optical information in the personal computer from the fiber-optical measuring lines are considered. the device has block structure and has two mode of operation: calibration mode of operation and work mode of operation. In the calibration mode of operation computing, system is adaptation to condition of the Solution problem of reconstruction information about parameters of monitoring physical fields. In the work mode of operation the device implements the adaptive processing of incoming optical radiation.
Synchronous collaborative systems allow geographically distributed users to form a virtual work environment enabling cooperation between peers and enriching the human interaction. the technology facilitating this inte...
详细信息
Agent-based simulation of large multicellular biological systems has become a viable option owing to affordable parallel computers. such as Beowulf-style clusters. We describe a scalable modular software platform that...
详细信息
ISBN:
(纸本)3540240136
Agent-based simulation of large multicellular biological systems has become a viable option owing to affordable parallel computers. such as Beowulf-style clusters. We describe a scalable modular software platform that (i) provides for an easy integration of different. solvers computing internal dynamics of the cells, and (ii) dynamically adapts to the changing loads on the cluster nodes using a load balancing algorithm. Simulations of systems of about 100,000 bacterial cells have been shown to be feasible using the platform.
Due to the heterogeneity and the large volume of resources involved;the complexity of computational applications and their Grid environments, the importance of problem solving environment (PSE)s been more emphasized. ...
详细信息
ISBN:
(纸本)3540240136
Due to the heterogeneity and the large volume of resources involved;the complexity of computational applications and their Grid environments, the importance of problem solving environment (PSE)s been more emphasized. Currently, most PSE systems for computational applications mainly focus on development of an application for a specific domain and helping its execution with static resource configuration but does not consider of general form of PSE toolkit for its deployment to extended domains. this paper proposed a Grid-enabled PSE called as a computing Environment for Grid applications (CEGA) and discuss how it is evolving to develop a computational application in a style of workflow model and incorporate Grid computing services to extend its range of services and handle information for development, deployment, execution and maintenance for an application as well as an application requirement itself. In addition, the paper provides the architecture of CEGA and its implementation for development, execution and visualization of an application in detail.
Unstructured Peer-to-Peer applications are very popular on the Internet. An efficient technique for improving performance of search method of these systems is to replicate file location information in P2P. In this pap...
详细信息
ISBN:
(纸本)3540240136
Unstructured Peer-to-Peer applications are very popular on the Internet. An efficient technique for improving performance of search method of these systems is to replicate file location information in P2P. In this paper we present random walk spread mechanism, and random walk spread and search method. Simulation results show that it achieves high success rates at low cost.
Concept Lattice, the core data structure in Formal Concept Analysis, has been used widely in machine learning, data mining and knowledge discovery, information retrieval, etc. the main difficulty with concept lattice-...
详细信息
ISBN:
(纸本)0769521525
Concept Lattice, the core data structure in Formal Concept Analysis, has been used widely in machine learning, data mining and knowledge discovery, information retrieval, etc. the main difficulty with concept lattice-based system comes from the lattice construction itself In this paper, a parallel algorithm based on the closure search space partition for computing concepts is proposed. this algorithm divides the closure search space into several subspaces in accordance with criterions prescribed ahead and introduces an efficient scheme to recognize the valid ones, in which the searching for closures is bounded An intermediate structure is employed to judge the validity of a subspace and compute closures more efficiently. Since the searching in subspaces are independent tasks, a parallel algorithm based on search space partition can be directly reached.
暂无评论