Avoiding deadlock between storage assignments by devices in...

Electrical computers and digital processing systems: memory – Storage accessing and control – Control technique

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C711S148000, C707S793000, C707S793000, C709S214000, C709S216000, C709S218000

Reexamination Certificate

active

07010657

ABSTRACT:
A method of avoiding deadlock during managing storage of items in a network (102) of heterogeneous storage devices (104,106,108). The method firstly detects (402) a storage event. Detection is effected by the local storage device and then the method obtains input information (404) having parameter values related to the item and the heterogeneous storage devices (104,106,108). The method then processes (406) the input information to determine a storage assignment, for storage of the item on one or more of the heterogeneous storage devices (104,106,108). The assignment is based on item-device suitability determined from a combination of at least one item selection rule and rules preventing deadlock.

REFERENCES:
patent: 5764972 (1998-06-01), Crouse et al.
patent: 6269382 (2001-07-01), Cabrera et al.
patent: 6336120 (2002-01-01), Noddings et al.
patent: 2002/0188605 (2002-12-01), Adya et al.
“Microsoft Computer Dictionary”, 2002, Microsoft Press, 5thEdition, p. 518.

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

Avoiding deadlock between storage assignments by devices in... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Avoiding deadlock between storage assignments by devices in..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Avoiding deadlock between storage assignments by devices in... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3580366

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