-
公开(公告)号：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
-
公开(公告)号：KR101910192B1
公开(公告)日：2018-10-22
申请号：KR1020110102500
申请日：2011-10-07
Applicant: 한국전자통신연구원 , 국민대학교산학협력단
CPC classification number: H04N13/106 , H04N13/161 , H04N13/194 , H04N19/00 , H04N19/132 , H04N19/136 , H04N19/172 , H04N19/587 , H04N19/597 , H04N21/234327 , H04N21/2365 , H04N21/4307 , H04N21/4347
Abstract: 3DTV 서비스에서의영상압축규격결정방법및 장치가제공된다. 영상압축규격결정방법은고화질영상을부호화하여채널 1을통해전송하고, 부호화된저화질영상의해상도가부호화된고화질영상대비기준값이상에해당하는영상압축규격을결정하고, 결정된영상압축규격에따라저화질영상을부호화하여채널 2를통해전송할수 있다.
-
48.发明授权고정 및 이동 융합형 ３ＤＴＶ에서 좌／우 스트림을 동기화하는 컨텐츠 제공 장치 및 방법, 그리고, 컨텐츠 재생 장치 및 방법 有权用于在固定和移动会聚型3DTV中同步左/右流的设备和方法，方法和内容再现设备和方法
公开(公告)号：KR101856093B1
公开(公告)日：2018-05-10
申请号：KR1020120117827
申请日：2012-10-23
Applicant: 한국전자통신연구원 , (주)카이미디어 , 국민대학교산학협력단 , (주)하이디어 솔루션즈
IPC: H04N13/00
CPC classification number: H04N13/167 , H04N13/194 , H04N21/2362 , H04N21/242 , H04N21/4307 , H04N21/4345
Abstract: 고정및 이동융합형 3DTV에서좌/우스트림을동기화하는장치및 방법이개시된다. 본발명의일실시예에따른장치는 (i) 타임스탬프페어링방식, (ii) 타임스탬프오프셋방식, (iii)NTP 동기방식을이용하여좌영상과우영상에대응하는컨텐츠스트림을동기화할수 있다.
-
公开(公告)号：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: 本发明提供一种通过调整屏幕上显示的用户界面的位置或布置来提高用户便利性的用户界面控制装置及其用户界面控制方法。 根据本发明，用户界面控制装置的控制方法包括以下步骤：检测用户手的位置; 根据检测到的手的位置确定用户界面的布置是否合适; 以及将用户界面的用户界面的布置改变为位于用户界面检测到的手的位置附近。
-
-
-
-
-
-
-
-
-
Search Results
57
records
(took 0.04 seconds)
