可重构多核体系结构上的程序执行
Program Execution on Reconfigurable Multicore Architectures
摘要:
基于两个观察,即不同的应用程序在不同的多核架构上执行得更好,以及应用程序的不同阶段可能具有非常不同的资源需求,Jesus等人提出了一种用于执行多线程程序的新的可重构硬件方法。该体系结构不是将并发程序映射到固定的体系结构,而是自适应地重新配置自身以满足应用程序的并发性和通信要求,从而显著提高了性能。基于我们早期的抽象操作框架,多核执行与层次存储器结构,我们描述了多线程程序的可重构架构,支持各种集群配置的执行。由于可能引入由在不同核上运行的线程对共享存储器的并发访问引起的竞争条件,这种重新配置可能不保留程序的语义。我们提出了一个直观的偏序概念的集群配置,并表明,多线程程序的语义总是保留重新配置“向上”的顺序,而语义保存任意重新配置可以保证良好的同步程序。我们进一步表明,一个简单的近似概念的执行效率上的不同配置可以得到使用摊销互模拟的概念,并将其扩展到动态重新配置。
英文摘要:
Based on the two observations that diverse applications perform better on different multicore architectures, and that different phases of an application may have vastly different resource requirements, Pal et al. proposed a novel reconfigurable hardware approach for executing multithreaded programs. Instead of mapping a concurrent program to a fixed architecture, the architecture adaptively reconfigures itself to meet the application's concurrency and communication requirements, yielding significant improvements in performance. Based on our earlier abstract operational framework for multicore execution with hierarchical memory structures, we describe execution of multithreaded programs on reconfigurable architectures that support a variety of clustered configurations. Such reconfiguration may not preserve the semantics of programs due to the possible introduction of race conditions arising from concurrent accesses to shared memory by threads running on the different cores. We present an intuitive partial ordering notion on the cluster configurations, and show that the semantics of multithreaded programs is always preserved for reconfigurations "upward" in that ordering, whereas semantics preservation for arbitrary reconfigurations can be guaranteed for well-synchronised programs. We further show that a simple approximate notion of efficiency of execution on the different configurations can be obtained using the notion of amortised bisimulations, and extend it to dynamic reconfiguration.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。