公开(公告)号：KR1020050060804A

公开(公告)日：2005-06-22

申请号：KR1020030092526

申请日：2003-12-17

Applicant: 한국전자통신연구원

Inventor： 강동재 ,  김경배 ,  정성인 ,  김명준

IPC: G06F12/16

Abstract: 본 발명은 데이터를 중복 저장하는 읽기 연산 집약 시스템에서 디스크에 저장되는 데이터 블록의 배치를 수정하고 이에 따른 새로운 맵핑 방식을 제공함으로써 기존의 데이터 중복 저장 방식(RAID1)의 장점인 데이터 신뢰성을 유지하면서 동시에 데이터 분산 저장 방식(RAID0)의 빠른 읽기 성능을 갖는 대용량 데이터에 대한 데이터 중복 저장 시스템에 관한 것이다.
본 발명의 데이터 중복 저장 시스템은 원본 데이터를 저장하는 원본 디스크와 상기 원본 데이터에 대한 사본들을 저장하는 다수의 중복 디스크들로 구성되며, 디스크 개수만큼의 연속적인 데이터 블록들을 그룹핑하여 상기 원본 디스크와 상기 중복 디스크들에 대한 SMU들을 생성한 후 각 디스크내에서 SMU 순서에 따라 SMU에 SMUno값을 부여하고 각 SMU내에서의 데이터 블록의 순서에 따라 데이터 블록에 SMUidx값을 부여하며, 동일 SMUno값의 각 SMU내에서의 동일 데이터 블록들은 각 디스크마다 서로 다른 배치 순서를 갖는 것을 특징으로 한다.

公开(公告)号：KR100449485B1

公开(公告)日：2004-09-21

申请号：KR1020010066218

申请日：2001-10-26

Applicant: 한국전자통신연구원

Inventor： 박유현 ,  김창수 ,  김경배 ,  신범주

IPC: G06F3/06

CPC classification number: G06F3/0632 ,  G06F3/0607 ,  G06F3/0689

Abstract: A system having RAID levels includes a storage medium, a memory and a CPU. The storage medium has at least two disks. The memory stores a striping zone information table of total disks in which a physical address of data recorded in a disk of the storage medium is converted into a logic address. The CPU modifies a striping zone information table stored in the memory in case a new disk is added to the storage medium, stores the modified striping zone information table in the memory, converts a logic address of data to be written/read out from the stored table into a physical address in response to the disk writing/reading instructions, searches positions of a corresponding disk D and a physical block B and controls writing or reading out data.

Abstract translation: 具有RAID级别的系统包括存储介质，存储器和CPU。 存储介质至少有两个磁盘。 存储器存储总盘的分条区信息表，其中记录在存储介质的盘中的数据的物理地址被转换成逻辑地址。 如果新磁盘被添加到存储介质中，CPU修改存储在存储器中的分条区信息表，将修改的分条区信息表存储在存储器中，将要被写入/读出的数据的逻辑地址从存储的 表响应于盘写入/读取指令转换成物理地址，搜索相应盘D和物理块B的位置并控制写入或读出数据。

公开(公告)号：KR100431511B1

公开(公告)日：2004-05-13

申请号：KR1020020045951

申请日：2002-08-03

Applicant: 한국전자통신연구원

Inventor： 박선영 ,  손덕주 ,  김경배

IPC: G06F15/16

Abstract: PURPOSE: A method for managing a global buffer capable of executing a load distribution in a cluster system is provided to calculate loads of each host and distribute a request of a global buffer manager for preventing a performance decline caused by a concentration to a specific host in a system of a system load necessary for an operation of a global buffer manager when a buffer cache is shared among many hosts through a global buffer manager in a cluster system. CONSTITUTION: The upper module of a specific host of a cluster system requests a transmission of a buffer block to a global buffer manager(S131). The global buffer manager requests a permission as to a corresponding disk block to a locking manager(S132). The locking manager transmits a response message including an accept of the permission to the global buffer manager(S133). If the global buffer manager acquires a permission, it is checked whether a requested buffer block exists in a buffer cache of a host having a permission(S136). If a requested buffer block does not exist in a buffer cache of a host having a permission, it is checked whether a requested buffer block exists in a buffer cache of other host(S137). If a requested buffer block exists in a buffer cache of other host, a transmission of a buffer block is requested to other host through a communication module(S138,S140). If a transmission of a buffer block requested to other host is failed, the buffer block requested through a disk I/O is copied to the buffer cache(S139). The copied buffer block or a buffer block received from a buffer cache of other host is transmitted to the upper module(S142). If the upper block requests a release of a buffer block use, the global buffer manager returns a permission as to the buffer block(S145).

Abstract translation: 目的：提供一种用于管理能够执行集群系统中的负载分配的全局缓冲器的方法，以计算每个主机的负载并分配全局缓冲器管理器的请求，以防止由于集中到特定主机而导致性能下降 当一个缓冲区缓存在多个主机间通过一个集群系统中的全局缓冲区管理器共享时，一个全局缓冲区管理器操作所需的系统负载系统。 构成：集群系统的特定主机的上层模块请求将缓冲块传输到全局缓冲区管理器（S131）。 全局缓冲区管理器向锁定管理器请求关于相应磁盘块的许可（S132）。 锁定管理器向全局缓冲器管理器发送包括许可接受的响应消息（S133）。 如果全局缓冲区管理器获得许可，则检查所请求的缓冲区块是否存在于具有许可的主机的缓冲区高速缓存中（S136）。 如果请求的缓冲块不存在于具有权限的主机的缓冲区高速缓存中，则检查所请求的缓冲块是否存在于其他主机的缓冲区高速缓存中（S137）。 如果所请求的缓冲块存在于其他主机的缓冲区高速缓存中，则通过通信模块向其他主机请求发送缓冲块（S138，S140）。 如果向其他主机请求的缓冲块传输失败，则通过磁盘I / O请求的缓冲块被复制到缓冲区缓存（S139）。 从其他主机的缓冲区缓存接收的复制的缓冲块或缓冲块被发送到上层模块（S142）。 如果上部块请求释放缓冲块使用，则全局缓冲管理器返回关于缓冲块的许可（S145）。

公开(公告)号：KR1020030014513A

公开(公告)日：2003-02-19

申请号：KR1020010048542

申请日：2001-08-11

Applicant: 한국전자통신연구원

Inventor： 강동재 ,  김창수 ,  김경배 ,  신범주

IPC: G06F15/16

Abstract: PURPOSE: A system for sharing client data for distributing a load of a server and a method thereof are provided to transmit and process data among clients by transforming and applying a P2P(Peer-to-Peer) which is a file sharing method on the Internet to a client/server environment. CONSTITUTION: A server portion component(100) manages client information being connected to the server and information of data cached the client, and performs a control for making the client which caches corresponding data in accordance with a data request from a connected specific client support data. A client portion component(200) processes a connection formation for sharing cache data with other client connected to the server in accordance with a message from the server portion component(100). The client portion component(200) includes a packet conversion module(210) for converting and using a packet being used in a conventional client/server system, and a communication module among clients(220) for performing a connection formation for sharing data among clients connected to the server.

Abstract translation: 目的：提供一种用于分发用于分发服务器负载的客户端数据的系统及其方法，用于通过在因特网上转换和应用作为文件共享方法的P2P（对等）来在客户端之间传送和处理数据 到客户端/服务器环境。 构成：服务器部分组件（100）管理连接到服务器的客户端信息和缓存客户端的数据信息，并根据来自连接的特定客户端支持数据的数据请求执行使客户端缓存对应数据的控制 。 客户部分组件（200）根据来自服务器部分组件（100）的消息，处理与连接到服务器的其他客户机共享缓存数据的连接结构。 客户端部分（200）包括用于转换和使用在常规客户机/服务器系统中使用的分组的分组转换模块（210），以及客户端（220）中的通信模块，用于执行用于在客户端之间共享数据的连接形成 连接到服务器。

公开(公告)号：KR1020030075854A

公开(公告)日：2003-09-26

申请号：KR1020020015322

申请日：2002-03-21

Applicant: 한국전자통신연구원

Inventor： 박춘서 ,  김경배 ,  신범주 ,  이용주 ,  박선영

IPC: G06F15/16

CPC classification number: G06F11/1474 ,  G06F11/1471

Abstract: PURPOSE: A method for journaling and recovering a shared disk file system is provided to increase a journaling speed by transmitting the changed metadata through network without reflecting to a disk if one host changes the metadata and other host accesses the same metadata in a shared disk environment such as an SAN(Storage Area Network) environment. CONSTITUTION: If a system call operation for processing journaling is occurred, a new transaction region is allotted and initialized by staring a transaction for guaranteeing the recovery, and a transaction type is set. The transaction manages the lock information by getting the lock information for the changed information and adding it to the transaction, and the update of the changed metadata is pinned while the metadata is changed(201). The changed metadata added to the transaction and the changed information for the important general data are stored in a journal space, and the lock information connected to the transaction is unlocked(203).

Abstract translation: 目的：提供用于日记和恢复共享磁盘文件系统的方法，以通过网络传输已更改的元数据而不反映磁盘，如果一个主机更改元数据并且其他主机在共享磁盘环境中访问相同的元数据，则可提高日志记录速度 例如SAN（存储区域网络）环境。 构成：如果发生用于处理日志记录的系统调用操作，则通过盯着一个事务来分配和初始化新的事务区域，以保证恢复，并且设置事务类型。 该事务通过获取改变的信息的锁定信息并将其添加到事务来管理锁定信息，并且在元数据被改变时固定更改的元数据（201）。 添加到事务中的更改的元数据和重要的一般数据的改变的信息被存储在日记空间中，并且连接到事务的锁定信息被解锁（203）。

公开(公告)号：KR1020030010946A

公开(公告)日：2003-02-06

申请号：KR1020010045621

申请日：2001-07-27

Applicant: 한국전자통신연구원

Inventor： 김창수 ,  김경배 ,  신범주

IPC: G06F12/02

CPC classification number: G06F3/0601 ,  G06F2003/0697

Abstract: PURPOSE: A method for managing a logical volume for minimizing the dynamic size change and a metadata volume is provided to manage the logical volume by using a mapping table for a relation between a logical and a physical address and a minimal storage for the system metadata. CONSTITUTION: The logical volume is generated by gathering the disk partitions according to a logical volume configuration request for a physical storage. The metadata including the information for the disk partitions joining with the logical and the physical volume and stores the metadata in the disk partition. A size of the logical volume is dynamically changed by receiving a change request from the disk partition configuring the logical volume and the change of the metadata needed to change the logical volume is carried out. The physical address corresponding to the mapping information of the metadata storing the information of the physical address matched with the logical address is understood and returned by receiving the logical address of the logical volume.

Abstract translation: 目的：一种用于管理逻辑卷以最小化动态大小更改的方法，并提供元数据卷以通过使用逻辑和物理地址之间的关系的映射表以及系统元数据的最小存储来管理逻辑卷。 构成：逻辑卷是通过根据物理存储的逻辑卷配置请求收集磁盘分区而生成的。 元数据包括与逻辑和物理卷相连接的磁盘分区的信息，并将元数据存储在磁盘分区中。 通过从配置逻辑卷的磁盘分区接收到更改请求并执行更改逻辑卷所需的元数据的更改来动态地更改逻辑卷的大小。 通过接收逻辑卷的逻辑地址来理解并返回与存储与逻辑地址匹配的物理地址的信息的元数据的映射信息对应的物理地址。

公开(公告)号：KR1020020092550A

公开(公告)日：2002-12-12

申请号：KR1020010031213

申请日：2001-06-04

Applicant: 한국전자통신연구원

Inventor： 김경배 ,  김창수 ,  신범주

IPC: G11B20/10

Abstract: PURPOSE: A large-capacity file storage system and a method of adding and deleting data blocks of dynamic multi-level inode are provided to effectively manage large-capacity files. CONSTITUTION: A large-capacity file storage system includes a pointer having a level different from the level of an inode information area(101A) storing information about root inode. The pointer includes a double indirect inner pointer in which a data block exists through double indirect pointer nodes, a single indirect inner pointer in which a data block exists through a single indirect pointer node, and a direct point that directly points a data block. The pointer of the root inode is allocated according to the direct pointer, single indirect pointer node and double indirect pointer node by increasing and decreasing the level in accordance with the size of the data block.

Abstract translation: 目的：提供大容量文件存储系统和添加和删除动态多级节点数据块的方法，以有效地管理大容量文件。 构成：大容量文件存储系统包括具有不同于存储关于根节点的信息的信息节点信息区域（101A）的级别的指针。 该指针包括一个双间接内部指针，其中通过双间接指针节点存在数据块，通过单个间接指针节点存在数据块的单个间接内部指针，以及直接指向数据块的直接点。 根索引节点的指针根据直接指针，单间接指针节点和双间接指针节点通过根据数据块的大小增加和减少电平来分配。

公开(公告)号：KR100484942B1

公开(公告)日：2005-04-25

申请号：KR1020020013800

申请日：2002-03-14

Applicant: 한국전자통신연구원

Inventor： 이용주 ,  김경배 ,  신범주

IPC: G06F17/30

CPC classification number: G06F17/30091 ,  Y10S707/99953 ,  Y10S707/99956

Abstract: 본 발명은 대용량 파일시스템의 디렉토리 관리방법에 관한 것이다.
본 발명은 일정한 전역 깊이를 갖는 루트 블록을 생성하는 단계; 및 루트 블록에 디렉토리 엔트리가 완전히 채워지면 해시함수를 통해 상기 전역깊이로부터 루트 블록에 대하여 몇 개의 비트를 참조할 것인가에 대한 위치정보를 나타내는 인덱스 값을 구하고, 이 인덱스 값으로 논리적이고 연속된 객체인 복수의 고정 길이 기반의 익스텐트 블록으로 구성된 리프 블록들의 블록 넘버를 구하여 루트 블록에 순차적으로 저장한 후, 루트 블록의 디렉토리 엔트리를 리프 블록에 나누어 저장하는 단계로 이루어지며,
이에 따라서, 파일시스템의 자료저장구조에 대한 빈번한 변경 원인을 지연시키고 간접 블록의 생성을 유연하게 방지하여 검색 성능을 향상시킨다.

公开(公告)号：KR100453228B1

公开(公告)日：2004-10-15

申请号：KR1020020015322

申请日：2002-03-21

Applicant: 한국전자통신연구원

Inventor： 박춘서 ,  김경배 ,  신범주 ,  이용주 ,  박선영

IPC: G06F15/16

CPC classification number: G06F11/1474 ,  G06F11/1471

Abstract: A journaling method is provided for supporting a recovery when a system is abnormally terminated in a shared disk environment. When a system call operation to take part in a journaling is generated, in order to guarantee a recovery, a transaction is started and new transaction region is assigned. Then, a system is initialized and a transaction type is set up. Lock information on modified data is acquired and added to the transaction so that a transaction manages lock information. A reflection to a disk during a modification of metadata is prevented. Modified metadata added to the transaction and modified information on principal general data are recorded. Then, lock information connected to the transaction is released.

Abstract translation: 提供日志记录方法，用于在共享磁盘环境中系统异常终止时支持恢复。 生成参与日记的系统调用操作时，为了保证恢复，将启动事务并分配新的事务区域。 然后，初始化系统并设置交易类型。 获取已修改数据的锁定信息并将其添加到事务中，以便事务管理锁定信息。 防止在修改元数据期间反映磁盘。 记录添加到交易中的修改元数据和主要通用数据的修改信息。 然后，释放连接到交易的锁定信息。

公开(公告)号：KR100452631B1

公开(公告)日：2004-10-14

申请号：KR1020020010855

申请日：2002-02-28

Applicant: 한국전자통신연구원

Inventor： 김경배 ,  이용주 ,  박춘서 ,  박선영 ,  신범주

IPC: G06F17/40

Abstract: PURPOSE: A mass file storage system and a dynamic bitmap management method are provided to dynamically allocate a bit map without being restricted by a file size so that it can effectively manage large sized files. CONSTITUTION: The method comprises several steps. A bit map is read from a storage device(S521). A pattern value is read from the header of the bit map in order to be compared with an object pattern requested by a file system(S522). If the pattern of the bit map is identical to that of the object pattern, the number of used bits is compared with that of the total bits(S523). If the number of the used bits is less than that of the total bits, unused bits are set with "1"(S524). Then, a bit map area is allocated to a corresponding object(S525). If the pattern of the bit map is not identical to that of the object or the number of the used bits is more than that of the total bits, it is checked whether there is a bit map in use allocated at a current bit map area(S526). If there is a bit map in use, a new bit map is read, otherwise an unused bit map is selected from a bit map area and is set with a requested pattern(S527). Then, the first bit of the new allocated bit map is set with "1" for allocating a bit map area to the object(S528).

Abstract translation: 目的：提供海量文件存储系统和动态位图管理方法，以动态分配位图而不受文件大小的限制，从而可以有效地管理大型文件。 构成：该方法包括几个步骤。 从存储设备读取位图（S521）。 从位图的标题读取模式值，以便与文件系统请求的对象模式进行比较（S522）。 如果位图的图案与对象图案的图案相同，则将使用的位数与总位数进行比较（S523）。 如果使用的比特数小于总比特数，则将未使用的比特设置为“1”（S524）。 然后，将位图区域分配给对应的对象（S525）。 如果位图的图案与对象的图案不相同或者所使用的位的数量多于总位数，则检查在当前位图区域处分配的位图是否存在（ S526）。 如果正在使用位图，则读取新的位图，否则从位图区域选择未使用的位图并用所请求的图案设置（S527）。 然后，新分配的位图的第一位被设置为“1” 用于将位图区域分配给对象（S528）。