DOIAbstract
In this paper we study the scheduling of multiple divisible loads on a star network of processors. We show that this problem is computationally hard. Special cases solvable in polynomial time are identified
In this paper we study the scheduling of multiple divisible loads on a star network of processors. We show that this problem is computationally hard. Special cases solvable in polynomial time are identified
In this paper we introduce the Divisible Load Scheduling (DLS) family of algorithms for data-intensi...
International audienceIn this paper, we discuss complexity issues for scheduling divisible workloads...
To date solutions for optimal finish time and job allocation in divisible load theory are largely ob...
Scheduling multiple divisible loads on a star network of processors is studied in this paper. It is ...
Many applications in scientific and engineering domains are structured as large numbers of independe...
(eng) Applications in many scientific and engineering domains are structured in large numbers of ind...
Applications in many scientific and engineering domains are structured in large numbers of independe...
We analyze scheduling multilayer divisible computations. Multilayer computations consist o...
In this paper we study master-worker scheduling of divisible loads in heterogeneous distributed syst...
In this paper we prove that the Divisible Load Scheduling (DLS) problem is NP-complete when the unde...
(eng) Divisible load applications consist of an amount of data and associated computation that can b...
In this paper we propose a general Linear Programming (LP) based formulation and solution methodolog...
The Divisible Load Theory (DLT) is a paradigm in the area of parallel and distributed computing. Ba...
The problem of distributing and processing a divisible load in a heterogeneous linear net-work of pr...
In this paper we introduce the Divisible Load Scheduling (DLS) family of algorithms for data-intensi...
In this paper we introduce the Divisible Load Scheduling (DLS) family of algorithms for data-intensi...
International audienceIn this paper, we discuss complexity issues for scheduling divisible workloads...
To date solutions for optimal finish time and job allocation in divisible load theory are largely ob...
Scheduling multiple divisible loads on a star network of processors is studied in this paper. It is ...
Many applications in scientific and engineering domains are structured as large numbers of independe...
(eng) Applications in many scientific and engineering domains are structured in large numbers of ind...
Applications in many scientific and engineering domains are structured in large numbers of independe...
We analyze scheduling multilayer divisible computations. Multilayer computations consist o...
In this paper we study master-worker scheduling of divisible loads in heterogeneous distributed syst...
In this paper we prove that the Divisible Load Scheduling (DLS) problem is NP-complete when the unde...
(eng) Divisible load applications consist of an amount of data and associated computation that can b...
In this paper we propose a general Linear Programming (LP) based formulation and solution methodolog...
The Divisible Load Theory (DLT) is a paradigm in the area of parallel and distributed computing. Ba...
The problem of distributing and processing a divisible load in a heterogeneous linear net-work of pr...
In this paper we introduce the Divisible Load Scheduling (DLS) family of algorithms for data-intensi...
In this paper we introduce the Divisible Load Scheduling (DLS) family of algorithms for data-intensi...
International audienceIn this paper, we discuss complexity issues for scheduling divisible workloads...
To date solutions for optimal finish time and job allocation in divisible load theory are largely ob...
Add to ORKG