摘要:
A computer-executable method for allocating resource discovery and identification processes among a plurality of management tools and resources in a distributed and heterogeneous IT management system includes providing at least one authoritative manageable resource having minimal or no responsibility for reporting its identity, minimal or no responsibility for advertising any lifecycle-related creation event for the resource, and minimal or no responsibility for advertising any lifecycle-related destruction event for the resource; using a service oriented architecture (SOA) to define one or more services needed to manage the resource within the management system; and using a component model to define one or more interfaces and one or more interactions to be implemented by the manageable resource within the management system.
摘要:
An integrated hybrid system is provided. The hybrid system includes compute components of different types and architectures that are integrated and managed by a single point of control to provide federation and the presentation of the compute components as a single logical computing platform.
摘要:
A system for managing topologies includes a topology data datastore that stores topology information. A topology computer element interfaces with the topology data datastore to create and update a topology of resources. A subscription computer element generates notifications to a user based on at least one of the creating and the updating of the topology of resources and further based on subscription data.
摘要:
A server instance includes a first region to perform one or more privileged functions and a second region to perform one or more non-privileged functions. Thus, the privileged functions are separate from the non-privileged functions. The first region includes at least a portion of an object request broker, which is used in communicating with one or more clients coupled to the server instance. The second region executes non-privileged application code, and can be replicated within the server instance based on workload management criteria.
摘要:
A transactional name server. One or more objects of the name server are managed as transactional objects, thereby providing a transactional name server. Atomic updates are provided in the name server by the addition of transactional semantics. The transactional semantics include making the objects of the name space managed objects and providing a local interface to a directory service that propagates a transactional context from the name server through a directory down to a resource manager.
摘要:
A LOCK PAGE instruction is provided for locking a page of real storage using a virtual address. The LOCK PAGE instruction includes an operation code which specifies the operation to be performed, a first operand which contains the value of the real address obtained during execution of the LOCK PAGE instruction and a second operand which contains the value of the virtual address of the page to be locked during execution of LOCK PAGE. LOCK PAGE enables an address page or a data page to be locked without requiring the entire address space to be locked. A page is locked when a lock control bit in general register 0 is zero, the page is valid in main storage and a lock bit located in a page table entry is zero. In addition to the above, the technique used by an operating system service for reclaiming a page of real storage is altered to intersect with the LOCK PAGE facility.
摘要:
Storage is managed in a shared electronic store (SES) by assigning storage classes (STCs) to each directory entry having a data item stored in SES. The assignments of directory entries and data elements to the respective STCs can be changed at any time by any CPC. Eventually, no free space remains in the SES cache, and then space for new directory entries and data items must be obtained by reclaiming space occupied by directory entries and associated unchanged data items. The reclaiming of SES space is controlled on a STC basis. Any specified STC may reclaim from itself or from another STC using reclaiming software/microcode in SES, which includes a reclaim vector, a reclaim counter, a queue, and reclaiming controls. The vector and counter have respective elements for all possible STCs to controls how a specified STC may reclaim space from any or all target STC. Any enabled target STC reclaims its space according to an LRU algorithm maintained by a queue for the STC. A CPC can issue a command to load different values in target STC elements in the SES vector for a specified STC to control how reclaiming is apportioned for the specified STC. In SES, associated target counter elements are loaded from its vector. Reclaiming is done automatically in SES upon each directory miss in the current target STC having a non-zero counter value, when no free space exists. The counter is decremented for each reclaimed directory entry until its count reaches zero, and then the counter element for the next non-zero target STC is used for reclaiming until it reaches zero. When all STC elements in the counter are zero for the specified STC, the counter elements are reloaded from the vector elements to repeat the reclaiming operation, as long as a repeat factor for the specified STC has not reached zero. The repeat factor is decremented each time the counters are loaded from the vector. When the counters and repeat factor have all reached zero, reclaiming is disabled for the specified STC.
摘要:
Apparatus and accompanying methods for use in preferably a multi-system shared data (sysplex (5)) environment which quickly and efficiently isolates (fences), through a pre-defined hierarchical order, failed sysplex components from accessing shared data in order to protect data integrity. Specifically, by dividing a sysplex workload into specified fence groups (FG A, FG B) and providing appropriate software and hardware fence support, fencing can occur at various distinct levels: a member-to-member level, i.e. to allow any member (220, 225, 230, 233,237) of a fence group to fully isolate any other ("target") member of that same group; a fence group level, i.e. to isolate all members of a fence group that execute on a "target" system (200.sub.1, 200.sub.2, 200.sub.3); and a system level, i.e. to fully isolate an entire "target" system. Through pre-defined escalation rules (630), fencing can be escalated from a lower member level to a higher, group or system, level in the event a lower level fence can not be successfully imposed. Member level fencing is accomplished in software (1300, 1500); group and system level fencing is accomplished through dedicated hardware fencing facilities (44). An identifier (444, 464) uniquely designates each different fence group existing on a computer processing complex (CPC) (40.sub.1, 40.sub.2, 40.sub.3, 40.sub.M) in the sysplex over the life of that CPC. Advantageously, this technique eliminates erroneous back level fencing, significantly expedites fence processing and also greatly reduces a need for human intervention.
摘要:
Page management mechanisms provide candidates for page stealing and prefetching from a main storage data cache of shared data when the jobs sharing the data are accessing it in a sequential manner. Pages are stolen behind the first reader in the cache, and thereafter at locations least likely to be soon re-referenced by trailing readers. A "clustering" of readers may be promoted to reduce I/O contention. Prefetching is carried out so that the pages most likely to be soon referenced by one of the readers are brought into the cache.
摘要:
An integrated hybrid system is provided. The hybrid system includes compute components of different types and architectures that are integrated and managed by a single point of control to provide federation and the presentation of the compute components as a single logical computing platform.