Theory and Algorithms for Multicore Computing

多核计算的理论和算法

• 批准号: 0830737
• 负责人: Vijaya Ramachandran
• 金额: $ 37.5万
• 依托单位: University of Texas at Austin
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2010
• 资助国家: 美国
• 起止时间: 2010-01-15 至 2014-12-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0830737&HistoricalAwards=false
• 关键词: Theory; Algorithms; 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.

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