-
公开(公告)号：US07139850B2
公开(公告)日：2006-11-21
申请号：US10176967
申请日：2002-06-21
IPC分类号： G06F3/00
CPC分类号： G06F9/451
摘要： System for processing programmable buttons using system control interrupts in a portable device. The system comprises a programmable button that comprises logic to generate a selected system control interrupt when actuated. The system also comprises interrupt logic coupled to receive the selected system control interrupt. The interrupt logic comprises logic to generate a button report that includes a button identifier, which indicates that the programmable button has been actuated. The system also comprises button support logic that is coupled to receive the button report, the button support logic comprises logic to determine a selectable device function associated with the button identifier, and logic to activate the selectable device function.
摘要翻译： 用于使用便携式设备中的系统控制中断处理可编程按钮的系统。 该系统包括可编程按钮，其包括当被致动时产生所选择的系统控制中断的逻辑。 该系统还包括耦合以接收所选择的系统控制中断的中断逻辑。 中断逻辑包括用于生成包括按钮标识符的按钮报告的逻辑，该按钮标识符指示可编程按钮已被致动。 该系统还包括耦合以接收按钮报告的按钮支持逻辑，按钮支持逻辑包括用于确定与按钮标识符相关联的可选设备功能的逻辑，以及激活可选设备功能的逻辑。
-
公开(公告)号：US09274885B2
公开(公告)日：2016-03-01
申请号：US13997246
申请日：2011-12-30
申请人： Shekoufeh Qawami , Rajesh Sundaram
发明人： Shekoufeh Qawami , Rajesh Sundaram
CPC分类号： G06F11/1048 , G06F11/073 , G06F11/0763 , G06F11/1068 , G11C13/0004
摘要： Methods and apparatus related to PCMS (Phase Change Memory with Switch) write error detection are described. In one embodiment, a first storage unit stores a single bit to indicate whether an error corresponding to a write operation in any of one or more PCMS devices has occurred. Also, one or more storage units each store a plurality of bits to indicate whether the error corresponding to the write operation has occurred in a partition of a plurality of partitions of the one or more PCMS devices. Other embodiments are also disclosed and claimed.
摘要翻译： 描述了与PCMS（带切换的相变存储器）写入错误检测相关的方法和装置。 在一个实施例中，第一存储单元存储单个位以指示是否发生了与一个或多个PCMS设备中的任一个中的写入操作相对应的错误。 此外，一个或多个存储单元每个存储多个位以指示与一个或多个PCMS设备的多个分区的分区中是否发生了与写入操作相对应的错误。 还公开并要求保护其他实施例。
-
公开(公告)号：US20130238832A1
公开(公告)日：2013-09-12
申请号：US13413898
申请日：2012-03-07
CPC分类号： G06F3/0641 , G06F3/0608 , G06F3/0685 , G06F12/0866 , G06F2212/217 , G06F2212/461
摘要： Methods and apparatuses for performing deduplication in a hybrid storage aggregate are provided. In one example, a method includes operating a hybrid storage aggregate that includes a plurality of tiers of different types of physical storage media. The method includes identifying a first storage block and a second storage block of the hybrid storage aggregate that contain identical data and identifying caching statuses of the first storage block and the second storage block. The method also includes deduplicating the first storage block and the second storage block based on the caching statuses of the first storage block and the second storage block.
摘要翻译： 提供了用于在混合存储集合中执行重复数据消除的方法和装置。 在一个示例中，方法包括操作包括多个不同类型的物理存储介质的混合存储集合。 该方法包括识别包含相同数据并识别第一存储块和第二存储块的高速缓存状态的混合存储聚合的第一存储块和第二存储块。 该方法还包括基于第一存储块和第二存储块的高速缓存状态对第一存储块和第二存储块进行重复数据删除。
-
4.发明授权公开(公告)号：US07979633B2
公开(公告)日：2011-07-12
申请号：US10817212
申请日：2004-04-02
申请人： Steven R. Kleiman , Rajesh Sundaram , Douglas P. Doucette , Stephen H. Strange , Srinivasan Viswanathan
发明人： Steven R. Kleiman , Rajesh Sundaram , Douglas P. Doucette , Stephen H. Strange , Srinivasan Viswanathan
IPC分类号： G06F12/16
CPC分类号： G06F3/0613 , G06F3/0643 , G06F3/0655 , G06F3/0689 , G06F11/1076
摘要： The invention features a method for controlling storage of data in a plurality of storage devices each including storage blocks, for example, in a RAID array. The method includes receiving a plurality of write requests associated with data, and buffering the write requests. A file system defines a group of storage blocks, responsive to disk topology information. The group includes a plurality of storage blocks in each of the plurality of storage devices. Each data block of the data to be written is associated with a respective one of the storage blocks, for transmitting the association to the plurality of storage devices.
摘要翻译： 本发明的特征在于一种用于控制多个存储设备中的数据存储的方法，每个存储设备包括例如RAID阵列中的存储块。 该方法包括接收与数据相关联的多个写入请求，并缓冲写入请求。 文件系统根据磁盘拓扑信息定义一组存储块。 该组包括多个存储装置中的每一个中的多个存储块。 要写入的数据的每个数据块与相应的一个存储块相关联，用于将关联发送到多个存储设备。
-
5.发明授权Storing data to multi-chip low-latency random read memory device using non-aligned striping 有权使用非对齐条带将数据存储到多芯片低延迟随机读取存储器件公开(公告)号：US07945822B1
公开(公告)日：2011-05-17
申请号：US12430783
申请日：2009-04-27
IPC分类号： G11C29/00
CPC分类号： G06F12/0246 , G06F11/1666 , G06F11/20 , G06F2212/1032 , G06F2212/7208 , G11C29/76
摘要： Described herein are method and apparatus for storing data to a low-latency random read memory (LLRRM) device using non-aligned data striping, the LLRRM device being implemented on a storage system. The LLRRM device may comprise a bank comprising a plurality of memory chips, each chip being simultaneously accessible for storing data on a plurality of erase-units (EUs). A storage operating system may maintain, for each chip, a reserve data structure listing reserve EUs and a remapping data structure for tracking remappings between defective EUs to reserve EUs in the chip. A defective EU in a chip may be mapped to a reserve EU from the reserve data structure. Upon receiving a data block to be stored to the LLRRM device at the defective EU, the storage operating system may stripe the received data block across a plurality of chips in a non-aligned manner using the remapped reserve EU.
摘要翻译： 这里描述了使用非对齐数据条带化将数据存储到低延迟随机读取存储器（LLRRM）装置的方法和装置，LLRRM装置在存储系统上实现。 LLRRM设备可以包括一个包括多个存储器芯片的存储体，每个芯片可以同时访问以存储多个擦除单元（EU）上的数据。 存储操作系统可以为每个芯片保留列出保留EU的备用数据结构和用于跟踪缺陷EU之间的重新映射的重映射数据结构，以在芯片中保留EU。 芯片中的有缺陷的EU可以从保留数据结构映射到保留EU。 在接收到在缺陷EU处存储到LLRRM设备的数据块时，存储操作系统可以使用重新映射的保留EU以不对齐的方式跨越多个芯片对接收到的数据块进行条带化。
-
6.发明授权Technique for coherent suspension of I/O operations in a RAID subsystem 有权在RAID子系统中进行I / O操作连续停止的技术公开(公告)号：US07685462B1
公开(公告)日：2010-03-23
申请号：US11970784
申请日：2008-01-08
IPC分类号： G06F11/00
CPC分类号： G06F11/2087
摘要： A method for operating a data storage system is described. The method first constructs an I/O tree representing a logical configuration of storage devices coupled to the storage system, the I/O tree representing a flow of I/O operations to the storage devices. Elements of the I/O tree are represented by objects. A freeze condition is imposed on a selected object of the I/O tree in order to disable a portion of the storage devices serviced by the selected object. Configuration management operations are performed on the portion of the storage devices serviced by the selected object. The freeze condition is removed from the selected object in response to completion of the configuration management, in order to resume I/O operations to the portion of the storage devices serviced by the selected object.
摘要翻译： 描述了一种用于操作数据存储系统的方法。 该方法首先构建表示耦合到存储系统的存储设备的逻辑配置的I / O树，该I / O树表示到存储设备的I / O操作流。 I / O树的元素由对象表示。 对I / O树的所选对象施加冻结条件，以便禁用所选对象所服务的存储设备的一部分。 对所选对象所服务的存储设备的部分执行配置管理操作。 响应于配置管理的完成，从所选对象中删除冻结条件，以便恢复对所选对象所服务的存储设备的部分的I / O操作。
-
7.发明授权Method and system for accurately calculating latency variation on an end-to-end path in a network 有权准确计算网络中端到端路径上的延迟变化的方法和系统公开(公告)号：US07333517B2
公开(公告)日：2008-02-19
申请号：US11203474
申请日：2005-08-12
IPC分类号： H04J3/06
CPC分类号： H04L12/2854
摘要： A high-resolution, per-packet measurement tool for analyzing a computer network that operates by sending a predetermined number of packets from a sender machine to a receiver machine with measurement information inserted into the packet. The system kernel at the sending machine stamps a sequence number and the sender's local time into the data section of each packet. When packets arrive at the receiver machine, they are similarly stamped by the receiving machine's kernel with the receiving machine's local time. The maintained packet information serves as the basis for latency analysis. For example, one set of latencies can be obtained with QoS mechanisms turned on, and another set with QoS mechanisms turned off, whereby the benefits of the QoS mechanisms can be accurately determined. To analyze the latencies, the present invention normalizes each time and each latency into relative latency information. Clock skew and timer jumps may be handled as part of the normalization.
摘要翻译： 一种用于分析计算机网络的高分辨率，每分组测量工具，所述计算机网络通过将预定数量的分组从发送者机器发送到具有插入分组中的测量信息的接收机的操作。 发送机的系统内核将序列号和发送者的本地时间标记到每个数据包的数据部分。 当数据包到达接收机时，接收机的内核同样受到接收机的本地时间的打印。 维护的分组信息用作等待时间分析的基础。 例如，可以在启用了QoS机制的情况下获得一组延迟，并且关闭具有QoS机制的另一组，由此可以准确地确定QoS机制的优点。 为了分析延迟，本发明将每个时间和每个延迟归一化为相对等待时间信息。 时钟偏移和定时跳转可以作为归一化的一部分来处理。
-
公开(公告)号：US07254813B2
公开(公告)日：2007-08-07
申请号：US10105079
申请日：2002-03-21
申请人： James Leong , Rajesh Sundaram , Douglas P. Doucette , Scott Schoenthal , Stephen H. Strange , Srinivasan Viswanathan
发明人： James Leong , Rajesh Sundaram , Douglas P. Doucette , Scott Schoenthal , Stephen H. Strange , Srinivasan Viswanathan
CPC分类号： G06F3/0601 , G06F2003/0697
摘要： The present invention implements an I/O task architecture in which an I/O task requested by the storage manager, for example a stripe write, is decomposed into a number of lower-level asynchronous I/O tasks that can be scheduled independently. Resources needed by these lower-level I/O tasks are dynamically assigned, on an as-needed basis, to balance the load and use resources efficiently, achieving higher scalability. A hierarchical order is assigned to the I/O tasks to ensure that there is a forward progression of the higher-level I/O task and to ensure that resources do not become deadlocked.
摘要翻译： 本发明实现了I / O任务架构，其中由存储管理器请求的I / O任务（例如条带写入）被分解成可以独立调度的多个较低级别的异步I / O任务。 这些较低级I / O任务所需的资源根据需要动态分配，以有效平衡负载和使用资源，实现更高的可扩展性。 分层次序分配给I / O任务，以确保上级I / O任务有前进的进程，并确保资源不会成为死锁。
-
公开(公告)号：US07200862B2
公开(公告)日：2007-04-03
申请号：US10260479
申请日：2002-09-30
申请人： Arvind M. Murching , Henry L. Sanders , Eric B. Stenson , Shivakumar Seetharaman , Rajesh Sundaram , Anish V. Desai , George V. Reilly
发明人： Arvind M. Murching , Henry L. Sanders , Eric B. Stenson , Shivakumar Seetharaman , Rajesh Sundaram , Anish V. Desai , George V. Reilly
IPC分类号： H04L9/32
CPC分类号： H04L63/101
摘要： A namespace management module utilizes a persistent reservation store that associates URI namespaces with one or more permissions. The reservation store can contain a number of reservation entries that each include a URI identifying a URI namespace and a corresponding Access Control List (“ACLs”) that includes permissions for the identified URI namespace. When a request to register a URI namespace is received, the permissions of an appropriate ACL can be checked to determine if the registration is approved. When a resource request is received, permissions of the ACLs can also be checked to determine if the resource request should be routed to a registered process. Preemptive wildcards can be included in aggregated URIs to identify aggregated URI namespaces. Aggregated URIs can be included in registration requests to override the registration of unauthorized processes.
摘要翻译： 命名空间管理模块利用将URI命名空间与一个或多个权限相关联的永久性预留存储。 预留商店可以包含多个预留条目，每个预留条目包括标识URI命名空间的URI和包含所标识的URI命名空间的权限的对应的访问控制列表（“ACL”）。 当接收到注册URI命名空间的请求时，可以检查适当的ACL的权限，以确定注册是否被批准。 当收到资源请求时，还可以检查ACL的权限，以确定资源请求是否应该路由到已注册的进程。 可以在聚合URI中包含抢占式通配符，以标识汇总的URI命名空间。 聚合URI可以包含在注册请求中，以覆盖未经授权的进程的注册。
-
10.发明申请公开(公告)号：US20050271071A1
公开(公告)日：2005-12-08
申请号：US11203474
申请日：2005-08-12
CPC分类号： H04L12/2854
摘要： A high-resolution, per-packet measurement tool for analyzing a computer network that operates by sending a predetermined number of packets from a sender machine to a receiver machine with measurement information inserted into the packet. The system kernel at the sending machine stamps a sequence number and the sender's local time into the data section of each packet. When packets arrive at the receiver machine, they are similarly stamped by the receiving machine's kernel with the receiving machine's local time. The maintained packet information serves as the basis for latency analysis. For example, one set of latencies can be obtained with QoS mechanisms turned on, and another set with QoS mechanisms turned off, whereby the benefits of the QoS mechanisms can be accurately determined. To analyze the latencies, the present invention normalizes each time and each latency into relative latency information. Clock skew and timer jumps may be handled as part of the normalization.
-
-
-
-
-
-
-
-
-
搜索结果
86 条记录 (耗时 0.041 秒)
