Duck Futures: A Generative Approach to Transparent Futures Lin, Eric Upadhyaya, Ganesha Rajan, Hridesh Mooney, Sean Rajan, Hridesh
dc.contributor.department Computer Science 2018-02-16T15:41:51.000 2020-06-30T01:57:04Z 2020-06-30T01:57:04Z 2015-06-24
dc.description.abstract <p>Futures offer a convenient abstraction for encapsulating delayed computation. It is a mechanism to introduce concurrency through a rewrite of the sequential program. However, managing futures is tedious and requires knowledge of concurrency and its concerns. The notion of transparent futures is used to hide the complexity of futures from developers. A number of techniques based on transparency have been proposed to create and manage futures. Previous techniques make use of reflection. In this paper, we propose duck futures that use a generative approach. We show that duck futures are much more efficient compared to previous notions of transparent futures. We also present the first large scale study of the applicability and utility of duck futures in practice using the Boa infrastructure for mining large scale open source repositories. Our study finds that transparent futures, despite their limitations, can be very useful in practice.</p>
dc.identifier archive/
dc.identifier.articleid 1370
dc.identifier.contextkey 7260161
dc.identifier.s3bucket isulib-bepress-aws-west
dc.identifier.submissionpath cs_techreports/371
dc.source.bitstream archive/|||Fri Jan 14 23:50:05 UTC 2022
dc.subject.disciplines Programming Languages and Compilers
dc.subject.disciplines Software Engineering
dc.subject.keywords Duck futures
dc.subject.keywords Transparent futures
dc.subject.keywords Implicit concurrency
dc.title Duck Futures: A Generative Approach to Transparent Futures
dc.type article
dc.type.genre article
dspace.entity.type Publication
relation.isAuthorOfPublication 4e3f4631-9a99-4a4d-ab81-491621e94031
relation.isOrgUnitOfPublication f7be4eb9-d1d0-4081-859b-b15cee251456
Original bundle
Now showing 1 - 1 of 1
351.24 KB
Adobe Portable Document Format