Dynamic adding system for memory files shared among hosts, dynam

Electrical computers and digital processing systems: memory – Storage accessing and control – Memory configuring

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

711216, 711 2, 711130, 711147, G06F 1200

Patent

active

06014730&

ABSTRACT:
In response to an extension request to a shared memory file 104, shared file adding means 111 allocates an (additional) memory file 110; inter-host locking means 103 locks a hash table 106; hash table updating means 108 checks the number of data blocks in the (additional) shared memory file, and updates the hash table 106 to alter one of the data block addresses, out of those stored in entries in the hash table 106, pointing to the same data block in the shared buffer 104 so as to point to a data block in the (additional) shared memory file 110; and the added shared memory file 110 is thereby made available for shared use.

REFERENCES:
patent: 4961139 (1990-10-01), Hong et al.
patent: 5535365 (1996-07-01), Barriuso et al.
patent: 5584005 (1996-12-01), Miyaoku et al.
patent: 5765219 (1998-06-01), Densham et al.
patent: 5860070 (1999-01-01), Tow et al.
patent: 5860101 (1999-01-01), Arimilli et al.
patent: 5899994 (1999-05-01), Mohamed et al.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Dynamic adding system for memory files shared among hosts, dynam does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Dynamic adding system for memory files shared among hosts, dynam, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic adding system for memory files shared among hosts, dynam will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-1470662

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.