公开(公告)号：US08671082B1

公开(公告)日：2014-03-11

申请号：US12394002

申请日：2009-02-26

Applicant: Sandeep Yadav ,  Subramanian Periyagaram

Inventor： Sandeep Yadav ,  Subramanian Periyagaram

IPC: G06F7/00 ,  G06F17/30 ,  G06F11/14 ,  G06F3/06

CPC classification number: G06F3/0641 ,  G06F3/0608 ,  G06F3/0619 ,  G06F3/067 ,  G06F3/0679 ,  G06F11/1453 ,  G06F12/0871 ,  G06F17/30156 ,  G06F17/30197 ,  G06F17/30386 ,  G06F2206/1014 ,  G06F2212/222

Abstract: A method and system for eliminating the redundant allocation and deallocation of special data on disk, wherein the redundant allocation and deallocation of special data on disk is eliminated by providing an innovate technique for specially allocating special data of a storage system. Specially allocated data is data that is pre-allocated on disk and stored in memory of the storage system. “Special data” may include any pre-decided data, one or more portions of data that exceed a pre-defined sharing threshold, and/or one or more portions of data that have been identified by a user as special. For example, in some embodiments, a zero-filled data block is specially allocated by a storage system. As another example, in some embodiments, a data block whose contents correspond to a particular type document header is specially allocated.

Abstract translation: 一种消除磁盘上特殊数据的冗余分配和释放的方法和系统，其中通过提供专门分配存储系统的特殊数据的创新技术，消除了磁盘上特殊数据的冗余分配和释放。 特别分配的数据是在磁盘上预先分配并存储在存储系统的存储器中的数据。 “特殊数据”可以包括任何预先决定的数据，超过预定义共享阈值的数据的一个或多个部分，和/或用户已经被特别识别的数据的一个或多个部分。 例如，在一些实施例中，零填充数据块由存储系统专门分配。 作为另一示例，在一些实施例中，特别分配其内容对应于特定类型文档头的数据块。

公开(公告)号：US20100174879A1

公开(公告)日：2010-07-08

申请号：US12349423

申请日：2009-01-06

Applicant: Dnyaneshwar Pawar ,  Rahul Khona ,  Subramanian Periyagaram ,  Sandeep Yadav

Inventor： Dnyaneshwar Pawar ,  Rahul Khona ,  Subramanian Periyagaram ,  Sandeep Yadav

IPC: G06F12/00 ,  G06F12/02 ,  G06F12/16 ,  G06F17/30

CPC classification number: G06F3/0608 ,  G06F3/0611 ,  G06F3/0631 ,  G06F3/064 ,  G06F3/067

Abstract: A method and system for estimating space in a compressed volume to enable a storage server to respond to write requests before actually compressing and/or allocating data on disk. In some embodiments, in response to receiving a request to store data, the storage server estimates the amount of storage space required to store the data on disk. The storage server compares the estimated amount with the amount of available disk space. When the amount of available disk space is less than the estimated space, the storage server sends a response indicating that the request failed. Otherwise, when the amount of available disk space is greater than or equal to the estimate space, the storage server sends a response indicating that the request succeeded. The response is sent before the storage server allocates any disk space in connection with the request.

Abstract translation: 一种用于估计压缩卷空间的方法和系统，以使得存储服务器能够在实际压缩和/或分配磁盘上的数据之前对写请求做出响应。 在一些实施例中，响应于接收到存储数据的请求，存储服务器估计将数据存储在盘上所需的存储空间量。 存储服务器将估计的数量与可用磁盘空间的数量进行比较。 当可用磁盘空间量小于估计的空间时，存储服务器发送一个响应，指示请求失败。 否则，当可用磁盘空间量大于或等于估计空间时，存储服务器发送一个响应，指示该请求成功。 在存储服务器分配与请求相关联的任何磁盘空间之前发送响应。

公开(公告)号：US20100088296A1

公开(公告)日：2010-04-08

申请号：US12245669

申请日：2008-10-03

Applicant: Subramanian Periyagaram ,  Rahul Khona ,  Dnyaneshwar Pawar ,  Sandeep Yadav

Inventor： Subramanian Periyagaram ,  Rahul Khona ,  Dnyaneshwar Pawar ,  Sandeep Yadav

IPC: G06F7/06 ,  G06F17/30

CPC classification number: G06F16/1752 ,  G06F3/061 ,  G06F3/0641 ,  G06F3/067 ,  G06F11/1453 ,  G06F16/183 ,  H04L67/1097 ,  H04L67/2842

Abstract: A technique for organizing data to facilitate data deduplication includes dividing a block-based set of data into multiple “chunks”, where the chunk boundaries are independent of the block boundaries (due to the hashing algorithm). Metadata of the data set, such as block pointers for locating the data, are stored in a tree structure that includes multiple levels, each of which includes at least one node. The lowest level of the tree includes multiple nodes that each contain chunk metadata relating to the chunks of the data set. In each node of the lowest level of the buffer tree, the chunk metadata contained therein identifies at least one of the chunks. The chunks (user-level data) are stored in one or more system files that are separate from the buffer tree and not visible to the user.

Abstract translation: 用于组织数据以便于重复数据删除的技术包括将基于块的数据集划分成多个“块”，其中块边界独立于块边界（由于散列算法）。 数据集的元数据（例如用于定位数据的块指针）被存储在包括多个级别的树结构中，每个级别包括至少一个节点。 树的最低级别包括多个节点，每个节点包含与数据集块大小相关的块元数据。 在缓冲树的最低级别的每个节点中，其中包含的块元数据标识至少一个块。 块（用户级数据）存储在与缓冲树分开的一个或多个系统文件中，并且对用户不可见。

公开(公告)号：US08892527B1

公开(公告)日：2014-11-18

申请号：US13620684

申请日：2012-09-14

Applicant: Sandeep Yadav ,  Subramanian Periyagaram

Inventor： Sandeep Yadav ,  Subramanian Periyagaram

IPC: G06F7/00 ,  G06F17/30 ,  G06F3/06

CPC classification number: G06F3/0641 ,  G06F3/0608 ,  G06F3/0619 ,  G06F3/067 ,  G06F3/0679 ,  G06F11/1453 ,  G06F12/0871 ,  G06F17/30156 ,  G06F17/30197 ,  G06F17/30386 ,  G06F2206/1014 ,  G06F2212/222

Abstract: A method and system for eliminating the redundant allocation and deallocation of special data on disk, wherein the redundant allocation and deallocation of special data on disk is eliminated by providing an innovate technique for specially allocating special data of a storage system. Specially allocated data is data that is pre-allocated on disk and stored in memory of the storage system. “Special data” may include any pre-decided data, one or more portions of data that exceed a pre-defined sharing threshold, and/or one or more portions of data that have been identified by a user as special. For example, in some embodiments, a zero-filled data block is specially allocated by a storage system. As another example, in some embodiments, a data block whose contents correspond to a particular type document header is specially allocated.

Abstract translation: 一种消除磁盘上特殊数据的冗余分配和释放的方法和系统，其中通过提供专门分配存储系统的特殊数据的创新技术，消除了磁盘上特殊数据的冗余分配和释放。 特别分配的数据是在磁盘上预先分配并存储在存储系统的存储器中的数据。 “特殊数据”可以包括任何预先决定的数据，超过预定义共享阈值的数据的一个或多个部分，和/或用户已经被特别识别的数据的一个或多个部分。 例如，在一些实施例中，零填充数据块由存储系统专门分配。 作为另一示例，在一些实施例中，特别分配其内容对应于特定类型文档头的数据块。

公开(公告)号：US08539191B2

公开(公告)日：2013-09-17

申请号：US12349423

申请日：2009-01-06

Applicant: Dnyaneshwar Pawar ,  Rahul Khona ,  Subramanian Periyagaram ,  Sandeep Yadav

Inventor： Dnyaneshwar Pawar ,  Rahul Khona ,  Subramanian Periyagaram ,  Sandeep Yadav

IPC: G06F12/00

CPC classification number: G06F3/0608 ,  G06F3/0611 ,  G06F3/0631 ,  G06F3/064 ,  G06F3/067

Abstract: A method and system for estimating space in a compressed volume to enable a storage server to respond to write requests before actually compressing and/or allocating data on disk. In some embodiments, in response to receiving a request to store data, the storage server estimates the amount of storage space required to store the data on disk. The storage server compares the estimated amount with the amount of available disk space. When the amount of available disk space is less than the estimated space, the storage server sends a response indicating that the request failed. Otherwise, when the amount of available disk space is greater than or equal to the estimate space, the storage server sends a response indicating that the request succeeded. The response is sent before the storage server allocates any disk space in connection with the request.

Abstract translation: 一种用于估计压缩卷空间的方法和系统，以使得存储服务器能够在实际压缩和/或分配磁盘上的数据之前对写请求做出响应。 在一些实施例中，响应于接收到存储数据的请求，存储服务器估计将数据存储在盘上所需的存储空间量。 存储服务器将估计的数量与可用磁盘空间的数量进行比较。 当可用磁盘空间量小于估计的空间时，存储服务器发送一个响应，指示请求失败。 否则，当可用磁盘空间量大于或等于估计空间时，存储服务器发送一个响应，指示该请求成功。 在存储服务器分配与请求相关联的任何磁盘空间之前发送响应。

公开(公告)号：US20160311192A1

公开(公告)日：2016-10-27

申请号：US15139965

申请日：2016-04-27

Applicant: Sandeep Yadav ,  Tamera Scholz

Inventor： Sandeep Yadav ,  Tamera Scholz

IPC: B32B3/14 ,  B32B3/30 ,  B32B7/12

CPC classification number: B32B3/14 ,  B32B3/30 ,  B32B7/12 ,  B32B9/025 ,  B32B9/045 ,  B32B25/08 ,  B32B27/08 ,  B32B27/10 ,  B32B27/308 ,  B32B29/002 ,  B32B2255/12 ,  B32B2274/00 ,  B32B2307/536 ,  B32B2307/546 ,  B32B2307/554 ,  B32B2307/581 ,  B32B2307/732 ,  B32B2307/744 ,  B32B2405/00 ,  B32B2457/00 ,  B32B2475/00 ,  C09J7/22 ,  C09J2201/122 ,  C09J2201/20 ,  C09J2201/36 ,  C09J2201/606

Abstract: Various implementations include an anti-slip pad for use with a portable electronic device. The anti-slip pad may prevent the portable electronic device from slipping out of the user's hand or across a surface, for example. As described below, the pad includes a non-slip layer and an adhesive layer that are permanently affixed to each other. The non-slip layer has a first side and a second side opposite the first side. The first side of the non-slip layer has a non-slip surface. The adhesive layer is affixed to the second side of the non-slip layer. The adhesive layer is configured for being removably adherable to an outer surface of the portable electronic device such that the non-slip layer faces away from the outer surface. The adhesive layer allows the pad to be selectively repositioned on the portable electronic device, according to some implementations.

Abstract translation: 各种实施方式包括与便携式电子设备一起使用的防滑垫。 例如，防滑垫可以防止便携式电子设备滑出用户的手或横过表面。 如下所述，垫包括永久地彼此固定的防滑层和粘合剂层。 防滑层具有与第一侧相对的第一侧和第二侧。 防滑层的第一面具有防滑表面。 粘合剂层固定在防滑层的第二面上。 粘合剂层被构造成可移除地粘附到便携式电子设备的外表面，使得防滑层面向外表面。 根据一些实施方式，粘合剂层允许衬垫被选择性地重新定位在便携式电子设备上。

公开(公告)号：US08918378B1

公开(公告)日：2014-12-23

申请号：US13223226

申请日：2011-08-31

Applicant: Rickard E. Faith ,  Subramaniam Periyagaram ,  Sandeep Yadav ,  Ashish Prakash ,  Blake Lewis

Inventor： Rickard E. Faith ,  Subramaniam Periyagaram ,  Sandeep Yadav ,  Ashish Prakash ,  Blake Lewis

IPC: G06F7/00 ,  G06F17/00

CPC classification number: G06F3/0626 ,  G06F3/065 ,  G06F3/067

Abstract: An extent-based storage architecture is implemented by a storage server. The storage server generates a new extent identifier for cloning a source extent identified by a source extent identifier and stored at a source data structure that includes a length value providing a length of the source extent, an offset value and a reference count value that provides a number of data containers that reference the source extent identifier. The storage server updates a data structure for a cloned version of the data container for storing the new extent identifier that points to the source extent identifier and includes an extent length value and offset value different from length value and the offset value of the source data structure.

Abstract translation: 存储服务器实现基于范围的存储架构。 存储服务器生成新的盘区标识符，用于克隆由源盘区标识符识别的源盘区，并存储在源数据结构中，源数据结构包括提供源盘区长度的长度值，偏移值和引用计数值， 参考源盘区标识符的数据容器数。 存储服务器更新用于存储指向源盘区标识符的新盘区标识符的数据容器的克隆版本的数据结构，并且包括与长度值不同的盘区长度值和偏移值以及源数据结构的偏移值 。

公开(公告)号：US20130067175A1

公开(公告)日：2013-03-14

申请号：US13232216

申请日：2011-09-14

Applicant: Sandeep Yadav ,  Dnyaneshwar Pawar ,  Anand Natarajan

Inventor： Sandeep Yadav ,  Dnyaneshwar Pawar ,  Anand Natarajan

IPC: G06F12/00

CPC classification number: G06F12/00 ,  G06F3/0613 ,  G06F3/0617 ,  G06F3/065 ,  G06F3/0683 ,  G06F11/1448 ,  G06F11/1453 ,  G06F17/30088

Abstract: Method and system for partially cloning a data container with compression is provided. A storage operating system determines if a portion of a source data container that is to be cloned includes a plurality of compressed blocks that are compressed using a non-variable compression group size. The operating system clones the plurality compressed blocks with the non-variable compression group size and de-compresses a plurality of blocks of the data container that are not within the non-variable compression group size. The plurality of compressed blocks and the plurality of blocks that are not within the non-variable compression group size are then stored as a partially cloned copy of the source data container.

Abstract translation: 提供了一种用于部分克隆数据容器并进行压缩的方法和系统。 存储操作系统确定要克隆的源数据容器的一部分是否包含使用非可变压缩组大小压缩的多个压缩块。 操作系统以非变量压缩组大小克隆多个压缩块，并且解压缩不在非变量压缩组大小内的数据容器的多个块。 然后将不在不可变压缩组大小内的多个压缩块和多个块存储为源数据容器的部分克隆副本。

公开(公告)号：US07752325B1

公开(公告)日：2010-07-06

申请号：US10974427

申请日：2004-10-26

Applicant: Sandeep Yadav ,  Konstantinos Roussos ,  Yasuhiro Endo

Inventor： Sandeep Yadav ,  Konstantinos Roussos ,  Yasuhiro Endo

IPC: G06F15/16

CPC classification number: H04L47/10 ,  H04L47/2416 ,  H04L47/283 ,  H04L47/32 ,  H04L65/4076 ,  H04L65/605 ,  H04L67/32 ,  H04L67/325

Abstract: A method and system to efficiently transmit streaming media are described. The system includes a network protocol engine configured to receive a request for a data stream from a client system and to transmit data packets from the data stream to the client system; and a packet pacing sub-system, responsive to the request for the data stream. The packet pacing sub-system is configured to wait to receive a plurality of data packets from the data stream, and schedule delivery events for the plurality of data packets.The system may further include a streaming media protocol engine to determine a delivery time for data packets in the data stream. The packet pacing sub-system may be configured to receive an associated delivery time for the data packets from the streaming media protocol engine and schedule the delivery events for the data packets according to the associated delivery times for the plurality of packets.

Abstract translation: 描述了一种有效传输流媒体的方法和系统。 该系统包括被配置为从客户端系统接收对数据流的请求并且将数据分组从数据流传送到客户端系统的网络协议引擎; 以及响应于对数据流的请求的分组起搏子系统。 分组起搏子系统被配置为等待从数据流接收多个数据分组，并且调度多个数据分组的传送事件。 该系统还可以包括流媒体协议引擎，以确定数据流中的数据分组的传送时间。 分组起搏子系统可以被配置为从流媒体协议引擎接收关于数据分组的相关联的递送时间，并且根据多个分组的相关递送时间调度数据分组的递送事件。

公开(公告)号：US08866649B2

公开(公告)日：2014-10-21

申请号：US13232216

申请日：2011-09-14

Applicant: Sandeep Yadav ,  Dnyaneshwar Pawar ,  Anand Natarajan

Inventor： Sandeep Yadav ,  Dnyaneshwar Pawar ,  Anand Natarajan

IPC: H03M7/00 ,  G06F12/00 ,  G06F11/14

CPC classification number: G06F12/00 ,  G06F3/0613 ,  G06F3/0617 ,  G06F3/065 ,  G06F3/0683 ,  G06F11/1448 ,  G06F11/1453 ,  G06F17/30088

Abstract: Method and system for partially cloning a data container with compression is provided. A storage operating system determines if a portion of a source data container that is to be cloned includes a plurality of compressed blocks that are compressed using a non-variable compression group size. The operating system clones the plurality compressed blocks with the non-variable compression group size and de-compresses a plurality of blocks of the data container that are not within the non-variable compression group size. The plurality of compressed blocks and the plurality of blocks that are not within the non-variable compression group size are then stored as a partially cloned copy of the source data container.

Abstract translation: 提供了一种用于部分克隆数据容器并进行压缩的方法和系统。 存储操作系统确定要克隆的源数据容器的一部分是否包含使用非可变压缩组大小压缩的多个压缩块。 操作系统以非变量压缩组大小克隆多个压缩块，并且解压缩不在非变量压缩组大小内的数据容器的多个块。 然后将不在不可变压缩组大小内的多个压缩块和多个块存储为源数据容器的部分克隆副本。