专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

61. 发明申请

WO01057677A1 METHODS AND CIRCUITS FOR SECURING ENCACHED INFORMATION 审中-公开
标题翻译：用于保护信息的方法和电路
公开(公告)号：WO01057677A1
公开(公告)日：2001-08-09
申请号：PCT/US2001/002767
申请日：2001-01-26
IPC分类号： G06F12/08 , G06F12/12 , G06F12/14 , G06F21/57 , G06F21/71
CPC分类号： G06F21/71 , G06F12/126 , G06F21/572 , G06F2211/1097
摘要： A method of preventing access and observation of encached information includes the steps of generating and storing private information to be encached in memory. A translation look aside buffer is updated with descriptors to the locations in memory containing the private information. A cache miss is forced to a selected location in cache to be loaded with a selected portion of the private information. The selected portion of the private information is retrieved from memory using the corresponding descriptor from the translation look aside buffer and encached. The selected portion of the private information is locked in the selected location in cache.
摘要翻译：防止访问和观察加密信息的方法包括生成和存储要加密在存储器中的私人信息的步骤。使用描述符将缓冲区的翻译视图更新到包含私有信息的存储器中的位置。高速缓存未命中被强制到高速缓存中的选定位置以加载私有信息的所选部分。使用来自翻译后备缓冲器的对应描述符从存储器检索所选择的私人信息部分并被加密。私有信息的所选部分被锁定在高速缓存中的所选位置。

62. 发明申请

WO01057673A1 COORDINATED AND PERSONALIZED APPLICATION AND DATA MANAGEMENT 审中-公开
标题翻译：协调和个性化应用程序和数据管理
公开(公告)号：WO01057673A1
公开(公告)日：2001-08-09
申请号：PCT/US2001/003594
申请日：2001-02-02
IPC分类号： G06F7/00 , G06F12/12 , G06F15/16 , G06F17/30 , H04L12/24 , H04L12/58 , H04L29/06 , H04L29/08 , G06F12/00 , G06F12/02 , G06F12/06
CPC分类号： H04W28/10 , G06F12/121 , G06F17/30867 , H04L29/06 , H04L41/00 , H04L41/12 , H04L51/06 , H04L51/38 , H04L67/04 , H04L67/06 , H04L67/1095 , H04L67/18 , H04L67/2804 , H04L67/2842 , H04L67/2852 , H04L67/288 , H04L67/306 , H04L69/329 , Y10S707/99932 , Y10S707/99934 , Y10S707/99935 , Y10S707/99936 , Y10S707/99945 , Y10S707/99948
摘要： An exemplary method for managing information in a mobile device comprises the steps of downloading a first set of files, determining whether a local cache has enough space to store the first set of files (520), storing the first set of files into the local cache if the local cache has enough space (522), selecting an out-dated record and removing a second set of files corresponding to the out-dated record from the local cache if the local cache does not have enough space (530), and repeating the determining step until the first set of files is stored into the local cache.
摘要翻译：用于管理移动设备中的信息的示例性方法包括以下步骤：下载第一组文件，确定本地高速缓存是否具有足够的空间来存储第一组文件（520），将第一组文件存储到本地高速缓存如果本地高速缓存具有足够的空间（522），如果本地高速缓存没有足够的空间（530），则选择过期的记录并从本地高速缓存中移除与过期记录相对应的第二组文件（530），并重复直到第一组文件被存储到本地高速缓存中的确定步骤。

63. 发明申请

WO01057657A1 METHODS AND CIRCUITS FOR SELECTIVELY OPERATING A SYSTEM IN A SECURE ENVIRONMENT 审中-公开
标题翻译：在安全环境中选择性地运行系统的方法和电路
公开(公告)号：WO01057657A1
公开(公告)日：2001-08-09
申请号：PCT/US2001/002534
申请日：2001-01-26
IPC分类号： G06F9/445 , G06F12/12 , G06F21/57 , G06F21/71 , G06F1/00 , G06F11/22
CPC分类号： G06F21/71 , G06F12/126 , G06F21/572 , G06F2211/1097
摘要： A method for selective secure operation of a system on a chip includes the step of disabling debug circuitry forming a part of the system on a chip at power on reset to prevent access by an unauthorized party to security resources. A determination is made as to whether a security procedure is called for during system initialization from boot memory. When a security procedure is called for, an attempt is made to execute a selected security procedure. A vector is mapped to the selected location in boot memory storing security code corresponding to the selected security procedure. The security code in boot memory is executed to determine whether the called security procedure is valid, and if the called security procedure is valid, the system operates in a secure environment in response to the called security procedure.
摘要翻译：一种用于芯片上的系统的选择性安全操作的方法包括在上电复位时禁止在芯片上形成系统的一部分的调试电路的步骤，以防止未授权方接入安全资源。确定在启动存储器的系统初始化期间是否要求安全程序。当调用安全过程时，会尝试执行所选的安全过程。将向量映射到存储与所选安全过程相对应的安全码的引导存储器中的所选位置。执行引导存储器中的安全代码以确定所调用的安全过程是否有效，并且如果所调用的安全过程有效，则系统在安全环境中操作以响应被叫安全过程。

64. 发明申请

WO00077820A3 OPERATING SYSTEM PAGE PLACEMENT TO MAXIMIZE CACHE DATA REUSE 审中-公开
标题翻译：操作系统页面放置以最大限度地提高高速缓存数据重新使用
公开(公告)号：WO00077820A3
公开(公告)日：2001-06-28
申请号：PCT/US2000/014851
申请日：2000-05-30
IPC分类号： G06F12/12
CPC分类号： G06F12/126
摘要： A software methodology to control replacement of one or more selected pages within a cache memory in a computer system. The operating system designates one or more pages containing critical data, text or other digital information as hot pages within a physical system memory in the computer system and prevents replacement during execution of various application programs of these hot pages when cached. The operating system inhibits allocation of the conflict pages that would map to cache locations occupied by a cached hot page, thereby preserving the hot page within the cache memory. The conflict pages are placed at the bottom of a free list created in the system memory by the operating system. The operating system scans the free list using a pointer while allocating free system memory space at run-time. The system memory pages are allocated from the free list until the pointer reaches a conflict page. This allows the operating system to prevent the conflict pages from getting cached to the hot page location within the cache memory. The operating system can also allow a user to designate one or more hot pages during run-time. The user is warned when the number of hot pages reaches or exceeds a predetermined limit.
摘要翻译：一种用于控制计算机系统中的高速缓冲存储器内的一个或多个所选页面的替换的软件方法。操作系统将包含关键数据，文本或其他数字信息的一个或多个页面指定为计算机系统中的物理系统存储器内的热页面，并且在缓存时防止在执行这些热页面的各种应用程序期间的替换。操作系统禁止将映射到由缓存的热页面占据的高速缓存位置的冲突页面的分配，从而保留高速缓冲存储器内的热页面。冲突页面位于操作系统在系统内存中创建的空闲列表的底部。操作系统使用指针扫描空闲列表，同时在运行时分配空闲的系统内存空间。系统内存页从空闲列表中分配，直到指针到达冲突页面。这允许操作系统防止冲突页面被缓存到高速缓冲存储器内的热页面位置。操作系统还可以允许用户在运行期间指定一个或多个热页面。当热页数达到或超过预定限度时，用户被警告。

65. 发明申请

WO01037074A1 METHOD OF CACHING DATA 审中-公开
标题翻译：数据缓存方法
公开(公告)号：WO01037074A1
公开(公告)日：2001-05-25
申请号：PCT/JP2000/008072
申请日：2000-11-16
IPC分类号： G06F3/06 , G06F12/00 , G06F12/08 , G06F12/12 , G11B20/10
CPC分类号： G11B20/10527 , G06F12/0862 , G06F12/0866 , G11B2020/1062
摘要： When a computer requests to retrieve data stored in a recording medium, it is decided whether there are cache hits for the requested data in a read buffer. Only the data that are not associated with the cache hits are retrieved from the recording medium and stored in the read buffer. The requested data are transferred from the read buffer to the computer. The address of the requested data is pre-read and stored so that it may be contiguous to the requested data. Thus, cache data can be used efficiently and effectively.
摘要翻译：当计算机请求检索存储在记录介质中的数据时，确定在读取缓冲器中是否存在针对所请求的数据的高速缓存命中。只有与缓存命中无关的数据从记录介质中检索并存储在读缓冲器中。请求的数据从读缓冲区传输到计算机。所请求的数据的地址被预读和存储，使得它可以与所请求的数据相邻。因此，可以有效且有效地使用高速缓存数据。

66. 发明申请

WO01025931A1 MULTIPLE VARIABLE CACHE REPLACEMENT POLICY 审中-公开
标题翻译：多变量缓存更换策略
公开(公告)号：WO01025931A1
公开(公告)日：2001-04-12
申请号：PCT/US2000/026863
申请日：2000-09-29
IPC分类号： G06F12/08 , G06F12/12
CPC分类号： G06F12/127 , G06F12/0804
摘要： A method for selecting a candidate to mark as overwritable in the event of a cache miss while attempting to avoid a write back operation. The method includes associating a set of data with the cache access request, each datum of the set is associated with a way, then choosing an invalid way among the set. Where no invalid ways exist among the set, the next step is determining a way that is not most recently used among the set. Next, the method determines whether a shared resource is crowded. When the shared resource is not crowded, the not most recently used way is chosen as the candidate. Where the shared resource is crowded, the next step is to determine whether the not most recently used way differs from an associated source in the memory and where the not most recently used way is the same as an associated source in the memory, the not most recently used way is chosen as the candidate. Where the not most recently used way differs from an associated source in the memory, the candidate is chosen as the way among the set that does not differ from an associated source in the memory. Where all ways among the set differ from respective sources in the memory, the not most recently used way is chosen as the candidate and the not most recently used way is stored in the shared resource.
摘要翻译：一种方法，用于在尝试避免回写操作时，在高速缓存未命中的情况下选择候选标记为可重写。该方法包括将一组数据与高速缓存访问请求相关联，该集合的每个数据与一种方式相关联，然后在该集合中选择无效的方式。在集合中不存在无效方式的情况下，下一步是确定集合中最近不使用的方式。接下来，该方法确定共享资源是否拥挤。当共享资源不拥挤时，选择不是最近使用的方式作为候选。在共享资源拥挤的地方，下一步是确定不是最近使用的方式与存储器中的相关源不同，哪些不是最近使用的方式与存储器中的相关源相同，不是最大的最近选用的方式是候选人。在不是最近使用的方式不同于存储器中的相关源的情况下，候选者被选择为与存储器中的相关源不相同的集合中的方式。在集合中的所有方式与存储器中的各个源不同的情况下，不是最近使用的方式被选择为候选，并且不是最近使用的方式被存储在共享资源中。

67. 发明申请

WO9950752A9 SHARED CACHE STRUCTURE FOR TEMPORAL AND NON-TEMPORAL INSTRUCTIONS 审中-公开
标题翻译：用于时间和非时间指令的共享缓存结构
公开(公告)号：WO9950752A9
公开(公告)日：2000-05-25
申请号：PCT/US9906501
申请日：1999-03-24
申请人： INTEL CORP , PALANCA SALVADOR , COORAY NIRANJAN L , NARANG ANGAD , PENTKOVSKI VLADIMIR , TSAI STEVE
发明人： PALANCA SALVADOR , COORAY NIRANJAN L , NARANG ANGAD , PENTKOVSKI VLADIMIR , TSAI STEVE
IPC分类号： G06F12/08 , G06F12/12
CPC分类号： G06F12/0875 , G06F12/0862 , G06F12/0864 , G06F12/126
摘要： A method and system for providing cache memory management. The system comprises a main memory (11), a processor coupled to the main memory, and at least one cache memory (50) coupled to the processor for caching of data. The at least one cache memory has at least two cache ways (50), each comprising a plurality of sets (50). Each of the plurality of sets has a bit (50) which indicates whether one of the at least two cache ways contains non-temporal data. The processor accesses data from one of the main memory or the at least one cache memory.
摘要翻译：一种用于提供高速缓存存储器管理的方法和系统。该系统包括主存储器（11），耦合到主存储器的处理器和耦合到处理器的用于数据缓存的至少一个高速缓存存储器（50）。所述至少一个高速缓存存储器具有至少两个高速缓存路径（50），每个缓存路径包括多个集合（50）。所述多个集合中的每一个具有指示所述至少两个高速缓存路径中的一个是否包含非时间数据的位（50）。处理器从主存储器或至少一个高速缓冲存储器之一访问数据。

68. 发明申请

WO99060564A2 CACHING METHOD FOR DATA BLOCKS OF VARIABLE SIZE 审中-公开
标题翻译：可变尺寸数据块的缓存方法
公开(公告)号：WO99060564A2
公开(公告)日：1999-11-25
申请号：PCT/US1999/010536
申请日：1999-05-12
IPC分类号： G06F12/08 , G06F12/12 , G11B
CPC分类号： G06F12/122
摘要： A caching method (30) for selecting variable size data blocks for removal from a cache (14) for a virtual tape subsystem (10) or other cached system of computer data storage includes determining (32, 34) the size and the unreferenced time interval of each data block in the cache. The size of a data block is the amount of cache space taken up by the block. The unreferenced time interval of a data block is the time that has elapsed since the block was last accessed. The recall probability per unit time of each data block in the cache is then determined (38). The recall probability of a data block is a function of its unreferenced time interval and possibly size and other auxiliary parameters. The caching method then determines (40) a quality factor (q) for each data block. The quality factor (q) of a data block is a function of its recall probability and size. The caching method concludes with removing (42) from the cache the data block with the lowest quality factor (q).
摘要翻译：用于从虚拟磁带子系统（10）或其他高速缓存的计算机数据存储系统的高速缓存（14）中选择用于移除的可变大小数据块的缓存方法（30）包括：确定（32,34）大小和未引用的时间间隔的缓存中的每个数据块。数据块的大小是块所占据的高速缓存空间量。数据块的未引用时间间隔是自上次访问块以来经过的时间。然后确定高速缓存中每个数据块的每单位时间的召回概率（38）。数据块的调用概率是其未引用时间间隔以及可能的大小和其他辅助参数的函数。然后，缓存方法确定（40）每个数据块的质量因子（q）。数据块的质量因子（q）是其调用概率和大小的函数。缓存方法的结论是从缓存中删除（42）具有最低质量因子（q）的数据块。

69. 发明申请

WO98041923A1 PENALTY-BASED CACHE STORAGE AND REPLACEMENT TECHNIQUES 审中-公开
标题翻译：基于罚款的高速缓存存储和替换技术
公开(公告)号：WO98041923A1
公开(公告)日：1998-09-24
申请号：PCT/SE1998/000454
申请日：1998-03-13
IPC分类号： G06F12/08 , G06F12/12
CPC分类号： G06F12/121 , G06F12/0875
摘要： Cache data replacement techniques enable improved performance in a computer system having a central processing unit (CPU), a cache memory and a main memory, wherein the cache memory has a plurality of data items stored therein. The cache data replacement techniques include associating a priority value with each of the stored data items, wherein for each data item, the priority value is an estimate of how much CPU stall time will occur if an attempt is made to retrieve the data item from the cache memory when the data item is not stored in the cache memory. When a cache entry must be replaced, the priority values are analyzed to determine a lowest priority value. One of the data items that has the lowest priority value is selected and replaced by a replacement data item. The priority value of a data item may be determined, as a function of how many other instructions have been fetched and stored in a buffer memory between a time interval defined by initiation and completion of retrieval of the data item from the main memory, wherein execution of the other instruction is dependent on completing retrieval of the data item. In other aspects of the invention, the priority values of cache entries may periodically be lowered in order to improve the cache hit ratio, and may also be reinitialized whenever the associated data time is accessed, in order to ensure retention of valuable data items in the data cache.
摘要翻译：高速缓存数据替换技术能够在具有中央处理单元（CPU），高速缓冲存储器和主存储器的计算机系统中改进性能，其中高速缓存存储器中存储有多个数据项。高速缓存数据替换技术包括将优先级值与存储的每个数据项相关联，其中对于每个数据项，优先级值是如果尝试从当数据项目不存储在高速缓冲存储器中时，缓存存储器。当必须更换缓存条目时，会分析优先级值以确定最低优先级值。选择具有最低优先级值的数据项之一，并替换为替换数据项。数据项的优先级值可以被确定为在从主存储器的数据项的检索的开始和完成定义的时间间隔之间已经获取并存储在缓冲存储器中的多少其他指令的函数，其中执行的其他指令取决于完成数据项的检索。在本发明的其他方面，缓存条目的优先级值可以周期性地降低，以便提高高速缓存命中率，并且每当访问相关联的数据时间时也可以重新初始化高速缓存条目的优先级值，以便确保将有价值的数据项保留在数据缓存。

70. 发明申请

WO9836587A2 QUEUING STRUCTURE AND METHOD FOR PRIORITIZATION OF FRAMES IN A NETWORK SWITCH 审中-公开
标题翻译：用于网络交换机框架优化的排队结构和方法
公开(公告)号：WO9836587A2
公开(公告)日：1998-08-20
申请号：PCT/US9802357
申请日：1998-02-06
申请人： ADVANCED MICRO DEVICES INC
发明人： ERIMLI BAHADIR , CRAYFORD IAN , EGBERT CHANDAN
IPC分类号： G06F5/06 , G06F12/12 , G11C7/10 , G11C11/412 , H04L12/18 , H04L12/24 , H04L12/46 , H04L12/56 , H04L29/06 , H04Q3/545 , H04Q3/64
CPC分类号： H04L69/26 , G06F5/06 , G06F12/128 , G11C7/1015 , G11C11/412 , H04L12/1877 , H04L12/1881 , H04L12/4641 , H04L12/4645 , H04L12/467 , H04L41/0213 , H04L47/50 , H04L47/6215 , H04L49/103 , H04L49/205 , H04L49/255 , H04L49/30 , H04L49/3009 , H04L49/3027 , H04L49/351 , H04L49/354 , H04L49/90 , H04L49/901 , H04L49/9073 , H04L49/9078 , H04Q3/54591 , H04Q2213/1316 , H04Q2213/13162
摘要： A method and arrangement for queuing data in a prioritized manner have a queue with a single queue write side in which data entries are input to the queue. The queue also has a plurality of queue read sides, with each read side having a different priority level. An entry exiting from the queue write side is examined to determine the priority level of the entry, and then placed into the queue read side with the matching priority level as the entry. The queue read sides form the output of the queue, and are polled and emptied so that the higher priority queues are emptied completely before emptying lower priority queues.
摘要翻译：以优先排序方式对数据进行排队的方法和装置具有一个具有单个队列写入端的队列，其中将数据条目输入队列。队列还具有多个队列读取侧，每个读取侧具有不同的优先级。检查从队列写入端退出的条目以确定条目的优先级，然后将其作为条目以匹配的优先级等级放入队列读取端。队列读取端形成队列的输出，并被轮询和清空，以便在排空较低优先级队列之前，将优先级队列完全清空。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式