• Title/Summary/Keyword: Address mapping

Search Result 127, Processing Time 0.026 seconds

Procedure-Based On-Line Program Replacement (프로시저 단위의 온라인 프로그램 교체)

  • 김영진;이인환
    • Proceedings of the IEEK Conference
    • /
    • 1999.06a
    • /
    • pp.1005-1008
    • /
    • 1999
  • This paper presents a method for procedure-based on-line program replacement for user applications. To deal with the size change in the procedure to replace, the method uses the unmapped area of process address space for mapping a new version of procedure. The method is effective in that and it does not cause large performance loss during the replacement or require any additional software layer for the replacement. The method is illustrated in the SUN Solaris environment.

  • PDF

A Buffer Architecture based on Dynamic Mapping table for Write Performance of Solid State Disk (동적 사상 테이블 기반의 버퍼구조를 통한 Solid State Disk의 쓰기 성능 향상)

  • Cho, In-Pyo;Ko, So-Hyang;Yang, Hoon-Mo;Park, Gi-Ho;Kim, Shin-Dug
    • The KIPS Transactions:PartA
    • /
    • v.18A no.4
    • /
    • pp.135-142
    • /
    • 2011
  • This research is to design an effective buffer structure and its management for flash memory based high performance SSDs (Solid State Disks). Specifically conventional SSDs tend to show asymmetrical performance in read and /write operations, in addition to a limited number of erase operations. To minimize the number of erase operations and write latency, the degree of interleaving levels over multiple flash memory chips should be maximized. Thus, to increase the interleaving effect, an effective buffer structure is proposed for the SSD with a hybrid address mapping scheme and super-block management. The proposed buffer operation is designed to provide performance improvement and enhanced flash memory life cycle. Also its management is based on a new selection scheme to determine random and sequential accesses, depending on execution characteristics, and a method to enhance the size of sequential access unit by aggressive merging. Experiments show that a newly developed mapping table under the MBA is more efficient than the basic simple management in terms of maintenance and performance. The overall performance is increased by around 35% in comparison with the basic simple management.

Index Management Method using Page Mapping Log in B+-Tree based on NAND Flash Memory (NAND 플래시 메모리 기반 B+ 트리에서 페이지 매핑 로그를 이용한 색인 관리 기법)

  • Kim, Seon Hwan;Kwak, Jong Wook
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.5
    • /
    • pp.1-12
    • /
    • 2015
  • NAND flash memory has being used for storage systems widely, because it has good features which are low-price, low-power and fast access speed. However, NAND flash memory has an in-place update problem, and therefore it needs FTL(flash translation layer) to run for applications based on hard disk storage. The FTL includes complex functions, such as address mapping, garbage collection, wear leveling and so on. Futhermore, implementation of the FTL on low-power embedded systems is difficult due to its memory requirements and operation overhead. Accordingly, many index data structures for NAND flash memory have being studied for the embedded systems. Overall performances of the index data structures are enhanced by a decreasing of page write counts, whereas it has increased page read counts, as a side effect. Therefore, we propose an index management method using a page mapping log table in $B^+$-Tree based on NAND flash memory to decrease page write counts and not to increase page read counts. The page mapping log table registers page address information of changed index node and then it is exploited when retrieving records. In our experiment, the proposed method reduces the page read counts about 61% at maximum and the page write counts about 31% at maximum, compared to the related studies of index data structures.

A Study on the Implementation of New Address Management and Guide System for Jecheon City Area (제천시 새주소 관리 및 안내 시스템 구축에 관한 연구)

  • Yeon, Sang-Ho;Yoo, Joon-Sang
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.4 no.3
    • /
    • pp.13-20
    • /
    • 2001
  • The purpose of this study is development of the management and guide system for convenient use of new address guide system for systematic management and use of spatial information gained by mapping of numerical map of building and road to large basic new address, survey and input of main gate, decision of the road session, naming and input of road name, grant of numbering of all houses and buildings, new address guide, real life geographical information and added information service on web site in Jecheon-si city area. In this study, the development and establishment of new address management and guide system in local cities are designed by making full use of GIS function of client server based system. A guide system is designed the same database as management system, and it is transformed into Web GIS environment and developed in order to add the various functions of life GIS as well as new address guide. In the result, the effectiveness of new address system and guide of Jecheon-si city could be highly increased owing to not only citizens' easy access but also easy availability of various informations necessary in life by developed its system.

  • PDF

Semantic-based Keyword Search System over Relational Database (관계형 데이터베이스에서의 시맨틱 기반 키워드 탐색 시스템)

  • Yang, Younghyoo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.12
    • /
    • pp.91-101
    • /
    • 2013
  • One issue with keyword search in general is its ambiguity which can ultimately impact the effectiveness of the search in terms of the quality of the search results. This ambiguity is primarily due to the ambiguity of the contextual meaning of each term in the query. In addition to the query ambiguity itself, the relationships between the keywords in the search results are crucial for the proper interpretation of the search results by the user and should be clearly presented in the search results. We address the keyword search ambiguity issue by adapting some of the existing approaches for keyword mapping from the query terms to the schema terms/instances. The approaches we have adapted for term mapping capture both the syntactic similarity between the query keywords and the schema terms as well as the semantic similarity of the two and give better mappings and ultimately 50% raised accurate results. Finally, to address the last issue of lacking clear relationships among the terms appearing in the search results, our system has leveraged semantic web technologies in order to enrich the knowledgebase and to discover the relationships between the keywords.

Improving Remedial Measures from Incident Investigations: A Study Across Ghanaian Mines

  • Theophilus Joe-Asare;Eric Stemn
    • Safety and Health at Work
    • /
    • v.15 no.1
    • /
    • pp.24-32
    • /
    • 2024
  • Background: Learning from incidents for accident prevention is a two-stage process, involving the investigation of past accidents to identify the causal factors, followed by the identification and implementation of remedial measures to address the identified causal factors. The focus of past research has been on the identification of causal factors, with limited focus on the identification and implementation of remedial measures. This research begins to contribute to this gap. The motivation for the research is twofold. First, previous analyses show the recurring nature of accidents within the Ghanaian mining industry, and the causal factors also remain the same. This raises questions on the nature and effectiveness of remedial measures identified to address the causes of past accidents. Secondly, without identifying and implementing remedial measures, the full benefits of accident investigations will not be achieved. Hence, this study aims to assess the nature of remedial measures proposed to address investigation causal factors. Method: The study adopted SMARTER from business studies with the addition of HMW (H - Hierarchical, M - Mapping, and W - Weighting of causal factors) to analyse the recommendations from 500 individual investigation reports across seven different mines in Ghana. Results: The individual and the work environment (79%) were mostly the focused during the search for causes, with limited focus on organisational factors (21%). Forty eight percentage of the recommendations were administrative, focussing on fixing the problem in the immediate affected area or department of the victim(s). Most recommendations (70.4%) were support activities that only enhance the effectiveness of control but do not prevent/mitigate the failure directly. Across all the mines, there was no focus on evaluating the performance of remedial measures after their implementation. Conclusion: Identifying sharp-end causes leads to proposing weak recommendations which fail to address latent organisational conditions. The study proposed a guide for effective planning and implementation of remedial actions.

A Design of Parallel Turbo Decoder based on Double Flow Method Using Even-Odd Cross Mapping (짝·홀 교차 사상을 이용한 Double Flow 기법 기반 병렬 터보 복호기 설계)

  • Jwa, Yu-Cheol;Rim, Chong-Suck
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.54 no.7
    • /
    • pp.36-46
    • /
    • 2017
  • The turbo code, an error correction code, needs a long decoding time since the same decoding process must be repeated several times in order to obtain a good BER performance. Thus, parallel processing may be used to reduce the decoding time, in which case there may be a memory contention that requires additional buffers. The QPP interleaving has been proposed to avoid such case, but there is still a possibility of memory contention when a decoder is constructed using the so-called double flow technique. In this paper, we propose an even-odd cross mapping technique to avoid memory conflicts even in decoding using the double-flow technique. This method uses the address generation characteristic of the QPP interleaving and can be used to implement the interleaving circuit between the decoding blocks and the LLR memory blocks. When the decoder implemented by applying the double flow and the proposed methods is compared with the decoder by the conventional MDF techniques, the decoding time is reduced by up to 32% with the total area increase by 8%.

Managing and Modeling Variability of UML Based FORM Architectures Through Feature-Architecture Mapping (휘처-아키텍처 대응을 통한 UML 기반 FORM 아키텍처의 가변성 모델링 및 관리)

  • Lee, Kwan-Woo
    • The KIPS Transactions:PartD
    • /
    • v.19D no.1
    • /
    • pp.81-94
    • /
    • 2012
  • FORM(Feature-Oriented Reuse Method) is one of representative product line engineering methods. The essence of FORM is the FORM architecture models, which can be reused in the development of multiple products of a software product line. The FORM architecture models, however, have the following problems when applied in practice. First, they are not standardized models like UML(Unified Modeling Language) and therefore they can be constructed only through a specific modeling tool. Second, they do not represent architectural variability explicitly. Instead their variability is only managed through a mapping from a feature model. To address these two problems, we developed at first a method for representing the FORM architecture models using UML, which enables the FORM architecture models to be constructed through various available UML modeling tools. Also, we developed an effective method for representing as well as managing the variability of the FORM architecture models through a mapping from a feature model.

Reversible Sub-Feature Retrieval: Toward Robust Coverless Image Steganography for Geometric Attacks Resistance

  • Liu, Qiang;Xiang, Xuyu;Qin, Jiaohua;Tan, Yun;Zhang, Qin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.3
    • /
    • pp.1078-1099
    • /
    • 2021
  • Traditional image steganography hides secret information by embedding, which inevitably leaves modification traces and is easy to be detected by steganography analysis tools. Since coverless steganography can effectively resist steganalysis, it has become a hotspot in information hiding research recently. Most coverless image steganography (CIS) methods are based on mapping rules, which not only exposes the vulnerability to geometric attacks, but also are less secure due to the revelation of mapping rules. To address the above issues, we introduced camouflage images for steganography instead of directly sending stego-image, which further improves the security performance and information hiding ability of steganography scheme. In particular, based on the different sub-features of stego-image and potential camouflage images, we try to find a larger similarity between them so as to achieve the reversible steganography. Specifically, based on the existing CIS mapping algorithm, we first can establish the correlation between stego-image and secret information and then transmit the camouflage images, which are obtained by reversible sub-feature retrieval algorithm. The received camouflage image can be used to reverse retrieve the stego-image in a public image database. Finally, we can use the same mapping rules to restore secret information. Extensive experimental results demonstrate the better robustness and security of the proposed approach in comparison to state-of-art CIS methods, especially in the robustness of geometric attacks.

A Memory Mapping Technique to Reduce Data Retrieval Cost in the Storage Consisting of Multi Memories (다중 메모리로 구성된 저장장치에서 데이터 탐색 비용을 줄이기 위한 메모리 매핑 기법)

  • Hyun-Seob Lee
    • Journal of Internet of Things and Convergence
    • /
    • v.9 no.1
    • /
    • pp.19-24
    • /
    • 2023
  • Recently, with the recent rapid development of memory technology, various types of memory are developed and are used to improve processing speed in data management systems. In particular, NAND flash memory is used as a main media for storing data in memory-based storage devices because it has a nonvolatile characteristic that it can maintain data even at the power off state. However, since the recently studied memory-based storage device consists of various types of memory such as MRAM and PRAM as well as NAND flash memory, research on memory management technology is needed to improve data processing performance and efficiency of media in a storage system composed of different types of memories. In this paper, we propose a memory mapping scheme thought technique for efficiently managing data in the storage device composed of various memories for data management. The proposed idea is a method of managing different memories using a single mapping table. This method can unify the address scheme of data and reduce the search cost of data stored in different memories for data tiering.