Boeken: Vinden. Vergelijken. Kopen.

(*)

Akash Kumar#Henk Corporaal#Bart Mesman#Yajun Ha:
Multimedia Multiprocessor Systems - nieuw boek

2010, ISBN: 9789400700826

ID: 814481230

To achieve high performance in multimedia multiprocessor systems and keep costs and used resources low, the limited computational resources must be shared. The concurrent execution of applications on shared resources causes interference. Having an analysis technique can significantly reduce the development cost. Since applications are often added to the system at run-time (for example, a mobile-phone user may download a Java application at run-time), a complete analysis at design-time is also not feasible. Existing techniques are unable to handle this dynamism, and the only solution left to the designer is to over-dimension the hardware by a large factor leading to increased area, cost and power. In Multimedia Multiprocessor Systems, a run-time performance prediction methodology is presented that can predict the performance of multiple applications accurately and quickly. Synchronous data flow (SDF) graphs are used to model applications, since they fit well with characteristics of multimedia applications, and at the same time allow analysis of application performance. While a lot of techniques are available to analyze performance of single applications, for multiple applications this task is a lot harder and little work has been done in this direction. This book presents one of the first attempts to analyze performance of multiple applications executing on heterogeneous non-preemptive multiprocessor platforms. A novel probabilistic performance prediction (P3) algorithm is presented for predicting performance of multiple applications executing concurrently on multi-processor platforms. The algorithm predicts the time that tasks have to spend during the contention phase for a resource. Each application contains a number of tasks that have a worst-case execution time. Two approaches are presented -- basic and iterative probabilistic techniques. The basic P3 approach looks at all the possible combinations of actors blocking a particular actor. The iterative P3 approach computes how much a particular actor contributes to the waiting time of the other actors. Both techniques compute the expected waiting time when multiple tasks share a processing resource. These waiting time estimates, together with the execution time are used to estimate the performance of applications. The approach is very fast and can be used both at design-time and run-time owing to its low implementation complexity. In our experiments with both random and real-life applications, the deviation from measured performance is less than 10%. This book presents a run-time methodology that predicts the performance of multiple applications accurately and quickly, and which represents one of the first attempts to analyze the performance of such applications on heterogeneous multiprocessor platforms. Buch (fremdspr.) gebundene Ausgabe 23.09.2010 Bücher>Fremdsprachige Bücher>Englische Bücher, Springer, .201

(*)

Akash Kumar#Henk Corporaal#Bart Mesman#Yajun Ha:
Multimedia Multiprocessor Systems - nieuw boek

ISBN: 9789400700826

ID: 836462282

To achieve high performance in multimedia multiprocessor systems and keep costs and used resources low, the limited computational resources must be shared. The concurrent execution of applications on shared resources causes interference. Having an analysis technique can significantly reduce the development cost. Since applications are often added to the system at run-time (for example, a mobile-phone user may download a Java application at run-time), a complete analysis at design-time is also not feasible. Existing techniques are unable to handle this dynamism, and the only solution left to the designer is to over-dimension the hardware by a large factor leading to increased area, cost and power. In Multimedia Multiprocessor Systems, a run-time performance prediction methodology is presented that can predict the performance of multiple applications accurately and quickly. Synchronous data flow (SDF) graphs are used to model applications, since they fit well with characteristics of multimedia applications, and at the same time allow analysis of application performance. While a lot of techniques are available to analyze performance of single applications, for multiple applications this task is a lot harder and little work has been done in this direction. This book presents one of the first attempts to analyze performance of multiple applications executing on heterogeneous non-preemptive multiprocessor platforms. A novel probabilistic performance prediction (P3) algorithm is presented for predicting performance of multiple applications executing concurrently on multi-processor platforms. The algorithm predicts the time that tasks have to spend during the contention phase for a resource. Each application contains a number of tasks that have a worst-case execution time. Two approaches are presented -- basic and iterative probabilistic techniques. The basic P3 approach looks at all the possible combinations of actors blocking a particular actor. The iterative P3 approach computes how much a particular actor contributes to the waiting time of the other actors. Both techniques compute the expected waiting time when multiple tasks share a processing resource. These waiting time estimates, together with the execution time are used to estimate the performance of applications. The approach is very fast and can be used both at design-time and run-time owing to its low implementation complexity. In our experiments with both random and real-life applications, the deviation from measured performance is less than 10%. This book presents a run-time methodology that predicts the performance of multiple applications accurately and quickly, and which represents one of the first attempts to analyze the performance of such applications on heterogeneous multiprocessor platforms. Buch (fremdspr.) Bücher>Fremdsprachige Bücher>Englische Bücher, Springer

(*)

Akash Kumar:
Multimedia Multiprocessor Systems - nieuw boek

1, ISBN: 9789400700826

[ED: Buch], [PU: Springer-Verlag GmbH], Neuware - To achieve high performance in multimedia multiprocessor systems and keep costs and used resources low, the limited computational resources must be shared. The concurrent execution of applications on shared resources causes interference. Having an analysis technique can significantly reduce the development cost. Since applications are often added to the system at run-time (for example, a mobile-phone user may download a Java application at run-time), a complete analysis at design-time is also not feasible. Existing techniques are unable to handle this dynamism, and the only solution left to the designer is to over-dimension the hardware by a large factor leading to increased area, cost and power. In Multimedia Multiprocessor Systems, a run-time performance prediction methodology is presented that can predict the performance of multiple applications accurately and quickly. Synchronous data flow (SDF) graphs are used to model applications, since they fit well with characteristics of multimedia applications, and at the same time allow analysis of application performance. While a lot of techniques are available to analyze performance of single applications, for multiple applications this task is a lot harder and little work has been done in this direction. This book presents one of the first attempts to analyze performance of multiple applications executing on heterogeneous non-preemptive multiprocessor platforms. A novel probabilistic performance prediction (P3) algorithm is presented for predicting performance of multiple applications executing concurrently on multi-processor platforms. The algorithm predicts the time that tasks have to spend during the contention phase for a resource. Each application contains a number of tasks that have a worst-case execution time. Two approaches are presented -- basic and iterative probabilistic techniques. The basic P3 approach looks at all the possible combinations of actors blocking a particular actor. The iterative P3 approach computes how much a particular actor contributes to the waiting time of the other actors. Both techniques compute the expected waiting time when multiple tasks share a processing resource. These waiting time estimates, together with the execution time are used to estimate the performance of applications. The approach is very fast and can be used both at design-time and run-time owing to its low implementation complexity. In our experiments with both random and real-life applications, the deviation from measured performance is less than 10%., DE, [SC: 0.00], Neuware, gewerbliches Angebot, 245x164x20 mm, 163, [GW: 395g], offene Rechnung (Vorkasse vorbehalten), PayPal, Kreditkarte, Banküberweisung, Internationaler Versand

(*)

Akash Kumar:
Multimedia Multiprocessor Systems - nieuw boek

1, ISBN: 9789400700826

[ED: Buch], [PU: Springer-Verlag GmbH], Neuware - To achieve high performance in multimedia multiprocessor systems and keep costs and used resources low, the limited computational resources must be shared. The concurrent execution of applications on shared resources causes interference. Having an analysis technique can significantly reduce the development cost. Since applications are often added to the system at run-time (for example, a mobile-phone user may download a Java application at run-time), a complete analysis at design-time is also not feasible. Existing techniques are unable to handle this dynamism, and the only solution left to the designer is to over-dimension the hardware by a large factor leading to increased area, cost and power. In Multimedia Multiprocessor Systems, a run-time performance prediction methodology is presented that can predict the performance of multiple applications accurately and quickly. Synchronous data flow (SDF) graphs are used to model applications, since they fit well with characteristics of multimedia applications, and at the same time allow analysis of application performance. While a lot of techniques are available to analyze performance of single applications, for multiple applications this task is a lot harder and little work has been done in this direction. This book presents one of the first attempts to analyze performance of multiple applications executing on heterogeneous non-preemptive multiprocessor platforms. A novel probabilistic performance prediction (P3) algorithm is presented for predicting performance of multiple applications executing concurrently on multi-processor platforms. The algorithm predicts the time that tasks have to spend during the contention phase for a resource. Each application contains a number of tasks that have a worst-case execution time. Two approaches are presented -- basic and iterative probabilistic techniques. The basic P3 approach looks at all the possible combinations of actors blocking a particular actor. The iterative P3 approach computes how much a particular actor contributes to the waiting time of the other actors. Both techniques compute the expected waiting time when multiple tasks share a processing resource. These waiting time estimates, together with the execution time are used to estimate the performance of applications. The approach is very fast and can be used both at design-time and run-time owing to its low implementation complexity. In our experiments with both random and real-life applications, the deviation from measured performance is less than 10%., DE, [SC: 0.00], Neuware, gewerbliches Angebot, 245x164x20 mm, 163, [GW: 395g], offene Rechnung (Vorkasse vorbehalten), PayPal, Kreditkarte, Banküberweisung, International shipping

(*)

Akash Kumar:
Multimedia Multiprocessor Systems - nieuw boek

1, ISBN: 9789400700826

[ED: Buch], [PU: Springer-Verlag GmbH], Neuware - Modern multimedia systems are becoming increasingly multiprocessor and heterogeneous to match the high performance and low power demands placed on them by the large number of applications. The concurrent execution of these applications causes interference and unpredictability in the performance of these systems. In Multimedia Multiprocessor Systems, an analysis mechanism is presented to accurately predict the performance of multiple applications executing concurrently. With high consumer demand the time-to-market has become significantly lower. To cope with the complexity in designing such systems, an automated design-flow is needed that can generate systems from a high-level architectural description such that they are not error-prone and consume less time. Such a design methodology is presented for multiple use-cases -- combinations of active applications. A resource manager is also presented to manage the various resources in the system, and to achieve the goals of performance prediction, admission control and budget enforcement., DE, [SC: 0.00], Neuware, gewerbliches Angebot, FixedPrice, 163, [GW: 395g], offene Rechnung (Vorkasse vorbehalten), PayPal, Banküberweisung