Abstract: The present invention relates to method and system for accessing server resources from heterogeneous platforms which are distributed in a distributed application network. One aspect of the present invention is to generate a connecting mechanism, i.e. a connector between the relational data base and the non-relational data system which must be programmed as well, but which is—once programmed—independent of changes made to the application used on the client side during program maintenance. According to an advantageous aspect of the present invention this is achieved by programming so-called ‘stored procedures’ which access the non-relational data and which process them according to prior art relational data base technology in order to be accessed by JDBC, ODBC or CLI interface for e.g. from IBM DB2 relational database technology on the client side.

Abstract: In a heterogeneuos work environment a method and apparatus for managing isochronous streaming servers is disclosed. This includes a mechanism for allocating processor resource to streaming servers at admission control time with respect to the business importance of work they will be running. This mechanism includes a provision to preempt currently running streaming work of lesser business importance in order to allocate its share of the processor to the new higher importance work. Also included is a mechanism to resume the server when a running stream terminated and processor becomes available. In the case of the variable bit rate multiple peak problem a mechanism is presented to preempt running streaming work at the lowest business importance so that higher priority work can continue to run unaffected. The mechanism to resume paused streams at the termination of a stream also restarts this work.

Abstract: The present invention relates to method and system for accessing server resources (20, 22) from heterogeneous platforms which are distributed in a distributed application network. The basic idea comprised of the present invention is to generate a connecting mechanism (40), i.e. a connector between the relational data base (12) and the non-relational data system (20, 22) which must be programmed as well, but which is—once programmed—independent of changes made to the application (14) used on the client side (13) during program maintenance.

Abstract: In a computer including an operating system comprising a virtual storage organization concept providing storage space for parallel program execution in pre-allocated partitions of a virtual address storage containing shared areas and private areas in several address spaces, there are provided dynamic partitions (P1, P2, . . . N1, N2, . . . O1, O2, . . . ) that are allocatable in addition to the pre-allocated partitions (F1-F8, FA, FB, BG), in dependance from the job to be performed and that are de-allocated after job termination to free the storage area for subsequent use. This concept enlarges the virtual storage area, uses the provided space more effectively and allows the parallel execution of more programs.

Abstract: Data processing apparatus comprises a processor and memory. The processor has a supervisor state including a first set of supervisor service routines for controlling the operation of the data processing apparatus. The memory has a first hash table accessible by the supervisor state for pointing to the first set of supervisor service routines and a second hash table also accessible by the supervisor state for pointing to a second set of supervisor service routines. The data processing apparatus provides table indicating means for indicating whether the first hash table or the second hash table is accessible by the supervisor state. The table indicating means is provided as an index into the first hash table. When this index is accessed, further code is executed which allows access to the second hash table.

Abstract: A 31-bit addressing scheme is compatible with current 24-bit addressing schemes and allows an address space of 2 GB to be created. The shared area of the operating system is divided into two separate areas (230, 260), one (230) located at the bottom of the address space and the other (260) at the top of the address space. Between the shared areas (230, 260), a continuous private area (240, 270) is available for use by the applications software. In one embodiment of the invention, the size of the bottom shared area (230) is limited to 1 MB blocks so optimizing the use of private area (230) by applications programs written for 24-bit addressing.