WAVE is a distributed scheduler for DAG type
task graph that outputs a mapping of tasks to real compute nodes.
It is a module used in Jupiter.
We have two versions of WAVE: random_WAVE and greedy_WAVE
Note: We can not use WAVE as an independent tool
When assigning tasks to nodes, this version of WAVE does random assignment. The algorithm will random choose a node in the set of all validate nodes.
When assigning tasks to nodes, this version of WAVE will first get network parameters from DRUPE as a delay factor. The delay factor contains network delay, target node's CPU usage and memory usage. The WAVE running in each of the node will maintain a sorted list of all its neighbor's delay information. Then it will pick up the node who has the lowest delay and assign tasks to it.
You need to have Jupiter first. Then copy either
random_WAVE folder or greedy_WAVE folder to Jupiter's root folder, and rename as "wave".
Then it's good to use.
This material is based upon work supported by Defense Advanced Research Projects Agency (DARPA) under Contract No. HR001117C0053. Any views, opinions, and/or findings expressed are those of the author(s) and should not be interpreted as representing the official views or policies of the Department of Defense or the U.S. Government.