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

1. 发明授权

US07506343B2 System and method for passing information from one device driver to another 失效
标题翻译：将信息从一个设备驱动程序传递到另一个设备驱动程序的系统
公开(公告)号：US07506343B2
公开(公告)日：2009-03-17
申请号：US10922276
申请日：2004-08-19
申请人： Vishal Chittranjan Aslot , Bruce G. Mealey , James Anthony Pafumi , James Britt Partridge , Chris Alan Schwendiman
发明人： Vishal Chittranjan Aslot , Bruce G. Mealey , James Anthony Pafumi , James Britt Partridge , Chris Alan Schwendiman
IPC分类号： G06F9/44
CPC分类号： G06F13/28 , G06F13/102
摘要： A system and method for passing data between a first device driver and a second device driver. Data to be provided to the second device driver is identified in the first device driver. A data exchange interface within a kernel space is invoked by the first device driver. The data exchange interface initializes a physical to Direct Memory Access (DMA) address translation table for the child device based on an identifier of a direct memory access window. The data is provided to the data exchange interface. The data exchange interface, in the kernel space, writes the data to a data structure maintained and used by the second device driver.
摘要翻译：一种用于在第一设备驱动器和第二设备驱动器之间传递数据的系统和方法。在第一设备驱动器中识别要提供给第二设备驱动器的数据。内核空间中的数据交换接口由第一个设备驱动程序调用。数据交换接口基于直接存储器访问窗口的标识符初始化子设备的物理到直接存储器访问（DMA）地址转换表。数据提供给数据交换界面。在内核空间中的数据交换接口将数据写入由第二设备驱动程序维护和使用的数据结构。

2. 发明授权

US07249208B2 System and method for extending the cross-memory descriptor to describe another partition's memory 有权
标题翻译：用于扩展交叉存储器描述符以描述另一分区的存储器的系统和方法
公开(公告)号：US07249208B2
公开(公告)日：2007-07-24
申请号：US10855726
申请日：2004-05-27
申请人： Vishal Chittranjan Aslot , Bruce G. Mealey
发明人： Vishal Chittranjan Aslot , Bruce G. Mealey
IPC分类号： G06F17/50 , G06F9/46 , H04L12/66 , H04J3/16
CPC分类号： G06F12/1072
摘要： A system and method for extending the use of the cross-memory descriptor in a server partition environment such that it may be used to describe another partition's memory, e.g., a client partition's memory (referred to hereafter as a “remote” memory), are provided. With the system and method, when an operating system in a logically partitioned computing system is initialized, operating system kernel services are invoked that examine a device tree of the computing system and generate an extended cross-memory descriptor that describes the local memory of another logical partition, which is a remote memory to the present logical partition. When an access to a remote memory is required to perform an operation, the operating system of the server partition uses the stored extended cross-memory descriptor to perform the remote memory access.
摘要翻译：一种用于在服务器分区环境中扩展使用交叉存储器描述符的系统和方法，使得其可以用于描述另一分区的存储器，例如客户端分区的存储器（以下称为“远程”存储器））提供。利用系统和方法，当逻辑分区计算系统中的操作系统被初始化时，调用操作系统内核服务来检查计算系统的设备树，并生成描述另一逻辑的本地存储器的扩展跨存储器描述符分区，它是当前逻辑分区的远程内存。当需要访问远程存储器来执行操作时，服务器分区的操作系统使用存储的扩展跨存储器描述符来执行远程存储器访问。

3. 发明授权

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请求。确定文件的大小是否不超过阈值大小。超过阈值导致将文件的至少一部分存储在没有子块的文件系统的块中。确定文件的大小是否不超过文件系统中单个块内的未分配空间的大小。单个块包括一组子块。响应于不超过单个块内的阈值大小和未分配空间的大小的文件的大小，文件在单个块的子块集合的第一子集中的地址处被存储。该地址识别子块中的单个块和子块的位置。

4. 发明申请

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.
摘要翻译：计算机识别一组数据块的子集之间的关系，形成由数据块的子集共享的上下文的关系的基础。计算机使用上下文从一组代码数据结构中选择代码数据结构。上下文与代码数据结构相关联，并且代码数据结构包括一组代码。对于数据块子集中的第一数据块，计算机计算与第一数据块的内容相对应的第一代码。计算机确定第一代码是否与代码数据结构中存储的代码相匹配。响应于与存储的代码匹配的第一代码，计算机替换参考第一数据块的实例的第一数据块。计算机使参考存储在目标数据处理系统中。

5. 发明授权

US08789033B2 Reducing application startup time by optimizing spatial locality of instructions in executables 失效
标题翻译：通过优化可执行文件中的指令的空间位置来减少应用程序启动时间
公开(公告)号：US08789033B2
公开(公告)日：2014-07-22
申请号：US13365317
申请日：2012-02-03
申请人： Vishal Chittranjan Aslot , Aravinda Prasad
发明人： Vishal Chittranjan Aslot , Aravinda Prasad
IPC分类号： G06F9/45
CPC分类号： G06F8/4441 , G06F8/427 , G06F8/443
摘要： Provided are techniques for parsing source code file into a plurality of functions; generating a ranking corresponding to each of the plurality of functions based upon an order of occurrence in the source code file; generating a weight score corresponding to each of the plurality of functions based upon a weighing factor and the occurrence of a condition corresponding to each of the plurality of functions; and generating an object code file such that the plurality of functions are ordered in the object code file based upon the corresponding rankings and weight scores such during a startup of execution of the object code file a startup time is minimized with respect to an object code file not generated in accordance with the claimed method.
摘要翻译：提供了用于将源代码文件解析成多个功能的技术; 基于所述源代码文件中的发生顺序，生成与所述多个功能中的每一个对应的排序; 基于与所述多个功能中的每一个相对应的加权因子和条件的发生，生成与所述多个功能中的每一个对应的加权分数; 以及生成目标代码文件，使得在目标代码文件的执行启动期间，基于相应的排名和权重分数，在目标代码文件中对多个功能进行排序，启动时间相对于目标代码文件最小化不是根据所要求保护的方法产生的。

6. 发明授权

US08589891B2 Capturing multi-component trace for unit of work 失效
标题翻译：捕获工作单元中的多组件跟踪
公开(公告)号：US08589891B2
公开(公告)日：2013-11-19
申请号：US13217413
申请日：2011-08-25
申请人： Vishal Chittranjan Aslot , Brian W. Hart , Anil Kalavakolanu , Evelyn Tingmay Yeung
发明人： Vishal Chittranjan Aslot , Brian W. Hart , Anil Kalavakolanu , Evelyn Tingmay Yeung
IPC分类号： G06F9/44
CPC分类号： G06F11/3466 , G06F11/3636
摘要： Provided are techniques for the tracing of computer processes and, more specifically, to techniques that enable a work unit to be traced across multiple processing components. A data structure is created and associated with a work unit. The first time a unit of work is processed a tracing context is retrieved form a pool and associated with the data structure. As the unit of work is passed from component to component, the data structure is passed so that each component has access and is able to augment the same tracing context associated with the unit of work.
摘要翻译：提供了用于跟踪计算机进程的技术，更具体地，涉及使工作单元能够跨多个处理组件进行跟踪的技术。创建数据结构并与工作单元相关联。第一次处理工作单元时，从池中检索跟踪上下文并与数据结构相关联。随着工作单元从组件传递到组件，数据结构被传递，使得每个组件都具有访问权限，并且能够增加与工作单元相关联的相同跟踪上下文。

7. 发明申请

US20130205287A1 Reducing Application Startup Time by Optimizing Spatial Locality of Instructions in Executables 失效
标题翻译：通过优化可执行文件中的指令的空间位置来减少应用程序启动时间
公开(公告)号：US20130205287A1
公开(公告)日：2013-08-08
申请号：US13365317
申请日：2012-02-03
申请人： Vishal Chittranjan Aslot , Aravinda Prasad
发明人： Vishal Chittranjan Aslot , Aravinda Prasad
IPC分类号： G06F9/45
CPC分类号： G06F8/4441 , G06F8/427 , G06F8/443
摘要： Provided are techniques for parsing source code file into a plurality of functions; generating a ranking corresponding to each of the plurality of functions based upon an order of occurrence in the source code file; generating a weight score corresponding to each of the plurality of functions based upon a weighing factor and the occurrence of a condition corresponding to each of the plurality of functions; and generating an object code file such that the plurality of functions are ordered in the object code file based upon the corresponding rankings and weight scores such during a startup of execution of the object code file a startup time is minimized with respect to an object code file not generated in accordance with the claimed method.
摘要翻译：提供了用于将源代码文件解析成多个功能的技术; 基于所述源代码文件中的发生顺序，生成与所述多个功能中的每一个对应的排序; 基于与所述多个功能中的每一个相对应的加权因子和条件的发生，生成与所述多个功能中的每一个对应的加权分数; 以及生成目标代码文件，使得在目标代码文件的执行启动期间，基于相应的排名和权重分数，在目标代码文件中对多个功能进行排序，启动时间相对于目标代码文件最小化不是根据所要求保护的方法产生的。

8. 发明授权

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.
摘要翻译：示例性实施例包括用于估计数据处理系统的启动时间存储器需求的方法，系统和计算机程序产品。数据处理系统使用与数据处理系统相关联的系统配置信息来识别启动数据处理系统所需的一组组件。数据处理系统确定在组件集合中识别的组件的依赖性，该组件包括存储器估计器程序。数据处理系统确定在该组组件中标识的组件的祖先。数据处理系统使用组件的存储器估计器程序接收组件的引导时间存储器要求。数据处理系统计算总引导时间内存要求。数据处理系统确定数据处理系统的真实存储器的数量是否满足总的引导时间存储器要求。

9. 发明申请

US20130055215A1 CAPTURING MULTI-COMPONENT TRACE FOR UNIT FOR WORK 失效
标题翻译：为组装单位承担多组分追踪
公开(公告)号：US20130055215A1
公开(公告)日：2013-02-28
申请号：US13217413
申请日：2011-08-25
申请人： Vishal Chittranjan Aslot , Brian W. Hart , Anil Kalavakolanu , Evelyn Tingmay Yeung
发明人： Vishal Chittranjan Aslot , Brian W. Hart , Anil Kalavakolanu , Evelyn Tingmay Yeung
IPC分类号： G06F9/44
CPC分类号： G06F11/3466 , G06F11/3636
摘要： Provided are techniques for the tracing of computer processes and, more specifically, to techniques that enable a work unit to be traced across multiple processing components. A data structure is created and associated with a work unit. The first time a unit of work is processed a tracing context is retrieved form a pool and associated with the data structure. As the unit of work is passed from component to component, the data structure is passed so that each component has access and is able to augment the same tracing context associated with the unit of work.
摘要翻译：提供了用于跟踪计算机进程的技术，更具体地，涉及使工作单元能够跨多个处理组件进行跟踪的技术。创建数据结构并与工作单元相关联。第一次处理工作单元时，从池中检索跟踪上下文并与数据结构相关联。随着工作单元从组件传递到组件，数据结构被传递，使得每个组件都具有访问权限，并且能够增加与工作单元相关联的相同跟踪上下文。

10. 发明授权

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.
摘要翻译：计算机识别一组数据块的子集之间的关系，形成由数据块的子集共享的上下文的关系的基础。计算机使用上下文从一组代码数据结构中选择代码数据结构。上下文与代码数据结构相关联，并且代码数据结构包括一组代码。对于数据块子集中的第一数据块，计算机计算与第一数据块的内容相对应的第一代码。计算机确定第一代码是否与代码数据结构中存储的代码相匹配。响应于与存储的代码匹配的第一代码，计算机替换参考第一数据块的实例的第一数据块。计算机使参考存储在目标数据处理系统中。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式