The heuristics most of the current assignment schemes use is based on satisfying the following rule of thumb: keeping the processors busy leads to a 'good' assignment. Such schemes are said to be work-greedy. This paper presents new bound s on the performance of work-greedy schemes, taking into account the degree of parall elism visible between the tasks and the inter-task communication delays
Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines ...
Abstract- This paper presents a survey on Greedy Algorithm. This discussion is centered on overview ...
The paper presents a novel approach to compute tight upper bounds on the processor utilization indep...
International audienceWe study the impact of communication latency on the classical Work Stealing lo...
This paper investigates a variant of the work-stealing algorithm that we call the localized work-ste...
We revisit the well-known greedy algorithm for scheduling independent jobs on parallel processors, w...
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Com...
In this paper we study the performance of four mapping algorithms. The four algorithms include two n...
This paper studies the performance of parallel stream computations on a multiprocessor architecture ...
International audienceThis paper studies the performance of parallel stream computations on a multip...
In this paper we analyse a very simple dynamic work-stealing algorithm. In the work-generation model...
In many real-time systems, the workload can be charac-terized as a set of jobs with linear precedenc...
This paper studies the data locality of the work-stealing scheduling algorithm on hardware-controlle...
International audienceClassical list scheduling is a very popular and efficient technique for schedu...
Blumofe and Leiserson [6] gave the first provably good work-stealing work scheduler for mul-tithread...
Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines ...
Abstract- This paper presents a survey on Greedy Algorithm. This discussion is centered on overview ...
The paper presents a novel approach to compute tight upper bounds on the processor utilization indep...
International audienceWe study the impact of communication latency on the classical Work Stealing lo...
This paper investigates a variant of the work-stealing algorithm that we call the localized work-ste...
We revisit the well-known greedy algorithm for scheduling independent jobs on parallel processors, w...
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Com...
In this paper we study the performance of four mapping algorithms. The four algorithms include two n...
This paper studies the performance of parallel stream computations on a multiprocessor architecture ...
International audienceThis paper studies the performance of parallel stream computations on a multip...
In this paper we analyse a very simple dynamic work-stealing algorithm. In the work-generation model...
In many real-time systems, the workload can be charac-terized as a set of jobs with linear precedenc...
This paper studies the data locality of the work-stealing scheduling algorithm on hardware-controlle...
International audienceClassical list scheduling is a very popular and efficient technique for schedu...
Blumofe and Leiserson [6] gave the first provably good work-stealing work scheduler for mul-tithread...
Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines ...
Abstract- This paper presents a survey on Greedy Algorithm. This discussion is centered on overview ...
The paper presents a novel approach to compute tight upper bounds on the processor utilization indep...
DOI
Add to ORKG