• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.7
• /
• pp.370-379
• /
• 2006

Computational grid provides the environment which integrates v 따 ious computing resources. Grid environment is more complex and various than traditional computing environment, and consists of various resources where various software packages are installed in different platforms. For more efficient usage of computational grid, therefore, some kind of integration is required to manage grid resources more effectively. In this paper, a global scheduler is suggested, which integrates grid resources at meta level with applying various scheduling policies. The global scheduler consists of a mechanical part and three policies. The mechanical part mainly search user queues and resource queues to select appropriate job and computing resource. An algorithm for the mechanical part is defined and optimized. Three policies are user selecting policy, resource selecting policy, and executing policy. These can be defined newly and replaced with new one freely while operation of computational grid is temporarily holding. User selecting policy, for example, can be defined to select a certain user with higher priority than other users, resource selecting policy is for selecting the computing resource which is matched well with user's requirements, and executing policy is to overcome communication overheads on grid middleware. Finally, various algorithms for user selecting policy are defined only in terms of user fairness, and their performances are compared.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.12
• /
• pp.867-879
• /
• 2006

This paper concerns fast and time accurate HW/SW cosimulation for MPSoC(Multi-Processor System-on-chip) architecture where multiple software and/or hardware components exist. It is becoming more and more common to use MPSoC architecture to design complex embedded systems. In cosimulation of such architecture, as the number of the component simulators participating in the cosimulation increases, the time synchronization overhead among simulators increases, thereby resulting in low overall cosimulation performance. Although SystemC cosimulation frameworks show high cosimulation performance, it is in inverse proportion to the number of simulators. In this paper, we extend the novel technique, called virtual synchronization, which boosts cosimulation speed by reducing time synchronization overhead: (1) SystemC simulation is supported seamlessly in the virtual synchronization framework without requiring the modification on SystemC kernel (2) Parallel execution of component simulators with virtual synchronization is supported. We compared the performance and accuracy of the proposed parallel SystemC cosimulation framework with MaxSim, a well-known commercial SystemC cosimulation framework, and the proposed one showed 11 times faster performance for H.263 decoder example, while the accuracy was maintained below 5%.

• Journal of KIISE:Software and Applications
• /
• v.34 no.5
• /
• pp.397-406
• /
• 2007

The problem of finding an optimal alignment between sequence A and B can be solved by dynamic programming algorithm(DPA) efficiently. But, if the length of string was longer, the problem might not be solvable because it requires O(m*n) time and space complexity.(where, $m={\mid}A{\mid},\;n={\mid}B{\mid}$) For space, Hirschberg developed a linear space and quadratic time algorithm, so computer memory was no longer a limiting factor for long sequences. As computers's processor and memory become faster and larger, a method is needed to speed processing up, although which uses more space. For this purpose, we present an algorithm which will solve the problem in quadratic time and linear space. By using division method, It computes optimal alignment faster than LSA, although requires more memory. We generalized the algorithm about division problem for not being divided into integer and pruned additional space by entry/exit node concept. Through the proofness and experiment, we identified that our algorithm uses d*(m+n) space and a little more (m*n) time faster than LSA.

• Journal of KIISE:Software and Applications
• /
• v.34 no.10
• /
• pp.900-909
• /
• 2007

This paper describes an experiment on the evaluation of human sensibility by monitoring responses to changes In the frequency and amplitude of a tactile display system. Preliminary tasks were performed to obtain effective adjectives concerning texture perception. The number of collected adjectives was originally 33. This number of adjectives was reduced to 14 by a suitability survey that asked whether an adjective is suitable for expressing a texture feeling. Finally after performing a semantic similarity evaluation, the number of adjectives was further reduced to ten and these ten were used in the main experiment. In the main experiment, selected sandpaper types and 15 selected combinations of frequencies and amplitudes of a tactile display were utilized to quantitatively evaluate the ten adjectives using a bipolar seven-point scale. The data show that a relationship exists between the independent variables(frequency, amplitude, and grit site) and the dependent variable(perceived texture). That is, the change of frequency and amplitude is directly related to perceived roughness or essential elements of human tactile sensitivity found in the preliminary experiment.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.10
• /
• pp.397-406
• /
• 2014

In order to answer the questions successfully on behalf of the human in DeepQA environments such as Jeopardy! of the American quiz show, the computer is required to have the capability of fast temporal and spatial reasoning on a large-scale commonsense knowledge base. In this paper, we present a scalable spatial reasoning algorithm for deriving efficiently new directional and topological relations using the MapReduce framework, one of well-known parallel distributed computing environments. The proposed reasoning algorithm assumes as input a large-scale spatial knowledge base including CSD-9 directional relations and RCC-8 topological relations. To infer new directional and topological relations from the given spatial knowledge base, it performs the cross-consistency checks as well as the path-consistency checks on the knowledge base. To maximize the parallelism of reasoning computations according to the principle of the MapReduce framework, we design the algorithm to partition effectively the large knowledge base into smaller ones and distribute them over multiple computing nodes at the map phase. And then, at the reduce phase, the algorithm infers the new knowledge from distributed spatial knowledge bases. Through experiments performed on the sample knowledge base with the MapReduce-based implementation of our algorithm, we proved the high performance of our large-scale spatial reasoner.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.3
• /
• pp.147-160
• /
• 2010

The system virtualization shows interest in the consolidation of servers for the efficient utilization of system resources. There are many various researches to utilize a server machine more efficiently through the system virtualization technique, and improve performance of the virtualization software. These researches have studied with the activity to control the resource allocation of virtual machines dynamically focused on CPU, or to manage resources in the cross-machine using the migration. However, the researches of the memory management have been wholly lacking. In this respect, the use of memory is limited to allocate the memory statically to virtual machine in server consolidation. Unfortunately, the static allocation of the memory causes a great quantity of the idle memory and decreases the memory utilization. The underutilization of the memory makes other side effects such as the load of other system resources or the performance degradation of services in virtual machines. In this paper, we suggest the dynamic allocation of the memory in Xen to control the memory allocation of virtual machines for the utilization without the performance degradation. Using AR model for the prediction of the memory usage and ACO (Ant Colony Optimization) algorithm for optimizing the memory utilization, the system operates more virtual machines without the performance degradation of servers. Accordingly, we have obtained 1.4 times better utilization than the static allocation.

• The Journal of the Korea Contents Association
• /
• v.11 no.3
• /
• pp.26-35
• /
• 2011

In these days, internet environment are very quickly development as well on-line service have been using a online for the mission critical business around the world. As the amount of information to be processed by computers has recently been increased there has been cluster computing systems developed by connecting workstations server using high speed networks for high availability. but cluster computing technology are limited for a lot of IT resources. So, grid computing is an expanded technology of distributed computing technology to use low-cost and high-performance computing power in various fields. Although the purpose of Grid computing focuses on large-scale resource sharing, innovative applications, and in some case, high-performance orientation, it has been used as conventional distributed computing environment like clustered computer until now because grid middleware does not have common sharable information system. In order to use grid computing environment efficiently which consists of various grid middleware, it is necessary to have application-independent information system which can share information description and services, and expand them easily. This paper proposed new database architecture and load balancing for high availability through Grid technology.

• Journal of Korean Ophthalmic Optics Society
• /
• v.6 no.1
• /
• pp.13-29
• /
• 2001

A mathematical model was proposed to analyze the vibration of diaphragm, such as the contact lenses fitted on the eyes, being subjected to the external sinusoidal pressure. The model incorporates the differential equations and their numerical solution program, based on the wave equations. Turbo-C and graphic software, formulated to describe the dependence of the various parameters involved in the vibration. The model predicts the radial distribution of amplitude, frequency dependence of both average displacement amplitude and the power of diaphragm whose edge is being either simply supported or rigidly clamped in vibration. The effect of variables such as thickness, radius, damping coefficients on the vibration characteristics was illustrated by the computer simulation of the derived program. As the frequency of driving pressure increases above the certain value determined by the boundary conditions and parameters the wave shape or pattern changes from simple arc to belly or loops having double antinode. It seems that the effect of outer antinode progressively increases as the frequency increases. If this kind of phenomena occurs to the contact lens on the cornea in vivo, it may cause an abnormal correction power in the lenses or pull off the eye due the increased rise of outer part of the lens.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.5 no.3
• /
• pp.71-84
• /
• 1985

Using a saturated-unsaturated transient flow equation the change of hydraulic heads within a dike due to tidal fluctuation is investigated in this study. The calculation is done by the use of a software computer program called FLUMP, which is based on a FEM technique and useful to the analyses of unsaturated flow problems. Some of the program has been supplemented in this study for the application to the rise of a tide. It is assumed that a dike is composed of two materials, that the tide rises and falls with a constant amplitude of 10 meters, and that water tables are located at 0m, 5m, and lam from the minimum tidal level. For these conditions the hydraulic heads are calculated for 8 cycles(96 hours) of tidal changes. It is known from the analysis that the hydraulic heads change with tidal level in some extent and that the amplitudes of the head varies depending on the location within the dike: the maximum amplitude shows near the toe of the dike, the amplitude decreases with increasing distance from the upstream face, and beyond a certain location the heads are unaffected by the tidal differences. Assuming that the dike has been completed in a moment the hydraulic heads are nearly stabilized in 96 hours towards some constant values corresponding to a specified water table.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.38 no.9
• /
• pp.781-787
• /
• 2014

A pressurized wire mesh heating reactor (PWMR) can provide high pressure and temperature experimental conditions up to 50 atm and 1750 K, respectively. This equipment was developed to evaluate the intrinsic reaction kinetics of $CO_2$ gasification. A PWMR utilizes a platinum (Pt) wire mesh resistance to generate heat with a direct current (DC) electricity supply. This DC power supply can then be controlled by computer software to reach the exact expected terminal temperature and heating period. In this study, BERAU (sub-bituminous Indonesian coal) was pulverized then converted into char with a particle size of $90-150{\mu}m$. This was used in experiments with various pressures (1-40 atm) and temperatures (1373-1673 K) under atmospheric conditions. The internal and external effectiveness factor was analyzed to determine the effects of high pressure. The intrinsic reaction kinetics of BERAU char was obtained using $n^{th}$ order reaction rate equations. The value was determined to be 203.8kJ/mol.