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

1. 发明授权

US08683150B2 System and method for optimizing data in value-based storage system 失效
标题翻译：基于价值的存储系统优化数据的系统和方法
公开(公告)号：US08683150B2
公开(公告)日：2014-03-25
申请号：US13616945
申请日：2012-09-14
申请人： Nikhil Bansal , Frederick Douglis , Lisa Karen Fleischer , Kirsten Weale Hildrum , Akshay Kumar Reddy Katta , John Davis Palmer , Elizabeth Suzanne Richards , David Tao , William Harold Tetzlaff , Joel Leonard Wolf , Philip Shi-lung Yu
发明人： Nikhil Bansal , Frederick Douglis , Lisa Karen Fleischer , Kirsten Weale Hildrum , Akshay Kumar Reddy Katta , John Davis Palmer , Elizabeth Suzanne Richards , David Tao , William Harold Tetzlaff , Joel Leonard Wolf , Philip Shi-lung Yu
IPC分类号： G06F12/00 , G06F13/00 , G06F13/28
CPC分类号： H04L47/2433 , H04L47/2416 , H04L49/90 , H04L49/9084
摘要： A storage system includes a plurality of data vats, and a processor including an optimizing unit that optimizes a value of data stored in the storage system. The optimizing unit optimizes the value by computing and implementing an optimal decision for allocating new data to a first data vat of the plurality of data vats, moving existing data from at least a second data vat of the plurality of data vats to the first data vat, and deleting existing data from the first data vat, based on an amount of data in each of the plurality of data vats.
摘要翻译：存储系统包括多个数据槽，以及包括优化存储在存储系统中的数据的值的优化单元的处理器。优化单元通过计算和实施用于将新数据分配到多个数据桶中的第一数据桶的最佳决定来优化该值，将现有数据从多个数据桶中的至少第二数据桶移动到第一数据槽并且基于多个数据桶中的每一个中的数据量来从第一数据桶中删除现有数据。

2. 发明申请

US20130013873A1 SYSTEM AND METHOD FOR OPTIMIZING DATA IN VALUE-BASED STORAGE SYSTEM 失效
标题翻译：基于价值的存储系统优化数据的系统与方法
公开(公告)号：US20130013873A1
公开(公告)日：2013-01-10
申请号：US13616945
申请日：2012-09-14
申请人： Nikhil Bansal , Frederick Douglis , Lisa Karen Fleischer , Kirsten Weale Hildrum , Akshay Kumar Reddy Katta , John Davis Palmer , Elizabeth Suzanne Richards , David Tao , William Harold Tetzlaff , Joel Leonard Wolf , Philip Shi-lung Yu
发明人： Nikhil Bansal , Frederick Douglis , Lisa Karen Fleischer , Kirsten Weale Hildrum , Akshay Kumar Reddy Katta , John Davis Palmer , Elizabeth Suzanne Richards , David Tao , William Harold Tetzlaff , Joel Leonard Wolf , Philip Shi-lung Yu
IPC分类号： G06F12/02
CPC分类号： H04L47/2433 , H04L47/2416 , H04L49/90 , H04L49/9084
摘要： A storage system includes a plurality of data vats, and a processor including an optimizing unit that optimizes a value of data stored in the storage system. The optimizing unit optimizes the value by computing and implementing an optimal decision for allocating new data to a first data vat of the plurality of data vats, moving existing data from at least a second data vat of the plurality of data vats to the first data vat, and deleting existing data from the first data vat, based on an amount of data in each of the plurality of data vats.
摘要翻译：存储系统包括多个数据槽，以及包括优化存储在存储系统中的数据的值的优化单元的处理器。优化单元通过计算和实施用于将新数据分配到多个数据桶中的第一数据桶的最佳决定来优化该值，将现有数据从多个数据桶中的至少第二数据桶移动到第一数据槽并且基于多个数据桶中的每一个中的数据量来从第一数据桶中删除现有数据。

3. 发明授权

US08352382B1 Heuristic methods for customer order fulfillment planning 有权
标题翻译：客户订单履行计划的启发式方法
公开(公告)号：US08352382B1
公开(公告)日：2013-01-08
申请号：US12192523
申请日：2008-08-15
申请人： Akshay Kumar Reddy Katta , Russell Allgor
发明人： Akshay Kumar Reddy Katta , Russell Allgor
IPC分类号： G06Q30/00
CPC分类号： G06Q50/28 , G06Q10/087
摘要： Techniques for heuristic customer order fulfillment planning. A method may include iteratively partitioning ordered items into shipment groups according to a set partition algorithm. Of a working set including the unassigned items, the algorithm may determine the subset that optimizes fulfillment cost per member of the subset, and may assign this subset to a shipment group. To determine the subset, the algorithm may iterate over the set of combinations of fulfillment decision variables. For each combination, a list of members of the working set that may be shipped according to the combination is generated. The subset of this list that optimizes, per member of the subset, the costs of shipping according to the combination is then identified.
摘要翻译：启发式客户订单履行计划的技术。一种方法可以包括根据设置的分区算法将有序项目迭代地分类成装运组。在包括未分配项目的工作集中，算法可以确定优化子集成员的履行成本的子集，并且可以将该子集分配给装运组。为了确定子集，该算法可以遍历一组履约决策变量的组合。对于每个组合，生成可根据组合运输的工作集的成员列表。然后识别该列表的子集，根据该组合优化每个成员的成本。

4. 发明授权

US08275957B2 System and method for optimizing data in value-based storage system 失效
标题翻译：基于价值的存储系统优化数据的系统和方法
公开(公告)号：US08275957B2
公开(公告)日：2012-09-25
申请号：US12061879
申请日：2008-04-03
申请人： Nikhil Bansal , Frederick Douglis , Lisa Karen Fleischer , Kirsten Weale Hildrum , Akshay Kumar Reddy Katta , John Davis Palmer , Elizabeth Suzanne Richards , David Tao , William Harold Tetzlaff , Joel Leonard Wolf , Philip Shi-lung Yu
发明人： Nikhil Bansal , Frederick Douglis , Lisa Karen Fleischer , Kirsten Weale Hildrum , Akshay Kumar Reddy Katta , John Davis Palmer , Elizabeth Suzanne Richards , David Tao , William Harold Tetzlaff , Joel Leonard Wolf , Philip Shi-lung Yu
IPC分类号： G06F12/00 , G06F13/00 , G06F13/28
CPC分类号： H04L47/2433 , H04L47/2416 , H04L49/90 , H04L49/9084
摘要： A method (and system) of storing data in a value-based storage system, includes optimizing a value of data stored in the value-based storage system.
摘要翻译：一种在基于值的存储系统中存储数据的方法（和系统）包括优化存储在基于价值的存储系统中的数据的值。

5. 发明申请

US20080189494A1 SYSTEM AND METHOD FOR OPTIMIZING DATA IN VALUE-BASED STORAGE SYSTEM 失效
标题翻译：基于价值的存储系统优化数据的系统与方法
公开(公告)号：US20080189494A1
公开(公告)日：2008-08-07
申请号：US12061879
申请日：2008-04-03
申请人： Nikhil Bansal , Frederick Douglis , Lisa Karen Fleischer , Kirsten Weale Hildrum , Akshay Kumar Reddy Katta , John Davis Palmer , Elizabeth Suzanne Richards , David Tao , William Harold Tetzlaff , Joe Leonard Wolf , Philip Shi-lung Yu
发明人： Nikhil Bansal , Frederick Douglis , Lisa Karen Fleischer , Kirsten Weale Hildrum , Akshay Kumar Reddy Katta , John Davis Palmer , Elizabeth Suzanne Richards , David Tao , William Harold Tetzlaff , Joe Leonard Wolf , Philip Shi-lung Yu
IPC分类号： G06F13/00
CPC分类号： H04L47/2433 , H04L47/2416 , H04L49/90 , H04L49/9084
摘要： A method (and system) of storing data in a value-based storage system, includes optimizing a value of data stored in the value-based storage system.
摘要翻译：一种在基于值的存储系统中存储数据的方法（和系统）包括优化存储在基于价值的存储系统中的数据的值。

6. 发明授权

US08612596B1 Resource planning for computing 有权
标题翻译：计算资源规划
公开(公告)号：US08612596B1
公开(公告)日：2013-12-17
申请号：US12751032
申请日：2010-03-31
申请人： Xiao Yu Li , Diwakar Gupta , Akshay Kumar Reddy Katta , Sergey Krasnovsky , Kalyanaraman Prasad
发明人： Xiao Yu Li , Diwakar Gupta , Akshay Kumar Reddy Katta , Sergey Krasnovsky , Kalyanaraman Prasad
IPC分类号： G06F15/173
CPC分类号： G06Q30/0202 , G06F9/50 , G06F2209/5019
摘要： Disclosed are various embodiments for the planning of resources used in computing. Usage statistics regarding one or more machine instances executing in a plurality of networked computing devices are obtained. The usage statistics are grouped based at least in part on one or more customer usage classifications, thereby producing one or more usage groups. A corresponding demand forecast is generated for each of the usage groups. A projected demand for one or more physical components of the networked computing devices is calculated according to the demand forecasts.
摘要翻译：公开了用于计算中使用的资源的规划的各种实施例。获得关于在多个网络计算设备中执行的一个或多个机器实例的使用统计。使用统计信息至少部分地基于一个或多个客户使用分类来分组，从而产生一个或多个使用组。为每个使用组生成相应的需求预测。根据需求预测计算出对网络计算设备的一个或多个物理组件的预计需求。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式