公开(公告)号：US20150215173A1

公开(公告)日：2015-07-30

申请号：US14168228

申请日：2014-01-30

Applicant: Xerox Corporation

Inventor： Partha Dutta ,  Tridib Mukherjee ,  Koustuv Dasgupta

IPC: H04L12/24 ,  G06F9/48 ,  G06F9/50

CPC classification number: H04L41/5016 ,  G06F9/4881 ,  G06F9/5038 ,  G06F9/505 ,  G06F2209/503 ,  H04L41/0896

Abstract: Disclosed are the methods for scheduling a task including at least one sub-task, on one or more computing devices in a distributed computing environment. A set of computing devices are identified from the one or more computing devices, based on an availability of a set of computational resources on the set of computing devices. Each computing device in the set of computing devices is ranked based on at least one of a monetary cost or a network cost, associated with the execution of the at least one sub-task on the each computing device. The at least one sub-task is allocated to at least one computing device from the set of computing devices for execution based on at least one of the ranking or an acceptable success probability associated with the execution of the at least one sub-task.

Abstract translation: 公开了在分布式计算环境中的一个或多个计算设备上调度包括至少一个子任务的任务的方法。 基于一组计算设备上的一组计算资源的可用性，从一个或多个计算设备识别一组计算设备。 基于与每个计算设备上的至少一个子任务的执行相关联的货币成本或网络成本中的至少一个来对该组计算设备中的每个计算设备进行排名。 基于与所述至少一个子任务的执行相关联的排序或可接受的成功概率中的至少一个，将所述至少一个子任务分配给来自所述一组计算设备的至少一个计算设备用于执行。

公开(公告)号：US20150213106A1

公开(公告)日：2015-07-30

申请号：US14162886

申请日：2014-01-24

Applicant: Xerox Corporation

Inventor： Shruti Kunde ,  Tridib Mukherjee ,  Gueyoung Jung

IPC: G06F17/30 ,  G06F9/455

CPC classification number: G06F17/30589 ,  G06F9/45558 ,  G06F2009/45562 ,  G06F2009/45595

Abstract: There is provided systems and methods for creating a repository of templates. The templates are deterministic of a configuration a virtual machine. The method includes creating one or more templates for each of one or more applications types based on a benchmark data. Each of the one or more templates is stored in a hierarchal structure having one or more hierarchal levels. Each of the one or more hierarchal levels is indicative of a parameter of the configuration of the virtual machine. Thereafter, one or more rules are defined to traverse through the one or more hierarchal levels to access the one or more templates.

Abstract translation: 提供了用于创建模板存储库的系统和方法。 模板是虚拟机配置的确定性。 该方法包括基于基准数据为一个或多个应用类型中的每一个创建一个或多个模板。 一个或多个模板中的每一个存储在具有一个或多个层级的层次结构中。 一个或多个分层级别中的每一个表示虚拟机的配置的参数。 此后，定义一个或多个规则来遍历一个或多个层级以访问一个或多个模板。

公开(公告)号：US20150142524A1

公开(公告)日：2015-05-21

申请号：US14083789

申请日：2013-11-19

Applicant: Xerox Corporation

Inventor： Gueyoung Jung ,  Tridib Mukherjee ,  Shruti Kunde

IPC: G06Q30/02

CPC classification number: G06Q30/0206

Abstract: Methods and systems for determining prices of customized virtual machines required to process customer-specified workloads are disclosed. A count of instances of the customized virtual machines, required to process the customer-specified workloads is determined, based on a configuration of the customized virtual machines. The instances of the customized virtual machines are consolidated on virtual machine servers. Further, the prices of the customized virtual machines are determined based on a count of the virtual machine servers, unused resources in the virtual machine servers, and unused resources in the customized virtual machines. The determined prices are recommended to the customer. Further, at least one of the prices of the customized virtual machines or the configuration of at least one or more customized virtual machines is modified, based on a response to the recommendation received from the customer.

Abstract translation: 公开了用于确定处理客户指定工作负载所需的定制虚拟机的价格的方法和系统。 基于定制虚拟机的配置，确定处理客户指定工作负载所需的定制虚拟机的实例数。 自定义虚拟机的实例在虚拟机服务器上合并。 此外，基于虚拟机服务器的计数，虚拟机服务器中的未使用资源以及定制虚拟机中未使用的资源来确定定制虚拟机的价格。 确定的价格是向客户推荐的。 此外，基于从客户接收到的推荐的响应，修改定制虚拟机的价格中的至少一个或至少一个或多个定制虚拟机的配置。

公开(公告)号：US20170085624A1

公开(公告)日：2017-03-23

申请号：US14857855

申请日：2015-09-18

Applicant: XEROX CORPORATION

Inventor： Tridib Mukherjee ,  Amit Kumar ,  Deepthi Chander ,  Koustuv Dasgupta ,  Anirban Mondal

IPC: H04L29/08 ,  H04L12/26

CPC classification number: H04L43/0817 ,  G06F9/542 ,  H04L41/0604 ,  H04L47/28 ,  H04L67/12 ,  H04L67/28 ,  H04W4/70

Abstract: The disclosed embodiments illustrate methods and systems for transmitting information generated for one or more events. The method includes receiving queries from subscribers. The method includes receiving said information pertaining to said one or more events from sensors. Thereafter, the method includes transmitting said information pertaining to said one or more events to said subscribers based on a first boundary condition and a second boundary condition. The information pertaining to said one or more events is transmitted using a first technique when at least a number of events in said one or more events satisfy said first boundary condition. Further, the information pertaining to said one or more events is transmitted using a second technique when at least said number of events in said one or more events satisfy said second boundary condition. The method is performed by said one or more microprocessors in a notification distribution server.

公开(公告)号：US20170024256A1

公开(公告)日：2017-01-26

申请号：US14807918

申请日：2015-07-24

Applicant: XEROX CORPORATION

Inventor： Tridib Mukherjee ,  Sujit Gujar ,  Shruti Kunde

IPC: G06F9/50

CPC classification number: G06F9/5005 ,  G06F9/5027 ,  G06F9/505 ,  G06F2209/501 ,  G06F2209/504 ,  Y02D10/22

Abstract: A method and system to determine a computational resource requirement is described. The method and system rank one or more computational resources for each of the plurality of tasks in an ascending order, based on a cost associated with the plurality of tasks for each of the computational resource. Based on the ranked one or more computational resources and a fairness metric, the method and system allocates the one or more capacity units associated with the computational resource to perform the plurality of tasks. The method and system determines the computational resource requirement to perform the plurality of tasks based on the allocated one or more capacity units. The fairness metric ensures that allocation of the one or more capacity units to the plurality of tasks is performed in a manner to maximize the fairness.

Abstract translation: 描述了一种确定计算资源需求的方法和系统。 所述方法和系统基于与所述计算资源中的每一个的所述多个任务相关联的成本，以升序对所述多个任务中的每一个进行排序的一个或多个计算资源。 基于排序的一个或多个计算资源和公平度量，该方法和系统分配与计算资源相关联的一个或多个容量单元以执行多个任务。 该方法和系统基于所分配的一个或多个容量单元确定执行多个任务的计算资源需求。 公平度量确保以一种最大化公平性的方式来执行对多个任务的一个或多个容量单元的分配。

公开(公告)号：US09444846B2

公开(公告)日：2016-09-13

申请号：US14308748

申请日：2014-06-19

Applicant: Xerox Corporation

Inventor： Avinash Sharma ,  Partha Dutta ,  Tridib Mukherjee ,  Shruti Kunde

IPC: H04L29/06

CPC classification number: H04L63/20 ,  H04L63/126

Abstract: Embodiments of a method are disclosed for computing trust index among multiple entities associated with a resource marketplace. The method includes receiving multiple inputs including interaction attributes, attribute importance factors, references to databases, and multiple entities associated with the resource marketplace. The method also includes creating a weighted-interaction graph based on the received inputs. The weighted-interaction graph includes multiple vertices representing the entities. The method further includes performing a topology-specific analysis of the weighted-interaction graph. The method furthermore includes computing Euclidean distances for each pair of vertices in the weighted-interaction graph based on the performed analysis. The method also includes determining a trust index for a first entity in the received multiple entities based on the computed Euclidean distances. The trust index includes ranking of at least one of the multiple entities with respect to the first entity. The ranking is inversely proportional to the computed Euclidean distances.

Abstract translation: 公开了一种用于计算与资源市场相关联的多个实体之间的信任指数的方法的实施例。 该方法包括接收多个输入，包括交互属性，属性重要性因素，对数据库的引用以及与资源市场相关联的多个实体。 该方法还包括基于所接收的输入创建加权交互图。 加权交互图包括表示实体的多个顶点。 该方法还包括执行加权交互图的拓扑特定分析。 该方法还包括基于所执行的分析来计算加权交互图中的每对顶点的欧几里得距离。 该方法还包括基于所计算的欧氏距离来确定所接收的多个实体中的第一实体的信任度索引。 信任指数包括相对于第一实体的至少一个多个实体的排名。 排名与计算的欧氏距离成反比。

公开(公告)号：US09444695B2

公开(公告)日：2016-09-13

申请号：US14168228

申请日：2014-01-30

Applicant: Xerox Corporation

Inventor： Partha Dutta ,  Tridib Mukherjee ,  Koustuv Dasgupta

IPC: G06F15/16 ,  H04L12/24 ,  G06F9/50 ,  G06F9/48

CPC classification number: H04L41/5016 ,  G06F9/4881 ,  G06F9/5038 ,  G06F9/505 ,  G06F2209/503 ,  H04L41/0896

Abstract: Disclosed are the methods for scheduling a task including at least one sub-task, on one or more computing devices in a distributed computing environment. A set of computing devices are identified from the one or more computing devices, based on an availability of a set of computational resources on the set of computing devices. Each computing device in the set of computing devices is ranked based on at least one of a monetary cost or a network cost, associated with the execution of the at least one sub-task on the each computing device. The at least one sub-task is allocated to at least one computing device from the set of computing devices for execution based on at least one of the ranking or an acceptable success probability associated with the execution of the at least one sub-task.

Abstract translation: 公开了在分布式计算环境中的一个或多个计算设备上调度包括至少一个子任务的任务的方法。 基于一组计算设备上的一组计算资源的可用性，从一个或多个计算设备识别一组计算设备。 基于与每个计算设备上的至少一个子任务的执行相关联的货币成本或网络成本中的至少一个来对该组计算设备中的每个计算设备进行排名。 基于与所述至少一个子任务的执行相关联的排序或可接受的成功概率中的至少一个，将所述至少一个子任务分配给来自所述一组计算设备的至少一个计算设备用于执行。

公开(公告)号：US09262502B2

公开(公告)日：2016-02-16

申请号：US14162886

申请日：2014-01-24

Applicant: Xerox Corporation

Inventor： Shruti Kunde ,  Tridib Mukherjee ,  Gueyoung Jung

IPC: G06F9/45 ,  G06F17/30 ,  G06F9/455

CPC classification number: G06F17/30589 ,  G06F9/45558 ,  G06F2009/45562 ,  G06F2009/45595

Abstract: There is provided systems and methods for creating a repository of templates. The templates are deterministic of a configuration a virtual machine. The method includes creating one or more templates for each of one or more applications types based on a benchmark data. Each of the one or more templates is stored in a hierarchal structure having one or more hierarchal levels. Each of the one or more hierarchal levels is indicative of a parameter of the configuration of the virtual machine. Thereafter, one or more rules are defined to traverse through the one or more hierarchal levels to access the one or more templates.

Abstract translation: 提供了用于创建模板存储库的系统和方法。 模板是虚拟机配置的确定性。 该方法包括基于基准数据为一个或多个应用类型中的每一个创建一个或多个模板。 一个或多个模板中的每一个存储在具有一个或多个层级的层次结构中。 一个或多个分层级别中的每一个表示虚拟机的配置的参数。 此后，定义一个或多个规则来遍历一个或多个层级以访问一个或多个模板。

公开(公告)号：US20150373049A1

公开(公告)日：2015-12-24

申请号：US14308748

申请日：2014-06-19

Applicant: Xerox Corporation

Inventor： Avinash Sharma ,  Partha Dutta ,  Tridib Mukherjee ,  Shruti Kunde

IPC: H04L29/06

CPC classification number: H04L63/20 ,  H04L63/126

Abstract: Embodiments of a method are disclosed for computing trust index among multiple entities associated with a resource marketplace. The method includes receiving multiple inputs including interaction attributes, attribute importance factors, references to databases, and multiple entities associated with the resource marketplace. The method also includes creating a weighted-interaction graph based on the received inputs. The weighted-interaction graph includes multiple vertices representing the entities. The method further includes performing a topology-specific analysis of the weighted-interaction graph. The method furthermore includes computing Euclidean distances for each pair of vertices in the weighted-interaction graph based on the performed analysis. The method also includes determining a trust index for a first entity in the received multiple entities based on the computed Euclidean distances. The trust index includes ranking of at least one of the multiple entities with respect to the first entity. The ranking is inversely proportional to the computed Euclidean distances.

Abstract translation: 公开了一种用于计算与资源市场相关联的多个实体之间的信任指数的方法的实施例。 该方法包括接收多个输入，包括交互属性，属性重要性因素，对数据库的引用以及与资源市场相关联的多个实体。 该方法还包括基于所接收的输入创建加权交互图。 加权交互图包括表示实体的多个顶点。 该方法还包括执行加权交互图的拓扑特定分析。 该方法还包括基于所执行的分析来计算加权交互图中的每对顶点的欧几里得距离。 该方法还包括基于所计算的欧氏距离来确定所接收的多个实体中的第一实体的信任度索引。 信任指数包括相对于第一实体的至少一个多个实体的排名。 排名与计算的欧氏距离成反比。

公开(公告)号：US20150325102A1

公开(公告)日：2015-11-12

申请号：US14273565

申请日：2014-05-09

Applicant: Xerox Corporation

Inventor： Anirban Mondal ,  Tridib Mukherjee ,  Avinash Sharma ,  Saraschandra Karanam

IPC: G08B25/10

CPC classification number: G08B25/10 ,  G06Q10/10 ,  G06Q10/101 ,  H04L67/18 ,  H04L67/306

Abstract: The disclosed embodiments illustrate methods and systems for processing crowd-sensed data. The method includes receiving the crowd-sensed data from a mobile device associated with a user. The crowd-sensed data corresponds to metadata of an event pertaining to an aberration in at least one of a public service, a public infrastructure, a private service, or a private infrastructure. Thereafter, the event may be prioritized based at least on a type of the event, a measure of impact of the event, or a measure of urgency to resolve the event. Further, a notification of the event may be transmitted to an organization responsible to at least resolve the event, based on the prioritizing, wherein the notification comprises at least the metadata.

Abstract translation: 所公开的实施例示出了用于处理人群感测数据的方法和系统。 该方法包括从与用户相关联的移动设备接收人群感测数据。 人群感测数据对应于与公共服务，公共基础设施，私人服务或私人基础设施中的至少一个有关的事件的事件的元数据。 此后，可以至少基于事件的类型，事件的影响的度量或解决事件的紧急度量来优先考虑该事件。 此外，可以基于优先级将事件的通知发送到负责至少解决事件的组织，其中通知至少包括元数据。