• Title/Summary/Keyword: Load share

Search Result 155, Processing Time 0.036 seconds

Software Architecture for Implementing the Grid Computing of the High Availability Solution through Load Balancing (고가용성 솔루션 구축을 위한 그리드 측면에서의 소프트웨어 아키텍처를 통한 로드밸랜싱 구현)

  • Lee, Byoung-Yup;Park, Jun-Ho;Yoo, Jae-Soo
    • 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.

An Evaluative Analysis of the Referral System for Insurance Patients (보험진료체계 개편의 효과에 대한 연구)

  • Han, Dal-Sun;Kim, Byungy-Ik;Lee, Young-Jo;Bae, Sang-Soo;Kwon, Soon-Ho
    • Journal of Preventive Medicine and Public Health
    • /
    • v.24 no.4 s.36
    • /
    • pp.485-495
    • /
    • 1991
  • This study examined the effects of referral requirements for insurance patients which have been enforced since July 1, 1989 when medical insurance coverage was extended to the whole population except beneficiaries of medical assistance program. The requirements are mainly aimed at discouraging the use of tertiary care hospitals by imposing restrictions on the patient's choice of a medical service facility. The expectation is that such change in the pattern of medical care utilization would produce several desirable effects including increased efficiency in patient care and balanced development of various types of medical service facilities. In this study, these effects were assessed by the change in the number of out-patient visits and bed-days per illness episode and the share of each type of facility in the volume of services and the amount of expenditures after the implementation of the new referral system. The data for analysis were obtained from the claims to the insurance for government and school employees. The sample was drawn from the claims for the patients treated during the first six months of 1989, prior to the enforcement of referral requirements, and those of the patients treated during the first six months of 1990, after the enforcement. The 1989 sample included 299,824 claims (3.6% of total) and the 1990 sample included 332,131 (3.7% of total). The data were processed to make the unit of analysis an illness episode instead of an insurance claim. The facilities and types of care utilized for a given illness episode are defined to make up the pathway of medical care utilization. This pathway was conceived of as a Markov Chain process for further analysis. The conclusion emerged from the analysis is that the enforcement of referral requirements resulted in less use of tertiary care hospitals, and thereby decreased the volume of services and the amount of insurance expenses per illness episode. However, there are a few points that have to be taken into account in relation to the conclusion. The new referral system is likely to increase the use of medical services not covered by insurance, so that its impact on national health expenditures would be different from that on insurance expenditures. The extension of insurance coverage must have inereased patient load for all types of medical service organizations, and this increase may be partly responsible for producing the effects attributed to the new referral system. For example, excessive patient load for tertiary care hospitals may lead to the transfer of their patients to other types of facilities. Another point is that the data for this study correspond to very early phase of the new system. But both patients and medical care providers would adapt themselves to the new system to avoid or overcome its disadvantages for them, so as that its effects could change over time. Therefore, it is still necessary to closely monitor the impact of the referral requirements.

  • PDF

Maximizing Bandwidth Utilization by Sharing Method of SSID Hiding in Multiple Wireless Routers (다중 무선 공유기에서 SSID Hiding 공유 기법을 이용한 대역폭 이용률 극대화)

  • Yoon, Young-Hyo;Kim, Myung-Won;Kwak, Hu-Keun;Chung, Kyu-Sik
    • The KIPS Transactions:PartC
    • /
    • v.15C no.2
    • /
    • pp.111-118
    • /
    • 2008
  • A wireless router is a device which allows several wireless clients to share an internet line using NAT (Network Address Translation). In a school or a small office environment where many clients use multiple wireless routers, a client may select any one of wireless routers so that most clients can be clustered to a small set of the wireless routers. In such a case, there exists load unbalancing problem between clients and wireless routers. One of its result is that clients using the busiest router get poor service. The other is that the resource utilization of the whole wireless routers becomes very low. In order to resolve the problems, we propose a load sharing scheme to maximize network bandwidth utilization based on SSID(Service Set IDentifier) hiding. The proposed scheme keeps checking the available bandwidth of all the possible wireless routers in a time interval and select the most available one. If a new client appears, the most available router is visible to him or her whereas the others are not visible. This is handled by SSID hiding in the proposed scheme. We implemented the proposed scheme with ASUS WL 500G wireless router and performed experiments. Experimental results show the bandwidth utilization improvement compared to the existing method.

The Contact and Parallel Analysis of SPH Using Cartesian Coordinate Based Domain Decomposition Method (Cartesian 좌표기반 동적영역분할을 고려한 SPH의 충돌 및 병렬해석)

  • Moonho Tak
    • Journal of the Korean GEO-environmental Society
    • /
    • v.25 no.4
    • /
    • pp.13-20
    • /
    • 2024
  • In this paper, a parallel analysis algorithm for Smoothed Particle Hydrodynamics (SPH), one of the numerical methods for fluidic materials, is introduced. SPH, which is a meshless method, can represent the behavior of a continuum using a particle-based approach, but it demands substantial computational resources. Therefore, parallel analysis algorithms are essential for SPH simulations. The domain decomposition algorithm, which divides the computational domain into partitions to be independently analyzed, is the most representative method among parallel analysis algorithms. In Discrete Element Method (DEM) and Molecular Dynamics (MD), the Cartesian coordinate-based domain decomposition method is popularly used because it offers advantages in quickly and conveniently accessing particle positions. However, in SPH, it is important to share particle information among partitioned domains because SPH particles are defined based on information from nearby particles within the smoothing length. Additionally, maintaining CPU load balance is crucial. In this study, a highly parallel efficient algorithm is proposed to dynamically minimize the size of orthogonal domain partitions to prevent excess CPU utilization. The efficiency of the proposed method was validated through numerical analysis models. The parallel efficiency of the proposed method is evaluated for up to 30 CPUs for fluidic models, achieving 90% parallel efficiency for up to 28 physical cores.

A Study on the Musical Characteristics of Fishing songs in North Korea (북한 어업노동요의 음악적 특징)

  • Kim, Jeong-Hee
    • (The) Research of the performance art and culture
    • /
    • no.39
    • /
    • pp.279-323
    • /
    • 2019
  • The musical characteristics of Fishing songs in North Korean which recorded on Anthology of North Korean Folk Songs were examined in this paper. The results are as follows. Among Fishing songs in North Korea, there are "Rowing Song," the "Song for Hauling Nets," and the "Song for Picking Up Fish" in songs related to walleye pollack fishing and in songs related to croaker fishing, the "Song for Dropping Anchor" and the "Full-Load-of-Fish Song" in songs related to croaker fishing, the "Song for Weighing Anchor," the "Song for Shaking Fish," the "Full-Load-of-Fish Rowing Song," and the "Song for Hanging Walleye Pollack" in songs related to walleye pollack fishing. There are the "Song for Setting a sail" and the "Song for catching shells" in Fishing songs in North Korea, too. In the rhythmic elements of Fishing songs in North Korea, the tempo of the "Songs for Setting a sail" is moderato, and that of the "Songs for Picking Up Fish" of songs related to anchovy or herring fishing is quite slow. "Rowing Songs"(croaker fishing) have various tempos but faster than moderato, and usually get faster and faster as time goes by. Most songs have 4/♩. time and there are some of 2, 3 or 5 time. Some songs use irregular time or 6 time overlapping 2 beats. The mode Menari is the most common tonal system used in fishing songs of North Korea. And the mode Susimga, the mode Changbutaryeong, the mode Nanbongga, and the mode Odolttogi are also used in the tonal system of Fishing songs in North Korea. There are shoutting intonations that have indefinite pitch, too. Modulation or interaction by the mode Changbutaryeong appeared in songs of the mode Menari. There is a tendency to favor a certain tonal system by category. Responsorial form is mostly used, but in the most cases, they were sung in solo. In responsorial songs, several calling songs overlap with the responding songs. Durchkomponiert form is sung by antiphon or in solo, but the case sung in solo originally seems to have been sung by antiphon or unison, if we consider the procedure of the work. The "Song for Picking Up Fish" of Seonbong-gun of North Hamgyeong Province and Yangyang-gun of Gangwon Province, the "Full-Load-of-Fish Song-Bongjuktaryeong" of Jeungsan-gun of South Pyeongan Province and "Full-Load-of-Fish Song-Baechigisory" of Taean-gun of South Chungcheong Province, "Rowing Song" of Nampo City and Ganghwa-gun of Gyeonggi Province are resembled. In neighboring areas, even if the songs of different categorys, sometimes share a same melody. In a certain category, sometimes a same melody is shared to a considerable distance. It was first identified that in anchovy or herring fishing or dybowskii' sand eel fishing, the "Song for Picking Up Fish" is widely shared in the East Sea Coast area.

Material Characteristics and Deterioration Assessment of the Stone Buddhas and Shrine in Unjusa Temple, Hwasun, Korea (화순 운주사 석조불감의 재질특성과 풍화훼손도 평가)

  • Park, Sung-Mi;Lee, Myeong-Seong;Choi, Seok-Won;Lee, Chan-Hee
    • Journal of Conservation Science
    • /
    • v.24
    • /
    • pp.23-36
    • /
    • 2008
  • The stone Buddhas and Shrine of Unjusa temple (Korea Treasure No. 797) in Hwasun formed in Koryo Dynasty are unique style which the Buddha faces each other the back parts of south and north within the stone Shrine. The stone Buddhas and Shrine are highly evaluated in historical, artistic and academic respects. But, the stone properties have been exposed in the open system various aspects of degradations weathered for a long time without specific protective facilities. The rock materials of the stone Buddhas and Shrine are about 47 blocks, and total press load is about 56.6 metric ton. The host rocks composed mainly of white grey hyaline lithic tuff and rhyolitic tuff breccia. In addition, biotite granite used as part during the restoration works. The chemical index of alteration for host tuffaceous rocks and the replacement granites range from 52.1 to 59.4 and 50.0 to 51.0, respectively. Weathering types for the stone Buddhas and Shrine were largely divided with physical, chemical and biological weathering to make a synthetic deterioration map according to aspects of damage, and estimate share as compared with surface area. Whole deterioration degrees are represented that physical weathering appeared exfoliation. Chemical weathering is black coloration and biological weathering of grey lichen, which show each lighly deterioration degrees. According to deterioration degree by direction of stone Buddhas and Shrine, physical weathering mostly appeared by 39.1% on the sorthern part, and chemical weathering is 61.2% high share on the western part. Biological weathering showed 38.3% the largest distribution on the southern part. Therefore, it is necessary to try hardening for the parts with serious cracks or exfoliations, remove secondary contaminants and organisms through regular cleaning. Also necessary to make a plan to remove moisture of the ground which causes weathering, and estimate that need established and scientific processing through clinical demonstration of conservation plan that chooses suitable treatment.

  • PDF

Efficient Management of Statistical Information of Keywords on E-Catalogs (전자 카탈로그에 대한 효율적인 색인어 통계 정보 관리 방법)

  • Lee, Dong-Joo;Hwang, In-Beom;Lee, Sang-Goo
    • The Journal of Society for e-Business Studies
    • /
    • v.14 no.4
    • /
    • pp.1-17
    • /
    • 2009
  • E-Catalogs which describe products or services are one of the most important data for the electronic commerce. E-Catalogs are created, updated, and removed in order to keep up-to-date information in e-Catalog database. However, when the number of catalogs increases, information integrity is violated by the several reasons like catalog duplication and abnormal classification. Catalog search, duplication checking, and automatic classification are important functions to utilize e-Catalogs and keep the integrity of e-Catalog database. To implement these functions, probabilistic models that use statistics of index words extracted from e-Catalogs had been suggested and the feasibility of the methods had been shown in several papers. However, even though these functions are used together in the e-Catalog management system, there has not been enough consideration about how to share common data used for each function and how to effectively manage statistics of index words. In this paper, we suggest a method to implement these three functions by using simple SQL supported by relational database management system. In addition, we use materialized views to reduce the load for implementing an application that manages statistics of index words. This brings the efficiency of managing statistics of index words by putting database management systems optimize statistics updating. We showed that our method is feasible to implement three functions and effective to manage statistics of index words with empirical evaluation.

  • PDF

A Study on the Demonstration of Yellow Plume Elimination System from Combined Cycle Power Plant Using Liquid Injection System (액상 직분사 시스템을 이용한 복합화력 황연제거 실증 연구)

  • Lee, Seung-Jae;Kim, Younghee
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.21 no.10
    • /
    • pp.317-324
    • /
    • 2020
  • Combined cycle power plants (CCPP) that use natural gas as fuel are easier to start and stop, and have lower pollutant emissions, so their share of domestic power generation facilities is steadily increasing. However, CCPP have a high concentration of nitrogen dioxide (NO2) emission in the initial start-up and low-load operation region, which causes yellow plume and civil complaints. As a control technology, the yellow plume reduction system was developed and operated from the mid-2000s. However, this technology was unable to control the phenomenon due to insufficient preheating of the vaporization system for 10 to 20 minutes of the initial start-up. In this study, CFD analysis and demonstration tests were performed to derive a control technology by injecting a reducing agent directly into the gas turbine exhaust duct. CFD analysis was performed by classifying into 5 cases according to the exhaust gas condition. The RMS values of all cases were less than 15%, showing a good mixing. Based on this, the installation and testing of the demonstration facilities facilitated complete control of the yellow plume phenomenon in the initial start-up.

A Dynamic Transaction Routing Algorithm with Primary Copy Authority (주사본 권한을 이용한 동적 트랜잭션 분배 알고리즘)

  • Kim, Ki-Hyung;Cho, Hang-Rae;Nam, Young-Hwan
    • The KIPS Transactions:PartD
    • /
    • v.10D no.7
    • /
    • pp.1067-1076
    • /
    • 2003
  • Database sharing system (DSS) refers to a system for high performance transaction processing. In DSS, the processing nodes are locally coupled via a high speed network and share a common database at the disk level. Each node has a local memory and a separate copy of operating system. To reduce the number of disk accesses, the node caches database pages in its local memory buffer. In this paper, we propose a dynamic transaction routing algorithm to balance the load of each node in the DSS. The proposed algorithm is novel in the sense that it can support node-specific locality of reference by utilizing the primary copy authority assigned to each node; hence, it can achieve better cache hit ratios and thus fewer disk I/Os. Furthermore, the proposed algorithm avoids a specific node being overloaded by considering the current workload of each node. To evaluate the performance of the proposed algorithm, we develop a simulation model of the DSS, and then analyze the simulation results. The results show that the proposed algorithm outperforms the existing algorithms in the transaction processing rate. Especially the proposed algorithm shows better performance when the number of concurrently executed transactions is high and the data page access patterns of the transactions are not equally distributed.

Improvement of Computational Complexity of Device-to-Device (D2D) Resource Allocation Algorithm in LTE-Advanced Networks (LTE-Advanced 환경에서 D2D 자원 할당 알고리즘의 계산 복잡도 개선)

  • Lee, Han Na;Kim, Hyang-Mi;Kim, SangKyung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.4
    • /
    • pp.762-768
    • /
    • 2015
  • D2D communication as an underlaying LTE-Advanced network has proven to be efficient in improving the network performance and decreasing the traffic load of eNodeB(enhanced NodeB). However large amount of interference can be caused by sharing the resources between the cellular users and D2D pairs. So, a resource allocation for D2D communication to coordinate the interference is necessary. Related works for resource allocation that D2D can reuse the resources of more than one cellular user with best CQI(Channel Quality Indicator) have been proposed. D2D communications may still cause interference to the primary cellular network when radio resource are shared between them. To avoid this problem, we propose a radio resource allocation algorithm with low computational complexity for D2D communication in OFDM-based wireless cellular networks. Unlike the previous works, the proposed algorithm utilizes unused ones of the whole resource. The unused resource allocate to on D2D pair can be shared only with other D2D pairs. In other words, if the distance between the D2D pairs is sufficient, we allowed more than two D2D pairs to share the same resources. The simulation results have proven that the proposed algorithm has up to 11 times lower computational complexity than the compared one according to the number of D2D.