Real-Time Java Platform Programming
Par :Formats :
Définitivement indisponible
Cet article ne peut plus être commandé sur notre site (ouvrage épuisé ou plus commercialisé). Il se peut néanmoins que l'éditeur imprime une nouvelle édition de cet ouvrage à l'avenir. Nous vous invitons donc à revenir périodiquement sur notre site.
- Nombre de pages332
- PrésentationBroché
- Poids0.675 kg
- Dimensions18,0 cm × 23,5 cm × 2,5 cm
- ISBN0-13-028261-8
- EAN9780130282613
- Date de parution30/04/2002
- ÉditeurPearson
Résumé
Written for experienced Java platform developers, this practical guide provides a solid grounding in real-time programming. Dibble, a member of the RTSJ expert group, starts with an overview of real-time issues unique to the Java platform. He then explains how to use each major feature of the RTSJ. From broad real-time principles to detailed programming pitfalls, Real-Time Java Platform Programming covers everything you need to know to build effective RT programs. Key topics include: Interoperability with non-RT code, tradeoffs in real-time development, and RT issues for the JVM software; Garbage collection, non-heap access, physical and "immortal" memory, and constant-time allocation of non-heap memory; Priority scheduling, deadline scheduling, and rate monotonic analysis; Closures, asynchronous transfer of control, asynchronous events, and timers.
Written for experienced Java platform developers, this practical guide provides a solid grounding in real-time programming. Dibble, a member of the RTSJ expert group, starts with an overview of real-time issues unique to the Java platform. He then explains how to use each major feature of the RTSJ. From broad real-time principles to detailed programming pitfalls, Real-Time Java Platform Programming covers everything you need to know to build effective RT programs. Key topics include: Interoperability with non-RT code, tradeoffs in real-time development, and RT issues for the JVM software; Garbage collection, non-heap access, physical and "immortal" memory, and constant-time allocation of non-heap memory; Priority scheduling, deadline scheduling, and rate monotonic analysis; Closures, asynchronous transfer of control, asynchronous events, and timers.