詳細書目資料

2
0
0
0
0

Invasive computing for mapping parallel programs to many-core architectures

  • 作者: Weichslgartner, Andreas, author.
  • 其他作者:
  • 其他題名:
    • Computer architecture and design methodologies.
  • 出版: Singapore : Springer Singapore :Imprint: Springer
  • 叢書名: Computer architecture and design methodologies,
  • 主題: Parallel programming (Computer science) , Computer architecture. , Parallel processing (Electronic computers) , Engineering. , Circuits and Systems. , Processor Architectures. , Electronic Circuits and Devices.
  • ISBN: 9789811073564 (electronic bk.) 、 9789811073557 (paper)
  • FIND@SFXID: CGU
  • 資料類型: 電子書
  • 內容註: Introduction -- Invasive Computing -- Fundamentals -- Self-Embedding -- Hybrid Application Mapping -- Hybrid Mapping for Increased Security -- Conclusions and Future Work.
  • 摘要註: This book provides an overview of and essential insights on invasive computing. Pursuing a comprehensive approach, it addresses proper concepts, invasive language constructs, and the principles of invasive hardware. The main focus is on the important topic of how to map task-parallel applications to future multi-core architectures including 1,000 or more processor units. A special focus today is the question of how applications can be mapped onto such architectures while not only taking into account functional correctness, but also non-functional execution properties such as execution times and security properties. The book provides extensive experimental evaluations, investigating the benefits of applying invasive computing and hybrid application mapping to give guarantees on non-functional properties such as timing, energy, and security. The techniques in this book are presented in a step-by-step manner, supported by examples and figures. All proposed ideas for providing guarantees on performance, energy consumption, and security are enabled by using the concept of invasive computing and the exclusive usage of resources.
  • 讀者標籤:
  • 引用連結:
  • Share:
  • 系統號: 005421364 | 機讀編目格式
  • 館藏資訊

    回到最上