Distributed computing using communities
First Claim
1. A method at an entity in a distributed computing system comprising:
- providing an input arranged to connect to the distributed computing system and access a distributed computing graph associated with an activity to be carried out in the distributed computing system, the distributed computing graph representing currently executing processes in the distributed computing system;
arranging a processor to provide a dynamic mapping between the distributed computing graph and a data structure at the entity holding a graph layout view of the distributed computing graph such that changes in the graph layout view are reflected in the distributed computing graph;
receiving user input adding a first community in the graph layout view the first community comprising computing resources in the distributed computing system;
receiving user input placing a first graphical element in the first community, the first graphical element representing at least a first one of the currently executing processes;
using the processor to update the distributed computing graph such that the first currently executing process runs on computing resources of the first community;
receiving user input placing a second graphical element outside all communities displayed on the graph layout view, the second graphical element representing at least a second one of the currently executing processes; and
using the processor to update the distributed computing graph such that the second currently executing process represented by the second graphical element runs on computing resources of a local machine.
2 Assignments
0 Petitions
Accused Products
Abstract
Distributed computing using communities is described. In an embodiment computations in a distributed computing system are driven and controlled by a document storing a distributed computing graph, a graph layout view of that graph and visualization elements. For example, the document is replicated and synchronized at each of a plurality of entities in the distributed computing system. In examples a community may be drawn as a rectangle or other shape in the graph layout view and represents one or more computing resources in the distributed computing system. For example by placing graphical elements representing currently executing processes into the community on the graph layout view a user is able to ensure that those processes execute using the computing resources of the community. In examples communities may be nested and may have parameters specifying conditions which are to be met by the computing resources they represent.
25 Citations
20 Claims
-
1. A method at an entity in a distributed computing system comprising:
-
providing an input arranged to connect to the distributed computing system and access a distributed computing graph associated with an activity to be carried out in the distributed computing system, the distributed computing graph representing currently executing processes in the distributed computing system; arranging a processor to provide a dynamic mapping between the distributed computing graph and a data structure at the entity holding a graph layout view of the distributed computing graph such that changes in the graph layout view are reflected in the distributed computing graph; receiving user input adding a first community in the graph layout view the first community comprising computing resources in the distributed computing system; receiving user input placing a first graphical element in the first community, the first graphical element representing at least a first one of the currently executing processes; using the processor to update the distributed computing graph such that the first currently executing process runs on computing resources of the first community; receiving user input placing a second graphical element outside all communities displayed on the graph layout view, the second graphical element representing at least a second one of the currently executing processes; and using the processor to update the distributed computing graph such that the second currently executing process represented by the second graphical element runs on computing resources of a local machine. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17)
-
-
18. A graph engine at an entity in a distributed computing system, the graph engine comprising:
-
an input arranged to connect to the distributed computing system and access a distributed computing graph associated with an activity to be carried out in the distributed computing system, the distributed computing graph representing currently executing processes in the distributed computing system; a processor arranged to provide a dynamic mapping between the distributed computing graph and a data structure at the entity holding a graph layout view of the distributed computing graph such that changes in the graph layout view are reflected in the distributed computing graph; a graphical user interface arranged to receive user input adding a first community in the graph layout view the first community comprising computing resources in the distributed computing system; the graphical user interface also being arranged to receive user input placing a first graphical element in the first community, the first graphical element representing at least a first one of the currently executing processes; the processor being arranged to update the distributed computing graph such that the first currently executing process runs on computing resources of the first community; the graphical user interface also being arranged to receive user input placing a second graphical element outside all communities displayed in the graph layout view, the second graphical element representing at least a second one of the currently executing processes; and the processor being arranged to update the distributed computing graph such that the second currently executing process runs on computing resources of a local machine. - View Dependent Claims (19)
-
-
20. A distributed computing system comprising:
-
a plurality of computing devices connected using a communications network, each computing device having a copy of a controlling document for controlling computations currently executing at the computing devices and which are part of the same activity, wherein a graphical element, representing a computation, being positioned outside each community represented in a distributed computing graph associated with the controlling document indicates that the computation is executed on a local machine; a replication mechanism arranged to replicate and synchronize the controlling document at each computing device; and a graph engine provided at each of the computing devices and arranged to manage any computations of the activity which are currently executing at that computing device using the controlling document.
-
Specification