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

1. 发明申请

US20070220219A1 System and method for optimizing data in value-based storage system 审中-公开
标题翻译：基于价值的存储系统优化数据的系统和方法
公开(公告)号：US20070220219A1
公开(公告)日：2007-09-20
申请号：US11376322
申请日：2006-03-16
申请人： Nikhil Bansal , Frederick Douglis , Lisa Fleischer , Kirsten Hildrum , Akshay Kumar Katta , John Palmer , Elizabeth Richards , David Tao , William Tetzlaff , Joel Wolf , Philip Yu
发明人： Nikhil Bansal , Frederick Douglis , Lisa Fleischer , Kirsten Hildrum , Akshay Kumar Katta , John Palmer , Elizabeth Richards , David Tao , William Tetzlaff , Joel Wolf , Philip 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.
摘要翻译：一种在基于值的存储系统中存储数据的方法（和系统）包括优化存储在基于价值的存储系统中的数据的值。

2. 发明申请

US20070118539A1 Focused community discovery 失效
标题翻译：聚焦社区发现
公开(公告)号：US20070118539A1
公开(公告)日：2007-05-24
申请号：US11283383
申请日：2005-11-18
申请人： Kirsten Hildrum , Philip Yu
发明人： Kirsten Hildrum , Philip Yu
IPC分类号： G06F7/00
CPC分类号： G06F17/30864 , G06Q10/10
摘要： Techniques for community discovery in a network are disclosed. For example, a technique for discovering a community around a given entity in an interaction graph, wherein nodes in the graph represent entities and edges connecting nodes in the graph represent interactions between connected nodes, comprises the following steps/operations. Nodes in the interaction graph are partitioned into different sets of nodes based on interaction information associated with each node to minimize a number of interaction pairs that need to be considered. An objective function is minimized by moving entities between the different sets such that the community is discovered once a measure associated with the objective function is minimized.
摘要翻译：公布了网络中社区发现的技术。例如，用于在交互图中发现给定实体周围的社区的技术，其中图中的节点表示连接图中的节点的实体和边表示连接的节点之间的交互，包括以下步骤/操作。基于与每个节点相关联的交互信息将交互图中的节点划分成不同的节点集合，以最小化需要考虑的多个交互对。通过在不同组之间移动实体来最小化目标函数，使得一旦与目标函数相关联的度量被最小化，则发现社区。

3. 发明申请

US20070211280A1 Method and apparatus for assigning candidate processing nodes in a stream-oriented computer system 失效
标题翻译：在面向流的计算机系统中分配候选处理节点的方法和装置
公开(公告)号：US20070211280A1
公开(公告)日：2007-09-13
申请号：US11374399
申请日：2006-03-13
申请人： Nikhil Bansal , James Challenger , Lisa Fleischer , Oktay Gunluk , Kirsten Hildrum , Richard King , Deepak Rajan , David Tao , Joel Wolf , Laura Wynter
发明人： Nikhil Bansal , James Challenger , Lisa Fleischer , Oktay Gunluk , Kirsten Hildrum , Richard King , Deepak Rajan , David Tao , Joel Wolf , Laura Wynter
IPC分类号： G06F3/12
CPC分类号： G06F9/5066 , G06F9/50 , G06F2209/5021
摘要： A method of choosing jobs to run in a stream based distributed computer system includes determining jobs to be run in a distributed stream-oriented system by deciding a priority threshold above which jobs will be accepted, below which jobs will be rejected. Overall importance is maximized relative to the priority threshold based on importance values assigned to all jobs. System constraints are applied to ensure jobs meet set criteria.
摘要翻译：选择在基于流的分布式计算机系统中运行的作业的方法包括通过确定哪个作业将被接受的优先级阈值来确定要在分布式流导向系统中运行的作业，低于哪个作业将被拒绝。基于分配给所有作业的重要性值，相对于优先级阈值，总体重要性最大化。应用系统约束以确保作业符合设定标准。

4. 发明申请

US20070214458A1 Method and apparatus for assigning fractional processing nodes to work in a stream-oriented computer system 有权
$Method and apparatus for assigning fractional processing nodes to work in a stream-oriented computer system$
标题翻译：分配处理节点在面向流的计算机系统中工作的方法和装置
公开(公告)号：US20070214458A1
公开(公告)日：2007-09-13
申请号：US11374643
申请日：2006-03-13
申请人： Nikhil Bansal , James Challenger , Lisa Fleischer , Kirsten Hildrum , Richard King , Deepak Rajan , David Tao , Joel Wolf
发明人： Nikhil Bansal , James Challenger , Lisa Fleischer , Kirsten Hildrum , Richard King , Deepak Rajan , David Tao , Joel Wolf
IPC分类号： G06F9/46
CPC分类号： G06F9/5061 , G06F2209/5012
摘要： An apparatus and method for making fractional assignments of processing elements to processing nodes for stream-based applications in a distributed computer system includes determining an amount of processing power to give to each processing element. Based on a list of acceptable processing nodes, a determination of fractions of which processing nodes will work on each processing element is made. To update allocations of the amount of processing power and the fractions, the process is repeated.
摘要翻译：一种用于在分布式计算机系统中对处理元件进行分组分配以处理基于流的应用的装置和方法包括确定给予每个处理元件的处理能力的量。基于可接受的处理节点的列表，确定哪些处理节点将在每个处理元件上工作的分数。为了更新处理能力和分数的分配，重复该过程。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式