• Title/Summary/Keyword: Block priority

Search Result 73, Processing Time 0.027 seconds

Block Replacement Scheme based on Reuse Interval for Hybrid SSD System (Hybrid SSD 시스템을 위한 재사용 간격 기반 블록 교체 기법)

  • Yoo, Sanghyun;Kim, Kyung Tae;Youn, Hee Yong
    • Journal of Internet Computing and Services
    • /
    • v.16 no.5
    • /
    • pp.19-27
    • /
    • 2015
  • Due to the advantages of fast read/write operation and low power consumption, SSD(Solid State Drive) is now widely adopted as storage device of smart phone, laptop computer, server, etc. However, the shortcomings of SSD such as limited number of write operations and asymmetric read/write operation lead to the problem of shortened life span of SSD. Therefore, the block replacement policy of SSD used as cache for HDD is very important. The existing solutions for improving the lifespan of SSD including the LARC scheme typically employ the LRU algorithm to manage the SSD blocks, which may increase the miss rate in SSD due to the replacement of frequently used block instead of rarely used block. In this paper we propose a novel block replacement scheme which considers the block reuse interval to effectively handle various data read/write patterns. The proposed scheme replaces the block in SSD based on the recency decided by reuse interval and age along with hit ratio. Computer simulation using workload trace files reveals that the proposed scheme consistently improves the performance and lifespan of SSD by increasing the hit ratio and decreasing the number of write operations compared to the existing schemes including LARC.

Fast Motion Estimation Algorithm via Optimal Candidate for Each Step (단계별 최적후보를 통한 고속 움직임 예측 알고리즘)

  • Kim, Jong-Nam;Moon, Kwang-Seok
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.18 no.2
    • /
    • pp.62-67
    • /
    • 2017
  • In this paper, we propose a fast motion estimation algorithm which is important in performance of video encoding. Even though so many fast algorithms for motion estimation have been published due to tremendous computational amount of full search algorithm, efforts for reducing computations of motion estimation still remain. In the paper, we propose an algorithm that reduces unnecessary computations only, while keeping prediction quality the same as that of the full search. The proposed algorithm does not calculate block matching error for each candidate directly to find motion vectors but divides the calculation procedure into several steps and calculates partial sum of block errors for candidates with high priority. By doing that, we can find the minimum error point early and get the enhancement of calculation speed by reducing unnecessary computations. The proposed algorithm uses smaller computations than conventional fast search algorithms with the same prediction quality as the full search algorithm.

  • PDF

Performance Analysis of Bandwidth-Awared Bus Arbitration Method (점유율을 고려한 버스 중재방식의 성능 분석)

  • Lee, Kook-Pyo;Koh, Si-Young
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.9
    • /
    • pp.2078-2082
    • /
    • 2010
  • The general bus system architecture consists of masters, slaves, arbiter, decoder and so on in shared bus. As several masters can't use a bus concurrently, arbiter plays an role in bus arbitration. In compliance with the selection of arbitration method, The efficiency of bus usage can be determined. Fixed Priority, Round-Robin, TDMA, Lottery arbitration are studied in conventional arbitration method. Conventional arbitration method is considered bus priority primarily, actual bus utilization didn't considered. In this paper, we propose arbitration method using bus utilization operating block of each master, we verify the performance compared with the other arbitration methods through throughput performance. From the result of performance verification, we confirm that proposed arbitration method, matched bus utilization set by the user 40%, 20%, 20%, 20%.

Design and Implementation of HomePNA 2.0 MAC Controller Circuit (HomePNA 2.0 MAC Controller 회로의 설계 및 구현)

  • Kim, Jong-Won;Kim, Dae-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.1A
    • /
    • pp.1-10
    • /
    • 2006
  • The Home Phoneline Networking Alliance(HomePNA) 2.0 technology can establish a home network using existing in-home phone lines, which provides a channel rate of 4-32 Mbps. HomePNA 2.0 Medium Access Control(MAC) protocol adopts an IEEE 802.3 Carrier Sense Multiple Access with Collision Detection(CSMA/CD) access method, Quality of Service(QoS) algorithm, and Distributed Fair Priority Queuing(DFPQ) collision resolution algorithm. In this paper, we describe some performance analysis results of HomePNA 2.0 MAC protocol and the requirements of HomePNA 2.0 MAC controller. Then, we propose the architecture of HomePNA 2.0 MAC controller circuit, show the simulation result of each block included in HomePNA 2.0 MAC controller, and present the HomePNA 2.0 transceiver chip that we have implemented.

Spatial Scheduling in Shipbuilding Industry

  • Duck Young Yoon;Varghese Ranjan;Koo Chung Kon
    • Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
    • /
    • 2004.05a
    • /
    • pp.106-110
    • /
    • 2004
  • In any large heavy industry like that of ship building, there exist a lot of complications for the arrangement of building blocks optimally for the minimal space consumption. The major problem arises at yard because of laxity in space for arranging the building blocks of ship under construction. A standardized erection sequence diagram is generally available to provide the prioritised erection sequence. This erection sequence diagram serves as the frame work. In order to make a timely erection of the blocks a post plan has to be developed so that the blocks lie in the nearest possible vicinity of the material handling devices while keeping the priority of erection. Therefore, the blocks are arranged in the pre-erection area. This kind of readiness of blocks leads to a very complex problem of space. This arises due to the least available space leading to an urgent need of an availability of intelligent spatial schedule without compromising the rate of production. There exists two critical problems ahead namely, the spatial occupation layout of pre-erection area and the emptying pattern in the spatial vicinity. The block shape is assumed be rectangular. The related input data's are the dates of erection (earliest as well as the latest), geometrical parameters of block available on pre-erection area, slack time and the like.

  • PDF

A Study on the Segmentation for Adaptation of Web Contents in Smart Learning Environment (스마트 학습 환경에서 웹 콘텐츠 적응을 위한 부분화에 관한 연구)

  • Seo, Jin Ho;Kim, Myong Hee;Park, Man-Gon
    • Journal of Korea Multimedia Society
    • /
    • v.19 no.2
    • /
    • pp.325-333
    • /
    • 2016
  • The development of smart technology has brought the conversion of closed traditional e-learning contents into open flexible smart learning contents consisting of learner-centered modules, without the constraints of time and space by use of smart devices from the uniformed and passive classroom between teachers and learners. It has been demanded an open, personalized and customized teaching and learning contents of smart education and training systems according to wide supply of various smart devices. In this paper, we discuss about the status of the smart teaching and learning systems and analyze the characteristics and structure of the web contents for smart education and training systems by use of smart devices. And we propose a method how to block web contents, to extract them, and adapt personalized segments of web contents by adaptive algorithm into smart learning devices. We extract blocks from the web contents based on the smart device information and the preference information of the learners from existing web contents without the hassle of learners environment. After specifying a block priority from the extracted web contents by the adaptive segment algorithm, it can be displayed directly to the screen to fit the individual learning progress of the learners.

Field Application of the Slit Type Coastal Structures under Waves and Currents

  • Park, Sang-Gil;Kang, Sug-Jin;Kim, Kang-Min;Kim, Suk-Mun;Lee, Joong-Woo
    • Journal of Navigation and Port Research
    • /
    • v.34 no.9
    • /
    • pp.711-718
    • /
    • 2010
  • Redevelopment of the domestic small fishing ports is being started in earnest by applying the environmentally friendly technology in order to attract tourists. For the purpose of improving water quality in the harbor, selection of breakwater type might have the priority to secure calmness and stability. Therefore, this study is to determine the hydraulic characteristics of reflective ratio, installation efficiency and stability of the special type of blocks through the hydraulic model experiment. The results were introduced to analyze for the effect of infield construction work through numerical analysis. Gujora, a small fishing port in southern Korea, is affected by the waves of SSE, S, SSW direction and strong tidal currents. The results of applying cylindrical slit block show that stability of the blocks and harbor calmness were secured. Considering that the pass rate of a long period wave is still excellent, the primary objective of wave control and the secondary objective of improving water exchange are satisfied simultaneously.

Extended Pairing Heap Algorithms Considering Cache Effect (캐쉬 효과를 고려한 확장된 Pairing Heap 알고리즘)

  • 정균락;김경훈
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.30 no.5_6
    • /
    • pp.250-257
    • /
    • 2003
  • As the memory access time becomes slower relative to the fast processor speed, most systems use cache memory to reduce the gap. The cache performance has an increasingly large impact on the performance of algorithms. Blocking is the well known method to utilize cache and has shown good results in multiplying matrices and search trees like d-heap. But if we use blocking in the data structures which require rotation during insertion or deletion, the execution time increases as the data movements between blocks are necessary. In this paper, we have proposed the extended pairing heap algorithms using block node and shown by experiments that our structure is superior Also in case of using block node, we use less memory space as the number of pointers decreases.

Incremental Redundancy Hybrid ARQ (IR-HARQ) Scheme Using Block LDPC Codes (블록 LDPC의 Incremental Redundancy Hybrid ARQ (IR-HARQ) 기법)

  • Kim, Dong Ho;Lee, Ye Hoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38A no.8
    • /
    • pp.662-668
    • /
    • 2013
  • Mobile communication systems have been adopting link adaptive transmission schemes such as adaptive modulation and coding (AMC) and hybrid-ARQ (HARQ). Incremental redundancy (IR) HARQ scheme is known to be highly efficient in terms of throughput and power consumption and can be a good solution for mobile communication systems. In this paper, we propose an IR-HARQ scheme based on dual-diagonal parity-type block LDPC codes in which we define a transmission priority of coded bits and propose the sub-packet construction rule. We present the throughput performance of IR-HARQ with various modulation and coding and multi-antenna modes. Consequently, the proposed scheme provides the improvement of system throughput by elaborate link adaptation with CQI information.

Design Algorithm & Datagram Analysis of UDP using Queuing (Queuing을 이용한 UDP 설계 알고리즘과 데이터그램 분석)

  • Eom, Gum-Yong
    • Proceedings of the KIEE Conference
    • /
    • 2004.11c
    • /
    • pp.231-233
    • /
    • 2004
  • Queuing is waiting lines which play routing service when packet entered. Queuing is decide how and whom is going to provide priority service. This is kind of first in first out(FIFO) or weighted fair queuing(WFQ) method. In this study, UDP design using WFQ way to serve to provide service evenly and rapidly in network. Also in actuality internet, datagram analyzed by packet captured. Queuing services through the requesting port number, input, output, output queuing creation & delete, message request by internet control message protocol(ICMP). Queuing designed in control block module, input queues, input/output module composition. In conclusion, I have confirm queuing result of WFQ method by the datagram information analyzed.

  • PDF