会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • Systems And Methods For Self-Adaptive Distributed Systems
    • 自适应分布式系统的系统与方法
    • US20140297833A1
    • 2014-10-02
    • US13853533
    • 2013-03-29
    • Alcatel Lucent
    • Ivan BediniBart Antoon Rika TheetanTommaso CucinottaAlessandra Sala
    • H04L12/26
    • H04L43/0876G06F9/5083
    • Systems and methods for run-time monitoring, tuning and optimization of distributed systems are provided. In various aspects, a system or method may include measuring run-time values for one or more performance metrics of the distributed system, such as, for example, task-latencies, process-throughputs, and the degree of utilization of various physical resources of the system. The system or method may further include comparing the measured run-time values with one or more target values assigned to the performance metrics, and, based on the comparison, adjusting one or more tunable run-time control variables of the distributed system, such as the number of the tasks, processes, and nodes executing in the distributed system.
    • 提供了分布式系统的运行时监控,调优和优化的系统和方法。 在各个方面,系统或方法可以包括测量分布式系统的一个或多个性能度量的运行时间值,例如任务延迟,过程吞吐量以及各种物理资源的利用程度 系统。 所述系统或方法还可以包括将测量的运行时间值与分配给性能度量的一个或多个目标值进行比较,并且基于比较,调整分布式系统的一个或多个可调运行时间控制变量,例如 在分布式系统中执行的任务,进程和节点的数量。
    • 4. 发明申请
    • Systems And Methods For Distance Approximation In Graphs
    • 图中距离近似的系统和方法
    • US20150091909A1
    • 2015-04-02
    • US14041210
    • 2013-09-30
    • ALCATEL LUCENT
    • Deepak AjwaniWilliam S. KennedyAlessandra SalaIraj Saniee
    • G06T11/20
    • G06T11/206H04L45/122H04L45/48
    • Systems and methods are provided for constructing a collection of one or more tree sub-graph representations of a graph including multiple interconnected nodes, where the one or more tree sub-graph representations of the graph are used to estimate the shortest distance between any two nodes of a graph. One of the features of the systems and methods disclosed herein is a methodology for the selection or designation of root nodes for constructing the collection of the one or more tree sub-graph representations. Another feature of the present disclosure is a methodology of expanding the parent nodes in a given level of the tree sub-graph representations into one or more child nodes in a successive level of the tree-graph representations based on a descending order of degree of the parent nodes.
    • 提供了系统和方法,用于构建包括多个互连节点的图的一个或多个树子图表示的集合,其中该图的一个或多个树子图表示用于估计任何两个节点之间的最短距离 的图表。 本文公开的系统和方法的特征之一是用于选择或指定用于构造一个或多个树子图表示的集合的根节点的方法。 本公开的另一个特征是一种将树子图表示的给定级别中的父节点在树形图表示的连续级中扩展为一个或多个子节点的方法,该方法基于 父节点。