Die Programmiersprache Java hat sich in den letzten Jahren als ein leistungsfähiges Werkzeug für WWW-orientierte Anwendungen durchgesetzt. Mit den EJB’s und dem J2EE-Standard bemüht man sich, einen objektorientierten Ansatz auch für die Geschäftslogik einzusetzen. Von dem Ziel, existierende Geschäftslogik durch neue EJB-Implementierungen zu ersetzen, sind wir jedoch noch weit entfernt. Dies gilt besonders für die größeren Unternehmen, die in der Regel z/OS mit IMS, CICS, VSAM, DB2, Oracle und Adabas auf ihrem zentralen Server einsetzen. Vorhandene Java-Implementierungen von Internet-Anwendungen benutzen häufig Konnektoren, um mit Hilfe der Java Connector-Architektur (JCA) auf vorhandene Anwendungslogik zuzugreifen, die in der Form von Anwendungen unter CICS, IMS/DC,DB2 Stored Procedures oder Stapelverarbeitungsanwendungen auf dem z/OS Server vorliegen. Der vorliegende Beitrag erläutert, wie mit unterschiedlichen Konnektoren auf existierende CICS-Anwendungen zugegriffen werden kann. Hierbei wird besonders die Internet-Integration mit Hilfe des CICS Transaction Gateways beschrieben. Eine erfolgreiche Integration des Internets in existierende unternehmerische IT-Strukturen ist ein wichtiges Thema für die Ausbildung des akademischen Nachwuchses. Es wird dargestellt, wie an der Universität Leipzig die Studenten mit praktische Übungen am Beispiel des CICS Transaction Gateways an dieses Ziel herangeführt werden.

This report details the design of a garbage collection (GC) module, which introduces modern GC features to the domain of embedded implementations. The described design supports weak references and feeds reference queues. Its architecture allows multiple concurrent application cores operating as mutators on the shared memory managed by the GC module. The garbage collection is exact and fully concurrent so as to enable the uninterrupted computational progress of the mutators. It combines a distributed root marking with a centralized heap scan of the managed memory. It features a novel mark-and-copy GC strategy on a segmented memory, which thereby overcomes both the tremendous space overhead of two-space copying and the compaction race of mark-and-compact approaches. The proposed GC architecture has been practically implemented and proven using the embedded bytecode processor SHAP as a sample testbed. The synthesis results for settings up to three SHAP mutator cores are given and online functional measurements are presented. Basic performance dependencies on the system configuration are evaluated.

This report presents the SHAP platform consisting of its microarchitecture and its implementation of the Java Virtual Machine (JVM). Like quite a few other embedded implementations of the Java platform, the SHAP microarchitecture relies on an instruction set architecture based on Java bytecode. Unlike them, it, however, features a design with well-encapsulated components autonomously managing their duties on rather high abstraction levels. Thus, permanent runtime duties are transferred from the central computing core to concurrently working components so that it can actually spent a larger fraction of time executing application code. The degree of parallelity between the application and the runtime implementation is increased. Currently, the stack and heap management including the automatic garbage collection are implemented this way. After detailing the design of the microarchitecture, the SHAP implementation of the Java Virtual Machine is described. A major focus is laid on the presentation of the layout and the use of the runtime data structures representing the various language abstractions provided by Java. Also, the boot sequence starting the JVM is described.

In the ever-evolving world of modern software engineering, dynamic and context-dependent adaptability becomes increasingly important. A promising new paradigm that has been proposed is role-oriented programming, an extension of object-oriented programming which allows collaborative relationships of objects to be modeled. Through the introduction of roles and contexts, the behavior of objects can be adapted at run-time via addition or modification of attributes and methods. This dynamism however incurs a high overhead, especially in the area of role function invocation. Recent research has found a remedy inspired by polymorphic inline caches, allowing reuse of so-called dispatch plans which encode the steps directly required for the execution of adaptations. With this optimization, an average speedup of 4.0× was achieved in static contexts and 1.1× in variable contexts. Still, performance sharply drops off at a certain degree of volatility as a consequence of cache capacity exhaustion. This thesis presents a fallback mechanism that is to be used at highly variable call sites which would normally cause a significant slowdown with the new approach. In addition, an optimized reuse mechanism is proposed, further improving execution efficiency. Evaluation through benchmarking shows complete elimination of the aforementioned overhead, meaning a speedup of 16.5×, while the previously achieved speedup is maintained.