Methods and apparatus to perform process placement for distributed applications
First Claim
Patent Images
1. A computer implemented method comprising:
- determining a mapping between a communication graph representative of communications of a distributed application and a topology graph representative of communication costs associated with a computing network;
determining a size of the communication graph;
determining a size of the topology graph;
inserting a dummy vertex into the communication graph if the size of the communication graph is smaller than the size of the topology graph;
inserting a dummy vertex into the topology graph if the size of the topology graph is smaller than the size of the communication graph; and
executing the distributed application with processes of the distributed application assigned to computing nodes of the computing network based upon the mapping.
1 Assignment
0 Petitions
Accused Products
Abstract
Methods and apparatus to perform process placement for distributed applications are disclosed. An example method comprises determining a mapping between a communication graph representative of communications of a distributed application and a topology graph representative of communication costs associated with a computing network, and executing the distributed application with the processes of the distributed application assigned to the processing entities of the computing network based upon the mapping.
-
Citations
27 Claims
-
1. A computer implemented method comprising:
-
determining a mapping between a communication graph representative of communications of a distributed application and a topology graph representative of communication costs associated with a computing network; determining a size of the communication graph; determining a size of the topology graph; inserting a dummy vertex into the communication graph if the size of the communication graph is smaller than the size of the topology graph; inserting a dummy vertex into the topology graph if the size of the topology graph is smaller than the size of the communication graph; and executing the distributed application with processes of the distributed application assigned to computing nodes of the computing network based upon the mapping. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12)
-
-
13. An apparatus comprising:
-
a memory to store a communication graph representative of communication requirements for a distributed application, and to store a topology graph representative of communication costs associated with a computing network; and a graph mapper to; assign processes of the distributed application to processing entities of the computing network by mapping the communication graph to the topology graph to minimize a cost associated with the mapping; determine a size of the communication graph; determine a size of the topology graph; insert a dummy vertex into the communication graph if the size of the communication graph is smaller than the size of the topology graph; and insert a dummy vertex into the topology graph if the size of the topology graph is smaller than the size of the communication graph. - View Dependent Claims (14, 15, 16, 17, 18, 19, 20, 21, 22)
-
-
23. An article of manufacture storing machine accessible instructions which, when executed, cause a machine to:
-
obtain a communication graph for a distributed application; obtain a topology graph for a computing network; determine a size of the communication graph; determine a size of the topology graph; insert a dummy vertex into the communication graph if the size of the communication graph is smaller than the size of the topology graph; insert a dummy vertex into the topology graph if the size of the topology graph is smaller than the size of the communication graph; and iteratively and randomly map the communication graph to the topology graph to select a process-to-node map to reduce an overall communication cost of the distributed application when executed on the computing network, wherein randomly mapping increases the likelihood of an overall communication cost minimum. - View Dependent Claims (24, 25, 26, 27)
-
Specification