Theory and Algorithms for Multicore Computing

芯片多处理器（即，多核）正迅速成为计算的主导平台。 这种计算环境的特点是具有共享内存和缓存层次结构的并行计算。 这个研究项目将开发一个多核计算的理论，它将包括（但不限于）以下方面：开发和完善多核计算的抽象理论模型;设计和分析针对重要问题的多核高效算法，包括高速缓存无关和处理器无关算法;设计用于多核上高效执行并行算法的编译器;以及开发下限来描述多核计算的固有限制。 该项目的成果将是一套有效利用多核的新方法。 由于在可预见的未来，多核被广泛认为是占主导地位的计算平台，因此这些结果可能对依赖计算密集型任务的所有领域具有广泛的适用性。

Chip multiprocessors (i.e., multicores) are rapidly emerging as the dominant platform for computing. This computing environment features parallel computing with shared-memory and a hierarchy of caches. This research project will develop a theory of multicore computing, which will include (but is not limited to) the following aspects: Developing and refining abstract theoretical models for multicore computing; designing and analyzing efficient algorithms for multicores for important problems, including cache-oblivious and processor-oblivious algorithms; designing schedulers for efficient execution of parallel algorithms on multicores; and developing lower bounds to delineate the inherent limitations of multicore computing. The outcome of the project will be a new set of methods for the efficient use of multicores. Since multicores are widely expected to be the dominant compute platform for the foreseeable future, these results are likely to have broad applicability to all fields that rely on compute-intensive tasks.