CSR-AES: Optimizations for Optimistic Parallelization Systems

CSR-AES：乐观并行化系统的优化

• 批准号: 0719966
• 负责人: Keshav Pingali
• 金额: $ 60万
• 依托单位: University of Texas at Austin
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 2007
• 资助国家: 美国
• 起止时间: 2007-08-01 至 2012-07-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0719966&HistoricalAwards=false
• 关键词: CSR; AES; Optimizations; Optimistic; Parallelization

Most current general-purpose processors have two to four cores, and the number of cores on processor chips is expected to double every one and half years. Applications run efficiently on such processors only if they exploit coarse-grain parallelism. However, parallel programminghas so far been successful only for applications that deal with structured datasuch as arrays and relations; unfortunately, most general-purpose applications deal with unstructured data such as graphs and trees. This project is focusedon the exploitation of a particular kind of data parallelism in irregularapplications that arises from the use of unordered and ordered worklists. Optimistic parallelization is the key mechanism for obtaining parallelism in such applications. A runtime system is used to manage the optimistic parallelism, and compiler analyses are used to optimize parallel execution. Finally, programs are further optimized using dynamic code specialization as the program executes. To investigate the scalability of this approach, the project uses multicore hardware prototypes based on field-programmable gate-arrays. If successful, the project will go a long way towards solving the pressing problem of writing software for multicore processors.

目前大多数通用处理器都有两到四个核心，处理器芯片上的核心数量预计每一年半就会翻一番。只有当应用程序利用粗粒度并行时，它们才能在这样的处理器上高效地运行。然而，并行编程迄今为止只在处理结构化数据（如数组和关系）的应用程序中取得了成功;不幸的是，大多数通用应用程序都处理非结构化数据（如图和树）。这个项目的重点是在不规则的应用程序中利用一种特殊的数据并行性，这种并行性来自于无序和有序工作列表的使用。乐观并行化是在此类应用中获得并行性的关键机制。运行时系统用于管理乐观并行性，编译器分析用于优化并行执行。最后，在程序执行时使用动态代码专门化来进一步优化程序。为了研究这种方法的可扩展性，该项目使用基于现场可编程门阵列的多核硬件原型。如果成功，该项目将大大有助于解决为多核处理器编写软件的紧迫问题。