300 Pseudo-Random Task Graphs for Evaluating Mobile Cloud, Fog and Edge Computing Systems

This paper describes a set of 300 pseudo-random task graphs which can be used for evaluating Mobile Cloud, Fog and Edge computing systems. The pseudo-random task graphs are based upon graphs that have previously appeared in IEEE papers. The graphs are described in Matlab code, which is easy to read, edit and execute. Each task has an amount of computational work to perform, expressed in Mega-cycles per second. Each edge has an amount of data to transfer between tasks, expressed in Kilobits or Kilobytes of data. The set can be used by researchers or graduate students to evaluate  cloud/fog/edge computing systems and computational offloading algorithms. The task graphs are organized as 3 sets of 100. Each graph in the first set has the same topology, with N=9 tasks and 6 offloadable tasks. Each graph in the second set has the same topology, with N=29 tasks and 20 offloadable tasks. Each graoh in the third set has the same topology, with N=23 tasks and 19 offloadable tasks. Users can also change the number of offloadable components per task graph, in which case the total number of task graphs specified in this paper exceeds 5,000,  providing a good basis for the evaluating cloud computing systems. The task graphs can be used in single-user systems, where one mobile device accesses a remote server, or in multi-user systems, where many users access a remote server through a wireless channel.