Data processing: artificial intelligence – Knowledge processing system – Knowledge representation and reasoning technique
Reexamination Certificate
2004-09-30
2009-02-17
Vincent, David R (Department: 2129)
Data processing: artificial intelligence
Knowledge processing system
Knowledge representation and reasoning technique
C706S057000, C706S021000
Reexamination Certificate
active
07493300
ABSTRACT:
When an alarm condition relating to a performance goal of a storage system is detected, a storage management system invokes an N-step lookahead engine for simulating operation of the storage system when there are multiple actions that could be taken by the storage system for eliminating the alarm condition. The N-step lookahead engine generates N possible system states based on a current state of the storage system. The N possible states are based on a cost model of each of the multiple actions. Each cost model is based on an action, a behavior implication of the action, a resource implication of the action and a transient cost of the action. An action is selected that generates a system state that optimizes the stability, a prerequisite and a transient cost of invoking the selected action.
REFERENCES:
patent: 5479414 (1995-12-01), Keller et al.
patent: 6233590 (2001-05-01), Shaw et al.
patent: 6430712 (2002-08-01), Lewis
patent: 6442715 (2002-08-01), Wilson
patent: 6532454 (2003-03-01), Werbos
patent: 6704719 (2004-03-01), Ericson
patent: 2001/0051861 (2001-12-01), Tamura et al.
patent: 2002/0174306 (2002-11-01), Gajjar et al.
patent: 2003/0060898 (2003-03-01), Jenkins et al.
patent: 2003/0220899 (2003-11-01), Numanoi et al.
patent: 2003/0225801 (2003-12-01), Devarakonda et al.
patent: 2004/0015386 (2004-01-01), Abe et al.
John Wilkes, “Traveling to Rome: QoS Specification for Automated Storage System Management”, Springer, 2001.
Alvarez et al., Guillermo, “Minerva: An Automated Resource Provisioning Tool for Large-Scale Storage Systems”, ACM, 2001.
S.J. Beaty, “Lookahead Scheduling,” ACM SIGMICRO vol. 23, Issue 1-2 (Dec. 1992).
S. Chaudhuri et al. “AutoAdmin ‘What-if’ Index Analysis Utility,” Proceedings ACM SIGMOD Conference Seattle 1998, pp. 367-378.
J.W. Janneck, “Generalizing lookahead-behavior prediction in distributed simulation”, In: Parallel and Distributed Simulation, 1998.
M. Kallahalla et al., “Optimal prefetching and caching for parallel I/O systems,” In ACM Symposium on Parallel Architectures and Algorithms, pp. 219-228, 2001.
E.J. Sandewall, “A Planning Problem Solver Based on Look-Ahead in Stochastic Game Trees,” Journal of the ACM (JACM), vol. 16, Issue 3 (Jul. 1969).
M. Selter et al., “Self-Monitoring and Self-Adapting Operating Systems,” In Proceedings of the Sixth Workshop on Hot Topics in Operating Systems, May 1997.
G. Valentin et al., “DB2 Advisor: An Optimizer Smart Enough To Recommend Its Own Indexes,” available at http://www-106.ibm.com/developerworks/db2/library/techarticle/lohman/0107lohman.pdf.
T. Yeh et al., “Competitive analysis of on-line disk scheduling,” Theory of Computing Systems, 31:491-506, 1998.
Palmer John Davis
Uttamchandani Sandeep Madhav
Voruganti Kaladhar
Curtin, L.L.C. Joseph P.
International Business Machines - Corporation
Kennedy Adrian L
Vincent David R
LandOfFree
Model and system for reasoning with N-step lookahead 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 Model and system for reasoning with N-step lookahead in..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Model and system for reasoning with N-step lookahead in... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4134173