Jeremy P. Erickson

Learn More
Current hard real-time scheduling and analysis techniques are unable to efficiently utilize the computational bandwidth provided by multicore platforms. This is due to the large gap between worst-case execution time predictions used in schedulability analysis and actual execution times seen in practice. In this paper, we view this gap as " slack " that can(More)
In prior work on soft real-time (SRT) multiprocessor scheduling, tardiness bounds have been derived for a variety of scheduling algorithms, most notably, the global earliest-deadline-first (G-EDF) algorithm. In this paper, we devise G-EDF-like (GEL) schedulers, which have identical implementations to G-EDF and therefore the same overheads, but that provide(More)
Semi-partitioned real-time scheduling algorithms extend partitioned ones by allowing a (usually small) subset of tasks to migrate. The first such algorithm to be proposed was directed at soft real-time (SRT) sporadic task systems where bounded deadline tardiness is acceptable. That algorithm , called EDF-fm, has the desirable property that migrations are(More)
The Earliest Deadline First scheduling algorithm (EDF) is known to not be optimal under global scheduling on multiproces-sor platforms. Results have been obtained that bound the maximum tardiness – the amount of time by which deadlines may be missed – of any feasible system of implicit-deadline sporadic tasks scheduled using global EDF. However, it is known(More)
Under current analysis, tardiness bounds applicable to global earliest-deadline-first scheduling and related policies depend on per-task worst-case execution times. By splitting job budgets to create subjobs with shorter periods and worst-case execution times, such bounds can be reduced to near zero for implicit-deadline sporadic task systems. However,(More)
Dataflow software architectures are prevalent in prototypes of advanced automotive systems, for both driver-assisted and autonomous driving. Safety constraints of these systems necessitate real-time performance guarantees. Automotive prototypes often ensure such constraints through over-provisioning and dedicated hardware; however, a commercially viable(More)
The multicore revolution is having limited impact on safety-critical cyber-physical systems. The key reason is the " one out of m " problem: certifying the real-time correct-ness of a system running on m cores can necessitate pessimistic analysis that easily negates the processing capacity of the " additional " m − 1 cores. In safety-critical domains such(More)
Prior work has provided bounds on the deadline tardiness that a set of sporadic real-time tasks may incur when scheduled using the global earliest-deadline-first (G-EDF) scheduling algorithm. Under the sporadic task model, it is necessary that no individual task overutilize a single processor and that the set of all tasks does not overutilize the set of all(More)
The earliest-deadline-first (EDF) scheduling algorithm, while not optimal for globally-scheduled hard real-time systems, can support any feasible task system with bounded lateness. Furthermore, global-EDF-like (GEL) scheduling algorithms, which prioritize jobs by assigning them fixed priority points based on per-task relative priority points, have been(More)
Google Earth is a virtual globe that allows users to explore satellite imagery, terrain, 3D buildings, and geo-spatial content. It is available on a wide variety of desktop and mobile platforms, including Windows, Mac OS X, Linux, iOS, and Android. To preserve the sense of fluid motion through a 3D environment, the application must render at 60Hz. In this(More)