• Title/Summary/Keyword: 순차설계영역

Search Result 44, Processing Time 0.019 seconds

Temporary Metadata Journaling Scheme to Improve Performance and Stability of a FAT Compatible File System (FAT 파일 시스템의 호환성을 유지하며 성능과 안정성을 향상시키는 메타데이터 저널링 기법의 설계)

  • Hyun, Choul-Seung;Choi, Jong-Moo;Lee, Dong-Hee;Noh, Sam-H.
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.36 no.3
    • /
    • pp.191-198
    • /
    • 2009
  • The FAT (File Allocation Table) compatible file system has been widely used in mobile devices and memory cards because of its data exchangeability among numerous platforms recognizing the FAT file system. By the way. modern embedded systems have tough demands for instant power failure recovery and superior performance for multimedia applications. The key issue is how to achieve the goals of superior write performance and instant booting capability while controlling compatibility issues. To achieve the goals while controlling compatibility issues. we devised a temporary meta-data journaling scheme for a FAT compatible file system. Benchmark results of the scheme implemented in a FAT compatible file system shows that it really improves write performance of the FAT file system by converting small random write for meta-data update to a large sequential write in journaling area. Also, it provides natural way to implement the instant booting capability. Nevertheless, the file system compatibility is temporarily compromised by the scheme because it stores updated meta-data in the temporary journaling area rather than to their original locations. However, the compatibility can be fully recovered at any time by journal-flushing that copies meta-data in journaling area to their original locations. Generally, the journal-flushing is done before un-mounting a memory card so that it can be used in other mobile devices which recognized FAT file system but not the temporary meta-data journaling scheme.

A Study on Integrated Information System for Marine Leisure Industry (해양레저 산업의 통합 정보 시스템 구축에 관한 연구)

  • Kim, Y.S.;Kim, D.J.
    • Journal of the Korean Society for Marine Environment & Energy
    • /
    • v.16 no.1
    • /
    • pp.17-24
    • /
    • 2013
  • In order to have market competitiveness in local and global areas, Domestic Marine Leisure Industry business, which is a latecomer in the Marine Leisure industry, should retain a strong market adaptability by reducing time and cost that are required for work of planning, designing, and preparation for product development. To meet above requirements, it is essential that integrated system control extensive marine leisure industry. After ensuring integrated information by figuring out the systematic link between related-industries, the core of this research is to secure information classifications that are not just in the flow of simple serial order, but in that of integration and object-oriented information classifications. For this end, we examine other similar cases in industries using real information system applied to industrial production and Product Lifecycle Management (PLM), Product Data Management (PDM), Digital Manufacturing (DM) and applying the same methodology to review practical application in order to construct the information system, and Work Breakdown Structure (WBS), compared with the case studies. Through this basic task for the marine leisure industry classification system configuration (Work Breakdown Structure, WBS) and utilizing information of driving real companies of marine leisure industry, a unique area of MLWBS (Marine Leisure Work Breakdown Structure, MLWBS) is configured. This Marine Leisure Work Breakdown Structure can be used in various areas of applications like products, design information, engineering, production, purchasing, sales, marketing, AS, utilizing various forms of customer support.

An Efficient Periodic-Request-Grouping Technique for Reduced Seek Time in Disk Array-based Video-on-Demand Server (디스크 배열-기반 주문형 비디오 서버에서의 탐색 시간 단축을 위한 효율적인 주기적 요청 묶음 기법)

  • Kim, Un-Seok;Kim, Ji-Hong;Min, Sang-Ryeol;No, Sam-Hyeok
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.28 no.12
    • /
    • pp.660-673
    • /
    • 2001
  • In Video-on-Demand (VoD) servers, disk throughput is an important system design parameter because it is directly related to the number of user requests that can be served simultaneously. In this paper, we propose an efficient periodic request grouping scheme for disk array-based VoD servers that reduces the disk seek time, thus improving the disk throughput of VoD disk arrays. To reduce the disk seek time, the proposed scheme groups the periodic requests that access data blocks stored in adjacent regions into one, and arranges these groups in a pre-determined order (e.g., in left-symmetric or right-symmetric fashion). Our simulation result shows that the proposed scheme reduces the average disk bandwidth required by a single video stream and can serve more user requests than existing schemes. For a data block size of 192KB, the number of simultaneously served user requests is increased by 8% while the average waiting time for a user request is decreased by 20%. We also propose an adaptation technique that conforms the proposed scheme to the user preference changes for video streams.

  • PDF

Multi-Cell Search Scheme for Heterogeneous Networks (이기종 네트워크를 위한 다중 셀 검출 기법)

  • Cho, Yong-Ho;Ko, Hak-lim;Im, Tae-ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.4
    • /
    • pp.395-403
    • /
    • 2016
  • This paper introduces a multi-cell search method for heterogeneous networks (HetNet), in which user equipments need to search multiple cells in its vicinity simultaneously. Due to the difficulty of acquiring channel informations for multiple cells, a non-coherent approach is preferred. In this paper, a non-coherent single-cell search scheme using a weighted vector is proposed, and the successive interference cancellation based multi-cell search algorithm is devised. In order to improve cell search performance, the weighted vector is designed in a way to exploit the general characteristic of wireless channel. Based on the fact that the performance of the proposed single-cell search scheme deviates slowly from the one using the optimal weighted vector, a universal weighted vector is also proposed, which shows the performance close to the optimal ones for various channel environments and signal-to-noise ratio regimes. Simulation results confirm that the proposed multi-cell search algorithm is capable of identifying cells more accurately with the help of the proposed single-cell search scheme, and can detect the remaining cells more effectively by removing the signals of the identified cells from the received signal.