2007
DOI: 10.1109/pact.2007.4336206
|View full text |Cite
|
Sign up to set email alerts
|

Language and Virtual Machine Support for Efficient Fine-Grained Futures in Java

Abstract: In this work, we investigate the implementation of futures in Java J2SE v5.0. Java 5.0 provides an interface-based implementation of futures that enables users to encapsulate potentially asynchronous computation and to define their own execution engines for futures. Although this methodology decouples thread scheduling from application logic, for applications with fine-grained parallelism, this model imposes an undue burden on the average users and introduces significant performance overhead.To address these i… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
16
0

Year Published

2007
2007
2019
2019

Publication Types

Select...
3
2
1

Relationship

2
4

Authors

Journals

citations
Cited by 9 publications
(16 citation statements)
references
References 19 publications
0
16
0
Order By: Relevance
“…To simplify programmer effort and to improve performance and scalability of future-based applications in Java, in prior work [39], we propose a new implementation of futures in Java that we refer to as Directive-based Lazy Futures (DBLFutures).…”
Section: Overview Of Dblfuturesmentioning
confidence: 99%
See 3 more Smart Citations
“…To simplify programmer effort and to improve performance and scalability of future-based applications in Java, in prior work [39], we propose a new implementation of futures in Java that we refer to as Directive-based Lazy Futures (DBLFutures).…”
Section: Overview Of Dblfuturesmentioning
confidence: 99%
“…We provide a complete description of the DBLFuture implementation in [39] and [40]. In summary, our DBLFuture system facilitates:…”
Section: Figure 3: the Fibonacci Program Using Dblfuturesmentioning
confidence: 99%
See 2 more Smart Citations
“…"Task inlining" [3], "lazy task creation" [4] and "leapfrogging" [5] has been devised almost two decades ago for Mul-T [3] and Multilisp [6]. In principle, all these techniques are applicable in context of any futures-based system, like it has been recently shown for Java-based system in [7]. A lot of work has been done on granularity control in Glasgow Parallel Haskell both in terms of CPU and memory resources [8,9].…”
Section: Related Workmentioning
confidence: 99%