Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: In “Process placement in multicore clusters: Algorithmic issues and practical techniques,” Jeannot, Mercier, and Tessier presented an algorithm called  TreeMatch  for determining the best placement of a set of communicating processes on a hierarchically structured computing architecture, described by a tree. In order to speed up the algorithm, it was suggested to decompose levels of the tree with high arity into several levels of smaller arity. The authors conjectured what the optimal strategy for decomposition is. In this contribution,  prove that their conjecture was right.
['Zoltán Ádám Mann']
I am writing a research paper on a idea A Comment on “Process Placement in Multicore Clusters: Algorithmic Issues and Practical Techniques”
[{"from": "human", "value": "I am writing a research paper on a idea A Comment on \u201cProcess Placement in Multicore Clusters: Algorithmic Issues and Practical Techniques\u201d"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: In \u201cProcess placement in multicore clusters: Algorithmic issues and practical techniques,\u201d Jeannot, Mercier, and Tessier presented an algorithm called  TreeMatch  for determining the best placement of a set of communicating processes on a hierarchically structured computing architecture, described by a tree. In order to speed up the algorithm, it was suggested to decompose levels of the tree with high arity into several levels of smaller arity. The authors conjectured what the optimal strategy for decomposition is. In this contribution,  prove that their conjecture was right."}]