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

51. 发明申请

WO2015131955A1 RULE ENGINE FOR APPLICATION SERVERS 审中-公开
标题翻译：应用服务器规则发动机
公开(公告)号：WO2015131955A1
公开(公告)日：2015-09-11
申请号：PCT/EP2014/054462
申请日：2014-03-07
申请人： NOKIA SOLUTIONS AND NETWORKS OY
发明人： BORGES, Nuno Alexandre , FIGUEIRA, Andre Goncalo , RODRIGUES, Ivo , MARTINS, Joao , SILVA TEIXEIRA, Joao , MEIRA, Nuno , ABREU, Sergio Afonso , CARVALHO, Vasco , MARREIROS, Luis , ALVES DA CUNHA, Rui Pedro
IPC分类号： G06N5/04 , G06F9/50 , G06F9/54
CPC分类号： G06F9/542 , G06F9/5033
摘要： A node managing unit (11) selects, for an event associated with a sub-context of a specific context, an event distributing unit of a plurality of event distributing units (12, 13), which distributes events towards queues for the specific context. The selected event distributing unit selects a queue for the sub-context, which is associated with a rule engine unit of a plurality of rule engines units (17, 19), which comprises a rule execution unit associated with the specific context. A rule managing unit of the rule engine unit, which receives the event from the selected queue for the sub-context, selects the rule execution unit of the plurality of rule execution units, which is associated with the specific context, and delivers, to the selected rule execution unit, a particular rule of a rule set associated with the rule execution unit, within the associated sub-context.
摘要翻译：节点管理单元（11）为与特定上下文的子上下文相关联的事件选择多个事件分发单元（12,13）的事件分发单元，该事件分发单元将事件分配给针对特定上下文的队列。所选择的事件分发单元选择与多个规则引擎单元（17,19）的规则引擎单元相关联的子上下文的队列，其包括与特定上下文相关联的规则执行单元。规则引擎单元的规则管理单元从所选择的子上下文队列接收事件，选择与特定上下文相关联的多个规则执行单元的规则执行单元，并将其传递给所选择的规则执行单元，与规则执行单元相关联的规则集的特定规则在相关联的子上下文内。

52. 发明申请

WO2015110856A1 COMPUTING METHOD 审中-公开
标题翻译：计算方法
公开(公告)号：WO2015110856A1
公开(公告)日：2015-07-30
申请号：PCT/IB2014/001073
申请日：2014-05-16
申请人： TOTAL SA
发明人： BRUCHER, Matthieu , MULLER, Nils-Alexander
IPC分类号： G06F9/50
CPC分类号： G06F9/5033 , G06F9/5083
摘要： The present invention relates to a method for computing tasks by computing clients. The method comprises distributing tasks to the clients; the determination of the association between distributed task and clients is based on a minimization of a size of a union of the subsets of data associated with tasks distributed to computing clients of at least one group in the plurality of clients groups. In addition the method further comprise, for each current computing client in the plurality of computing clients retrieving the subset of data associated with the task distributed to said current computing client from the storage node of the group of the current computing client, and computing the task distributed to said current computing client based on said retrieved subset of data associated with the task distributed to said current computing client.
摘要翻译：本发明涉及一种计算客户端计算任务的方法。该方法包括向客户端分发任务; 分布式任务和客户端之间的关联的确定基于与分配给多个客户端组中的至少一个组的计算客户端的任务相关联的数据子集的联合的大小的最小化。此外，对于多个计算客户端中的每个当前计算客户端，还包括从当前计算客户端的组的存储节点检索与分配给所述当前计算客户端的任务相关联的数据的子集，并且计算任务基于与分配给所述当前计算客户端的任务相关联的所述数据的所述数据子集分发到所述当前计算客户端。

53. 发明申请

WO2014145727A1 SYSTEMS AND METHODS FOR PROVIDING REPEATED USE OF COMPUTING RESOURCES 审中-公开
标题翻译：提供重复使用计算资源的系统和方法
公开(公告)号：WO2014145727A1
公开(公告)日：2014-09-18
申请号：PCT/US2014/030536
申请日：2014-03-17
申请人： SERVICEMESH, INC.
发明人： CATALANO, John , FALKENHAGEN, Kyle , PULIER, Eric , ROBERTS, David , WOODALL, Tim
IPC分类号： G06F17/00 , G06F15/16
CPC分类号： G06F9/5033 , G06F9/5072
摘要： Systems, methods, and non-transitory computer-readable media can provide access to a first-level computing resource via a service catalog. In some instances, the first-level computing resource can be created by a first entity. Moreover, a second-level computing resource can be received. In some cases, the second-level computing resource can be created by a second entity based, at least in part, on the first-level computing resource. Access to the second-level computing resource can be provided via the service catalog. Relational information associated with the first-level computing resource and the second-level computing resource can be tracked.
摘要翻译：系统，方法和非暂时的计算机可读介质可以经由服务目录提供对第一级计算资源的访问。在某些情况下，第一级计算资源可以由第一实体创建。此外，可以接收二级计算资源。在一些情况下，第二级计算资源可以由至少部分地基于第一级计算资源的第二实体创建。可以通过服务目录提供对二级计算资源的访问。可以跟踪与第一级计算资源和第二级计算资源相关联的关系信息。

54. 发明申请

WO2013110187A1 SYSTEM AND METHOD TO REDUCE MEMORY USAGE BY OPTIMALLY PLACING VMS IN A VIRTUALIZED DATA CENTER 审中-公开
标题翻译：通过在虚拟化数据中心中优选放置VMS来减少内存使用的系统和方法
公开(公告)号：WO2013110187A1
公开(公告)日：2013-08-01
申请号：PCT/CA2013/050040
申请日：2013-01-22
申请人： INTERNATIONAL BUSINESS MACHINES CORPORATION , IBM CANADA LIMITED-IBM CANADA LIMITEE
发明人： ASHOK, Rohith K. , HOGSTROM, Matt R. , SALO, Tiia , YADAV, Meeta
IPC分类号： G06F9/455 , G06F12/00 , G06F17/00
CPC分类号： G06F9/5016 , G06F9/45558 , G06F9/4856 , G06F9/5033 , G06F2009/4557
摘要： Embodiments of the present invention provide a method, system and computer program product for collocating VMs based on memory sharing potential. In an embodiment of the invention, a VM co-location method has been claimed. The method includes selecting a VM from amongst different VMs for server colocation. The method additionally includes computing an individual shared memory factor for each of a set of the VMs with respect to the selected VM. The method yet further includes determining a VM amongst the VMs in the set associated with a highest computed shared memory factor. Finally, the method includes co-locating the determined VM with the selected VM in a single server.
摘要翻译：本发明的实施例提供了一种用于基于存储器共享潜力来配置VM的方法，系统和计算机程序产品。在本发明的实施例中，已经要求保留VM共址方法。该方法包括从不同VM之间选择用于服务器托管的VM。该方法还包括针对所选择的VM针对VM集合中的每一个计算单独的共享存储器因子。该方法还包括在与最高计算共享存储器因子相关联的集合中的VM中确定VM。最后，该方法包括将确定的VM与所选择的VM共同定位在单个服务器中。

55. 发明申请

WO2013044304A1 SYSTEM AND METHOD FOR SERVICING A REQUEST 审中-公开
标题翻译：用于维修请求的系统和方法
公开(公告)号：WO2013044304A1
公开(公告)日：2013-04-04
申请号：PCT/AU2012/001169
申请日：2012-09-28
申请人： COCOON DATA HOLDINGS LIMITED , THOMPSON, Stephen , NUSSBAUM, Lawrence Edward
发明人： THOMPSON, Stephen , NUSSBAUM, Lawrence Edward
IPC分类号： G06F15/16 , G06F13/14
CPC分类号： G06F9/5033
摘要： The present invention relates to a method and system for servicing a request by a computer client. A routing server is arranged to receive a client service request. The routing server chooses a compatible other server, compatible with the client service request. It determines an address identifier for the compatible server and transmits the address identifier to the client.
摘要翻译：本发明涉及一种用于为计算机客户端请求提供服务的方法和系统。布置路由服务器以接收客户端服务请求。路由服务器选择与客户端服务请求兼容的兼容的其他服务器。它确定兼容服务器的地址标识符，并将地址标识符发送给客户端。

56. 发明申请

WO2012177343A1 MEMORY SHARING IN GRAPHICS PROCESSING UNIT 审中-公开
标题翻译：图形处理单元中的存储器共享
公开(公告)号：WO2012177343A1
公开(公告)日：2012-12-27
申请号：PCT/US2012/038659
申请日：2012-05-18
申请人： QUALCOMM Incorporated , ARVO, Jukka-Pekka
发明人： ARVO, Jukka-Pekka
IPC分类号： G06F9/48 , G06F9/50
CPC分类号： G06F9/5033
摘要： Aspects of this disclosure are directed to a method of processing data with a graphics processing unit (GPU). According to some aspects of the disclosure, the method comprises receiving input defining execution orders for a shader processor, wherein the execution orders comprise plurality of kernel designations and a plurality of workgroup designations. The method may also include assigning workgroups of kernels identified in the plurality of workgroup designations and the plurality of kernel designations to the shader processor. The method may also include executing, by the shader processor, the workgroups of kernels identified in the plurality of workgroup designations and the plurality of kernel designations to process input data, wherein executing the stream of execution orders comprises sharing input data between two or more workgroups identified in the plurality of workgroup designations.
摘要翻译：本公开的方面涉及用图形处理单元（GPU）处理数据的方法。根据本公开的一些方面，该方法包括接收定义着色器处理器的执行顺序的输入，其中执行顺序包括多个内核指定和多个工作组指定。该方法还可以包括将在多个工作组指定中识别的内核的工作组和多个内核指定分配给着色器处理器。该方法还可以包括由着色器处理器执行在多个工作组指定中识别的内核的工作组以及多个内核指定以处理输入数据，其中执行执行顺序流包括在两个或多个工作组之间共享输入数据在多个工作组名称中确定。

57. 发明申请

WO2011138430A3 METHOD FOR EXECUTING A PROGRAM FOR PROCESSING DATA, AND CORRESPONDING SYSTEM 审中-公开
标题翻译：方法一种用于为处理数据和相应的系统的程序
公开(公告)号：WO2011138430A3
公开(公告)日：2012-04-05
申请号：PCT/EP2011057292
申请日：2011-05-06
申请人： WEILER DIETER
发明人： WEILER DIETER
IPC分类号： G06F9/50
CPC分类号： G06F9/5033 , G06F9/5044 , G06F9/505 , G06F9/5061 , Y02D10/22 , Y02D10/36
摘要： Method for executing a program for processing data comprising at least one subprogram, in which an administrator controls at least two local agents and provides the latter with at least one subprogram, wherein the administrator controls the local agents on the basis of control data comprising at least one of the following items of information: a) the location of the data to be processed and b) the available computation capacity on the local agents, wherein the administrator controls at least the transport of data to the local agents and the allocation of subprograms to the local agents. The method according to the invention and the system according to the invention advantageously allow high-performance computation systems which are cost-effective and highly scalable to be set up. The costs incurred for so-called supercomputers at the time at which this application is filed can thus be considerably reduced with the same computation power and a reduced energy consumption.
摘要翻译：用于处理数据，包括在其中的管理员控制至少两个本地代理的至少一个部分节目执行的程序，提供至少一个部分节目的方法，根据控制数据包括以下信息中的至少一个的管理员执行本地代理的控制：1）将要处理的数据的位置和b），在本地代理可用的计算能力，其中，所述管理员控制至少数据到本地代理运输和部分节目到本地代理的分配。本发明并根据本发明的系统的方法允许以一种有利的方式是最具成本效益且可扩展的高性能计算系统的结构。孙可显著降低在提交本申请所谓的超级计算机时所产生的费用，以相同的处理能力和降低功耗。

58. 发明申请

WO2011147685A1 IDLE TRANSITIONS SAMPLING 审中-公开
标题翻译：空闲过渡采样
公开(公告)号：WO2011147685A1
公开(公告)日：2011-12-01
申请号：PCT/EP2011/057574
申请日：2011-05-11
申请人： INTERNATIONAL BUSINESS MACHINES CORPORATION , IBM UNITED KINGDOM LIMITED , LEVINE, Frank, Eliot , KUIPER, Kean , PINEDA, Enio, Manuel
发明人： LEVINE, Frank, Eliot , KUIPER, Kean , PINEDA, Enio, Manuel
IPC分类号： G06F9/50
CPC分类号： G06F9/5033 , G06F2201/86
摘要： A process generates a sample based on an event. The process identifies, with a dispatch monitor, a next dispatched monitored thread that is dispatched by a current processor. The process sets a processor affinity of the next dispatched monitored thread such that the next dispatched monitored thread runs only on the current processor without being able to migrate to a different processor. The process also retrieves, with a sampled thread that runs on the current processor, a next dispatched monitored thread call stack after the processor affinity of the next dispatched monitored thread has been set to the processor. The process restores the processor affinity of the next dispatched monitored thread after the next dispatched monitored thread call stack has been obtained.
摘要翻译：过程根据事件生成样本。该进程通过分派监视器识别由当前处理器调度的下一个调度的被监视线程。该进程设置下一个调度的被监视线程的处理器亲和度，使得下一个调度的被监视线程仅在当前处理器上运行，而无需迁移到不同的处理器。该进程还使用在当前处理器上运行的采样线程检索在下一个调度的被监视线程的处理器相关性已经设置为处理器之后的下一个调度的被监视线程调用堆栈。在获得下次调度的监听线程调用堆栈之后，该进程将恢复下一个调度的被监视线程的处理器关联。

59. 发明申请

WO2009043043A9 APPARATUS, SYSTEM, AND METHOD FOR CROSS-SYSTEM PROXY-BASED TASK OFFLOADING 审中-公开
标题翻译：用于跨系统代理的任务卸载的装置，系统和方法
公开(公告)号：WO2009043043A9
公开(公告)日：2011-11-03
申请号：PCT/US2008078182
申请日：2008-09-29
申请人： HILTON RONALD N
发明人： HILTON RONALD N
IPC分类号： G06F9/46
CPC分类号： G06F9/46 , G06F9/5033 , G06F9/5044 , G06F2209/509
摘要： An apparatus, system, and method are disclosed for offloading data processing. An offload task 306 hosted on a first data processing system 300-1 provides internal functionality substantially equivalent to that of a second task 304 hosted on a second data processing system 300-2 of a potentially different architecture. A proxy task 308 hosted on the second data processing system 300-2 provides an external interface substantially equivalent to that of the second task 304. A communication mechanism 322 between the first and second data processing systems 300 may be comprised of a network 424, shared storage 422, and shared memory 426. The proxy task 308 substantially replaces the second task 304, delegating the internal functionality of the second task 304 to the offload task 306 via mapping 506 of arguments and accessing 514 and 714 and translating 518 and 710 of input 510 and output 706 data as required.
摘要翻译：公开了用于卸载数据处理的装置，系统和方法。托管在第一数据处理系统300-1上的卸载任务306提供基本上等同于托管在潜在不同架构的第二数据处理系统300-2上的第二任务304的内部功能。托管在第二数据处理系统300-2上的代理任务308提供与第二任务304大致相同的外部接口。第一和第二数据处理系统300之间的通信机构322可以由网络424，共享的存储器422和共享存储器426.代理任务308基本上替换第二任务304，通过参数的映射506将访问第514任务的第二任务304的内部功能委托给卸载任务306，并且访问514和714并且转换输入的518和710 510并根据需要输出706数据。

60. 发明申请

WO2011083056A2 TRANSACTIONAL UPDATING IN DYNAMIC DISTRIBUTED WORKLOADS 审中-公开
标题翻译：动态分布式工作的交易更新
公开(公告)号：WO2011083056A2
公开(公告)日：2011-07-14
申请号：PCT/EP2010070631
申请日：2010-12-23
申请人： IBM , JOHNSON PAUL , BURGESS GEORGE , MITCHELL IAN
发明人： JOHNSON PAUL , BURGESS GEORGE , MITCHELL IAN
CPC分类号： G06F9/466 , G06F9/5033 , G06F11/2033
摘要： A workload manager is operable with a distributed transaction processor having a plurality of processing regions and comprises: a transaction initiator region for initiating a transaction; a transaction router component for routing an initiated transaction to one of the plurality of processing regions; an affinity controller component for restricting transaction routing operations to maintain affinities; the affinity controller component characterised in comprising a unit of work affinity component operable with a resource manager at the one of the plurality of processing regions to activate an affinity responsive to completion of a recoverable data operation at the one of the plurality of processing regions.
摘要翻译：工作负载管理器可操作于具有多个处理区域的分布式事务处理器，并且包括：用于发起事务的事务发起者区域; 用于将发起的事务路由到所述多个处理区域之一的事务路由器组件; 用于限制事务路由操作以保持亲和性的亲和度控制器组件; 所述亲和度控制器组件的特征在于包括可与所述多个处理区域中的所述一个处理区域中的所述一个处理区域中的资源管理器一起工作的工作亲和度单元的单元，以响应于所述多个处理区域中的所述一个处理区域中的所述一个处理区

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式