Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. A. W. Appel. Allocation without locking. Software Practice and Experience, 19(7):703–705, July 1989.
2. G. Bilardi and A. Nicolau. Adaptive bitonic sorting: An optimal parallel algorithm for shared-memory machines. SI AM Journal of Computing, 12(2):216–228, April 1989.
3. M. Feeley and J. S. Miller. A parallel virtual machine for efficient Scheme compilation. In Proceedings of the 1990 ACM Conference on Lisp and Functional Programming, Nice, France, June 1990.
4. M. Feeley. An Efficient and General Implementation of Futures on Large Scale Shared-Memory Multiprocessors. PhD thesis, Brandeis University Department of Computer Science, 1993. Available as publication #869 from département d'informatique et recherche opérationnelle de l'Université de Montréal.
5. M. Feeley. Polling efficiently on stock hardware. In Proceedings of the 1993 ACM Conference on Functional Programming Languages and Computer Architecture, 1993.
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Portable Implementations of Work Stealing;Proceedings of the International Conference on High Performance Computing in Asia-Pacific Region;2024-01-18
2. Work-stealing Strategies That Consider Work Amount and Hierarchy;Journal of Information Processing;2021
3. Extending a Work-Stealing Framework with Priorities and Weights;2019 IEEE/ACM 9th Workshop on Irregular Applications: Architectures and Algorithms (IA3);2019-11
4. Provably and practically efficient granularity control;Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming;2019-02-16
5. Probabilistic guards: A mechanism for increasing the granularity of work-stealing programs;Parallel Computing;2019-02