Patent
Cooperative lock override procedure
TLDR
In this paper, the authors propose a cooperative lock override procedure for managing a shared resource in a data processing system, where the detecting processor confirms that the failing processor is the lockholder and passes the lock to the next requestor in the queue.Abstract:
Queued lock services for managing a shared resource in a data processing system include a cooperative lock override procedure. On detecting a protocol failure by another processor, the detecting processor confirms that the failing processor is the lockholder and passes the lock to the next requestor in the queue.read more
Citations
More filters
Patent
Data protection in a storage system using external secrets
TL;DR: In this paper, the authors propose a secret sharing scheme for protecting a set of storage devices using secret sharing in combination with an external secret, where the data of each storage device is encrypted with a device-specific key and this key is encrypted using the final master secret.
Patent
Associating heartbeat data with access to shared resources of a computer system
TL;DR: In this article, the authors propose a method, system and program code for implementing distributed locks to be maintained through the use of on disk heartbeats, which can be implemented in a traditional computer environment or in a fully or partially virtualized environment and requires no use of an IP network or a separate network based lock manager.
Patent
Method for maintaining multiple fingerprint tables in a deduplicating storage system
TL;DR: In this paper, a system and method for managing multiple fingerprint tables in a deduplicating storage system is presented, where a storage controller is configured to select the first fingerprint table for storage of entries corresponding to data stored in the data storage medium that has been deemed more likely to be successfully deduced than other entries in the storage medium.
Patent
Method and system for deadlock detection and avoidance
TL;DR: In this paper, the authors propose a method of operating a computer system supporting multiple processes, and the intention is to avoid deadlock (an example of which is where process A owns resource A, and is waiting on resource B, but resource B is currently owned by process B, which is waiting for resource A).
Patent
Optimizing replication by distinguishing user and system write activity
TL;DR: In this paper, the history of remapped data in a storage system is maintained by a tag associated with the first portion of the first medium, which is retained when the second portion is remapped to the second medium.
References
More filters
Patent
System and method for disk mapping and data retrieval
TL;DR: In this paper, an apparatus and method for disk mapping and data retrieval includes a data storage medium on which has been stored a plurality of data records, each record includes at least a record identification portion, for uniquely identifying each record from among the plurality of records.
Patent
System and Method for dynamically controlling cache management
TL;DR: In this article, a cache management system and method coupled to at least one host and one data storage device is presented, where a cache indexer maintains a current index (25) of data elements which are stored in cache memory.
Proceedings ArticleDOI
Resource allocation with immunity to limited process failure
TL;DR: In this article, upper and lower bounds for the shared space requirements for solution of several problems involving resource allocation among asynchronous processes are proved for the case when a limited number of processes fail.
Patent
Cache management system using time stamping for replacement queue
Natan Vishlitzky,Yuval Ofek +1 more
TL;DR: In this paper, the authors propose a shared system memory buffer that buffers data transfers between multiple host computers and a plurality of data storage devices, which includes a cache memory and a number of queues and structures to facilitate performance.
Journal ArticleDOI
Distributed FIFO allocation of identical resources using small shared space
TL;DR: In this paper, the authors present a simple and efficient algorithm for the FIFO allocation of k identical resources among asynchronous processes that communicate via shared memory, simulating a shared queue but using exponentially fewer shared memory values, resulting in practical savings of time and space as well as program complexity.