Real-Time Java Platform Programming
Peter C. Dibble

ISBN-10: 0130282618
ISBN-13: 9780130282613

Publisher: Prentice Hall
Copyright: 2002
Format: Paper; 352 pp
Status: Out of Print

Suggested retail price: $49.99
This item is out of print and is no longer available for purchase.

This is an advanced Java programming book, which focuses on how to implement Java in systems that require real-time response, i.e., systems that require precisely measured time, consistency and utility. Written by one of RTSJ's creators, it offers a practical introduction to real-time programming for every Java developer.

Build powerful real-time Java™TM platform aplications!

  • The complete reference to the Real Time Specification for Java (RTSJ) for every Java developer who wants to master real-time programming.
  • Covers practical real-time development considerations, scheduling theory, garbage collection, rate monotonic analysis, and other key issues.
  • Closures, thread.interrupt, asynchronous events, timers, CT, physical and "immortal" memory, program structure, distributed RT applications, exceptions, and more.



Preface.


Introduction.


1. Landscape.

Java Technology and Real Time. Real-Time Programming Requirements. Java and Embedded Real Time. Definition of Real Time. Precision of Measurement. Consistency. Utility Function Curve. Java's Problem Domain. Real-Time Java's Problem Domain. Summary.



2. Architecture of the Java Virtual Machine.

Write Once, Run Anywhere: Maybe. JVM Components. Class Loading. Bytecode Interpreter. Security Manager. Garbage Collector. Thread Management. Input/Output. Graphics. Interpreter Implementation. Standard Interpreter. Optimized Interpreter. JIT. Snippets. Compilation to Independent Process. Native Methods. Compilation to a Native Method. Compilation to the JIT Interface.



3. Hardware Architecture.

Worst-Case Execution of One Instruction. Worst-Case Scenario. Practical Measures. Management of Troublesome Hardware. Managing Demand Paging. Managing DMA. Managing Cache. Managing Address Translation Cache. Managing Interrupts. Effects on the JVM.



4. Garbage Collection.

Reference Counting. Basic Garbage Collection. Mark and Sweep. Defragmentation. Copying Collectors. Incremental Collection. Incremental Garbage Collection in Practice. Generational Garbage Collection. Intergenerational References. Large Object Store. Real-Time Issues.



5. Priority Scheduling.

Scheduling Terms. Execution Sequences. Preemption. The Seductive Charm of Nonpreemptive Scheduling. Fixed versus Dynamic Priority. Priority Inversion. Why 32 Priorities? Problems with Priority Scheduling.



6. Scheduling with Deadlines.

Underlying Mechanism. Scope of the Scheduler. Some Systems. Earliest Deadline First (EDF). Least Laxity. Periodic Scheduling. Aperiodic Servers. Handling Overload. Timing Is Usually Probabilistic.



7. Rate Monotonic Analysis.

Theorems. Liu and Layland's Theorem. A Graphical Approach. Lehoczky, Sha, and Ding's Theorem. Restrictions. Independent Tasks. Deadlines Equal to Periods. Multiprocessor Systems.



8. Introduction to the Real-Time Java Platform.

A Brief History of Real-Time Java. Major Features of the Specification. Threads and Scheduling. Garbage Collection. Asynchronous Event Handlers. Asynchronous Transfer of Control. Memory Allocation. Memory Access. Implementation. RTSJ Hello World.



9. Closures.

The Language Construct. Java Closures. Closure Structure. Closures in the RTSJ. Limitations of Closures. Readability. Local Variables. Constructors. Nesting.



10. High-Resolution Time.

Resolution. The “clock”. HighResolutionTime Base Class. Absolute Time. Relative Time. Rational Time.



11. Async Events.

Binding a Happening to an Event. Basic Async Event Operation. Async Events without Happenings. Time Triggering. Fault Triggering. Software Event Triggering. Implementation Discussion.



12. Real-Time Threads.

Creation. Scheduling. Inversion Handling. Fixed Priority. Feasibility. Periodic Threads without Handlers. Feasibility Analysis. Periodic Threads with Handlers. Interactions with Normal Threads. Changing the Scheduler.



13. Non-Heap Memory.

The Advantage of Non-Heap Memory. The Allocation Regimes. Rules. Mechanisms for Allocating Immortal Memory. Mechanisms for Allocating from Scoped Memory. Allocation Time. Creating Scoped Memory. Allocation Mechanisms. Finalizers. Using Nested Scoped Memory. The Scope Stack (Tree). The DAG. Practical Use of Nested Scopes. Every Nested Scope Involves Two Memory Areas. Pitfalls. Using executeInArea. Using Standard Classes. Using Shared Scoped Memory. The Scope Stack Revisited. Scope Portals. Fine Print. Quick Examples.



14. Non-Heap Access.

Interaction with Scheduler. Rules. Samples. Final Remarks. Notes.



15. More Async Events.

Async Events and the Scheduler. The createReleaseParameters Method. Bound Async Event Handlers. Async Event Handlers and Non-Heap Memory. No-Heap Event Handlers vs. No-Heap Threads. Scheduling. Minimum Interarrival Time. Async Event Handlers and Threads. Special Async Events.



16. Reusing Immortal Memory.

Using Fixed-Object Allocators. Carrier Objects. Limitations. Recycling RT Threads. Recycling Async Event Handlers.



17. Asynchronous Transfer of Control.

Thread Interrupt in Context. Asynchronous Interrupt Firing. The Timed Class. The interrupt Method. The fire Method. In Summary. Replacement Rules. Rules for Async Exception Propagation. Oblivious catch. Nonmatching doInterruptible. Matching doInterruptible. Internals. Application Handling for Asynchronous Interrupts. Noninterruptible Code. Special Issues for Synchronized blocks. Legacy Code. Use of ATC for Thread Termination.



18. Physical Memory.

Physical and Virtual Memory. Physical Memory Manager. Memory Type. Removable Memory. Immortal Physical Memory. Scoped Physical Memory.



19. Raw Memory Access.

Security. Peek and Poke. Get/Set Methods. Mapping. The RawMemoryFloatAccess Class.



20. Synchronization without Locking.

Principles of Wait-Free Queues. Constructors. Common Methods. The Wait-Free Write Queue. Methods. Sharing the Wait-Free Queue. The Wait-Free Read Queue. The Extra Constructor. Methods. The Wait-Free Double-Ended Queue. Methods. No-Wait Queues and Memory. Implementation Notes.



21. Recommended Practice.

Powerful and Easy-to-Use Features of the RTSJ. Real-Time Threads. Periodic Threads. Asynchronous Event Handlers. High-Resolution Time. Happenings. Very Powerful and Dangerous Features of the RTSJ. Simple. Leaky. Viral. Very Powerful and Finicky Features of the RTSJ. Scoped Memory. No-Heap Asynchronous Event Handlers. No-Heap Real-Time Threads. Asynchronously Interrupted Exceptions. Selection of Priorities.



Index.

PETER DIBBLE, a member of the team that created the Real-Time Specification for the Java platform, was also on the Microware Systems Corporation team that first ported the Sun Java platform to an embedded system and produced the first version of Personal Java technology for a commercial RTOS. He has over a decade's experience with real-time system software and is author of OS-9 Insights and The Complete Guide to OS-9.

Build powerful real-time Java platform applications.

  • The authoritative reference to the Real-Time Specification for Java (RTSJ)—by one of its creators
  • Complete introduction to Java-based RT development—no real-time experience necessary
  • Covers scheduling, asynchronous transfer control, timers, non-heap memory, garbage collection, performance tradeoffs, program structure, and more

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 JVMtm 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

State-of-the-art information for RT developers:

  • Threads scheduling
  • Real-time scheduling
  • Raw memory access
  • Performance tradeoffs
  • Recommended practices
  • Implementation hints
  • Dozens of code examples and step-by-step walk-throughs

View a Sample Chapter PDF: /samplechapter/0130282618.pdf

Pearson Higher Education offers special pricing when you choose to package your text with other student resources. If you're interested in creating a cost-saving package for your students, contact your Pearson Higher Education representative for pricing and ordering information.

Pearson Higher Education offers special pricing when you choose to package your text with other student resources. If you're interested in creating a cost-saving package for your students contact your Pearson Higher Education representative.


Copyright ©2008 Pearson Education. All rights reserved. Legal Notice | Privacy Policy | Permissions