Results 241 to 250 of about 434,244 (289)

Task-Scheduling Algorithm

2001
This chapter presents a task-scheduling algorithm for a heterogeneous computing environment with a bounded number of processors. We first present the Heterogeneous Earliest Finish Time (HEFT) Algorithm [53] proposed by Haluk Rahmi Topcuoglu, and we then present the Dynamic Heterogeneous Prediction-Based (DHPB) Schedeuling Algorithm, and analyze its ...
Dongmin Kim, Salim Hariri
openaire   +1 more source

Scheduling UET multiprocessor tasks

1994
Summary: Classical scheduling theory assumed that a task for its processing may require only one processor at a time. This assumption is not so obvious in the context of new parallel computer systems and parallel algorithms. In this work we consider deterministic scheduling of unit execution time (UET) tasks, each of which requires more than one ...
BIANCO L., BLAZEWICZ J., DELL'OLMO, Paolo, DROZDOWSKI M.   +3 more
openaire   +2 more sources

Task Scheduling

2023
Peter Späth, Iuliana Cosmina, Rob Harrop, Chris Schaefer   +3 more
openaire   +1 more source

Scheduling Tasks

2023
Dmitry Kornilov, Daniel Kec, Dmitry Aleksandrov   +2 more
openaire   +1 more source

Task Graph Scheduling

2011
Yves Robert, Sameer Shende, Allen D. Malony, Alan Morris, Wyatt Spear, Scott Biersdorff, Burton Smith, Dali Wang, Daniel Ricciuto, Wilfred Post, Michael W. Berry, François Irigoin, Katherine Yelick, Susan L. Graham, Paul Hilfinger, Dan Bonachea, Jimmy Su, Amir Kamil, Kaushik Datta, Phillip Colella, Tong Wen, Jack Dongarra, Piotr Luszczek, Abhinav Bhatele, Stefan M. Freudenberger, Volker Diekert, Anca Muscholl, Maurice Herlihy, J. Eliot B. Moss   +28 more
openaire   +1 more source

Tasks and Scheduling

2015
With rising numbers of cores and increasing processor speed in computers nowadays, it is crucial for applications to be able to use this computational power. Let’s compare a processor to yourself at work. Imagine you get stuck with a task, and only your experienced teammate can help you with it. But he’s at lunch.
openaire   +1 more source

Scheduling Tasks

2008
Keir Thomas, Jaime Sicam
openaire   +2 more sources

Static Task Scheduling

1988
Depending on the granularity of the different parts of a program we have low and high level spreading for fine and coarse grain program modules respectively. Most instances of the spreading problem are NP-Complete [GaJo79]. In this chapter we discuss optimal solutions for some instances of high level spreading, and efficient heuristics for the ...
openaire   +1 more source

Scheduling Tasks

2010
Emilio Raggi, Keir Thomas, Trevor Parsons, Andy Channelle, Sander van Vugt   +4 more
openaire   +1 more source

Scheduling Tasks

2011
Emilio Raggi, Keir Thomas, Sander van Vugt   +2 more
openaire   +1 more source