• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.727-729
• /
• 2001

인터넷 사용이 보편화되면서 많은 사용자의 요청이 있더라도 만족할 만한 서비스를 제공할 수 있는 웹 서버가 필요로 하게 되었다. 이로 인해 최근 가상서버를 이용한 웹 서버 클러스터의 구축사례가 늘고 있다. 리눅스 운영체제와 값 싼 일반 PC를 이용하여 추가적인 비용 부담이 덜하고, IP Tunneling과 Direct Routing 같은 방법을 사용하여 후면 서버가 사용자에게 직접 응답할 수 있으므로 전면 서버의 병목현상을 줄일 수 있는 장점이 있다. 그러나 한 대의 전면 서버로는 그 한계가 있다. 그래서 본 논문에서는 전면 서버와 후면 서버의 구분을 없애고 모든 서버가 전면 서버와 후면 서버의 역할을 다 할 수 있는 웹 서버 클러스터를 제시한다. 다수의 전면 서버를 두어 전면 서버의 고가용성도 보장할 수 있고, 병목현상에 대해 좀 더 효율적인 대응을 할 수 있으며, 시스템 추가에 대한 손쉬운 확장성을 보장할 수 있다. 각 노드의 부하 정보에 의한 스케쥴링을 통해 좀 더 효율적인 클러스터 시스템을 구성하였다.

• Journal of information and communication convergence engineering
• /
• v.16 no.4
• /
• pp.264-270
• /
• 2018

In our research study, we aim at optimizing multiple load in cloud, effective resource allocation and lesser response time for the job assigned. Using Hadoop on datacenter is the best and most efficient analytical service for any corporates. To provide effective and reliable performance analytical computing interface to the client, various cloud service providers host Hadoop clusters. The previous works done by many scholars were aimed at execution of workflows on Hadoop platform which also minimizes the cost of virtual machines and other computing resources. Earlier stochastic hill climbing technique was applied for single parameter and now we are working to optimize multiple parameters in the cloud data centers with proposed heuristic hill climbing. As many users try to priorities their job simultaneously in the cluster, resource optimized workflow scheduling technique should be very reliable to complete the task assigned before the deadlines and also to optimize the usage of the resources in cloud.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2021.11a
• /
• pp.128-130
• /
• 2021

Smart cities collect data from thousands of IoT-based sensor devices for intelligent application-based services. Centralized cloud servers support application tasks with higher computation resources but introduce network latency. Fog layer-based data centers bring data processing at the edge, but fewer available computation resources and poor task allocation strategy prevent real-time data analysis. In this paper, tasks generated from devices are distributed as high resource and low resource intensity tasks. The novelty of this research lies in deploying a virtual node assigned to each cluster of IoT sensor machines serving a joint application. The node allocates tasks based on the task intensity to either cloud-computing or fog computing resources. The proposed Task Allocation Strategy provides seamless allocation of jobs based on process requirements.

• KIPS Transactions on Computer and Communication Systems
• /
• v.4 no.11
• /
• pp.369-382
• /
• 2015

Energy aware server clusters aim to reduce power consumption at maximum while keeping QoS(quality of service) compared to energy non-aware server clusters. They adjust the power mode of each server in a fixed or variable time interval to activate only the minimum number of servers needed to handle current user requests. Previous studies on energy aware server cluster put efforts to reduce power consumption or heat dissipation, but they do not consider energy efficiency well. In this paper, we propose an energy efficient cluster management method to improve not only performance per watt but also QoS of the existing server power mode control method based on autonomous learning. Our proposed method is to adjust server power mode based on a hybrid approach of autonomous learning method with multi level thresholds and power consumption prediction method. Autonomous learning method with multi level thresholds is applied under normal load situation whereas power consumption prediction method is applied under abnormal load situation. The decision on whether current load is normal or abnormal depends on the ratio of the number of current user requests over the average number of user requests during recent past few minutes. Also, a dynamic shutdown method is additionally applied to shorten the time delay to make servers off. We performed experiments with a cluster of 16 servers using three different kinds of load patterns. The multi-threshold based learning method with prediction and dynamic shutdown shows the best result in terms of normalized QoS and performance per watt (valid responses). For banking load pattern, real load pattern, and virtual load pattern, the numbers of good response per watt in the proposed method increase by 1.66%, 2.9% and 3.84%, respectively, whereas QoS in the proposed method increase by 0.45%, 1.33% and 8.82%, respectively, compared to those in the existing autonomous learning method with single level threshold.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1804-1820
• /
• 1997

In this paper, an efficient call control procedure is presented for next generation wireless ATM networks and its performance is mathematically analyzed using the open queueing network. This procedure is based on a new scheme called as the cell clustering. When we use the cell clustering scheme, at the time that a mobile connection is admitted to the network, a virtual cell is constructed by choosing a group of neighboring base stations to which the call may probabilistically hand over and by assigning to the call a collection of virtual paths between the base stations. Within a microcell/picocell environment, it is seen that the cell clustering can support effectively a very high rate of handovers, provides very high system capacity, and guarantees a high degree of frequency reuse over the same geographical region without requiring the intervention of the network call control processor each time a handover occurs. But since mobiles, once admitted, are free to roam within the virtual cell, overload condition occurs in which the number of calls to be handled by one base station to exceed that cell site's capacity of radio channel. When an overload condition happens, the quality of service is abruptly degraded. We refer to this as the overload state and in order to quantify the degree of degradation we define two metrics, the probability of overload and the normalized average time spent in the overload state. By using the open network queueing model, we derive closed form expressions for the maximum number of calls that can be admitted into the virtual cell such that the two defined metrics are used as the acceptance criteria for call admission control.

• Journal of the Korean Geographical Society
• /
• v.41 no.1 s.112
• /
• pp.1-21
• /
• 2006

Abstract The purpose of this paper is to analyze production and innovation networks of manufacturers in the rural, long-live areas of Gangwon Jeju and to suggest an ideal regional development model of rural areas in the knowledge-based information age. For this purpose, we compared the areas of Gangwon Jeju with the long-live belt areas in the rural pan of the Honan region and Gwangju Jeonju, the urban part of Honam. The findings from the study are summarized as follows. Firstly, the stronger the local networks in terms of supply of the necessary input materials and labor, the more successful the manufacturing industry is in the given area. Secondly, the more diverse and lasting the networks (in terms of the location of manufacturers, local area and national area) and cooperation agents(businesses, research institutions, the local government, the central government) they have, the more prosperous the manufacturing industry is. These results indicate that the successful development model for rural areas requires that we take the approach of fostering potential innovation capabilities of total areas by fully utilizing their innate resources so as to create an internal cooperative network and further build extensive networks encompassing external entities to create a virtual innovation cluster.

• The KIPS Transactions:PartA
• /
• v.14A no.2
• /
• pp.99-106
• /
• 2007

Grid computing, a mechanism which uses heterogeneous systems that are geographically distributed, draws attention as a new paradigm for the next generation operation of parallel and distributed computing. The importance of grid computing concerning communication cost is very huge because grid computing furnishes uses with integrated virtual computing service, in which a number of computer systems are connected by a high-speed network. Therefore, to reduce the execution time, the scheduling algorithm in grid environment should take communication cost into consideration as well as computing ability of resources. However, most scheduling algorithms have not only ignored the communication cost by assuming that all tasks were dealt in one cluster, but also did not consider the overhead of communication cost when the tasks were processed in a number of clusters. In this paper, the functions of original scheduling algorithms are analyzed. More importantly, the functions of algorithms are compared and analyzed with consideration of communication cost within the co allocation environment, in which a task is performed separately in many clusters.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.36 no.2
• /
• pp.185-194
• /
• 2008

In this paper, an efficient technique is proposed to integrate the 3D user interface with the tiled display system in PC cluster environment. In the developed 3D user interface software, various menus are provided to increase the user friendliness of the interface, including the several model-control-commands. To eliminate the noise produced from the 3D user interface devices, the box filtering algorithm is employed. Further, a communication splitting algorithm, which is a kind of asynchronous communication method, is proposed to reduce the motion delay between the 3D interface and the tiled display system, and its efficiency is validated through the benchmarking tests.

• Journal of Korea Water Resources Association
• /
• v.46 no.5
• /
• pp.439-447
• /
• 2013

The applicability of the parameter map of the Modified Bartlett-Lewis Rectangular Pulse (MBLRP) model for the Korean Peninsula was assessed from the perspective of flood prediction. The design rainfalls estimated from the MBLRP model were smaller than those from observed values by 5% to 40%, and the degree of underestimation of design rainfall increases with the increase of the recurrence interval of the design rainfall. The design floods at a virtual watershed estimated using the simulated rainfall time series based on MBLRP model were also smaller than those derived from the observed rainfall time series by 20% to 45%. The degree of underestimation of design flood increases with the increase of the recurrence interval of the design flood.

• Bulletin of the Korean Chemical Society
• /
• v.21 no.7
• /
• pp.720-726
• /
• 2000

The analytic gradient method for the equation-of-motion coupled-cluster singles and doubles (EOM-CCSD) energy has been extended to employ a reduced molecular orbital (MO) space. Not only the innermost core MOs but also some of the outermost virtua l MOs can be dropped in the reduced MO space, and a substantial amount of computation time can be reduced without deteriorating the results. In order to study the magnitudes and trends of the effects of the dropped MOs, the geometries and vibrational properties of the ground and excited states of BF, CO, CN, N2, AlCl, SiS, P2, BCl, AIF, CS, SiO, PN and GeSe are calculated with different sizes of molecular orbital space. The 6-31 G* and the aug-cc-pVTZ basis sets are employed for all molecules except GeSc for which the 6-311 G* and the TZV+f basis sets are used. It is shown that the magnitudes of the drop-MO effects are about $0.005\AA$ in bond lengths and about 1% on harmonic frequencies and IR intensities provided that the dropped MOs correspond to (1s), (1s,2s,2p), an (1s,2s,2p,3s,3p) atomic orbitals of the first, the second, and the third row atoms, respectively. The geometries and vibrational properties of the first and the second excited states of HCN and HNC are calculated by using a drastically reduced virtual MO space as well as with the well defined frozen core MO space. The results suggest the possibility of using a very smalI MO space for qualitative study of valence excited states.