Encontrados 12 documentos, a visualizar página 1 de 2
Task assignment algorithms for two-type heterogeneous multiprocessors
Raravi, Gurulingesh; Andersson, Björn; Bletsas, Konstantinos; Nélis, VincentConsider the problem of assigning real-time tasks on a heterogeneous multiprocessor platform comprising two different types of processors — such a platform is referred to as two-type platform. We present two linearithmic timecomplexity algorithms, SA and SA-P, each providing the follow- ing guarantee. For a given two-type platform and a given task set, if there exists a feasible task-to-processor-type assignmen...
Makespan computation for GPU threads running on a single streaming multiprocessor
Berezovskyi, Kostiantyn; Bletsas, Konstantinos; Andersson, BjörnGraphics processors were originally developed for rendering graphics but have recently evolved towards being an architecture for general-purpose computations. They are also expected to become important parts of embedded systems hardware -- not just for graphics. However, this necessitates the development of appropriate timing analysis techniques which would be required because techniques developed for CPU sched...
Preemption-light multiprocessor scheduling of sporadic tasks with high utilisat...
Bletsas, Konstantinos; Andersson, BjörnKnown algorithms capable of scheduling implicit-deadline sporadic tasks over identical processors at up to 100% utilisation invariably involve numerous preemptions and migrations. To the challenge of devising a scheduling scheme with as few preemptions and migrations as possible, for a given guaranteed utilisation bound, we respond with the algorithm NPS-F. It is configurable with a parameter, trading off guara...
Provably good scheduling of sporadic tasks with resource sharing on a two-type ...
Raravi, Gurulingesh; Andersson, Björn; Bletsas, KonstantinosConsider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a two-type heterogeneous multiprocessor platform where a task may request at most one of ; R; shared resources. There are m1 processors of type-1 and m2 processors of type-2. Tasks may migrate only when requesting or releasing resources. We present a new algorithm, FF-3C-vpr, which offers a guarantee that if a...
A conjecture about provably good task assignment on heterogeneous multiprocesso...
Raravi, Gurulingesh; Andersson, Björn; Bletsas, KonstantinosConsider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a heterogeneous multiprocessor platform. We use an algorithm proposed in [1] (we refer to it as LP-EE) from state-of-the-art for assigning tasks to heterogeneous multiprocessor platform and (re-)prove its performance guarantee but for a stronger adversary.We conjecture that if a task set can be scheduled to mee...
Two-type heterogeneous multiprocessor scheduling: Is there a phase transition? ...
Raravi, Gurulingesh; Andersson, Björn; Bletsas, KonstantinosConsider the problem of non-migratively scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a two-type heterogeneous multiprocessor platform. We ask the following question: Does there exist a phase transition behavior for the two-type heterogeneous multiprocessor scheduling problem? We also provide some initial observations via simulations performed on randomly generated task sets.
Provably good task assignment on heterogeneous multiprocessor platforms for a r...
Raravi, Gurulingesh; Andersson, Björn; Bletsas, KonstantinosConsider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a heterogeneous multiprocessor platform. We consider a restricted case where the maximum utilization of any task on any processor in the system is no greater than one. We use an algorithm proposed in [1] (we refer to it as LP-EE) from state-of-the-art for assigning tasks to heterogeneous multiprocessor platform...
Intra-type migrative scheduling of implicit-deadline sporadic tasks on two- typ...
Raravi, Gurulingesh; Andersson, Björn; Bletsas, KonstantinosConsider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a two-type heterogeneous multiprocessor platform. Each processor is either of type-1 or type-2 with each task having different execution time on each processor type. Jobs can migrate between processors of same type (referred to as intra-type migration) but cannot migrate between processors of different types. W...
On the implementation of real-time slotbased task-splitting scheduling algorith...
Sousa, Paulo Baltarejo; Bletsas, Konstantinos; Tovar, Eduardo; Andersson, BjörnIn this paper we discuss challenges and design principles of an implementation of slot-based tasksplitting algorithms into the Linux 2.6.34 version. We show that this kernel version is provided with the required features for implementing such scheduling algorithms. We show that the real behavior of the scheduling algorithm is very close to the theoretical. We run and discuss experiments on 4-core and 24-core ma...
Practical aspects of slot-based task- splitting dispatching in its schedulabili...
Sousa, Paulo Baltarejo; Bletsas, Konstantinos; Andersson, Björn; Tovar, EduardoConsider the problem of scheduling a set of sporadic tasks on a multiprocessor system to meet deadlines using a tasksplitting scheduling algorithm. Task-splitting (also called semipartitioning) scheduling algorithms assign most tasks to just one processor but a few tasks are assigned to two or more processors, and they are dispatched in a way that ensures that a task never executes on two or more processors sim...
| Financiadores do RCAAP | |||||||
|
|
|
|
|
|
||