Dynamic routing of I/O requests in a multi-tier storage...

Electrical computers and digital processing systems: multicomput – Computer-to-computer data routing

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C706S021000

Reexamination Certificate

active

07606934

ABSTRACT:
A method for routing an incoming service request is described wherein the service request is routed to a selected storage tier based on that selected storage tier having a predicted value indicating a state having greater utility as compared with the predicted value of the state associated with at least one other storage tier within the storage system. A computer system comprising a multi-tier storage system is described, the multi-tier storage system having a routing algorithm configured to adaptively tune functions which map variables describing the state of each storage tier of the storage system into the average latency experienced by incoming service requests associated with the storage tier.

REFERENCES:
patent: 2003/0172145 (2003-09-01), Nguyen
patent: 2003/0212872 (2003-11-01), Patterson et al.
patent: 2004/0068637 (2004-04-01), Nelson et al.
patent: 2005/0228619 (2005-10-01), Burnet et al.
patent: 2006/0029104 (2006-02-01), Jungck
patent: 2006/0053263 (2006-03-01), Prahlad et al.
D. Vengerov, “A Reinforcement Learning Framework for Utility- Based Scheduling in Resource-Contrained Systems”; pp. 16; Feb. 2005.

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 routing of I/O requests in a multi-tier storage... 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 routing of I/O requests in a multi-tier storage..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic routing of I/O requests in a multi-tier storage... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4099301

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