The incremental garbage collection of processes

H. Baker, C. Hewitt
{"title":"The incremental garbage collection of processes","authors":"H. Baker, C. Hewitt","doi":"10.1145/800228.806932","DOIUrl":null,"url":null,"abstract":"This paper investigates some problems associated with an argument evaluation order that we call “future” order, which is different from both call-by-name and call-by-value, In call-by-future, each formal parameter of a function is bound to a separate process (called a “future”) dedicated to the evaluation of the corresponding argument. This mechanism allows the fully parallel evaluation of arguments to a function, and has been shown to augment the expressive power of a language. \n We discuss an approach to a problem that arises in this context: futures which were thought to be relevant when they were created become irrelevant through being ignored in the body of the expression where they were bound. The problem of irrelevant processes also appears in multiprocessing problem-solving systems which start several processors working on the same problem but with different methods, and return with the solution which finishes first. This parallel method strategy has the drawback that the processes which are investigating the losing methods must be identified, stopped, and re-assigned to more useful tasks.","PeriodicalId":188914,"journal":{"name":"Artificial Intelligence and Programming Languages","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1977-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"428","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Artificial Intelligence and Programming Languages","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800228.806932","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 428

Abstract

This paper investigates some problems associated with an argument evaluation order that we call “future” order, which is different from both call-by-name and call-by-value, In call-by-future, each formal parameter of a function is bound to a separate process (called a “future”) dedicated to the evaluation of the corresponding argument. This mechanism allows the fully parallel evaluation of arguments to a function, and has been shown to augment the expressive power of a language. We discuss an approach to a problem that arises in this context: futures which were thought to be relevant when they were created become irrelevant through being ignored in the body of the expression where they were bound. The problem of irrelevant processes also appears in multiprocessing problem-solving systems which start several processors working on the same problem but with different methods, and return with the solution which finishes first. This parallel method strategy has the drawback that the processes which are investigating the losing methods must be identified, stopped, and re-assigned to more useful tasks.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
进程的增量垃圾收集
本文研究了与参数求值顺序相关的一些问题,这种顺序不同于按名调用和按值调用。在按未来调用中,函数的每个形式参数都被绑定到一个单独的进程(称为“未来”),该进程专门用于求相应参数的值。这种机制允许对函数的参数进行完全并行的求值,并且已被证明可以增强语言的表达能力。我们将讨论一种解决在这种情况下出现的问题的方法:在创建时被认为是相关的期货,由于在它们被绑定的表达式中被忽略而变得无关紧要。不相关进程的问题也出现在多进程问题解决系统中,该系统启动多个处理器以不同的方法处理同一个问题,然后返回最先完成的解决方案。这种并行方法策略的缺点是,必须识别、停止正在调查丢失方法的进程,并将其重新分配给更有用的任务。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Automatic synthesis of optimal invariant assertions: Mathematical foundations Program manipulation via an efficient production system A knowledge-based code generator generator What the nature of natural language tells us about how to make natural-language-like programming languages more natural The automatic synthesis of recursive programs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1