公开(公告)号：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）。

公开(公告)号：KR100422801B1

公开(公告)日：2004-03-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: 目的：提供一个大容量文件存储系统和一种增加和删除动态多级别inode数据块的方法，以有效管理大容量文件。 组成：大容量文件存储系统包括一个指针，该指针的级别与存储有关根节点信息的信息节点信息区域（101A）的级别不同。 指针包括双重间接内部指针，其中数据块通过双重间接指针节点存在，单个间接内部指针通过单个间接指针节点存在数据块，以及直接指向数据块的直接点。 根据索引节点的指针根据直接指针，单个间接指针节点和双重间接指针节点通过根据数据块的大小增加和减小电平来分配。

公开(公告)号：KR1020030073981A

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

申请号：KR1020020013800

申请日：2002-03-14

Applicant: 한국전자통신연구원

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

IPC: G06F17/30

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

Abstract: PURPOSE: A method for managing a directory of a high capacity file system is provided to manage a directory by forming an indirect block as a semi flat structure by applying a changed extendable hashing technique based on a fixed length extent block and a virtual block mapping technique, and memorizing the next insertion position of a directory using a scan indicator for preventing a sequential search in an extent block. CONSTITUTION: A root block(50) for storing a directory entry is created. The directory entry is stored continuously and sequentially. At this time, the root block(50) has a fixed global depth. If a directory entry is filled entirely in the root block(50), an index value for displaying position information for deciding the number of bits to be referred with respect to the root block(50) from the global depth through a hash function is searched. A block number of leaf blocks(60,70) comprises extent blocks(61-64,71-74) based on four fixed lengths which are logical and continuous objects. The leaf blocks(60,70) are searched using the index value. The block number is stored in the root block(50) sequentially, and a directory entry of the root block(50) is stored in the leaf blocks(60,70).

Abstract translation: 目的：提供一种用于管理大容量文件系统的目录的方法，通过使用基于固定长度范围块和虚拟块映射技术的改变的可扩展散列技术来形成间接块作为半平面结构来管理目录 并且使用扫描指示符来存储目录的下一个插入位置，以防止扩展块中的顺序搜索。 构成：创建用于存储目录条目的根块（50）。 目录条目是连续和顺序存储的。 此时，根块（50）具有固定的全局深度。 如果目录条目完全填充在根块（50）中，则搜索用于通过散列函数从全局深度显示用于决定关于根块（50）要参考的位数的位置信息的索引值 。 基于作为逻辑和连续对象的四个固定长度的块数目（60,70）包括扩展块（61-64,71-74）。 使用索引值搜索叶块（60,70）。 块编号依次存储在根块（50）中，根块（50）的目录项被存储在叶块（60,70）中。

公开(公告)号：KR100392382B1

公开(公告)日：2003-07-23

申请号：KR1020010045621

申请日：2001-07-27

Applicant: 한국전자통신연구원

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

IPC: G06F12/02

CPC classification number: G06F3/0601 ,  G06F2003/0697

Abstract: A method for managing a logical volume for minimizing a size of metadata and supporting dynamic online resizing, computer-readable recoding medium storing a program or data structure for embodying the method are disclosed. The method for managing a logical volume in order to support dynamic online resizing and minimizing a size of metadata, said method comprising steps of: a) creating a logical volume by rounding up disk partitions in response to a request of constructing the logical volume on a physical storage space; b) generating metadata including information of the logical volume and the disk partitions participating to the logical volume and storing it to the disk partitions participating to the logical volume; c) dynamically resizing the logical volume in response to a request of resizing, and modifying the metadata on the disk partitions participating to the logical volume; and d) calculating and returning a physical address corresponding to a logical address of the logical volume by using mapping information of the metadata containing information of the physical address corresponding to the logical address.

Abstract translation: 公开了一种用于管理用于最小化元数据的大小并支持动态在线调整大小的逻辑卷的方法，存储用于实现该方法的程序或数据结构的计算机可读记录介质。 用于管理逻辑卷以便支持动态在线调整大小和最小化元数据大小的方法，所述方法包括以下步骤：a）响应于构建逻辑卷上的逻辑卷的请求，通过将磁盘分区四舍五入来创建逻辑卷 物理存储空间; b）生成包括逻辑卷和参与逻辑卷的磁盘分区的信息的元数据，并将其存储到参与逻辑卷的磁盘分区; c）响应于调整大小的请求动态调整逻辑卷的大小，并修改参与逻辑卷的磁盘分区上的元数据; 以及d）通过使用包含对应于逻辑地址的物理地址的信息的元数据的映射信息来计算并返回对应于逻辑卷的逻辑地址的物理地址。

公开(公告)号：KR1020030034577A

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

申请号：KR1020010066218

申请日：2001-10-26

Applicant: 한국전자통신연구원

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

IPC: G06F3/06

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

Abstract: PURPOSE: A striping system and its mapping and processing method is provided to store striping data at a RAID(Redundancy Array of Inexpensive Disks) for enhancing a disk IO performance, and specially, to make it unnecessary rearranging data on the disk by using a stripping zone information table and a mapping algorithm. CONSTITUTION: The method comprises several steps. A striping system determines whether there exists an additional disk at a storage media(S100). If a new disk is added, the striping system adds the striping zone information of the new disk to the existing striping zone information table(S102). The system converts the logical address of write data in the striping zone information table into the physical one, searches for the physical position, and determines a corresponding striping zone(S104). In a case that the system receives a disk write instruction, the system accesses a physical block within a striping zone of a corresponding disk based on the converted table data, and writes the data on the striping zone(S106, S108). In a case that the system does not receives a disk write instruction, the system accesses a physical block within a striping zone of a corresponding disk based on the converted table data, and reads the data from the striping zone(S106, S110).

Abstract translation: 目的：提供条带化系统及其映射和处理方法，以便在RAID（廉价磁盘冗余阵列）中存储条带化数据，以增强磁盘IO性能，特别是通过使用剥离不必要地重新排列磁盘上的数据 区域信息表和映射算法。 构成：该方法包括几个步骤。 条带化系统确定在存储介质上是否存在附加的盘（S100）。 如果添加新磁盘，则条带化系统将新磁盘的条带区信息添加到现有的条带区信息表中（S102）。 系统将条带区信息表中的写数据的逻辑地址转换成物理位置，搜索物理位置，并确定相应的条带区（S104）。 在系统接收到磁盘写指令的情况下，系统基于转换后的表数据访问相应磁盘的条带区内的物理块，并将数据写入条带区（S106，S108）。 在系统没有接收到磁盘写指令的情况下，系统基于转换的表数据访问对应磁盘的条带区内的物理块，并从条带区读取数据（S106，S110）。

公开(公告)号：KR1020030013619A

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

申请号：KR1020010047715

申请日：2001-08-08

Applicant: 한국전자통신연구원

Inventor： 박춘서 ,  김창수 ,  김경배 ,  신범주 ,  유재수 ,  송석일 ,  신재룡

IPC: G06F17/30

Abstract: PURPOSE: A method for inserting and searching data of a parallel higher index structure is provided to search a higher index effectively by transforming a higher index structure which uses a parallel property of a SAN(Storage Area Network) thereby increasing a fan out, reducing a height of a tree, and maximizing a parallel property of an input/output at searching a range in searching a similarity. CONSTITUTION: For performing a partial K-most access query in a main server and all sub servers simultaneously, if a K-access query is entered, all servers access to a root node(1300). It is judged whether the accessed root node is a non-terminal node or not(1301). If the accessed root node is a non-terminal node, all servers calculates a similarity with a query and an entry, and each entry is sorted in a list in order of similarity(1302). All servers access to a child node of the first entry stored in the list in parallel and allocate the current node as a root node(1303), and the current stage is returned to the above stage (1301) for judging a non-terminal node of not of the root node.

Abstract translation: 目的：提供一种用于插入和搜索并行较高索引结构的数据的方法，通过转换使用SAN（存储区域网络）的并行属性的较高索引结构，有效地搜索较高索引，从而增加扇出，减少 在搜索相似度的范围内最大化输入/输出的并行属性。 规定：为了在主服务器和所有子服务器中同时执行部分K最多访问查询，如果输入K访问查询，则所有服务器都访问根节点（1300）。 判断所访问的根节点是否是非终端节点（1301）。 如果所访问的根节点是非终端节点，则所有服务器计算与查询和条目的相似性，并且每个条目按照相似度的顺序排列在列表中（1302）。 所有服务器并行地存储在列表中的第一条目的子节点并分配当前节点作为根节点（1303），并且当前阶段返回到上述阶段（1301），以判断非终端节点 不是根节点。

公开(公告)号：KR1020010076774A

公开(公告)日：2001-08-16

申请号：KR1020000004129

申请日：2000-01-28

Applicant: 한국전자통신연구원

Inventor： 이근영 ,  이권일 ,  신범주 ,  손덕주 ,  남궁한

IPC: G06F11/00

Abstract: PURPOSE: A device and method for creating a duplication object by a remote control is provided to move a server object embodying code of a server object prepared in a remote system 1 to another remote system for creating a copying object and to execute the moved server object embodying code without a user's intervention. CONSTITUTION: If a server object registration request is received in a server object processing unit(301), a server object is registered(302). In addition, it is judged whether a copying object of the server object is created(303). In case that a copying object of the server object is created, a copying object process data structure including a packet identifier, a message kind identifier, a target host name, a copying object name, a copying object key, and a server object embodying code necessary to a copying object creating request is created(304). The created copying object process data structure is converted into a packet having a proper type to be transmitted through a network(305), and is transmitted to a network(307) through a communication channel opened in accordance with a used communication protocol(306).

Abstract translation: 目的：提供一种用于通过远程控制创建复制对象的设备和方法，用于将体现在远程系统1中准备的服务对象的代码的服务器对象移动到另一个远程系统以创建复制对象并执行移动的服务器对象 体现代码而无需用户干预。 构成：如果在服务器对象处理单元（301）中接收到服务器对象注册请求，则登记服务对象（302）。 此外，判断是否创建了服务对象的复制对象（303）。 在创建服务器对象的复制对象的情况下，包括包标识符，消息种类标识符，目标主机名，复制对象名称，复制对象密钥和体现代码的服务对象的复制对象处理数据结构 创建复制对象创建请求所必需的（304）。 所创建的复制对象处理数据结构被转换成具有通过网络传送的正确类型的分组（305），并且通过根据所使用的通信协议（306）打开的通信信道被发送到网络（307） 。

公开(公告)号：KR100260517B1

公开(公告)日：2000-07-01

申请号：KR1019970065679

申请日：1997-12-03

Applicant: 한국전자통신연구원

Inventor： 김형철 ,  박치항 ,  이혁희 ,  신범주

IPC: H04L12/44 ,  H04L12/18

Abstract: PURPOSE: A method of conference roster exchange in a multipoint conference control module is provided so that an unnecessary processing time and data can be decreased by transmitting information from a new lower node to an upper node. CONSTITUTION: A conference roster correction notifying PDU is transmitted from a new lower node(1101), and the received PDU is decoded(1102). A state of a selector of the PDU is detected(1103). When the selector indicates 'refresh', the procedure of T.124 is performed(1104). The corrected conference roster is converted into the conference roster correction notifying PDU(1105). Thereafter, the new conference roster correction notifying PDU is coded again(1106). The coded PDU is transmitted to an upper node(1107). On the other hand, when the selector indicates 'update', the coded PDU from the lower node is separately stored(1108). The conference roster is corrected according to a kind of the selector of a node correction record of an update-list in the decoded PDU(1109). When the selector indicates 'add', it implies that a new node takes part in the conference. Thus, node information of the node correction record is added to the conference roster(1110). When the selector indicates 'replace', it implies that node information of the specific node number is replaced by the contents of the PDU(1111). When the selector indicates 'remove', node information corresponding to a node number of the node correction record is deleted(1112). When correction of the conference roster is finished, the coded PDU is transmitted to the upper node as it is(1113).

Abstract translation: 目的：提供一种多点会议控制模块中的会议名册交换方法，通过从新的下层节点向上层节点发送信息，可以减少不必要的处理时间和数据。 构成：从新的下层节点（1101）发送会议名单校正通知PDU，对接收到的PDU进行解码（1102）。 检测PDU的选择器的状态（1103）。 当选择器指示“刷新”时，执行T.124的过程（1104）。 经修正的会议名单被转换成会议名单纠正通知PDU（1105）。 此后，再次对新的会议名单校正通知PDU进行编码（1106）。 编码的PDU被发送到上层节点（1107）。 另一方面，当选择器指示“更新”时，来自下层节点的编码PDU被单独存储（1108）。 根据解码的PDU（1109）中的更新列表的节点校正记录的选择器的种类来校正会议名单。 当选择器指示“添加”时，这意味着新的节点参与会议。 因此，节点校正记录的节点信息被添加到会议名单（1110）。 当选择器指示“替换”时，表示特定节点编号的节点信息被PDU的内容替换（1111）。 当选择器指示“删除”时，与节点校正记录的节点编号对应的节点信息被删除（1112）。 当会议名单的校正完成时，编码的PDU被传送到上级节点（1113）。

公开(公告)号：KR1019990047324A

公开(公告)日：1999-07-05

申请号：KR1019970065681

申请日：1997-12-03

Applicant: 한국전자통신연구원

Inventor： 임헌규 ,  박치항 ,  이재영 ,  신범주 ,  김준성

IPC: G06F9/44

Abstract: 본 발명은 멀티미디어 데이터 처리 응용 프로그램을 하나의 멀티미디어 데이터 흐름도에 의해 내부 처리를 표현하여 프로그래밍 경험 및 지식이 전혀 없는 일반 사용자도 쉽게 사용할 수 있는 시각 멀티미디어 프로그래밍 장치의 개발을 위해, 흐름도를 구성하는 대표적인 구성 요소인 멀티미디어 스트림 처리 객체에 대한 구조 및 세부 장치에 대한 것이다.
최근의 개인용 컴퓨터는 대부분 멀티미디어 데이터 처리를 지원하는 멀티미디어 컴퓨터로서, 음성 및 동영상 데이터를 다양하게 처리할 수 있는 능력을 갖고 있지만 다양한 응용 프로그램이 제공되지 못하고 있는 관계로 일반 사용자가 자신의 멀티미디어 컴퓨터 능력을 충분히 활용하지 못하고 있는 실정이다.
이러한 문제점을 해결하여 일반 사용자들도 쉽게 자신이 원하는 간단한 멀티미디어 응용을 쉽게 개발할 수 있도록 하는 시각적인 멀티미디어 프로그래밍 장치가 이미 본 발명의 발명자에 의해 발명되었으며, 이 발명의 주요 핵심 구성 요소인 멀티미디어 스트림 처리 객체에 대한 내부 구조 및 동작 원리가 본 발명에 의해 이루어졌다.