• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.10 no.1
• /
• pp.7-13
• /
• 2011

Matrix multiplication is a fundamental operation of linear algebra and arises in many areas of science and engineering. This paper introduces an efficient parallel matrix multiplication scheme on N ${\times}$ N mesh-connected SIMD array processor, called multiple hierarchical SIMD architecture (HMSA). The architectural characteristic of HMSA is the hierarchically structured control units which consist of a global control unit, N local control units configured diagonally, and $N^2$ processing elements (PEs) arranged in an N ${\times}$ N array. PEs are communicating through local buses connecting four adjacent neighbor PEs in mesh-torus networks and global buses running across the rows and columns called horizontal buses and vertical buses, respectively. This architecture enables HMSA to have the features of diagonally indexed concurrent broadcast and the accessibility to either rows (row control mode) or columns (column control mode) of 2D array PEs alternately. An algorithmic mapping method is used for performance evaluation by mapping matrix multiplication on the proposed architecture. The asymptotic time complexities of them are evaluated and the result shows that paralle matrix multiplication on HMSA can provide significant performance improvement.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.6
• /
• pp.26-36
• /
• 2009

ad-hoc network is self-constructed by mobile hosts without any infrastructure. And the hosts collaborate with each other for routing packet by means of multi-hop communication. But it is too hard to deploy ad hoc network at the large area because of the salability problem caused by low network throughput. network throughput decrease is due to contention on the air among the neighbor host and single interface limitation, and broadcast flooding through overall network. In this paper, to solve the ad hoc scalability problem, we propose mesh network based scalable hierarchical ad hoc architecture, and also propose the adaptation methods for inter-working with the host not including ad hoc functions and the legacy infra-network.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.5_6
• /
• pp.360-370
• /
• 2004

Adaptive mesh refinement(AMR) is one of the popular computational simulation techniques used in various scientific and engineering fields. Although AMR data is organized in a hierarchical multi-resolution data structure, traditional volume visualization algorithms such as ray-casting and splatting cannot handle the form without converting it to a sophisticated data structure. In this paper, we present a hierarchical multi-resolution splatting technique using k-d trees and octrees for AMR data that is suitable for implementation on the latest consumer PC graphics hardware. We describe a graphical user interface to set transfer function and viewing / rendering parameters interactively. Experimental results obtained on a general purpose PC equipped with an nVIDIA GeForce3 card are presented to demonstrate that the proposed techniques can interactively render AMR data(over 20 frames per second). Our scheme can easily be applied to parallel rendering of time-varying AMR data.

• Structural Engineering and Mechanics
• /
• v.14 no.5
• /
• pp.595-610
• /
• 2002

This paper presents an efficiency of various non-conforming (NC) modes in development of a series of new finite elements with the special emphasis on 4-node quadrilateral elements. The NC modes have been used as a key scheme to improve the behaviors of various types of new finite elements, i.e., Mindlin plate bending elements, membrane elements with drilling degrees of freedom, flat shell elements. The NC modes are classified into three groups according to the 'correction constants' of 'Direct Modification Method'. The first group is 'basic NC modes', which have been widely used by a number of researchers in the finite element communities. The basic NC modes are effective to improve the behaviors of regular shaped elements. The second group is 'hierarchical NC modes' which improve the behaviors of distorted elements effectively. The last group is 'higher order NC modes' which improve the behaviors of plate-bending elements. When the basic NC modes are combined with hierarchical or higher order NC modes, the elements become insensitive to mesh distortions. When the membrane component of a flat shell has 'hierarchical NC modes', the membrane locking can be suppressed. A number of numerical tests are carried out to show the positive effect of aforementioned various NC modes incorporated into various types of finite elements.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.5
• /
• pp.196-208
• /
• 2005

In multiprocessor systems, interconnection network design is critical for overall system performance. Popular interconnection networks, which are generally considered, are meshes, rings, and hierarchical rings. In this paper, we propose (')Torus Ring('), which is a modified version of hierarchical ring. Torus Ring has the same complexity as the hierarchical rings, but the only difference is the way it connects the local rings. It has an advantage over the hierarchical rings when the destination of a packet is the neighbor local ring in the reverse direction. Though the average number of hops in Torus Ring is equal to that of the hierarchical rings when assuming the uniform distribution of each transaction, the benefits of the number of hops are expected to be larger because of the spatial locality in the real environment of parallel programming. In the simulation results, latencies in the interconnection network are reduced by up to 19$\%$, and the execution times are reduced by up to 10$\%$.

• Management Science and Financial Engineering
• /
• v.6 no.2
• /
• pp.29-45
• /
• 2000

We consider the design of a two-level telecommunication network having logical full-mesh/star topology, with the implementation of conduit systems taken together. The design problem is then viewed as consisting of three subproblems: locating hub facilities, placing a conduit network, and installing cables therein to configure the logical full-mesh/star network. Without partitioning into subproblems as done in the conventional approach, the whole problem is directly dealt with in a single integrated framework, inspired by some recent successes with the approach. We successfully formulate the problem as a variant of the classical multicommodity flow model for the fixed charge network design problem, aided by network augmentation, judicious commodity definition, and some flow restrictions. With our optimal model, we solve some randomly generated sample problems by using CPLEX MIP program. From the computational experiments, it seems that our model can be applied to the practical problem effectively.

• Korean Journal of Computational Design and Engineering
• /
• v.7 no.2
• /
• pp.121-130
• /
• 2002

The concept of Level Of Detail (LOD) was introduced and has been used to enhance display performance and to carry out certain engineering analysis effectively. We would like to use an adequate complexity level for each geometric model depending on specific engineering needs and purposes. Solid modeling systems are widely used in industry, and are applied to advanced applications such as virtual assembly. In addition, as the demand to share these engineering tasks through networks is emerging, the problem of building a solid model of an appropriate resolution to a given application becomes a matter of great necessity. However, current researches are mostly focused on triangular mesh models and various operators to reduce the number of triangles. So we are working on the multi-resolution of the solid model itself, rather than that of the triangular mesh model. In this paper, we propose multi-resolution representation of B-rep model by reordering and converting design features into an enclosing volume and subtractive features.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.6
• /
• pp.511-520
• /
• 2009

In this paper, we present a new iso-density surface reconstruction scheme based on a hierarchy on the input volume data and the output mesh data. From the input volume data, we construct a hierarchy of volumes, called a volume pyramid, based on a 3D dilation filter. After constructing the volume pyramid, we extract a coarse base mesh from the coarsest resolution of the pyramid with the Cell-boundary representation scheme. We iteratively fit this mesh to the iso-points extracted from the volume data under O(3)-adjacency constraint. For the surface fitting, the shrinking process and the smoothing process are adopted as in the SWIS (Shrink-wrapped isosurface) algorithm[6], and we subdivide the mesh to be able to reconstruct fine detail of the isosurface. The advantage of our method is that it generates a mesh which can be utilized by several multiresolution algorithms such as compression and progressive transmission.

• Structural Engineering and Mechanics
• /
• v.38 no.4
• /
• pp.529-547
• /
• 2011

This paper presents the global-local finite cover method (GL-FCM) that is capable of analyzing structures involving local heterogeneities and propagating cracks. The suggested method is composed of two techniques. One of them is the FCM, which is one of the PU-based generalized finite element methods, for the analysis of local cohesive crack growth. The mechanical behavior evaluated in local heterogeneous structures by the FCM is transferred to the overall (global) structure by the so-called mortar method. The other is a method of mesh superposition for hierarchical modeling, which enables us to evaluate the average stiffness by the analysis of local heterogeneous structures not subjected to crack propagation. Several numerical experiments are conducted to validate the accuracy of the proposed method. The capability and applicability of the proposed method is demonstrated in an illustrative numerical example, in which we predict the mechanical deterioration of a reinforced concrete (RC) structure, whose local regions are subjected to propagating cracks induced by reinforcement corrosion.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1992.10a
• /
• pp.39-44
• /
• 1992

This paper is concerned with formulations of the hierarchical $C^{o}$-plate element on the basis of Reissner-Mindlin plate theory. On reason for the development of the aforementioned element is that it is still difficult to construct elements based on h-version concepts which are accurate and stable against the shear locking effects. An adaptive mesh refinement and selective p-distribution of the polynomial degree using hp-version of the finite element method we proposed to verify the superior convergence and algorithmic efficiency with the help of the clamped L-shaped plate problems.s.