Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: , a genetic algorithm (GA) for scheduling tasks onto dynamically reconfigurable devices is presented. The scheduling problem is NP-hard and more complicated than multiprocessor scheduling, because both the task allocation and the configurations need to be carefully managed. The approach has been validated with a number of random task graphs. The results show that the GA approach has good convergence and it is in average 8.6% better than a list-based scheduler for large task graphs of various sizes.
['Yang Qu', 'Juha-Pekka Soininen', 'Jari Nurmi']
I am writing a research paper on a idea A Genetic Algorithm for Scheduling Tasks onto Dynamically Reconfigurable Hardware
[{"from": "human", "value": "I am writing a research paper on a idea A Genetic Algorithm for Scheduling Tasks onto Dynamically Reconfigurable Hardware"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: , a genetic algorithm (GA) for scheduling tasks onto dynamically reconfigurable devices is presented. The scheduling problem is NP-hard and more complicated than multiprocessor scheduling, because both the task allocation and the configurations need to be carefully managed. The approach has been validated with a number of random task graphs. The results show that the GA approach has good convergence and it is in average 8.6% better than a list-based scheduler for large task graphs of various sizes."}]