Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  consider the execution of a complex application on a heterogeneous "Grid" computing platform. The complex application consists of a suite of identical, independent problems to be solved. In turn, each problem consists of a set of tasks. There are dependences (precedence constraints) beten these tasks. A typical example is the repeated execution of the same algorithm on several distinct data samples.  use a non-oriented graph to model the Grid platform, where resources have different speeds of computation and communication.  show how to determine the optimal steady-state scheduling strategy for each processor (the fraction of time spent computing and the fraction of time spent communicating with each neighbor). This result holds for a quite general framework, allowing for cycles and multiple paths in the platform graph.
['Olivier Beaumont', 'Arnaud Legrand', 'Yves Robert']
I am writing a research paper on a idea Scheduling strategies for mixed data and task parallelism on heterogeneous clusters and Grids
[{"from": "human", "value": "I am writing a research paper on a idea Scheduling strategies for mixed data and task parallelism on heterogeneous clusters and Grids"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  consider the execution of a complex application on a heterogeneous \"Grid\" computing platform. The complex application consists of a suite of identical, independent problems to be solved. In turn, each problem consists of a set of tasks. There are dependences (precedence constraints) beten these tasks. A typical example is the repeated execution of the same algorithm on several distinct data samples.  use a non-oriented graph to model the Grid platform, where resources have different speeds of computation and communication.  show how to determine the optimal steady-state scheduling strategy for each processor (the fraction of time spent computing and the fraction of time spent communicating with each neighbor). This result holds for a quite general framework, allowing for cycles and multiple paths in the platform graph."}]