-
公开(公告)号：KR1020130068630A
公开(公告)日：2013-06-26
申请号：KR1020110135925
申请日：2011-12-15
Applicant: 한국전자통신연구원
CPC classification number: G06F9/4401 , G06F9/4411 , G06F9/24 , G06F9/4403 , G06F2211/1097
Abstract: PURPOSE: A method for Initializing an embedded device and a device thereof are provided to improve booting performance, to save memory spaces, and to resolve a duplication problem by composing an Initializing program and an Initializing script as one. CONSTITUTION: An initializing module(406) includes an execution module as an alternate function of an initializing script. A booting sequence control module(410) loads a booting sequence including an operation sequence of a boot process and the initializing module performs the alternate function based on the booting sequence. If a boot loader is operated and a kernel is loaded, an initializing program module(401) executes a function of the initializing module through the booting sequence control module and sets up an embedded system as an usable state. [Reference numerals] (401) Initializing program module; (402) Script replacement function module; (403) Process clean-up module; (404) State controller; (405) Service manager module; (406) Initializing module; (407) Kernel module initialization; (408) Application program initialization; (409) File system initialization; (410) Booting sequence control; (411) Network construction; (412) Environment variable initialization
Abstract translation: 目的：提供一种初始化嵌入式设备及其设备的方法，以提高启动性能，节省存储空间，并通过组合初始化程序和初始化脚本来解决复制问题。 构成：初始化模块（406）包括作为初始化脚本的备用功能的执行模块。 引导顺序控制模块（410）加载包括引导过程的操作序列的引导序列，并且初始化模块基于引导顺序执行备用功能。 如果操作引导加载程序并加载内核，则初始化程序模块（401）通过引导顺序控制模块执行初始化模块的功能，并将嵌入式系统设置为可用状态。 （附图标记）（401）初始化程序模块; （402）脚本替换功能模块; （403）过程清理模块; （404）国家控制人; （405）服务管理模块; （406）初始化模块; （407）内核模块初始化; （408）应用程序初始化; （409）文件系统的初始化; （410）启动顺序控制; （411）网络建设; （412）环境变量初始化
-
公开(公告)号：KR1020130038532A
公开(公告)日：2013-04-18
申请号：KR1020110102940
申请日：2011-10-10
Applicant: 한국전자통신연구원
CPC classification number: H04N5/907 , H04N5/91 , H04N9/8227
Abstract: PURPOSE: A snapshot storage method and device are provided to store a snapshot in continued blocks of a non-volatile memory, thereby minimizing booting time of a system. CONSTITUTION: A preparation unit(111) prepares a snapshot in a main memory unit. A block assignment unit(112) receives a continuous reference block in a non-volatile memory unit. When the block assignment unit assigns the continuous reference block, a storage unit(113) stores the snapshot in the assigned continuous reference block. A swap table preparation unit(114) prepares storage information of the snapshot in a swap table and stores the same in the non-volatile memory unit. When the block assignment unit does not assign the continuous reference block, the block assignment unit receives variable continuous blocks in the non-volatile memory unit. [Reference numerals] (111) Preparation unit; (112) Block assignment unit; (113) Storage unit; (114) Swap table preparation unit; (121) Storage information acquisition unit; (122) Block lead unit; (123) Restoration unit;
Abstract translation: 目的：提供快照存储方法和设备以将快照存储在非易失性存储器的连续块中，从而最小化系统的启动时间。 构成：准备单元（111）在主存储单元中准备快照。 块分配单元（112）在非易失性存储器单元中接收连续的参考块。 当块分配单元分配连续参考块时，存储单元（113）将快照存储在所分配的连续参考块中。 交换表准备单元（114）在交换表中准备快照的存储信息，并将其存储在非易失性存储单元中。 当块分配单元未分配连续参考块时，块分配单元在非易失性存储单元中接收可变连续块。 （111）制备单元; （112）块分配单元; （113）存储单元; （114）交换表准备单元; （121）存储信息采集单元; （122）块引导单元; （123）修复单位;
-
公开(公告)号：KR101213651B1
公开(公告)日：2012-12-18
申请号：KR1020090105072
申请日：2009-11-02
Applicant: 한국전자통신연구원
Abstract: 본발명은운영체제의초기화스크립트의이진화방법, 이진화스크립트및 그실행방법에관한것으로, 보조기억장치내에서이진화할쉘 스크립트(shell script)를호출하는단계, 호출된쉘 스크립트를번역하여실행테이블(Execution Table)을생성하는단계, 실행테이블과기 작성된소스코드템플릿(source code templit)을병합하여소스프로그램을생성하는단계, 및상기소스프로그램을명령서브루틴과결합하고, 컴파일및 빌드작업을수행하여쉘 스트립트를이진화하는단계를포함한다. 본발명에따르면, 본발명은부팅중 시스템초기화를수행하는과정에서쉘 스크립트대신이진화스크립트를적용하여 fork & exec 기법을이용하지않음으로써, 부팅지연시간을최소화시키는이점이있다.
-
公开(公告)号：KR1020110067795A
公开(公告)日：2011-06-22
申请号：KR1020090124543
申请日：2009-12-15
Applicant: 한국전자통신연구원
Abstract: PURPOSE: A tightly-coupled memory management method is provided to improve the response of real-time processes by determining the page to be loaded on the TCM in consideration of a process priority or memory address accessed to TCM, access frequency and recent access time. CONSTITUTION: A process to be saved in a tightly-coupled memory (TCM) requests the access to TCM(210). The TCM transfers the process or the memory information to a TCM manager(220). The process information includes the priority information. The memory information includes the address of the accessed memory, access frequency and recent access time. The TCM manager determines a memory page to be loaded on TCM in consideration of the information on the process or the memory, and then executes the load(230).
Abstract translation: 目的：提供一种紧密耦合的存储器管理方法，以便考虑到访问TCM，访问频率和最近访问时间的进程优先级或存储器地址，确定要加载在TCM上的页面来改善实时进程的响应。 构成：要保存在紧耦合存储器（TCM）中的过程请求访问TCM（210）。 TCM将过程或存储器信息传送到TCM管理器（220）。 处理信息包括优先级信息。 存储器信息包括访问存储器的地址，访问频率和最近访问时间。 TCM管理器考虑到关于进程或存储器的信息来确定要在TCM上加载的存储器页面，然后执行负载（230）。
-
公开(公告)号：KR100927190B1
公开(公告)日：2009-11-18
申请号：KR1020070103073
申请日：2007-10-12
Applicant: 한국전자통신연구원
CPC classification number: G06F3/0659 , G06F3/061 , G06F3/0676 , G06F2209/5021
Abstract: The present invention relates to a method and apparatus for scheduling requests having priorities and deadlines for an I/O operation on a disk storage medium. Requests are normally arranged and processed in deadline order, and requests whose process times based on deadlines overlap each other are processed in priority order. Therefore, it is possible to prevent processing of any requests having relatively higher priorities from being delayed due to a process based on deadline order. Further, in order to minimize seek time, the requests may also be processed in the scanning order. Furthermore, in order to minimize a time required for performing request search and arrangement in the scanning order and the deadline order, a deadline queue where requests are arranged in deadline order and a scan order queue where requests are arranged in the scanning order may be separately prepared.
Abstract translation: 本发明涉及一种用于调度具有磁盘存储介质上的I / O操作的优先级和最后期限的请求的方法和设备。 请求通常按截止日期顺序排列和处理，并且根据截止日期的处理时间彼此重叠的请求按优先顺序处理。 因此，可以防止具有相对较高优先级的任何请求的处理由于基于截止时间顺序的处理而延迟。 此外，为了最小化查找时间，还可以按照扫描顺序处理请求。 此外，为了使按照扫描顺序和截止时间顺序执行请求搜索和排列所需的时间最小化，其中请求按截止顺序排列的截止队列和以扫描顺序排列请求的扫描顺序队列可以是分开的 准备。
-
Patent Agency Ranking
-
公开(公告)号：KR1020160113483A
公开(公告)日：2016-09-29
申请号：KR1020150039174
申请日：2015-03-20
Applicant: 한국전자통신연구원
Inventor： 강동욱
Abstract: 본발명은스냅샷이미지의업데이트기술에관한것이다. 본발명에따른스냅샷이미지업데이트장치는, 업데이트되는메모리영역을더티페이지로서더티페이지목록에저장하는더티페이지기록부; 스냅샷업데이트동작이개시되면, 상기더티페이지목록에저장된더티페이지를저장장치에복사하고, 기존스냅샷이미지에포함된매핑테이블을복사한신규버전매핑테이블을생성하여상기더티페이지가기록되는상기저장장치내위치를기록하는신규매핑테이블작성부; 및상기더티페이지목록에상기저장장치에복사할더티페이지가더 이상존재하지않을경우에상기기존스냅샷이미지의매핑테이블주소를상기신규버전매핑테이블주소로업데이트하는매핑테이블주소업데이트부를포함한다.
Abstract translation: 本发明涉及更新快照图像的技术。 根据本发明的用于更新快照图像的方法包括：脏页记录单元，用于将脏页列表中的更新的存储区域存储为脏页; 一种新的映射表写入单元，用于在开始更新快照的操作时将存储在脏页列表中的脏页面复制到存储设备中，并且生成通过将现有快照图像中包括的映射表复制而导出的新版本映射表 记录在其中记录脏页的存储设备中的位置; 以及映射表地址更新单元，用于当在脏页面列表中的存储设备中没有更多的脏页面复制时，将现有快照图像的映射表地址更新为新版本映射表的地址。
-
公开(公告)号：KR1020150131607A
公开(公告)日：2015-11-25
申请号：KR1020140058512
申请日：2014-05-15
Applicant: 한국전자통신연구원
IPC: G06F3/0488
CPC classification number: G06F3/04886 , G06F1/1626 , G06F1/1684 , G06F1/1686 , G06F3/0304 , G06F3/04817 , G06F2203/0339
Abstract: 본발명에따르면화면상에표시되는사용자인터페이스의위치나배열을조정하여사용자편의성을도모하는사용자인터페이스제어장치및 그것의사용자인터페이스제어방법이제공된다. 본발명에따른사용자인터페이스제어장치의제어방법은사용자의손 위치를감지하는단계, 감지한손 위치에따라사용자인터페이스의배치가적절한지판단하는단계및 판단결과에따라사용자인터페이스가감지한손 위치에근접하여위치하도록사용자인터페이스의배치를변경하는단계를포함한다.
Abstract translation: 本发明提供一种通过调整屏幕上显示的用户界面的位置或布置来提高用户便利性的用户界面控制装置及其用户界面控制方法。 根据本发明，用户界面控制装置的控制方法包括以下步骤：检测用户手的位置; 根据检测到的手的位置确定用户界面的布置是否合适; 以及将用户界面的用户界面的布置改变为位于用户界面检测到的手的位置附近。
-
公开(公告)号：KR1020120038076A
公开(公告)日：2012-04-23
申请号：KR1020100099612
申请日：2010-10-13
Applicant: 한국전자통신연구원
CPC classification number: G06F11/1068 , H03M13/05 , H03M13/6502 , H03M13/6508 , H03M13/6569
Abstract: PURPOSE: A NAND flash memory data I/O method and an embedded system using the same are provided to correct an error by a software ECC method when the size of data is fixed and is smaller than a reference value, thereby increasing performance of correcting an error about data which is smaller than a page size. CONSTITUTION: An interface(105) controls and relays data input of a NAND flash memory. A software ECC(Error Correcting Code) generating unit(112) is synchronized with the interface to generate an ECC by a software ECC method. A hardware ECC generating unit(114) generates the ECC by a hardware ECC method during a process of writing the input data. A record controller(120) compares the size of data inputted through the interface with a reference value to selectively drive the software or hardware ECC generating unit in order to generate the ECC.
Abstract translation: 目的：提供NAND闪存数据I / O方法和使用其的嵌入式系统，以在数据大小固定且小于参考值时通过软件ECC方法校正错误，从而提高校正 关于小于页面大小的数据的错误。 构成：接口（105）控制和中继NAND闪存的数据输入。 软件ECC（纠错码）生成单元（112）与接口同步，以通过软件ECC方法生成ECC。 硬件ECC生成单元（114）在写入输入数据的处理期间通过硬件ECC方法生成ECC。 记录控制器（120）将通过接口输入的数据的大小与参考值进行比较，以选择性地驱动软件或硬件ECC生成单元，以便生成ECC。
-
公开(公告)号：KR1020100069302A
公开(公告)日：2010-06-24
申请号：KR1020080127952
申请日：2008-12-16
Applicant: 한국전자통신연구원
CPC classification number: G06F9/5016
Abstract: PURPOSE: A memory management apparatus and a method thereof are provided to solve memory fragmentation capable of happening by a core without memory management unit in a system combining an asymmetric multi-core processor and enable a plurality of cores efficiently to share memories. CONSTITUTION: A processor(100) comprises a first core which is supposed to be assigned to consecutive memory areas. A memory allocator(300) assigns the consecutive memory areas in response to a memory allocation request of the first core. If memory fragment is not in a memory which is bigger than memory size requested by the first core, the memory allocation processing unit gathers memory fractions installed in the memory and forms one consecutive memory area and assigns the consecutive memory area to the first core.
Abstract translation: 目的：提供一种存储器管理装置及其方法，用于在组合非对称多核处理器的系统中解决能够由核心发生的存储器碎片而不需要存储器管理单元，并且有效地使多个核心共享存储器。 构成：处理器（100）包括被假定分配给连续存储区域的第一核心。 存储器分配器（300）响应于第一核的存储器分配请求分配连续的存储器区域。 如果存储器片段不在大于由第一核心请求的存储器大小的存储器中，则存储器分配处理单元收集安装在存储器中的存储器部分，并形成一个连续的存储器区域，并将连续的存储器区域分配给第一核心。
-
-
-
-
-
-
-
-
-
Search Results
60
records
(took 0.024 seconds)
