Trevor Clinkenbeard

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
The research presented in this paper analyzes different algorithms for scheduling a set of potentially interdependent jobs in order to minimize the total runtime, or makespan, when data communication costs are considered. On distributed file systems, such as the HDFS, files are spread across a cluster of machines. Once a request, such as a query, having as(More)
  • 1