In-Memory Computing (eBook, PDF)
Synthesis and Optimization
Versandkostenfrei!
Sofort per Download lieferbar
73,95 €
inkl. MwSt.
Weitere Ausgaben:
PAYBACK Punkte
37 °P sammeln!
This book describes a comprehensive approach for synthesis and optimization of logic-in-memory computing hardware and architectures using memristive devices, which creates a firm foundation for practical applications. Readers will get familiar with a new generation of computer architectures that potentially can perform faster, as the necessity for communication between the processor and memory is surpassed. The discussion includes various synthesis methodologies and optimization algorithms targeting implementation cost metrics including latency and area overhead as well as the reliability issu...
This book describes a comprehensive approach for synthesis and optimization of logic-in-memory computing hardware and architectures using memristive devices, which creates a firm foundation for practical applications. Readers will get familiar with a new generation of computer architectures that potentially can perform faster, as the necessity for communication between the processor and memory is surpassed. The discussion includes various synthesis methodologies and optimization algorithms targeting implementation cost metrics including latency and area overhead as well as the reliability issue caused by short memory lifetime.
- Presents a comprehensive synthesis flow for the emerging field of logic-in-memory computing;
- Describes automated compilation of programmable logic-in-memory computer architectures;
- Includes several effective optimization algorithm also applicable to classical logic synthesis;
- Investigates unbalanced write traffic in logic-in-memory architectures and describes wear leveling approaches to alleviate it.
Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.
Andere Kunden interessierten sich für
