arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1601.05458cs.DC
收藏

事件驱动任务程序的高效编译

Efficient Compilation to Event-Driven Task Programs

Benoit Meister, Muthu Baskaran, Benoit Pradelle, Thomas Henretty, Richard Lethin

摘要:

正如一类新语言和运行时的出现所说明的那样,预计在超大规模计算机上运行的大部分程序将需要编写为事件驱动任务(EDT)的图形。EDT运行时系统调度这样的任务集合,通过减少任务间同步的量、改进动态负载均衡并使更多操作异步,从而实现比传统运行时更多的并发性。我们提出了一种有效的技术,从程序的多面体表示生成这样的任务图,无论是在编译时间和渐近执行时间。任务依赖性以不同的形式具体化,这取决于目标运行时可用的同步模型。我们探讨了使用每种同步模型编程EDT的不同方法,并确定了与之相关的重要开销来源。我们评估这些编程方案的成本,它们所带来的顺序启动,飞行中的任务管理,用于同步对象的空间,和这些对象的垃圾回收。虽然我们的实现和评估发生在多面体编译器,提出的开销成本分析是有用的自动代码生成的更一般的上下文中。

英文摘要:

As illustrated by the emergence of a class of new languages and runtimes, it is expected that a large portion of the programs to run on extreme scale computers will need to be written as graphs of event-driven tasks (EDTs). EDT runtime systems, which schedule such collections of tasks, enable more concurrency than traditional runtimes by reducing the amount of inter-task synchronization, improving dynamic load balancing and making more operations asynchronous. We present an efficient technique to generate such task graphs from a polyhedral representation of a program, both in terms of compilation time and asymptotic execution time. Task dependences become materialized in different forms, depending upon the synchronization model available with the targeted runtime. We explore the different ways of programming EDTs using each synchronization model, and identify important sources of overhead associated with them. We evaluate these programming schemes according to the cost they entail in terms of sequential start-up, in-flight task management, space used for synchronization objects, and garbage collection of these objects. While our implementation and evaluation take place in a polyhedral compiler, the presented overhead cost analysis is useful in the more general context of automatic code generation.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑