Abstract: A method and apparatus to guarantee type safety in multithreaded programs, and to guarantee initialization safety in well-behaved multithreaded programs. A plurality of bytecodes representing a program are received and examined to identify bytecodes defining object creation operations and object initialization operations. Upon execution of the plurality of bytecodes, memory barrier operations are performed subsequent to the performance of both the object creation operations and the object initialization operations. This guarantees type safety, and further guarantees initialization safety if the program is well-behaved. Optimization algorithms may also be applied in the compilation of bytecodes to improve performance.

Abstract: A method of managing configuration changes in a data processing system, particularly a network wherein software products (250) must be distributed to client workstations. The method provides the definition of reference models (220e-220d) arranged in a tree (215); each reference model includes configuration elements (such as software products and/or hardware features and their desired target status) for the corresponding client workstations (subscribers). A target configuration (230) of the client workstations associated with each reference model is determined by inheriting the configuration elements of the parent reference models. A list of actions (245) to be carried out on each client workstation for reaching the corresponding target configuration is determined by comparing the target configuration with a current configuration of the client workstation stored in a corresponding inventory (245).

Abstract: A method, apparatus, system, and signal-bearing medium that in an embodiment request a program or programs to tune themselves to run faster or slower if a service class is not meeting its performance goal. In an embodiment, the program is repeatedly requested to incrementally tune itself until the performance goal is met or until no further improvement occurs. In various embodiments, the programs to be requested to tune themselves are selected based on whether the programs are bottlenecks for the service class, whether the programs do the majority of work for the service class, whether the programs easily meet their own performance goals, or whether the programs are low priority. In this way, the programs may be performance tuned in a way that is more effective and less intrusive than by adjusting global, system-level resource allocations.