Andere Kunden interessierten sich auch für
![Task Scheduling for Multi-core and Parallel Architectures]( "Task Scheduling for Multi-core and Parallel Architectures")
Task Scheduling for Multi-core and Parallel Architectures66,99 €![Efficient Algorithms for the Multicore and Heterogeneous Architecture]( "Efficient Algorithms for the Multicore and Heterogeneous Architecture")
Efficient Algorithms for the Multicore and Heterogeneous Architecture36,99 €![Text Analysis Pipelines]( "Text Analysis Pipelines")
Text Analysis Pipelines37,99 €![CI/CD Pipeline Using Jenkins Unleashed]( "CI/CD Pipeline Using Jenkins Unleashed")
CI/CD Pipeline Using Jenkins Unleashed41,99 €![Real-Time Concepts for Embedded Systems]( "Real-Time Concepts for Embedded Systems")
Real-Time Concepts for Embedded Systems83,99 €![Self Aware Security for Real Time Task Schedules in Reconfigurable Hardware Platforms]( "Self Aware Security for Real Time Task Schedules in Reconfigurable Hardware Platforms")
Self Aware Security for Real Time Task Schedules in Reconfigurable Hardware Platforms103,99 €![Self Aware Security for Real Time Task Schedules in Reconfigurable Hardware Platforms]( "Self Aware Security for Real Time Task Schedules in Reconfigurable Hardware Platforms")
Self Aware Security for Real Time Task Schedules in Reconfigurable Hardware Platforms74,99 €
An important class of real-time multimedia streaming applications can be modeled as pipelines of tasks to be executed on multi processors systems. Each pipeline is periodically activated and each instance has to be completed before a given end-to-end deadline. A general problem is to allocate multiple real-time task pipelines on multi-core systems, guaranteeing their schedu- lability and optimizing a user de ned objective (e.g. minimum number of processors, minimum energy consumption, etc.). The objective of this paper is to analyze the problem from a mathematical point of view, and to design an algorithm to explore the space of possible solutions. The research activity builds upon a previous investigation about the assignment scheduling parameters of the tasks. In this thesis, we propose a grouping strategy that tries to minimize the number of processors required to schedule a sets of pipelines, and hence the overall resource utilization. The proposed algorithm is evaluated on awide combination of parameters and its e ectiveness is compared against existing solutions.