• Title/Summary/Keyword: data locality

Search Result 237, Processing Time 0.026 seconds

Analysis of Discontinuity Distribution Property to Predict Rock Slope Failure (암반 사면의 파괴 예측을 위한 불연속면 분포 특성 분석)

  • 윤운상;김정환;배기훈
    • Proceedings of the Korean Geotechical Society Conference
    • /
    • 1999.10a
    • /
    • pp.147-152
    • /
    • 1999
  • Distribution of fracture system is an important factor to analyse instability of jointed rock slope. In the most case of rock slopes, joint distribution properties are related to potential, shape, size and locality of slope failure. The purpose of this paper is to present an application of fracture characterization related to rock slope failure. Fracture data used in this study are collected by scanline survey. Two aspects of fracture characterization for rock slope are handled in this study First, In order to determine the potential and shape of slope failure, trace length of joints is considered as the weighting factor about collected orientation data. Second, Relationship between trace length and spacing is analysed to estimate failure location and size. The distribution of fracture system is directly influenced on wedge failure. It is effective to analyse the orientation of fractures by using weighting factors associated with the trace length of fractures rather than to analyse only that of fractures. It gives a conclusion that the wedge failure occurred along the peak of fracture density(or intensity) cycles.

  • PDF

Study on sea fog detection near Korea peninsula by using CMS-5 Satellite Data (CMS-5 위성자료를 이용한 한반도 주변 해무탐지 연구)

  • 윤홍주
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2000.10a
    • /
    • pp.597-601
    • /
    • 2000
  • Sea fog/stratus is very difficult to detect because of the characteristics of air-sea interaction and locality, and the scantiness of the observed data from the oceans such as ships or ocean buoys. The aim of our study develops new algorism for sea fog detection by using Geostational Meteorological Satellite-5(CMS-5) and suggests the technics of its continuous detection.

  • PDF

Monthly Wind Stress and Wind Stress Curl Distributions in the Eastern Sea(Japan Sea) (동해상의 월별 바람응력 및 바람응력컬 분포)

  • 김철호;최병호
    • Water for future
    • /
    • v.19 no.3
    • /
    • pp.239-248
    • /
    • 1986
  • Monthly wind stress, wind stress curl and volume transport stream functions are computed in the Eastern Sea(Japan Sea) based upon observed wind and atmospheric pressure data respectively. The presented two results show different distributios on locality and season but as common features the results reveal the northwesterly surface wind stress \ulcorner 새 the monsoon in winter, south to southwesterly wind stress \ulcorner 새 the southerly wind in summer and strond anticyclonic curl in the northern part on the Eastern Sea(Japan Sea) in winter. In the distributions obtained from the sea level atmospheric pressure data, the maximum value of the wind stress and of curls of small scales are shown off the southeast coast of Siberia and northeast coast of Korea. Volume transport distributions obtained from the Sverdrup relationship suggest that the strong northward boundary current can be formed along the northeast coast of Korea in winter and weak southward boundary current in summer.

  • PDF

A Novel Method of Improving Cache Hit-rate in Hadoop MapReduce using SSD Cache

  • Kim, Jong-Chan;An, Jae-Hoon;Kim, Young-Hwan;Jeon, Ki-Man
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.8
    • /
    • pp.1-6
    • /
    • 2015
  • The MapReduce Program of Hadoop Distributed File System operates on any unspecified nodes due to distributed-parallel process and block replicate for data stability. Since it is difficult to guarantee the cache locality when a Solid State Drive is used as a cache in hadoop, cache hit-rate is decreased. In this paper, we suggest a method to improve cache hit rate by pre-loading the input data of the MapReduce onto the SSD cache. To perform this method, we estimated the blocks that are used on each node by using capacity scheduler and block metadata. Eventually we could increase the performance of SSD cache by loading the blocks onto SSD cache before the Map Task run.

The First Record of the Marphysa victori (Polychaeta, Eunicida, Eunicidae) from Korea, with DNA Barcode Data

  • Kim, Hana;Kim, Keun-Yong;Phoo, War War;Kim, Chang-Hoon
    • Animal Systematics, Evolution and Diversity
    • /
    • v.37 no.1
    • /
    • pp.1-8
    • /
    • 2021
  • A eunicid polychaete, Marphysa victori Lavesque, Daffe, Bonifácio & Hutchings, 2017 is described for the first time from the intertidal zones of the Korean coasts. It is characterized by having three types of pectinate chaetae (INS, isodont-narrow-slender; AWS, anodont-wide-slender; and AWT, anodont-wide-thick), appearance of pectinate chaetae from chaetiger 2, the chaetae consisted of pectinate and compound spinigers, and pygidium with one pair of pygidial cirri. In genetic analysis based on cytochrome c oxidase subunit I (COI), intra-specific genetic distance between the specimens of M. victori from its type locality, France and Korea are in the range of 0.000-0.013. This paper includes the morphological description and photographs of M. victori new to Korean fauna, with partial sequences of the mitochondrial COI as DNA barcode data on this species.

Preference-Based Segment Buffer Replacement in Cluster VOD Servers (클러스터 VOD서버에서 선호도 기반 세그먼트 버퍼 대체 기법)

  • Seo, Dong-Mahn;Lee, Joa-Hyoung;Bang, Cheol-Seok;Lim, Dong-Sun;Jung, In-Bum;Kim, Yoon
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.11
    • /
    • pp.797-809
    • /
    • 2006
  • To support the QoS streams for large scale clients, the internal resources of VOD servers should be utilized based on the characteristics of the streaming media service. Among the various resources in the server, the main memory is used for the buffer space to the media data loaded from the disks and the buffer hit ratio has a great impact upon the server performance. However, if the buffer data with high hit ratio are replaced for the new media data as a result of the number of clients and the required movie titles are increased, the negative impact on the scalability of server performance is occurred. To address this problem, the buffer replacement policy considers the intrinsic characteristics of the streaming media such as the sequential access to large volume data and the highly disproportionate preference to specific movies. In this paper, the preference-based segment buffer replacement policy is proposed in the cluster-based VOD server to exploit the characteristics of the streaming media. Since the proposed method reflects both the temporal locality by the clients' preference and the spatial locality by the sequential access to media data, the buffer hit ratio would be improved as compared to the existing buffer replacement policy. The enhanced buffer hit ratio causes the fact that the performance scalability of the cluster-based VOD server is linearly improved as the number of cluster nodes is increased.

An Efficient Variable Rearrangement Technique for STT-RAM Based Hybrid Caches

  • Youn, Jonghee M.;Cho, Doosan
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.11 no.2
    • /
    • pp.67-78
    • /
    • 2016
  • The emerging Spin-Transfer Torque RAM (STT-RAM) is a promising component that can be used to improve the efficiency as a result of its high storage density and low leakage power. However, the state-of-the-art STT-RAM is not ready to replace SRAM technology due to the negative effect of its write operations. The write operations require longer latency and more power than the same operations in SRAM. Therefore, a hybrid cache with SRAM and STT-RAM technologies is proposed to obtain the benefits of STT-RAM while minimizing its negative effects by using SRAM. To efficiently use of the hybrid cache, it is important to place write intensive data onto the cache. Such data should be placed on SRAM to minimize the negative effect. Thus, we propose a technique that optimizes placement of data in main memory. It drives the proper combination of advantages and disadvantages for SRAM and STT-RAM in the hybrid cache. As a result of the proposed technique, write intensive data are loaded to SRAM and read intensive data are loaded to STT-RAM. In addition, our technique also optimizes temporal locality to minimize conflict misses. Therefore, it improves performance and energy consumption of the hybrid cache architecture in a certain range.

Improving the I/O Performance of Disk-Based Graph Engine by Graph Ordering (디스크 기반 그래프 엔진의 입출력 성능 향상을 위한 그래프 오더링)

  • Lim, Keunhak;Kim, Junghyun;Lee, Eunjae;Seo, Jiwon
    • KIISE Transactions on Computing Practices
    • /
    • v.24 no.1
    • /
    • pp.40-45
    • /
    • 2018
  • With the advent of big data and social networks, large-scale graph processing becomes popular research topic. Recently, an optimization technique called Gorder has been proposed to improve the performance of in-memory graph processing. This technique improves performance by optimizing the graph layout on memory to have better cache locality. However, since it is designed for in-memory graph processing systems, the technique is not suitable for disk-based graph engines; also the cost for applying the technique is significantly high. To solve the problem, we propose a new graph ordering called I/O Order. I/O Order considers the characteristics of I/O accesses for SSDs and HDDs to improve the performance of disk-based graph engine. In addition, the algorithmic complexity of I/O Order is simple compared to Gorder, hence it is cheaper to apply I/O Ordering. I/O order reduces the cost of pre-processing up to 9.6 times compared to that of Gorder's, still its performance is 2 times higher compared to the Random in low-locality graph algorithms.

An Energy-Efficient Location Update Scheme for Mobile Sinks in Continuous Object Detection Using Wireless Sensor Networks (무선 센서 망을 이용한 연속개체 탐지에서 이동싱크의 에너지 효율적인 위치갱신 방안)

  • Kim, Cheonyong;Cho, Hyunchong;Kim, Sangdae;Kim, Sang-Ha
    • Journal of KIISE
    • /
    • v.41 no.11
    • /
    • pp.967-973
    • /
    • 2014
  • A continuous object is large phenomenon diffusing continuously. Therefore, a large number of sources is a major problem in researches for continuous object. Existing studies for continuous object detecting focus on reducing communication cost generated by the sources. But, they only deal with the static sink located in fixed position. In this paper, we propose the location update scheme for mobile sinks in continuous object detecting. Generally, to receive data, a mobile sink should notice its current location to sources. Previous studies for location update of mobile sinks consider individual object. So they need a lot of energy for location update when a mobile sink notices its current location toward many sources of a continuous object independently. Proposed scheme exploits regional locality of the sources involved one continuous object. The regional locality makes the location update of mobile sinks efficient. Our simulation results show that the proposed scheme superior to existing schemes in terms of energy efficiency.

A PMIPv6-based Distributed Mobility Control Scheme Considering a User's Movement Locality (사용자 이동 지역성을 고려한 PMIPv6 기반의 분산형 이동성 제어 기법)

  • Kong, Ki-Sik
    • Journal of Digital Contents Society
    • /
    • v.14 no.3
    • /
    • pp.283-290
    • /
    • 2013
  • The current centralized mobility control protocols such as proxy mobile IPv6 (PMIPv6) are dependent on a central mobility anchor to process all control/data traffic. However, such centralized mobility control protocols have some drawbacks such as traffic concentration into the core network and serious service degradation in case of the failure of such a centralized mobility anchor, etc. In this paper, therefore, in order to alleviate these drawbacks, we propose a PMIPv6-based distributed mobility control scheme considering a user's movement locality. Performance evaluation results demonstrate that the proposed scheme has apparent potentials to alleviate serious drawbacks of S-PMIP, which is a closely-related distributed mobility control scheme, as well as PMIPv6, while reducing the total mobility control cost.