公开(公告)号：US08645429B1

公开(公告)日：2014-02-04

申请号：US13432806

申请日：2012-03-28

Applicant: Aart J. C. Bik ,  Matthew H. Austern ,  James C. Dehnert ,  Grzegorz Czajkowski ,  Grzegorz Malewicz ,  Naty Leiser

Inventor： Aart J. C. Bik ,  Matthew H. Austern ,  James C. Dehnert ,  Grzegorz Czajkowski ,  Grzegorz Malewicz ,  Naty Leiser

IPC: G06F7/00 ,  G06F17/30 ,  G06F11/20

CPC classification number: G06T11/206 ,  G06F7/00 ,  G06F8/457 ,  G06F9/46 ,  G06F9/5005 ,  G06F11/1464 ,  G06F11/1469 ,  G06F11/2082 ,  G06F15/17312 ,  G06F17/30 ,  G06F17/30958 ,  G06F17/30961 ,  G06F2201/84 ,  G06F2221/0793 ,  G06N99/00 ,  G06N99/005 ,  G06T2210/32 ,  H04L5/0032 ,  H04L29/08135 ,  H04L67/10

Abstract: Resolving conflicting graph mutations in a distributed computing system. Graph data for at least a partition of a graph is stored in a worker system of a distributed computing system. The graph represents relationships among a set of tangible items that model a real-world condition having an associated problem. A plurality of conflicting mutation requests are received to mutate the graph. A conflict between the mutation requests is resolved with a conflict resolution function that lacks direct access to the graph data. The graph data is updated responsive to a result generated by resolving the conflict using the conflict resolution function.

Abstract translation: 解决分布式计算系统中的冲突图突变。 至少图形分区的图形数据存储在分布式计算系统的工作系统中。 该图表示对具有相关问题的真实世界条件建模的一组有形项目之间的关系。 接收多个冲突变异请求以使图形变异。 突变请求之间的冲突由解决冲突的功能解决，缺少对图形数据的直接访问。 响应于通过使用冲突解决功能解决冲突而产生的结果来更新图形数据。

公开(公告)号：US20070234322A1

公开(公告)日：2007-10-04

申请号：US11366333

申请日：2006-03-02

Applicant: Krzysztof Palacz ,  Grzegorz Czajkowski ,  Laurent Daynes

Inventor： Krzysztof Palacz ,  Grzegorz Czajkowski ,  Laurent Daynes

IPC: G06F9/45

CPC classification number: G06F21/53 ,  G06F9/445 ,  G06F2209/542

Abstract: A dynamic delegation chain of executor objects can, at runtime, adapt code units to be executed as isolated computations prior to their execution to comport with current state of an environment. A dynamic delegation chain performs the dynamic runtime adaptation of the code unit in accordance with isolated computations that host the executor objects of the delegation chain. Adapting a code unit prior to execution of the code unit allows adaptation of the code unit to a current state, as well as at least reducing concerns of program integrity.

Abstract translation: 执行器对象的动态授权链可以在运行时调整代码单元，以在其执行之前作为独立计算执行以与当前环境状态相匹配。 动态委托链根据托管代理链的执行器对象的隔离计算来执行代码单元的动态运行时间调整。 在执行代码单元之前适应代码单元允许将代码单元适配到当前状态，并且至少减少对程序完整性的关注。

公开(公告)号：US09135565B1

公开(公告)日：2015-09-15

申请号：US13451894

申请日：2012-04-20

Applicant: Mohamed Elbassiony Mohamed Abou El Alaa Khalefa ,  Matthew H. Austern ,  James C. Dehnert ,  Aart J. C. Bik ,  Grzegorz Czajkowski ,  Grzegorz Malewicz

Inventor： Mohamed Elbassiony Mohamed Abou El Alaa Khalefa ,  Matthew H. Austern ,  James C. Dehnert ,  Aart J. C. Bik ,  Grzegorz Czajkowski ,  Grzegorz Malewicz

IPC: G06F15/17 ,  G06N99/00 ,  G06F15/173

CPC classification number: G06T11/206 ,  G06F7/00 ,  G06F8/457 ,  G06F9/46 ,  G06F9/5005 ,  G06F11/1464 ,  G06F11/1469 ,  G06F11/2082 ,  G06F15/17312 ,  G06F17/30 ,  G06F17/30958 ,  G06F17/30961 ,  G06F2201/84 ,  G06F2221/0793 ,  G06N99/00 ,  G06N99/005 ,  G06T2210/32 ,  H04L5/0032 ,  H04L29/08135 ,  H04L67/10

Abstract: Data are maintained in a distributed computing system that describe a directed graph representing relationships among items. The directed graph has a plurality of vertices representing the items and has edges with values representing distances between the items connected by the vertices. A multiple reference point algorithm is executed for a plurality of the vertices in the directed graph in parallel for a series of synchronized iterations to determine shortest distances between the vertices and the source vertex. After executing the algorithm on the vertices, value pairs associated with the vertices are aggregated. The aggregated value pairs indicate shortest distances from the respective vertices to the source vertex. The aggregated value pairs are outputted.

Abstract translation: 在分布式计算系统中维护数据，该分布式计算系统描述表示项目之间的关系的有向图。 有向图具有表示项目的多个顶点，并且具有表示由顶点连接的项目之间的距离的值的边。 针对一系列同步迭代并行地对有向图中的多个顶点执行多参考点算法，以确定顶点与源顶点之间的最短距离。 在对顶点执行算法之后，聚合与顶点相关联的值对。 聚合值对表示从各个顶点到源顶点的最短距离。 输出聚合值对。

公开(公告)号：US09104665B1

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

申请号：US13451420

申请日：2012-04-19

Applicant: Aart J. C. Bik ,  James C. Dehnert ,  Matthew H. Austern ,  Grzegorz Czajkowski

Inventor： Aart J. C. Bik ,  James C. Dehnert ,  Matthew H. Austern ,  Grzegorz Czajkowski

IPC: G06F7/00 ,  G06F17/30

CPC classification number: G06T11/206 ,  G06F7/00 ,  G06F8/457 ,  G06F9/46 ,  G06F9/5005 ,  G06F11/1464 ,  G06F11/1469 ,  G06F11/2082 ,  G06F15/17312 ,  G06F17/30 ,  G06F17/30958 ,  G06F17/30961 ,  G06F2201/84 ,  G06F2221/0793 ,  G06N99/00 ,  G06N99/005 ,  G06T2210/32 ,  H04L5/0032 ,  H04L29/08135 ,  H04L67/10

Abstract: Data are received at a worker system in a distributed computing system that describe a graph representing relationships among a set of items. The graph models a condition having an associated problem. The graph has graph components having associated data fields. The received data are stored in a backup table, and the relationships are analyzed to identify a solution to the problem. As part of the analysis, a new value for the data field associated with a graph component is identified and compared with an existing value of the data field, and the data field is modified. The modified data field is stored in a delta table representing a change to the backup table.

Abstract translation: 在分布式计算系统中的工作者系统处接收数据，该分布式计算系统描述表示一组项目之间的关系的图表。 图表模拟具有相关问题的条件。 该图具有具有相关数据字段的图形组件。 接收的数据存储在备份表中，并分析关系以识别问题的解决方案。 作为分析的一部分，识别与图形组件相关联的数据字段的新值，并与数据字段的现有值进行比较，并修改数据字段。 修改的数据字段存储在表示对备份表的更改的增量表中。

公开(公告)号：US07526760B1

公开(公告)日：2009-04-28

申请号：US10981965

申请日：2004-11-05

Applicant: Laurent Daynes ,  Grzegorz Czajkowski

Inventor： Laurent Daynes ,  Grzegorz Czajkowski

IPC: G06F9/45 ,  G06F15/00 ,  G06F7/38

CPC classification number: G06F9/449

Abstract: A method for implementing virtual method invocation when a compiled code of an invoked method is shared between class types that share a runtime representation is provided. In this method, an entry of an inline cache is set to a reference to an object. Subsequently, instructions for calling code are modified and the inline cache is set to be in one of an unresolved state, a monomorphic state, a shared monomorphic state, or a megamorphic state. A computer readable medium and a system for implementing virtual method invocation are also described.

Abstract translation: 提供了在共享运行时表示的类类型之间共享被调用方法的编译代码时实现虚方法调用的方法。 在该方法中，将内联高速缓存的条目设置为对对象的引用。 随后，修改调用代码的指令，并将内联高速缓存设置为处于未解决状态，单态，共形单态或变形状态之一。 还描述了一种用于实现虚拟方法调用的计算机可读介质和系统。

公开(公告)号：US20070288682A1

公开(公告)日：2007-12-13

申请号：US11728091

申请日：2007-03-22

Applicant: Grzegorz Czajkowski ,  Laurent Daynes

Inventor： Grzegorz Czajkowski ,  Laurent Daynes

IPC: G06F12/00

CPC classification number: G06F9/544 ,  G06F2209/543

Abstract: The present invention relates to computer systems and methods for providing a memory buffer for use with native and platform-independent software code. In a particular embodiment, the method includes providing a first software program compiled to platform-independent code for execution in a first process of the computer system, providing a second software program compiled to native code for execution in a second process of the computer system, and sending a message from the first process to the second process to request a memory buffer. In another particular embodiment, the computer system includes a processor and a memory. The computer system includes a first process to execute a first software program coded in a safe language, a second process to execute a second software program coded in an unsafe language, and an inter-process communication mechanism that allows data message communication between the first process and the second process. The inter-process communication mechanism includes a command that provides for transmission of a message from the first process to the second process to request creation of a direct buffer that is mapped from both the first process and the second process to a common memory area.

公开(公告)号：US20060259906A1

公开(公告)日：2006-11-16

申请号：US11125579

申请日：2005-05-10

Applicant: Grzegorz Czajkowski ,  Glenn Skinner ,  Laurent Daynes

Inventor： Grzegorz Czajkowski ,  Glenn Skinner ,  Laurent Daynes

IPC: G06F9/46

CPC classification number: G06F9/5077 ,  G06F9/5011

Abstract: Combining different resource types into a single logical resource can provide a perspective more suitable for managing a given computer program. Resources of different types that have similar characteristics are combined as a single resource type. Resource management policies are applied against the different resource types via the single combination resource type, wherein on a single computer or applied against a cluster of computers.

公开(公告)号：US20070245331A1

公开(公告)日：2007-10-18

申请号：US11403076

申请日：2006-04-12

Applicant: Laurent Daynes ,  Grzegorz Czajkowski

Inventor： Laurent Daynes ,  Grzegorz Czajkowski

IPC: G06F9/44

CPC classification number: G06F9/44521

Abstract: System and method for supporting per-program classpath and class sharing in a multi-tasking virtual machine. A virtual machine may allow each program to specify its classpath independently of other programs classpaths. Tasks that specify identical classpaths for their respective class loaders may share the runtime representation of classes. A multi-tasking virtual machine may generate and compare canonical forms of classpaths to determine which programs may share classes with each other. The runtime representation of a class may be split between shared and private portions of the runtime representation. A shared runtime representation may be associated with multiple private runtime representations. In one embodiment, unique class loader keys and a system dictionary may be used to associate tasks, class loaders and the shared representations of classes.

Abstract translation: 在多任务虚拟机中支持每程序类路径和类共享的系统和方法。 虚拟机可以允许每个程序独立于其他程序类路径来指定其类路径。 为其各自的类加载器指定相同的类路径的任务可以共享类的运行时表示。 多任务虚拟机可以生成和比较类路径的规范形式，以确定哪些程序可以彼此共享类。 类的运行时表示可以在运行时表示的共享部分和私有部分之间分割。 共享的运行时表示可以与多个私有运行时表示相关联。 在一个实施例中，可以使用唯一类加载器密钥和系统字典来关联任务，类加载器和类的共享表示。

公开(公告)号：US09385845B1

公开(公告)日：2016-07-05

申请号：US13449249

申请日：2012-04-17

Applicant: Matthew H. Austern ,  James C. Dehnert ,  Aart J. C. Bik ,  Grzegorz Czajkowski ,  Grzegorz Malewicz

Inventor： Matthew H. Austern ,  James C. Dehnert ,  Aart J. C. Bik ,  Grzegorz Czajkowski ,  Grzegorz Malewicz

IPC: H04L29/08 ,  H04L5/00

CPC classification number: G06T11/206 ,  G06F7/00 ,  G06F8/457 ,  G06F9/46 ,  G06F9/5005 ,  G06F11/1464 ,  G06F11/1469 ,  G06F11/2082 ,  G06F15/17312 ,  G06F17/30 ,  G06F17/30958 ,  G06F17/30961 ,  G06F2201/84 ,  G06F2221/0793 ,  G06N99/00 ,  G06N99/005 ,  G06T2210/32 ,  H04L5/0032 ,  H04L29/08135 ,  H04L67/10

Abstract: A value is distributed in a distributed computing system having a master system in communication with a plurality of worker systems. Partitions of a graph are assigned to the worker systems. The graph represents relationships among a set of tangible items that model a real-world condition having an associated problem. Configuration information is determined that describes a configuration of the distributed computing system. A distribution scheme is selected for distributing a value from the master system to the plurality of worker systems based on the configuration information. The value is distributed from the master system to the worker systems according to the selected distribution scheme. The worker systems are configured to use the value to produce an output representing a solution to the real-world problem.

Abstract translation: 值分布在具有与多个工作者系统通信的主系统的分布式计算系统中。 图形的分区分配给工作系统。 该图表示对具有相关问题的真实世界条件建模的一组有形项目之间的关系。 确定描述分布式计算系统的配置的配置信息。 选择分配方案，用于基于配置信息将值从主系统分配给多个工作者系统。 该值根据选定的分配方案从主系统分配给工作系统。 工作者系统被配置为使用该值来产生表示对现实世界问题的解决方案的输出。

公开(公告)号：US09026850B1

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

申请号：US13451450

申请日：2012-04-19

Applicant: Grzegorz Malewicz ,  Matthew H. Austern ,  James C. Dehnert ,  Aart J. C. Bik ,  Grzegorz Czajkowski

Inventor： Grzegorz Malewicz ,  Matthew H. Austern ,  James C. Dehnert ,  Aart J. C. Bik ,  Grzegorz Czajkowski

IPC: G06F11/00 ,  G06F9/45

CPC classification number: G06T11/206 ,  G06F7/00 ,  G06F8/457 ,  G06F9/46 ,  G06F9/5005 ,  G06F11/1464 ,  G06F11/1469 ,  G06F11/2082 ,  G06F15/17312 ,  G06F17/30 ,  G06F17/30958 ,  G06F17/30961 ,  G06F2201/84 ,  G06F2221/0793 ,  G06N99/00 ,  G06N99/005 ,  G06T2210/32 ,  H04L5/0032 ,  H04L29/08135 ,  H04L67/10

Abstract: Executing a confined recovery in a distributed system having a plurality of worker systems including a failed worker system at a current superstep. The confined recovery includes determining states of the partitions of the worker systems during the supersteps preceding the current superstep, and determining a recovery initiation superstep preceding the current superstep in which all messages for recovery initiation superstep are available. The recovery initiation superstep is determined responsive to determining the states of the partitions. Additionally, a recovery set of partitions is determined for which messages in supersteps after the recovery initiation superstep are not available. The worker systems having the partitions in the recovery set are instructed to execute the defined function for the partitions in the recovery set starting at the recovery initiation superstep to recover the lost exchanged messages.

Abstract translation: 在具有多个工作系统的分布式系统中执行限制恢复，包括当前超级步骤中的故障工作系统。 限制恢复包括在当前超级步骤之前的超级步骤中确定工作者系统的分区的状态，以及确定在当前超级步骤之前的恢复启动超级步骤，其中用于恢复启动超级步骤的所有消息都可用。 响应于确定分区的状态来确定恢复启动超级步骤。 另外，确定在恢复启动超级步骤之后的超级步骤中哪些消息不可用的恢复分区集合。 指示具有恢复组中的分区的工作系统对在恢复启动超级步骤开始的恢复集中的分区执行定义的功能，以恢复丢失的交换的消息。