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 defined 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 a wide combination of parameters and its effectiveness is compared against existing solutions.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
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 defined 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 a wide combination of parameters and its effectiveness is compared against existing solutions.
Angela Italiano has carried out her first university studies in "Computer Science" at the University of Pisa.After an internship at CapGemini S.p.A. se has pursued her studies at the "Scuola Superiore Sant'Anna" and University of Pisawith a master degree in "Computer Science and Networking".Se is currently working as researcher at the CNR of Pisa.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
EUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délaisVendeur : moluna, Greven, Allemagne
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Italiano AngelaAngela Italiano has carried out her first university studies in Computer Science at the University of Pisa.After an internship at CapGemini S.p.A. se has pursued her studies at the Scuola Superiore Sant Anna and Un. N° de réf. du vendeur 5001164
Quantité disponible : Plus de 20 disponibles
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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 a wide combination of parameters and its e ectiveness is compared against existing solutions. N° de réf. du vendeur 9783639814262
Quantité disponible : 1 disponible(s)
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 a wide combination of parameters and its e ectiveness is compared against existing solutions. 100 pp. Italienisch. N° de réf. du vendeur 9783639814262
Quantité disponible : 2 disponible(s)
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Taschenbuch. Etat : Neu. Neuware -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 a wide combination of parameters and its e¿ectiveness is compared against existing solutions.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 100 pp. Italienisch. N° de réf. du vendeur 9783639814262
Quantité disponible : 2 disponible(s)
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Paperback. Etat : Brand New. 100 pages. Italian language. 8.66x5.91x0.23 inches. In Stock. N° de réf. du vendeur __3639814266
Quantité disponible : 1 disponible(s)
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Paperback. Etat : Brand New. 100 pages. Italian language. 8.66x5.91x0.23 inches. In Stock. N° de réf. du vendeur 3639814266
Quantité disponible : 1 disponible(s)