Shared, distributed lock manager for loosely coupled processing systems
June 16, 2012. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.Patent ReferencesMain bus interface package Method and means for the retention of locks across system, subsystem, and communication failures in a multiprocessing, multiprogramming, shared data environment Shared resource locking apparatus Lockout operation among asynchronous accessers of a shared computer system resource Circuit arrangement for routing signals between a master-slave pair of controlling processors and several master-slave pairs of controlled processing units Method for managing lock escalation in a multiprocessing, multiprogramming environment Lock control for a shared storage in a data processing system Method for lock management, page coherency, and asynchronous writing of changed pages to shared external store in a distributed computing system Storage locking control for a plurality of processors which share a common storage unit Locking control with validity status indication for a multi-host processor system that utilizes a record lock processor and a cache memory for each host processor InventorsApplicationNo. 899664 filed on 06/16/1992US Classes:710/200ACCESS LOCKINGExaminersPrimary: Ray, Gopal C.Attorney, Agent or FirmInternational ClassesG06F 013/16G06F 013/364 G06F 012/16 G06F 009/46 AbstractApparatus and process for managing shared, distributed locks in a multiprocessing complex. The manager operates using a partitionable lock space with logical processor connection. Logically connected processors are subject to validation and disconnection due to failure. The locks synchronize data access to identifiable subunits of DASD. Denied lock requests are queued for servicing when the lock becomes available. Lock partitions are used to speed DASD to DASD copying without halting processing on the first DASD. A special partition is assigned to the copy task and the processors writing to the DASD can determine copy status with a single read or test. Operations requiring multilateral agreement of processors, such as rebuilding locks or moving locks, are protected by fencing any nonresponsive processor. A special queue partition is designated for master/slave control point designation. All processors contend for the master lock and losing contenders are queue. Queuing provides automatic fallback in case of a failing processor.Other References
| |
