4. A method as claimed in claim 1 which comprises using the processor to update the distributed computing graph to automatically incorporate data formatting processes such that data is able to flow between the first community and other processes in the distributed computing graph.
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.