• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.11
• /
• pp.2404-2410
• /
• 2011

This paper describes the design overview of cluster file system $SANique^{TM}$ based on SAN(Storage Area Network) environment. The design issues and problems of the conventional global buffer manager are also illustrated under a large set of clustered computing hosts. We propose the efficient global buffer management method that provides the more scalability and availability. In our proposed global buffer management method, we reuse the maintained list of lock information from our cluster lock manager. The global buffer manger can easily find and determine the location of requested data block cache based on that lock information. We present the pseudo code of the global buffer manager and illustration of global cache operation in cluster environment.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04a
• /
• pp.79-81
• /
• 2002

최근에는 ATM, Fast Switched LAN, Fiber Channel과 같은 고속의 네트워크의 발달로 인해 분산 환경의 네트워크 파일 시스템에서 디스크를 접근하는 속도보다 원격지 클라이언트의 메모리를 접근하는 속도가 현저하게 증가되었다. 실제로 이와 같은 고속 네트워크 환경을 기반으로 하여 각 서버와 저장 장치를 분리하여 대용량 데이터를 관리하는 SAN(Storage Area Network)과 같은 새로운 네트워크 저장 시스템이 출연하고 있다. 본 논문에서는 이와 같은 새로운 분산 네트워크 파일 저장 시스템 환경에서 필수적으로 고려되어야 하는 광역 버퍼관리기를 설계 및 구현하였다. 본 논문에서 구현된 광역 버퍼 관리기는 크게 데이터 룩업과 버퍼리스트 관리 부분으로 나누어 구성되어 있으며, 이를 위한 적절한 자죠 구조와 시스템 내에 있는 각 호스트간의 버퍼블록정보 유지를 위한 방안 및 기존 운영체제의 커널내 버퍼 관리기와 통합하는 방안을 제시한다.

• The Journal of the Korea Contents Association
• /
• v.9 no.10
• /
• pp.258-267
• /
• 2009

This study purposed to develop GIS model for evaluating hospital location in a metropolitan city. Secondly, the suitability score of hospital was compared with the number of outpatient/inpatients of hospitals. This study used administrative data collected from the annual report of the 5 ward offices from Daejeon in Korea in 2004. 7 Acute care hospitals operated in Daejeon in 2004 were selected for the analysis. The suitability of hospitals in a metropolitan city was evaluated by the economic factors which were assumed to influence the health care demand. Each criterion was measured from each Dong. Correlation coefficients between the suitability score of hospital and the number of patients were varied depending on the buffering size. The relationship showed positive relationship with the number of inpatient (0.15) and outpatients (0.10) on the 0.5km buffering size. However, the correlation coefficients were changed to a negative direction or decreased when the buffering size was increased to 1.0km, 1.5km, and 2.0km.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.14 no.6
• /
• pp.1109-1120
• /
• 2019

In the field of VLBI, If the quality of the connected network between the VLBI station and the correlation center is ensured, the existing inefficiency of repeatedly storing the observation data in each station and the correlation center can be overcome. In other words, the data center can be unified with the correlation center where data analysis is performed, which can improve data processing speed and productivity. In this paper, we design a massive VLBI data system that directly transmits and stores the observation data stream obtained from the VLBI station to the correlation center via the high - speed network KREONET. Based on this system, VLBI test observations confirmed that the observation data was stored perfectly in the recording system of the correlation center without a single packet loss.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.6
• /
• pp.583-591
• /
• 2000

Caching mechanisms have been studied extensively to buffer the speed gap of hierarchical storages in the context of cache memory, paging system, and buffer management system. As the wide-area distributed environments such as the WWW extend broadly, caching of remote objects becomes more and more important. In the wide-area distributed environments, the cost and the benefit of caching an object is not uniform due to the location of the object; which should be considered in the cache replacement algorithms. For online operation, the time complexity of the replacement algorithm should not be excessive. To date, most replacement algorithms for the wide-area distributed environments do not meet both the non-uniformity of objects and the time complexity constraint. This paper proposes a replacement algorithm which considers the non-uniformity of objects properly; it also allows for an efficient implementation. Trace-driven simulations show that proposed algorithm outperforms existing replacement algorithms.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.41 no.5
• /
• pp.9-18
• /
• 2013

Urban parks are public spaces that provide various services for any urban resident to use and enjoy. Parks should be fairly distributed so that the urban parks can be equally used amongst different regions, generations and classes. Researches on spatial distribution of urban parks have been continuously conducted from the past based on the principles of fairness with variety, and it was evident that their techniques have become more elaborate and sophisticated. Yet, there have been limitations in the analysis of residents who are the main users of the urban parks. The research done so far was unable to apply the real number of the residents and it was carried out by only classifying and analyzing the population by the same scale(grid in the same sizes), postal(zip) code and administrative district. The actual population that resides within the usable range of urban parks was not used. This study analyzes and evaluates the spatial distribution that the residents can use on foot, by utilizing the service areas and the residents' registration data by addresses. In this study, to analyze the square measure of the service areas of neighborhood parks in Daegu Metropolitan City and the number of residents within and outside of the service area, network analysis techniques were employed and the residents' registration data were utilized. Major findings were that the Square measure of service areas of neighborhood parks turned out to be 31.23% of the square measure of the residential areas and also, that only 43.03% of the population of the Daegu Metropolitan area lives within the service areas of the neighborhood parks.

• Korean Journal of Construction Engineering and Management
• /
• v.21 no.1
• /
• pp.21-31
• /
• 2020

Recently, interest and financial investment in community infrastructure have been growing. Accordingly, Korean Ministry of Land, Infrastructure and Transport suggested a standard for community infrastructure planning. The standard was based on time distance which represents citizens' accessibility to infrastructure facilities. This paper presents a method to use the navigation application programming interface (API) to calculate travel time. Buffer analysis using Euclidean distance has been widely used so far to evaluate accessibility. However, this method has limitation in that it does not reflect situations in the real world such as crosswalks and slope ways. The infrastructure accessibility indices of local towns in Yeonsu-gu, Incheon were computed based on the time obtained by navigation API. Also, Yeonsu-gu was spatially analyzed to reveal the resident units that are marginalized from community infrastructure facilities. Using navigation API enables to compute realistic accessibility indices and to find unbenefitted residential areas. The method presented in this paper can help community infrastructure planners for their facility spatial plan and budget distribution.

• Journal of Korea Multimedia Society
• /
• v.13 no.1
• /
• pp.38-46
• /
• 2010

A stable game managing system is absolutely needed to accept simultaneous interlacing of many users for on- line game system. The proposed P2P on-line game system in this paper is able to get stable and real-time game managing within limited time stamp utilizing through reorganizing peers according to synchronous time which can be avoid congestion on one region, it is possible to synchronize for game nodes within limited time stamp utilizing. Reorganizing M-tree which leads 10 distribute loads. The system manages each region unit, and it is execute no matter how big game sizes are. Thus to ensure such as the problems of expand server and stabilization or message transmission. Also, prove efficiency of the suggested system through the simulation.

• Journal of Korea Multimedia Society
• /
• v.12 no.3
• /
• pp.345-353
• /
• 2009

It is for sure that a stable game managing system is absolutely needed to accept simultaneous interfacing of many users for P2P on-line game system. The proposed P2P on-line game system in this paper is able to get smart and stable game managing taking care of extensive players through reorganizing numerous RS(Region Server) and mutual communications among RS's which can be avoid congestion on one region. Moreover, it is possible to synchronize for game nodes in time stamp utilizing Global Zone Buffer of Monitoring Server which leads to breakup loads. The system manages middleware layers in the so-called sub area, and it is able to execute no matter how big the game sizes are. That means, in some ways, we got everything we try to ensure such as the problems of high cost server and stabilization of message transmission. This paper welcomes to prove efficiency of the suggested system through the simulation.

• Journal of the Korea Society of Computer and Information
• /
• v.7 no.2
• /
• pp.101-114
• /
• 2002

The real multimedia application in wide area communication needs the guaranteed performance of communication service. Therefore, the resource is reserved at the moment of traffic burst and the region of connection admission possibility is widened at the basis of maximum cell rate. This of study shows that the end-to-end traffic delay to the traffic of burst state is guaranteed when the total of maximum transmission rate is higher than link speed by using the region of deterministic delay. The network load rate of connection admission can be improved by the inducement of delay bounds consideration each traffic characteristic to guarantee the end-to-end delay of network from single switch. This suggested buffering system using deterministic service do not give any influence to service quality and can guarantee the bounds of end-to-end delay. And it can also reduce the load of network even if the delay is increased according to the burst traffic characteristic. The above suggested system can be applied effectively to the various kinds of general network specification which admit both real time trafnc service and non-real time traffic service.