Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 37 for “"Schedulability"”.
-
Schedulability analysis of resource access control protocols in real-time systems
To guarantee the timing requirements of real-time systems are satisfied, the timing behavior of the systems must be predictable. Priority driven scheduling algorithms, such as the earliest deadline first algorithm, are known to be effective and predictable in scheduling independent tasks. However, …
-
Schedulability analysis and automated implementation of real-time object-oriented design models
… a feasible implementation model using a built-in schedulability analysis tool. The synthesis process is supported by automatic code generation that can take the application design model and the synthesized implementation model and generate code for the target platform. In this thesis, I have …
-
Delay composition theory: A reduction-based schedulability theory for distributed real-time systems
… for studying the worst-case end-to-end delay and schedulability of real-time jobs in distributed systems. The main result is a simple delay composition rule, that computes a worst-case bound on the end-to-end delay of a job, given the computation times of all other jobs that execute concurrently …
-
The Design, Analysis, & Application Of Multi-Modal Real-Time Embedded Systems
… modes and application-level modes. Existing schedulability analysis for a real-time multi-modal system (MMS) with software/hardware modes are computationally intractable. In addition, a fast schedulability analysis is desirable in a design-space exploration that determines the "best" …
-
Real-Time Software Transactional Memory: Contention Managers, Time Bounds, and Implementations
… times under the contention managers through schedulability analysis. Since ECM and RCM preserve the semantics of the underlying real-time scheduler, their maximum transactional retry cost is double the maximum atomic section length. This is improved in the design of LCM, which achieves …
-
Priority Assignment Algorithms for Real-Time Systems
… various design metrics in addition to the system schedulability when we assign priorities to tasks. There has been a rich set of research studies on the priority assignment algorithms. However, there exist several limitations in the state-of-the-art: 1) the current research focuses on improving …
-
Scalability in Real-Time Systems
… important, yet unsolved) problem--the end-to-end schedulability problem. The thesis reports a solution to the end-to-end schedulability problem which is based on a solution to another fundamental problem relevant to single-component real-time systems (a uniprocessor system is a special instance of …
-
Design Optimization Techniques for Time-Critical Cyber-Physical Systems
… CPS (e.g., system models and their timing and schedulability analysis). As CPS is becoming increasingly complex, there is an urgent need for efficient optimization techniques that can aid the design of large-scale systems. Specifically, techniques that can find good design options in a …
-
Real-Time Embedded Software Modeling and Synthesis using Polychronous Data Flow Languages
… technique of Prelude and expand upon current schedulability analysis techniques for multi-periodic real-time systems.
-
An Integrated Real-Time and Security Scheduling Framework for CPS
… and an accompanying scheduling framework, where schedulability can be used to indicate whether both real-time and security requirements are met. Our algorithm is designed to be flexible, allowing different security mechanisms to be used along with real-time tasks. Specifically, we augment the …
-
Global EDF Scheduling for Parallel Real-Time Tasks
… augmentation bound acts as a linear-time schedulability test since it guarantees that any task set with total utilization of at most m/(4-2/m) where each task's critical-path length is at most 1/(4-2/m) of its deadline is schedulable on m cores under GEDF. In addition, we present a …
-
A Distributed Open Environment for Real-Time Applications
"Traditional approaches to real-time schedulability analysis tend to require detailed timing attributes and resource usages of all applications that may run concurrently in the system. Reconfiguring such a system is expensive and often done offline. This fact has motivated the design of open system …
-
The delay composition theorem on pipeline systems with non-preemptive priority varying scheduling algorithms
… the number of tasks running on the system. The schedulability analysis based on delay composition theorem performs better than traditional analysis techniques. In this paper we break one assumption that has been hold by previous works on delay composition theorem, namely each task has the same …
-
Reducing the cost of real-time software through a cyclic task abstraction for Ada
… Boards, impedes the timing analysis of tasks and schedulability analysis of systems. Consequently, Ada and its environments do not reach their potential of producing low-cost, reliable and maintainable real-time systems. This thesis unlocks this latent potential through the development of the …
-
Reducing the cost of real-time software through a cyclic task abstraction for Ada
… Boards, impedes the timing analysis of tasks and schedulability analysis of systems. Consequently, Ada and its environments do not reach their potential of producing low-cost, reliable and maintainable real-time systems. This thesis unlocks this latent potential through the development of the …
-
An energy-efficient periodic resource model for cyber-physical systems By Suzanne Elashri
… be met for the applications to run properly. The schedulability of workloads can be analyzed by determining the supply and demand bound functions (sbf & dbf) when the minimum resource availability (sbf) can satisfy the maximum possible resource demand (dbf) of the workload under a specific …
-
MCFlow: Middleware for Mixed-Criticality Distributed Real-Time Systems
… has been no quantitative comparison of system schedulability or run-time overhead for the different approaches. In this dissertation, we present what is to our knowledge the first side-by-side implementation and evaluation of those approaches, for periodic and sporadic mixed-criticality tasks …
-
Dynamic resource provisioning for data center workloads with data constraints
… resources to serve the workload by analyzing the schedulability utilization bound; 2) avoiding transition penalties during cluster resizing operations by deliberately design data distribution policies. We apply this framework to both storage and computing subsystems, where the former includes …
-
End-to-end scheduling to meet deadlines in distributed systems
… consist of periodic tasks and to analyze their schedulability. We generalize this technique and describe how it can be used to schedule distributed systems that can not be modeled by flow shops. We then describe how to combine local or global resource access protocols and end-to-end scheduling. …
-
New data structures, models, and algorithms for real-time resource management
… i.e., the TIT* tree, the average costs of the schedulability tests in a wide variety of real-time systems can be reduced. With the Testing Interval Tree for Vacancy analysis (TIT-V), the complexities of the schedulability tests in a class of parallel/distributed real-time systems can be …
Page 1 of 2