• Title/Summary/Keyword: Linked list

Search Result 98, Processing Time 0.032 seconds

Onboard Store and Access for Communication Link Data: Grape Linked-List (통신 링크 데이터 온보드 저장 및 접근: 포도송이 연결리스트)

  • Cheol Hea Koo
    • Journal of Aerospace System Engineering
    • /
    • v.18 no.4
    • /
    • pp.89-95
    • /
    • 2024
  • This paper introduces an effective and convenient method for utilizing onboard memory space to process remote commands, telemetry, and interplanetary network protocol data in satellite onboard systems. By enhancing the doubly linked list data structure to store and make accessible variable-length communication protocol data either sequentially or at variable locations, the paper enhances memory capacity utilization. The concept of 'grape' is introduced into the doubly linked list data structure to manage variable-length data and its access, with performance verification conducted through its reference implementation. This novel approach to linked lists is termed 'grape.'

Design of a shared buffer memory switch with a linked-list architecture for ATM applications (Linked-list 구조를 갖는 ATM용 공통 버퍼형 메모리 스위치 설계)

  • 이명희;조경록
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.11
    • /
    • pp.2850-2861
    • /
    • 1996
  • This paper describes the design of AATM switch LIS of shared buffer type with linked-list architecture to control memory access. The proposed switch LSI consists of the buffer memory, controller and FIFO memory blocks and two special circuits to avoid the cell blocking. One of the special circuit is a new address control scheme with linked-list architecture which maintains the address of buffer memory serially ordered from write address to read address. All of the address is linked as chain is operated like a FIFO. The other is slip-flag register it will be hold the address chain when readaddress missed the reading of data. The circuits control the buffer memory efficiently and reduce the cell loss rate. As a result the designed chip operates at 33ns and occupied on 2.7*2.8mm$^{2}$ using 0.8.mu.m CMOS technology.

  • PDF

An In-Depth Analysis and Improvement on Cache Mechanisms of SSD FTL (SSD FTL의 캐시 메커니즘에 대한 심층 분석 및 개선)

  • Lee, Hyung-Bong;Chung, Tae-Yun
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.15 no.1
    • /
    • pp.9-16
    • /
    • 2020
  • Recently, the capacity of SSD has been increasing rapidly due to the improvement of flash memory density. To take full advantage of these SSDs, first of all, FTL's prompt adaptation is necessary. The FTL is a translation layer existing in SSDs to overcome the drawback of the SSD that cannot be modified in place, and has garbage collection and caching functions in addition to the map table management function. In this study, we focus on caching function, compare and analyze the cache implementation methodologies, and propose improved methods. Typical cache implementations divide the cache into groups, manage and retrieve the caches in the group as a linked list. Thus, searches are made in the order of the linked list. In contrast, we propose a method of sequential searching using the search area group of a cache registered in the map table regardless of the linked list and cache group. Experimental results show that the proposed method has a 2.5 times improvement over the conventional method.

Design and Implementation of Parallelized Linked List Class Library using Pthread Library (Pthread 라이브러리를 이용한 Linked List 병렬화 클래스 라이브러리의 설계 및 구현)

  • 김홍숙;한동수
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1999.10c
    • /
    • pp.780-782
    • /
    • 1999
  • 병렬 프로세서 시스템이 제고하는 하드웨어적인 장점을 이용하기 위해서는 병렬 프로그래밍을 통한 애플리케이션의 병렬화가 필요하다. 기존의 순차적 코드의 경우에 자동 병렬화 컴파일러 기법을 통하여 병렬 프로세서시스템이 제공하는 성능을 극대화하고 있다. 그러나 자동병렬화는 과학 기술 계산용 코드와 같은 정형성을 지닌 코드에서는 유용하지만 비즈니스 응용에서 사용되는 동적인 자료구조를 사용하는 코드에서는 포인터에 의한 별명과 이에 따른 의존성 분석에 어려움으로 인해 많이 응용되고 있지는 못하다. 본 논문은 병렬 프로세서 시스템이 제공하는 기능을 이용하기 위한 한 방법으로 비즈니스 응용에서 많이 사용되는 동적인 자료 구조 중 linked list 클래스 라이브러리의 설계와 구현에 대하여 기술한다.

  • PDF

The Conversion of a Set, a Sequence, and a Map in VDM to a Linked List in a Programming Language (VDM의 자료구조인 set, sequency, map의 프로그래밍 언어 자료구조인 linked list로의 변환)

  • Yu, Mun-Seong
    • The KIPS Transactions:PartD
    • /
    • v.8D no.4
    • /
    • pp.421-426
    • /
    • 2001
  • A formal development method is used to develop software rigorously and systematically. In a formal development method, we specify system by a formal specification language and gradually develop the system more concretely until we can implement the system. VDM is one of formal specification languages. VDM uses mathematical data structures such as sets, sequences, and maps to specify the system, but most programming languages do not have such data structures. Therefore, these data structures should be converted. We can convert mathematical data structures in VDM to a linked list, a data structure in a programming language. In this article, we propose a method to convert a set, a sequence, and a map in VDM to a linked list in a programming language and prove the correctness of this conversion mathematically.

  • PDF

Linking of Items in Two Function-related Questionnaires to the International Classification of Functioning, Disability and Health: Shoulder Pain

  • Lee, Hae Jung;Song, Ju Min
    • The Journal of Korean Physical Therapy
    • /
    • v.30 no.6
    • /
    • pp.239-245
    • /
    • 2018
  • Purpose: This study was to identify international classification of functioning, disability and health (ICF) categories that could be linked conceptually to disability of arm, shoulder and hand (DASH) items and short form of health survey 36 (SF-36) items for persons with shoulder pain. Methods: Linkage between each item in DASH and SF-36 and the categories in the ICF were assessed. The linking process was performed by ten health professionals following the linking rule. One hundred four patients with shoulder pain were enrolled from 12 private clinic outpatient departments and participated in this study. Pearson correlation coefficients were used to assess the relationships between each scale item and the linked ICF code. Results: Thirty DASH items were able to be linked to 30 ICF codes, whereas the 36 items in SF-36 were only linked to 17 ICF codes. General health items included in SF-36 could not be linked to a relevant ICF concept. There was a high correlation between the two measurement tools and the linked ICF codes, DASH and its ICF code list (r =0.91), SF-36-Physical Health and its code list (r =-0.62), and SF-36-Mental Health and its code list (r =-0.72). Conclusion: The results suggest that concepts within each item in DASH can be linked to ICF codes for patients with shoulder pain, however, the concepts in the SF-36 items had limited linkage to ICF codes. The shoulder-specific functional tool, DASH can be expressed with ICF codes and, therefore, its use can promote data standardization and improve communication between professionals.

Development of Cross-sectional Information Conversion System from STL file for Stereolithography (Stereolithography를 위한 STL파일로부터 단면정보 변환시스템의 개발)

  • Choi, Hong-Tae;Kim, Jun-An;Lee, Seok-Hee;Paik, In-Hwan
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.12 no.11
    • /
    • pp.140-147
    • /
    • 1995
  • This paper deals with conversion from the STL file to the Slice to the Slice cross-sectional information for Stereolithography. The STL file is widely used for Stereolithography, but it is very difficult to convert STL file into Slice file directly. Because it consists of an ordered list of triangular net without any topological information other than the orientation of each facet. So, The system is accomplished by data flow through several intermediate stages such as Reference. SL1. .SL2L. .SL3. and .SLC file. The data processing is performed in 5 steps: 1) Create a Reference file including common information. 2) Modify STL file within the effective range of SL machine. 3) Calculate a point of intersection between plane equation and line equation. 4) Sort z values in ascending order using quick sort algorithm. 5) Search the adjacent points and formulate a closed loop usingsingly linked linear list. The system is developed by using Borland C++ 3.1 compiler in the environment of Pentium PC, and verified to be satisfactory by making some prototypes of electric household appliances.

  • PDF

Application of Linked List Data Storage Scheme into Large Scale Power System Analysis (대규모 전력계통해석을 위한 연결형자료저장기법 적용에 관한 소개)

  • Kim, Seon-Gu;Hur, Seong-Il
    • Proceedings of the KIEE Conference
    • /
    • 2008.07a
    • /
    • pp.305-306
    • /
    • 2008
  • 실계통에서 운영되는 에너지관리시스템(EMS)의 계통해석 기능을 수행하기 위해서는 대규모 자료의 처리가 불가피하며 이에 따른 메모리의 사용에 대한 효율성, 즉 물리적인 자원의 제약성도 고려되어한 한다. 이러한 이유로 인하여 대규모 자료처리가 요구되는 실시간 시스템의 개발에서는 데이터에 대한 저장의 효율성과 접근의 용이성을 제공할 수 있는 자료설계 (Database Design)가 매우 중요하다 [1]. 이를 위하여 EMS에서는 고속의 연산속도에 대한 요구를 만족하며, 효율적이고 빠른 데이터 처리가 가능한 데이터저장기법이 적용된다. 본 논문에서는 상업용 EMS와 현재 개발중인 한국형EMS에서 적용되고 있는 자료저장기법인 연결형데이터저장기법 (Linked List Data Storage Scheme)에 대한 기능원리와 실제 적용에 대하여 소개하고자 한다.

  • PDF

Development a data base structure for a die/tool coding system

  • Rho, H.M.;Shin, D.M.;Lee, C.W.;Fukuda, Y.;Kiyosawa, F.
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.5 no.2
    • /
    • pp.56-61
    • /
    • 1988
  • For the use of computer to store, modify and retieve technical data, GT coding system has been considered as one of the effective methods. Effective data management is important for Computer Intergrated Manufacturing. Based on actual data obtained from a hand-tool maker, a die/tool coding system is developed as an example and its data base is designed susing a linked list structure. It is suggested that industries use this method to make their own data base.

  • PDF

Linked Block Designs for Diallel Cross Experiment

  • Bae, Jong Sung;Lee, Yung Man;Baek, Jang Sun
    • Communications for Statistical Applications and Methods
    • /
    • v.8 no.3
    • /
    • pp.661-666
    • /
    • 2001
  • In this paper we consider the properties of group divisible designs and triangular designs which belong to linked block designs. These designs have minimum number of experiments among the same average efficiency factor Optimal complete diallel cross designs are constructed by these designs. A list is prepared of all linked block designs in the class of group divisible designs and triangular designs enumerated by Clatworthy(1773).

  • PDF