2011
DOI: 10.1145/2076021.2048106
|View full text |Cite
|
Sign up to set email alerts
|

Oracle scheduling

Abstract: A classic problem in parallel computing is determining whether to execute a task in parallel or sequentially. If small tasks are executed in parallel, the task-creation overheads can be overwhelming. If large tasks are executed sequentially, processors may spin idle. This granularity problem, however well known, is not well understood: broadly applicable solutions remain elusive.We propose techniques for controlling granularity in implicitly parallel programming languages. Using a cost semantics for a general-… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2015
2015
2019
2019

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
references
References 42 publications
0
0
0
Order By: Relevance