2009
DOI: 10.1109/tpds.2008.219
|View full text |Cite
|
Sign up to set email alerts
|

An Integrated Approach to Locality-Conscious Processor Allocation and Scheduling of Mixed-Parallel Applications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
19
0

Year Published

2010
2010
2023
2023

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 38 publications
(19 citation statements)
references
References 30 publications
0
19
0
Order By: Relevance
“…For the application that presents the scheduling problem via dependency graph, also known as directed acyclic graph (DAG), we developed scheduling techniques that optimize latency while taking throughput as a constraint [24] and vice versa [25]. We also investigated duplication--based scheduling [26], and scheduling of mixed--parallel applications [27]. In addition, we developed an extensive survey of pipelined workflow scheduling [28].…”
Section: Schedulingmentioning
confidence: 99%
“…For the application that presents the scheduling problem via dependency graph, also known as directed acyclic graph (DAG), we developed scheduling techniques that optimize latency while taking throughput as a constraint [24] and vice versa [25]. We also investigated duplication--based scheduling [26], and scheduling of mixed--parallel applications [27]. In addition, we developed an extensive survey of pipelined workflow scheduling [28].…”
Section: Schedulingmentioning
confidence: 99%
“…In other words, a task is assigned a single core. The techniques presented in [2]- [5] take into account data parallelism within tasks as well as task parallelism. Their methods take a task graph as input and perform task scheduling and mapping simultaneously, aiming at minimization of schedule length or maximization of pipeline throughput.…”
Section: Related Workmentioning
confidence: 99%
“…Vydyanathan et. al [17] proposed scheduling algorithms that determine what tasks should be run concurrently and how many processors should be allocated to each task. Zhang et.…”
Section: Related Workmentioning
confidence: 99%