Utilization Bounds for EDF Scheduling on Real-Time Multiprocessor Systems

López, José M.; Díaz, José Luis Gahete; García, Daniel

doi:10.1023/b:time.0000033378.56741.14

Cited by 140 publications

(75 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The partitioned scheduling of traditional task sets has been explored in several works, including those by Lopez et al (2003Lopez et al ( , 2004. A majority of early efforts in the multiprocessor scheduling of traditional task sets were in fact focused on partitioned scheduling.…”

Section: Related Workmentioning

confidence: 99%

“…Multiprocessor scheduling algorithms are generally classified as partitioned or global scheduling algorithms. In partitioned scheduling approaches, each task is allocated to a single processor, and the scheduling problem becomes one of task allocation followed by the uniprocessor scheduling of the subset of tasks allocated to each processor (Lopez et al, 2003(Lopez et al, , 2004. In fact, an important advantage of partitioned approaches is the applicability of the rich body of results for uniprocessor scheduling after the partitioning phase.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Fixed-priority global scheduling for mixed-criticality real-time systems

Kelly¹,

Aydın²

2014

IJES

View full text Add to dashboard Cite

There has been a growing interest in recent years in mixed-criticality real-time systems in which tasks are attributed different levels of criticality based on the degree to which their deadlines must be assured. While most of the initial efforts on mixed-criticality systems targeted single-processor systems, the research community has recently started to investigate multiprocessor mixed-criticality real-time systems. In this paper we investigate how global, fixed-priority algorithms can be applied in the context of multiprocessor mixed-criticality systems. We identify the two key dimensions of the problem -priority assignment and schedulability testing, and consider candidate algorithms for each dimension. We also propose a new and simple priority assignment policy called CPRatio that considers both task criticality and timing constraints to improve the schedulability of mixed-criticality task sets. We experimentally evaluate the performance of priority assignment strategies and schedulability tests in the global multiprocessor mixed-criticality scheduling context. Keywords: mixed-criticality; real-time scheduling; global scheduling; fixed-priority scheduling; multiprocessor scheduling; schedulability tests.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Fixed-priority global scheduling for mixed-criticality real-time systems

Kelly¹,

Aydın²

2014

IJES

View full text Add to dashboard Cite

show abstract

“…presented an implementation of SRP for partitioned EDF. However, this study required that tasks sharing resources be assigned to the same processor [38].…”

Section: Synchronizationmentioning

confidence: 99%

Synchronization in Embedded Real-Time Operating Systems

2014

IJAERD

View full text Add to dashboard Cite

-Real-time multiprocessor systems are now commonplace. Manufacturers of traditionally uniprocessor embedded systems are also shifting towards multi-processor or multi-core platforms to obtain high computing performance. Embedded systems are the computing devices hidden inside a vast array of everyday products and appliances such as cell phones, toys, handheld PDAs, cameras, etc. An embedded system is various type of computer system or computing device that performs a dedicated function and/or is designed for use with a specific embedded software application. The Real Time Operating System (RTOS) supports applications that meet deadlines in addition to providing logically correct results. In this paper, we will discuss the study and analysis of the scheduling and synchronization. It also presents a system that can be schedule multiple tasks using global EDF scheduler and share the resource among tasks using preemptive synchronization algorithm. The main objective is to share resource among task sets and reduce the average waiting time and jitter for task. It considers global dynamic-priority preemptive multiprocessor scheduling of constrained-deadline periodic tasks that share resources in a non-nested manner. In the addition, a resourcesharing protocol (i.e. priority inheritance protocol) has been discussed to decrease the blocking overhead of tasks, which reduces the total utilization and has the potential to reduce the number of required processors.

show abstract

“…Bin-packing heuristics such as First-Fit (FF), Worst-Fit (WF)). López et al derived in [16] the worst-case utilization bounds for a task set Γ to be schedulable using PEDF. These bounds serve as a simple sufficient schedulability test.…”

Section: Scheduling Asynchronous Set Of Implicit Deadline Periodic Tasksmentioning

confidence: 99%

Hard-real-time scheduling of data-dependent tasks in embedded streaming applications

Bamakhrama

Stefanov

2011

Proceedings of the Ninth ACM International Conference on Embedded Software

View full text Add to dashboard Cite

Most of the hard-real-time scheduling theory for multiprocessor systems assumes independent periodic or sporadic tasks. Such a simple task model is not directly applicable to modern embedded streaming applications. This is because a modern streaming application is typically modeled as a directed graph where nodes represent actors (i.e. tasks) and edges represent data-dependencies. The actors in such graphs have data-dependency constraints and do not necessarily conform to the periodic or sporadic task models. Therefore, in this paper we investigate the applicability of hardreal-time scheduling theory for periodic tasks to streaming applications modeled as acyclic Cyclo-Static Dataflow (CSDF) graphs. In such graphs, the actors are data-dependent, however, we analytically prove that they (i.e. the actors) can be scheduled as implicitdeadline periodic tasks. As a result, a variety of hard-real-time scheduling algorithms for periodic tasks can be applied to schedule such applications with a certain guaranteed throughput. We compare the throughput resulting from such scheduling approach to the maximum achievable throughput of an application for a set of 19 real streaming applications. We find that in more than 80% of the cases, the throughput resulting from our approach is equal to the maximum achievable throughput.

show abstract

Utilization Bounds for EDF Scheduling on Real-Time Multiprocessor Systems

Cited by 140 publications

References 16 publications

Fixed-priority global scheduling for mixed-criticality real-time systems

Fixed-priority global scheduling for mixed-criticality real-time systems

Synchronization in Embedded Real-Time Operating Systems

Hard-real-time scheduling of data-dependent tasks in embedded streaming applications

Contact Info

Product

Resources

About