Heterogeneous Earliest Finish Time

Heterogeneous Earliest Finish Time (or HEFT) is a heuristic to schedule a set of dependent tasks onto a network of heterogeneous workers taking… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

2002-2017
051020022017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
The architectures of high-end embedded system have evolved into heterogeneous distributed integrated architectures. The… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
2012
2012
osting by E Abstract In parallel computation, the scheduling and mapping tasks is considered the most critical problem which… (More)
  • figure 1
  • table 1
  • table 2
  • figure 2
  • table 3
Is this relevant?
2011
2011
Heterogeneous computing platforms such as Grid and Cloud computing are becoming prevalent and available online. As a result… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2011
2011
To solve computationally expensive problems, multiple processor SoCs (MPSoCs) are frequently used. Mapping of applications to… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Among the numerous DAG scheduling heuristics suitable for heterogeneous systems, the Heterogeneous Earliest Finish Time (HEFT… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
A heterogeneous computing environment is a suite of heterogeneous processors interconnected by high-speed networks, thereby… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • figure 3
Is this relevant?
2005
2005
Optimal scheduling of parallel applications on distributed computing systems represented by directed acyclic graph (DAG) is… (More)
  • figure 1
  • table 2
  • table 1
  • table 4
  • table 5
Is this relevant?
2005
2005
Finding an optimal solution to the problem of scheduling an application modeled by a directed acyclic graph (DAG) onto a… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • figure 2
Is this relevant?
Highly Cited
2003
Highly Cited
2003
This paper considers the Heterogeneous Earliest Finish Time (HEFT) algorithm for scheduling the tasks of an application… (More)
  • figure 1
  • figure 2
  • table 1
Is this relevant?
Highly Cited
2002
Highly Cited
2002
ÐEfficient application scheduling is critical for achieving high performance in heterogeneous computing environments. The… (More)
Is this relevant?