Abstract:
In graphic programming based on module composition, there are many modules which are independent of each other and can be executed in parallel. The translating program traverses the DAG, generates a thread for every module, and generates a semaphore for every arc in order to synchronize the executing sequence of the modules which are dependent on each other, then generates a multithread program, which runs in parallel more efficiently at last.
Key words:
Graphic programming,
Automatic mining,
Multithread,
Parallelism
摘要: 在基于模块组合的图形化编程中,存在大量互不依赖的模块,这些模块具有并行执行的性质。翻译程序以拓扑排序算法遍历该有向无环图,为每个模块产生一个线程,为每条输入线产生一个信号量,以同步有依赖关系的模块的执行顺序,最终产生一个可并行执行的多线程程序,从而达到自动挖掘并行性、提高所生成程序的运行效率的目的。
关键词:
图形化编程,
自动挖掘,
多线程,
并行性
CLC Number:
YIN Huaxiang; TING Yulei; XU Zhu; HONG Xuehai; LIU Jingang; HONG Shengzhong; QIU Zhenge. Automatic Mining of Parallelism Between Modules in Graphic Programming[J]. Computer Engineering, 2007, 33(10): 87-89.
尹华祥;丁玉磊;徐 铸;洪学海;刘金刚;冯圣中;邱振戈. 图形化编程中模块间并行性的自动挖掘[J]. 计算机工程, 2007, 33(10): 87-89.