• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.11
• /
• pp.1031-1040
• /
• 2010

Hash join is one of the core algorithms in databases management systems. If a hash join cannot complete in one-pass because the available memory is insufficient (i.e., hash table overflow), however, it may incur a few sequential writes and excessive random reads. With harddisk as the tempoary storage for hash joins, the I/O time would be dominated by slow random reads in its probing phase. Meanwhile, flash memory based SSDs (flash SSDs) are becoming popular, and we will witness in the foreseeable future that flash SSDs replace harddisks in enterprise databases. In contrast to harddisk, flash SSD without any mechanical component has fast latency in random reads, and thus it can boost hash join performance. In this paper, we investigate several important and practical issues when flash SSD is used as tempoary storage for hash join. First, we reveal the va patterns of hash join in detail and explain why flash SSD can outperform harddisk by more than an order of magnitude. Second, we present and analyze the impact of cluster size (i.e., va unit in hash join) on performance. Finally, we emperically demonstrate that, while a commerical query optimizer is error-prone in predicting the execution time with harddisk as temporary storage, it can precisely estimate the execution time with flash SSD. In summary, we show that, when used as temporary storage for hash join, flash SSD will provide more reliable cost estimation as well as fast performance.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.6
• /
• pp.71-75
• /
• 2008

The big issue according to the advance of wireless internet is the design of on-line game under mobile computing environment. The current mobile games have constraints in implementation of on-line game due to the low performance processor. small memory size and short battery time. Therefore, nowadays one-button games which are simple and easy to manipulate, have attracted great interests. In this paper, we designed and implemented the trandition Jeki-chaki game, which is a kind of one-line game, using a mobile handset.

• Proceedings of the KIEE Conference
• /
• 1991.07a
• /
• pp.695-698
• /
• 1991

In this paper tried the estimation of parameter using of Cal-Sal functions. System equation given by the linear differential equation is converted into the integral equation, operation matrix for integral of Cal-Sal functions is used to find the estimation of parameter on the given system. Converting linear differential equation to linear algebraic equation, the method presented here computing time and required memory size can be reduced. Therefore real time data process can be possible.

• Proceedings of the KIEE Conference
• /
• 1991.07a
• /
• pp.426-431
• /
• 1991

Diakoptic method applied to analyze large power system, always require the efficient tearing algorithm. But conventional tearing methods is not suitable to apply practical power system. This paper presents new tearing algorithm based on factorization path concept of sparse vector method, and applied MPRLD, a kind of optimal ordering algorithm, in ordering step to improve the efficiency of tearing algorithm. Test result of model systems shows that new proposed method in this paper is enable to tear power systems not to be teared by heuristic cluster method, reduces computing time and memory size.

• Proceedings of the KIEE Conference
• /
• 1992.07b
• /
• pp.573-576
• /
• 1992

This paper presents a method, which couples the boundary integral terms in the thin magnetic materials with standard FEM used to analyze the rest of it, for analyzing the magnetic fields. The proposed method retains the sparsity and symmetry of the final system matrix, the merits of standard FEM and eliminates the need for fininte elements in the thin magnetic materials, thereby reducing necessary capacity of computer memory and computing time. To verify the usefulness of the proposed alogorithmn, an examples, coil with source currents and thin magnetic materials, is chosen and analyzed. the results are compared with those of the standard FEM by coarse mesh and the proposed method, using standard FEM by fine mesh as a reference.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.627-628
• /
• 2008

This paper proposes an indoor air Quality monitoring system for measuring various indoor air qualities using IEEE 802.15.4 based wireless sensor network. For indoor air quality monitoring, sensor nodes include carbon monoxide sensor and dust sensor were used. The wireless network by deployed sensor nodes has limited energy, computing, communication capabilities and memory sizes. In this paper, the query process in indoor air quality monitoring was designed to improve the limited sensor node resources such as battery consumption and networking.

• Proceedings of the Korean Reliability Society Conference
• /
• 2002.06a
• /
• pp.289-296
• /
• 2002

The traditional methods of evaluating the performance of a network by enumerating all possible states may quickly become computationally prohibitive, since the number of states grows exponentially as the number of components increases. In such cases, enumerating only the most probable states would provide a good approximation. In this paper, we propose a method which efficiently generates upper and lower bounds for coherent performance measures utilizing the most probable states. Compared with Yang and Kubat's method, our procedure significantly reduces the complexity and memory requirement per iteration for computing the bounds and thereby, achieves the given degree of accuracy or the coverage within a shorter time.

• IEIE Transactions on Smart Processing and Computing
• /
• v.5 no.5
• /
• pp.331-336
• /
• 2016

Multi-bit tries have been proposed to improve the search performance of a binary trie by providing flexibility in stride values, which identify the number of bits examined at a time. However, constructing a variable-stride multi-bit trie is challenging since it is not easy to determine a proper stride value that satisfies the required performance at each node. The aim of this paper is to identify several desired characteristics of a trie for IP address lookup problems, and to propose a multi-stride decision trie that has these characteristics. Simulation results using actual routing sets with about 30,000 to 220,000 prefixes show that the proposed multi-stride decision trie has the desired characteristics and achieves IP address lookup using 33% to 47% of the 2-bit trie in the average number of node accesses, while requiring a smaller amount of memory.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.298-302
• /
• 2009

This paper proposes a single sign-on scheme in which a mobile user offers his credential information to a home network running the OSGi (Open Service Gateway Initiative) service platform, to obtain user authentication and control a remote device through a mobile device using this authentication scheme, based on SAML (Security Assertion Markup Language). Especially by defining the single sign-on profile to overcome the handicap of the low computing and memory capability of the mobile device, we provide a clue to applying automated user authentication to control a remote device via a mobile device for distributed mobile environments such as a home network based on OSGi.

• International Journal of Aeronautical and Space Sciences
• /
• v.2 no.1
• /
• pp.20-27
• /
• 2001

Aerodynamic sensitivity analysis is performed for the Navier-Stokes equations coupled with two-equation turbulence models using a discrete adjoint method and a direct differentiation method respectively. Like the mean flow equations, the turbulence model equations are also hand-differentiated to accurately calculate the sensitivity derivatives of flow quantities with respect to design variables in turbulent viscous flows. The sensitivity codes are then compared with the flow solver in terms of solution accuracy, computing time and computer memory requirements. The sensitivity derivatives obtained from the sensitivity codes with different turbulence models are compared with each other. The capability of the present sensitivity codes to treat complex geometry is successfully demonstrated by analyzing the flows over multi-element airfoils on Chimera overlaid grid systems.