StackThreads/MP : Integrating Futures into Calling Standards

StackThreads/MP：将 Future 集成到调用标准中

• 批准号: 08408008
• 负责人: YONEZAWA Akinori
• 金额: $ 22.14万
• 依托单位: The University of Tokyo
• 依托单位国家: 日本
• 项目类别: Grant-in-Aid for Scientific Research (A)
• 财政年份: 1996
• 资助国家: 日本
• 起止时间: 1996 至 1998
• 项目状态: 已结题
• 来源: https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-08408008/
• 关键词: concurrent programming language; concurrent objects; synchronous channels; type systems; deadlock; partial evaluation; multithread; distributed GC; 並列プログラミング

An implementation scheme of fine-grain multithreading that needs no changes to current calling standards for sequential languages and modest extensions to sequential compilers is implemented. Like previous similar systems, it performs an asynchronous call as if it were an ordinary procedure call, and detaches the callee from the caller when the callee suspends or either of them migrates to another processor. Unlike previous similar systems, it detaches and connects arbitrary frames generated by off-the-shelf sequential compilers obeying calling standards. As a consequence, it requires neither a frontend preprocessor nor a native code generator that has a builtin notion of parallelism. The system practically works with unmodified GNU C compiler (GCC). Desirable extensions to sequential compilers for guaranteeing portability and correctness of the scheme are clarified and claimed modest. Experiments indicate that sequential performance is not sacrificed for practical applications and both sequential and parallel performance are comparable to Cilk, whose current implementation requires a fairly sophisticated preprocessor to C. These results show that efficient asynchronous calls (i.e., future calls) can be integrated into current calling standard with a very small impact both on sequential performance and compiler engineering.

实施了一种实现细节多线程的实现方案，该方案不需要更改顺序语言的当前调用标准和对顺序编译器的适度扩展。像以前的类似系统一样，它会执行异步调用，就好像它是一个普通的程序调用一样，当Callee悬挂或两个迁移到另一个处理器时，将Callee从呼叫者中分离出来。与以前的类似系统不同，它可以分离并连接由遵守呼叫标准的现成顺序编译器生成的任意帧。结果，它既不需要前端预处理器，也不需要具有内置的并行性概念的本机代码生成器。该系统实际上与未修改的GNU C编译器（GCC）一起使用。澄清并声称适度的顺序编译器的理想扩展是确保该方案的可移植性和正确性的理想扩展。实验表明，对于实际应用，未牺牲顺序性能，顺序和平行性能都与CILK相当，CILK的当前实施需要相当复杂的预处理器。这些结果表明，有效的异步呼叫（即未来）可以集成到当前的呼叫标准对顺序性能和编译器工程的影响很小。

项目成果

N.Kobayashi: "A partially deadlock-free typed process calculus" ACM Transactions on Programming Languages. (to appear). (1998)

N.Kobayashi：“部分无死锁的类型化过程演算”ACM Transactions on 编程语言。

K.Taura and A.Yonezawa: "An effective garvage collection stratsgy for parallel programming languages on large scale distributed-memory machines" Proceedings of ACM SIGPLAN Symposium on Principles & Practice of Prallel Programing (PPOPP). 264-275 (1997)

K.Taura 和 A.Yonezawa：“大规模分布式内存机器上并行编程语言的有效垃圾收集策略”ACM SIGPLAN 原则研讨会论文集

遠藤 敏夫: "Portableでrobustなglobal garbage collectorの構築について" In Proceedings of SWoPP '96. (1996)

Toshio Endo：“构建便携式且强大的全局垃圾收集器”，《SWoPP 96》论文集（1996 年）。

Kenjiro Taura: "StackThreads MP : Integrating Futures into Calling Standards"Proceedings of ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming (PPoPP). (1999)

Kenjiro Taura：“StackThreads MP：将 Future 集成到调用标准中”ACM SIGPLAN 原理研讨会论文集

Kenjiro Taura: "Fine-grain Multithreading with Minimal Compiler Support --- A cost Effective Approach to Implementing Efficient Multithreading Languages"Proceedings of the 1997 ACM SIGPLAN Conference on Programming Language Design and Implementation. 320-

Kenjiro Taura：“具有最少编译器支持的细粒度多线程 --- 实现高效多线程语言的成本有效方法”1997 年 ACM SIGPLAN 编程语言设计和实现会议记录。