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

1. 发明授权

US09058338B2 Storing a small file with a reduced storage and memory footprint 有权
标题翻译：存储一个小文件，减少存储空间
公开(公告)号：US09058338B2
公开(公告)日：2015-06-16
申请号：US13282454
申请日：2011-10-26
申请人： Vishal Chittranjan Aslot , Adekunle Bello , Robert Wright Thompson
发明人： Vishal Chittranjan Aslot , Adekunle Bello , Robert Wright Thompson
IPC分类号： G06F12/10 , G06F17/30 , G06F3/06
CPC分类号： G06F17/30153 , G06F3/0608 , G06F3/064 , G06F3/0673 , G06F12/10
摘要： An I/O request to store a file in a file-system is received. A determination is made whether the size of the file does not exceed a threshold size. Exceeding the threshold results in storing at least a portion of the file in a block of the file-system devoid of sub-blocks. A determination is made whether the size of the file does not exceed a size of unallocated space within a single block in the file-system. The single block includes a set of sub-blocks. Responsive to the size of the file not exceeding the threshold size and the size of unallocated space within the single block, the file is stored, at an address, in a first subset of the set of the sub-blocks of the single block. The address identifies the single block and a position of a sub-block in the subset.
摘要翻译：接收到将文件存储在文件系统中的I / O请求。确定文件的大小是否不超过阈值大小。超过阈值导致将文件的至少一部分存储在没有子块的文件系统的块中。确定文件的大小是否不超过文件系统中单个块内的未分配空间的大小。单个块包括一组子块。响应于不超过单个块内的阈值大小和未分配空间的大小的文件的大小，文件在单个块的子块集合的第一子集中的地址处被存储。该地址识别子块中的单个块和子块的位置。

2. 发明申请

US20130311432A1 CONTEXT SENSITIVE REUSABLE INLINE DATA DEDUPLICATION 有权
标题翻译：内容敏感的可重复的在线数据记录
公开(公告)号：US20130311432A1
公开(公告)日：2013-11-21
申请号：US13476453
申请日：2012-05-21
申请人： Vishal Chittranjan Aslot , Adekunle Bello , Brian W. Hart , Robert Wright Thompson
发明人： Vishal Chittranjan Aslot , Adekunle Bello , Brian W. Hart , Robert Wright Thompson
IPC分类号： G06F17/30
CPC分类号： G06F17/30159
摘要： A computer identifies a relationship among a subset of a set of data blocks, a basis of the relationship forming a context shared by the subset of data blocks. The computer selects a code data structure from a set of code data structures using the context. The context is associated with the code data structure, and the code data structure includes a set of codes. The computer computes, for a first data block in the subset of data blocks, a first code corresponding to a content of the first data block. The computer determines whether the first code matches a stored code in the code data structure. The computer replaces, responsive to the first code matching the stored code, the first data block with a reference to an instance of the first data block. The computer causes the reference to be stored in a target data processing system.
摘要翻译：计算机识别一组数据块的子集之间的关系，形成由数据块的子集共享的上下文的关系的基础。计算机使用上下文从一组代码数据结构中选择代码数据结构。上下文与代码数据结构相关联，并且代码数据结构包括一组代码。对于数据块子集中的第一数据块，计算机计算与第一数据块的内容相对应的第一代码。计算机确定第一代码是否与代码数据结构中存储的代码相匹配。响应于与存储的代码匹配的第一代码，计算机替换参考第一数据块的实例的第一数据块。计算机使参考存储在目标数据处理系统中。

3. 发明授权

US08909607B2 Context sensitive reusable inline data deduplication 有权
标题翻译：上下文敏感的可重复使用的内联重复数据删除
公开(公告)号：US08909607B2
公开(公告)日：2014-12-09
申请号：US13476453
申请日：2012-05-21
申请人： Vishal Chittranjan Aslot , Adekunle Bello , Brian W. Hart , Robert Wright Thompson
发明人： Vishal Chittranjan Aslot , Adekunle Bello , Brian W. Hart , Robert Wright Thompson
IPC分类号： G06F17/30
CPC分类号： G06F17/30159
摘要： A computer identifies a relationship among a subset of a set of data blocks, a basis of the relationship forming a context shared by the subset of data blocks. The computer selects a code data structure from a set of code data structures using the context. The context is associated with the code data structure, and the code data structure includes a set of codes. The computer computes, for a first data block in the subset of data blocks, a first code corresponding to a content of the first data block. The computer determines whether the first code matches a stored code in the code data structure. The computer replaces, responsive to the first code matching the stored code, the first data block with a reference to an instance of the first data block. The computer causes the reference to be stored in a target data processing system.
摘要翻译：计算机识别一组数据块的子集之间的关系，形成由数据块的子集共享的上下文的关系的基础。计算机使用上下文从一组代码数据结构中选择代码数据结构。上下文与代码数据结构相关联，并且代码数据结构包括一组代码。对于数据块子集中的第一数据块，计算机计算与第一数据块的内容相对应的第一代码。计算机确定第一代码是否与代码数据结构中存储的代码相匹配。响应于与存储的代码匹配的第一代码，计算机替换参考第一数据块的实例的第一数据块。计算机使参考存储在目标数据处理系统中。

4. 发明授权

US08880858B2 Estimation of boot-time memory requirement 有权
标题翻译：启动时间内存需求的估计
公开(公告)号：US08880858B2
公开(公告)日：2014-11-04
申请号：US13102497
申请日：2011-05-06
申请人： Vishal Chittranjan Aslot , Adekunle Bello , Liang Jiang
发明人： Vishal Chittranjan Aslot , Adekunle Bello , Liang Jiang
IPC分类号： G06F12/00 , G06F9/44 , G06F9/445
CPC分类号： G06F9/4401 , G06F9/44505
摘要： Illustrative embodiments include a method, system, and computer program product for estimating boot-time memory requirement of a data processing system. A data processing system identifies, using system configuration information associated with the data processing system, a set of components needed for booting up the data processing system. The data processing system determines a dependency of a component identified in the set of components, the component including a memory estimator program. The data processing system determines an ancestry of the component identified in the set of components. The data processing system receives, using the memory estimator program of the component, a boot-time memory requirement of the component. The data processing system calculates a total boot-time memory requirement. The data processing system determines whether an amount of real memory of the data processing system satisfies the total boot-time memory requirement.
摘要翻译：示例性实施例包括用于估计数据处理系统的启动时间存储器需求的方法，系统和计算机程序产品。数据处理系统使用与数据处理系统相关联的系统配置信息来识别启动数据处理系统所需的一组组件。数据处理系统确定在组件集合中识别的组件的依赖性，该组件包括存储器估计器程序。数据处理系统确定在该组组件中标识的组件的祖先。数据处理系统使用组件的存储器估计器程序接收组件的引导时间存储器要求。数据处理系统计算总引导时间内存要求。数据处理系统确定数据处理系统的真实存储器的数量是否满足总的引导时间存储器要求。

5. 发明申请

US20130275693A1 PREFERENTIAL BLOCK RECYCLING IN A REDIRECT-ON-WRITE FILESYSTEM 有权
标题翻译：重写式文件系统中的优先块循环
公开(公告)号：US20130275693A1
公开(公告)日：2013-10-17
申请号：US13444189
申请日：2012-04-11
申请人： Adekunle Bello , Andrew N. Solomon , Robert Wright Thompson
发明人： Adekunle Bello , Andrew N. Solomon , Robert Wright Thompson
IPC分类号： G06F12/12 , G06F12/16
CPC分类号： G06F3/067 , G06F3/0623 , G06F3/065
摘要： Provided are techniques for more efficient data storage on a computing system. An inode table is provided and populated with information relating to current and N previous locations within data storage that a particular data block has been stored. When a particular data block is modified in a redirect on write system, the modified data block is stored, if possible is a previous storage location for that particular data block and the current data location may be saved for use as the location for a subsequent modification.
摘要翻译：提供了一种用于计算系统上更有效的数据存储的技术。提供一个索引节点表并填充与数据存储器中当前和N个先前位置相关的信息，该数据存储器中已存储特定数据块。当特定数据块在写系统上的重定向被修改时，修改的数据块被存储，如果可能的话是该特定数据块的先前存储位置，并且当前数据位置可以被保存以用作后续修改的位置。

6. 发明授权

US08356099B2 Server resource allocation 失效
标题翻译：服务器资源分配
公开(公告)号：US08356099B2
公开(公告)日：2013-01-15
申请号：US13459193
申请日：2012-04-29
申请人： Adekunle Bello , Douglas Griffith , Somasundaram Krishnasamy , Aruna Yedavilli
发明人： Adekunle Bello , Douglas Griffith , Somasundaram Krishnasamy , Aruna Yedavilli
IPC分类号： G06F15/16
CPC分类号： G06F9/5038 , G06F2209/5021
摘要： A method, programmed medium and system are disclosed which provide for end-to-end QoS for a set of processes that comprise a workload over nfs. A set of processes that comprise a workload such as the processes of a WPAR, or an entire LPAR are given a class designation and assigned priority/limits. The data are then passed to the server which allocates resources based on the sum total of all the current classes and their priorities and/or limits. This requires re-engineering the nfs client code to be workload-aware and the nfs server code to accommodate the resource allocation and prioritization needs of the nfs clients.
摘要翻译：公开了一种方法，编程介质和系统，其为包括nfs上的工作负载的一组进程提供端到端QoS。给出了一组包含WPAR或整个LPAR的工作负载的进程，并给出了类别指定和分配的优先级/限制。然后将数据传递给服务器，该服务器根据所有当前类及其优先级和/或限制的总和来分配资源。这需要重新设计nfs客户端代码以使工作负载感知和nfs服务器代码适应nfs客户端的资源分配和优先级排序。

7. 发明申请

US20120284496A1 Memory affinitization in multithreaded environments 有权
标题翻译：多线程环境中的内存关联
公开(公告)号：US20120284496A1
公开(公告)日：2012-11-08
申请号：US13102497
申请日：2011-05-06
申请人： Vishal Chittaranjan Aslot , Adekunle Bello , Liang Jiang
发明人： Vishal Chittaranjan Aslot , Adekunle Bello , Liang Jiang
IPC分类号： G06F9/00
CPC分类号： G06F9/4401 , G06F9/44505
摘要： Illustrative embodiments include a method, system, and computer program product for estimating boot-time memory requirement of a data processing system. A data processing system identifies, using system configuration information associated with the data processing system, a set of components needed for booting up the data processing system. The data processing system determines a dependency of a component identified in the set of components, the component including a memory estimator program. The data processing system determines an ancestry of the component identified in the set of components. The data processing system receives, using the memory estimator program of the component, a boot-time memory requirement of the component. The data processing system calculates a total boot-time memory requirement. The data processing system determines whether an amount of real memory of the data processing system satisfies the total boot-time memory requirement.
摘要翻译：示例性实施例包括用于估计数据处理系统的启动时间存储器需求的方法，系统和计算机程序产品。数据处理系统使用与数据处理系统相关联的系统配置信息来识别启动数据处理系统所需的一组组件。数据处理系统确定在组件集合中识别的组件的依赖性，该组件包括存储器估计器程序。数据处理系统确定在该组组件中标识的组件的祖先。数据处理系统使用组件的存储器估计器程序接收组件的引导时间存储器要求。数据处理系统计算总引导时间内存要求。数据处理系统确定数据处理系统的真实存储器的数量是否满足总的引导时间存储器要求。

8. 发明申请

US20120215916A1 Server Access Processing System 审中-公开
标题翻译：服务器访问处理系统
公开(公告)号：US20120215916A1
公开(公告)日：2012-08-23
申请号：US13459160
申请日：2012-04-28
申请人： Adekunle Bello , Radhika Chirra , Nikhil Hegde , Aruna Yedavilli
发明人： Adekunle Bello , Radhika Chirra , Nikhil Hegde , Aruna Yedavilli
IPC分类号： G06F15/173
CPC分类号： H04L67/1097 , H04L43/16 , H04L47/193 , H04L47/27 , H04L47/822 , H04L63/1458 , H04L67/143 , H04L69/16 , H04L69/163
摘要： A method, programmed medium and system are provided for preventing the denial of file system access to a plurality of clients accessing a NFS server. In one example, an NFS server is configured to listen on a server port. The server runs a separate daemon which “watches” client requests as they are received at the NFS server. The server processing system tracks the number of times a client sends consecutive TCP zero-window packets in response to a data packet from the server. If the number of zero-window packets crosses a user-defined threshold, then a routine is called to stop responding to that client using a backoff algorithm. When the server reaches a point where the number of available threads or any other relevant resource dips below a user-defined threshold, the server process starts terminating connections to the clients starting from the ones with the oldest entry in the table.
摘要翻译：提供了一种编程介质和系统的方法，用于防止文件系统访问访问NFS服务器的多个客户机的访问。在一个示例中，NFS服务器配置为在服务器端口上侦听。服务器运行一个单独的守护进程，它在NFS服务器上收到客户端请求。服务器处理系统跟踪客户端响应于来自服务器的数据分组发送连续的TCP零窗口分组的次数。如果零窗口数据包的数量跨越用户定义的阈值，则调用例程以使用退避算法停止对该客户端的响应。当服务器达到可用线程数或任何其他相关资源下降到低于用户定义阈值的点时，服务器进程将从具有表中最早条目的服务器开始终止与客户端的连接。

9. 发明授权

US09516142B2 Server access processing system 有权
标题翻译：服务器访问处理系统
公开(公告)号：US09516142B2
公开(公告)日：2016-12-06
申请号：US13459160
申请日：2012-04-28
申请人： Adekunle Bello , Radhika Chirra , Nikhil Hegde , Aruna Yedavilli
发明人： Adekunle Bello , Radhika Chirra , Nikhil Hegde , Aruna Yedavilli
IPC分类号： H04L29/08 , H04L29/06 , H04L12/801 , H04L12/807 , H04L12/26
CPC分类号： H04L67/1097 , H04L43/16 , H04L47/193 , H04L47/27 , H04L47/822 , H04L63/1458 , H04L67/143 , H04L69/16 , H04L69/163
摘要： A method, programmed medium and system are provided for preventing the denial of file system access to a plurality of clients accessing a NFS server. In one example, an NFS server is configured to listen on a server port. The server runs a separate daemon which “watches” client requests as they are received at the NFS server. The server processing system tracks the number of times a client sends consecutive TCP zero-window packets in response to a data packet from the server. If the number of zero-window packets crosses a user-defined threshold, then a routine is called to stop responding to that client using a backoff algorithm. When the server reaches a point where the number of available threads or any other relevant resource dips below a user-defined threshold, the server process starts terminating connections to the clients starting from the ones with the oldest entry in the table.
摘要翻译：提供了一种编程介质和系统的方法，用于防止文件系统访问访问NFS服务器的多个客户机的访问。在一个示例中，NFS服务器配置为在服务器端口上侦听。服务器运行一个单独的守护进程，它在NFS服务器上收到客户端请求。服务器处理系统跟踪客户端响应于来自服务器的数据分组发送连续的TCP零窗口分组的次数。如果零窗口数据包的数量跨越用户定义的阈值，则调用例程以使用退避算法停止对该客户端的响应。当服务器达到可用线程数或任何其他相关资源下降到低于用户定义阈值的点时，服务器进程将从具有表中最早条目的服务器开始终止与客户端的连接。

10. 发明申请

US20110066851A1 Secure Route Discovery Node and Policing Mechanism 审中-公开
标题翻译：安全路由发现节点和管理机制
公开(公告)号：US20110066851A1
公开(公告)日：2011-03-17
申请号：US12558744
申请日：2009-09-14
申请人： Adekunle Bello , Radhika Chirra , Venkat Venkatsubra , Aruna Yedavilli
发明人： Adekunle Bello , Radhika Chirra , Venkat Venkatsubra , Aruna Yedavilli
IPC分类号： H04L9/00 , G06F15/173
CPC分类号： H04L63/04 , H04L45/42 , H04L63/08 , H04L63/105
摘要： A computer implemented method and computer program product for obtaining a secure route. A trusted host sets a node security association for a trusted host. The trusted host receives, at the trusted host, a client communication request directed to a destination host. The trusted host builds a secure route query comprising a trusted host address, a destination host address, and at least one security level, to form at least one secure route. The trusted host sends packets from the trusted host to the destination host based on the at least one secure route. The packets are responsive to the client communication request, and the packets each have a security label that matches the security level.
摘要翻译：一种用于获得安全路线的计算机实现的方法和计算机程序产品。可信主机为可信主机设置节点安全关联。可信主机在受信任的主机处接收指向目的地主机的客户端通信请求。可信主机构建包括可信主机地址，目的主机地址和至少一个安全级别的安全路由查询，以形成至少一个安全路由。可信主机基于至少一个安全路由将信息包从可信主机发送到目的地主机。分组响应于客户端通信请求，并且分组各自具有与安全级别匹配的安全标签。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式