Encontrados 56 documentos, a visualizar página 1 de 6
Response time analysis of slotted WiDom in noisy wireless channels
Vahabi, Maryam; Tennina, Stefano; Tovar, Eduardo; Andersson, BjörnWiDom is a wireless prioritized medium access control protocol which offers very large number of priority levels. Hence, it brings the potential to employ non-preemptive static-priority scheduling and schedulability analysis for a wireless channel assuming that the overhead of WiDom is modeled properly. Recent research has created a new version of WiDom (we call it: Slotted WiDom) which offers lower overhead co...
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...
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...
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...
WCET analysis considering contention on memory bus in COTS-based multicores
Dasari, Dakshina; Nélis, Vincent; Andersson, BjörnThe usage of COTS-based multicores is becoming widespread in the field of embedded systems. Providing realtime guarantees at design-time is a pre-requisite to deploy real-time systems on these multicores. This necessitates the consideration of the impact of the contention due to shared low-level hardware resources on the Worst-Case Execution Time (WCET) of the tasks. As a step towards this aim, this paper first...
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...
| Financiadores do RCAAP | |||||||
|
|
|
|
|
|
||