Leapfrogging

Author:

Wagner David B.1,Calder Bradley G.1

Affiliation:

1. Univ. of Colorado, Boulder

Abstract

A future is a language construct that allows programmers to expose parallelism in applicative languages such as MultiLisp [5] with minimal effort. In this paper we describe a technique for implementing futures, which we call leapfrogging , that reduces blocking due to load imbalance. The utility of leapfrogging is enhanced by the fact that it is completely platform-independent, is free from deadlock, and places a bound on stack sizes that is at most a small constant times the maximum stack size encountered during a sequential execution of the same computation. We demonstrate the performance of leapfrogging using a prototype implementation written in C++.

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Graphics and Computer-Aided Design,Software

Cited by 9 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. Distributed Continuation Stealing is More Scalable than You Might Think;2022 IEEE International Conference on Cluster Computing (CLUSTER);2022-09

3. Distributed binary decision diagrams for symbolic reachability;Proceedings of the 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software;2017-07-13

4. What drives leapfrogging? empirical assessment of consumer determinants of leapfrogging;Total Quality Management & Business Excellence;2015-08-24

5. Lace: Non-blocking Split Deque for Work-Stealing;Lecture Notes in Computer Science;2014

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3