Scheduling and Parallel Computing

考虑一项很大的计算任务，例如，求解一个大型的线性方程组。该任务可以拆分成许多较小的作业，然后在大量不同的不同计算资源上进行调度和排队，并并行执行。不同资源(例如CPU和GPU)的处理要求不同，它们的通信成本也可能不同。在这个项目中，我们将有兴趣在设计(和实现)新的分布式调度算法之前了解随机效应。

Consider a large computational task, for instance, solving a large system of linear equations. This task can be split into many smaller jobs which are then scheduled and queued at a large number of different heterogeneous computing resources and are executed in parallel. The processing requirements of the different resources (for instance CPUs and GPUs) are different, and they may well have different communication costs. In this project we will be interested in understanding the stochastic effects before designing (and implementing) novel distributed scheduling algorithms.