Zhengge Huang

CAD/CAE integration framework with layered software architecture

By introducing an open-sourced CAD abstraction component Common Geometry Module (CGM) as the integration middleware, a three-layer scheme is implemented to integrate our CAE software High End Digital Prototyping (HEDP) with mainstream CAD software. The major advantages of a layered software design are two-folded for CAE software developers. One is to provide unified interfaces with the differences of currently available CAD products hided. The other is to encapsulate common services relevant to geometry in the integration middleware. Both advantages could help alleviate development burdens greatly. Moreover, this paper will introduce three important functionalities for CAE systems built on the integration middleware, i.e. data transfer, defeaturing and virtual geometry operations with some practical examples. The above work consists of our preliminary efforts for the research of a third-party CAD/CAE integration middleware neutral for any CAD and CAE products.

A parallel algorithm for binary-tree-based string rewriting in L-systems

The L-system is a commonly used methodology to generate fractals and realistic model plants, yet it is very complex and computationally expensive. This paper presents a new parallel L-system string re-writing algorithm based on two types of binary tree: the growth-state tree (GST) and the growth-manner tree (GMT). This data structure makes one of the basic operations in the L-system - left and right context searching - extremely easy during the process of growth-state evolvement. Another benefit from this data structure is that we can make use of pseudo nodes to store information about neighboring sub-strings after each string partition. This helps working processes, in both the stage of growth and rendering, communicate well with each other so as to accomplish the final image compositions. Results of experimental tests have demonstrated that our parallel strategy works effectively on clusters with a multi-processors architecture.

Proxy-Based Parallel Visualization in a Grid Environment with PC Clusters

This paper describes our efforts to provide a grid-based parallel visualization environment to visualize massive dataset in parallel. The visualization environment is implemented as a visualization service on the grid. This paper focuses on deploying a proxy process on the master node of each cluster in the grid, to ensure that Globus jobs can be scheduled on internal nodes of clusters that have only local IP addresses. We have conducted an experiment to visualize in parallel a dataset of computational domains in a grid environment with PC clusters

A Virtual Plant Ecosystem Featuring Parallel Computing and Distributed Visualization

A parallel plant ecosystem simulation, running on a computer cluster with commodity graphic cards, is performed to simulate and visualize large groups of plants. With a scalable architecture, the system can simulate very large and complex plant ecosystem in much shorter time than the traditional. The extreme complexity is first simplified by using multilevel models, and then dividing into multiple parts and simulating parallel. The entire simulation process is visualized in an immersive mode approximately in real time by rendering the results locally and concatenated to a large display wall

EEMAS: An enabling environment for multidisciplinary application simulations

EEMAS environment is a problem-solving environment for multidisciplinary application simulations. Within the EEMAS, there are four categories of modules involved, namely pre-processing module, computing module, post-processing module, and platform control module. The EEMAS is developed for complex and large-scale simulations to take advantage of powerful parallel and distributed computing technologies. All the modules are coupled through a software bus, which maintains the share memory and makes the modules integrated seamlessly. In the present paper, detailed design principles and applications of the EEMAS are addressed.