Learn More
Multi-core processors offer a significant performance increase over single-core processors. They have the potential to enable computation-intensive real-time applications with stringent timing constraints that cannot be met on traditional single-core processors. However, most results in traditional multiprocessor real-time scheduling are limited to(More)
Multicore processors are becoming ubiquitous, and it is becoming increasingly common to run multiple real-time systems on a shared multicore platform. While this trend helps to reduce cost and to increase performance, it also makes it more challenging to achieve timing guarantees and functional isolation. One approach to achieving functional isolation is to(More)
—Due to their potential to deliver increased performance over single-core processors, multi-core processors have become mainstream in processor design. Computation-intensive real-time systems must exploit intra-task parallelism to take full advantage of multi-core processing. However, existing results in real-time scheduling of parallel tasks focus on(More)
We present a novel federated scheduling approach for parallel real-time tasks under a general directed acyclic graph (DAG) model. We provide a capacity augmentation bound of 2 for hard real-time scheduling; here we use the worst-case execution time and critical-path length of tasks to determine schedulability. This is the best known capacity augmentation(More)
Assuring end-to-end timeliness properties in a distributed real-time system poses a variety of challenges at each, of several, levels of abstraction. The challenges vary with levels of abstraction that correspond generally to levels of architectural scale. In particular, there are key differences in the design forces for resource scheduling (1) within the(More)
As multicore processors become ever more prevalent, it is important for real-time programs to take advantage of intra-task parallelism in order to support computation-intensive applications with tight deadlines. In this paper, we consider the global earliest deadline first (GEDF) scheduling policy for task sets consisting of parallel tasks. Each task can be(More)
Mission-critical Distributed Real-Time and Embedded (DRE) systems pose significant resource management challenges at and across all architectural levels, i.e., the operating system and low-level middleware on each endsystem, and distributed services spanning multiple endsystems. Furthermore, the challenges posed by one application may differ from the(More)
In workflow-based collaboration systems, an allocation protocol assigns responsibility for each task in the workflow to a specific host. In wired networks, due to stable connectivity of all components, the decisions reached by the allocation algorithms do not affect future coordination among hosts. However, in wireless networks, where connec-tivity windows(More)