Implementation of Mapping Heuristic Genetic Algorithm

Abstract: Mapping Heuristic APN Algorithm in which the list is ordered according to node priorities with the highest priority node. Schedule node to the processors which gives highest node. Calculate start time of node, routing table maintained for each processor, each entry of table indexed by destination processing element. Routing table will direct message from one machine to along a path with minimum communication time. Shortest path with between the processing elements are stored in routing table. Message is sent, the route from source to destination machine become busy, carrying message of certain amount of time. When message is received its route become free and this route can be used for other processor for transmission of message again. Every time a message sent and message received event is processed the routing table will be updated to profile the direction for fastest communication routes at any time. Append all ready successor nodes of ni according to priority to the ready node list.

Keywords: DAG, multiprocessor scheduling, genetic algorithm heuristics, mapping heuristics