Encontrados 10 documentos, a visualizar página 1 de 1
A PTAS for assigning sporadic tasks on two-type heterogeneous multiprocessors
Raravi, Gurulingesh; Nélis, VincentConsider the problem of determining a task-toprocessor assignment for a given collection of implicit-deadline sporadic tasks upon a multiprocessor platform in which there are two distinct kinds of processors. We propose a polynomialtime approximation scheme (PTAS) for this problem. It offers the following guarantee: for a given task set and a given platform, if there exists a feasible task-to-processor assignme...
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...
Real-time scheduling with resource sharing on uniform multiprocessors
Raravi, Gurulingesh; Nélis, Vincent; Andersson, BjörnConsider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a uniform multiprocessor platform where each task may access at most one of ; R; shared resources and at most once by each job of that task. The resources have to be accessed in a mutually exclusive manner. We propose an algorithm, GIS-vpr, which offers the guarantee that if a task set is schedulable to meet d...
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...
Partitioned scheduling of multimode systems on multiprocessor platforms: when t...
Marinho, José; Raravi, Gurulingesh; Nélis, Vincent; Petters, Stefan M.Systems composed of distinct operational modes are a common necessity for embedded applications with strict timing requirements. With the emergence of multi-core platforms protocols to handle these systems are required in order to provide this basic functionality.In this work a description on the problems of creating an effective mode-transition protocol are presented and it is proven that in some cases previou...
Calculating an upper bound on the finishing time of a group of threads executin...
Raravi, Gurulingesh; Andersson, BjörnGraphics processor units (GPUs) today can be used for computations that go beyond graphics and such use can attain a performance that is orders of magnitude greater than a normal processor. The software executing on a graphics processor is composed of a set of (often thousands of) threads which operate on different parts of the data and thereby jointly compute a result which is delivered to another thread execu...
| Financiadores do RCAAP | |||||||
|
|
|
|
|
|
||