Electrical computers and digital processing systems: memory – Storage accessing and control – Memory configuring
Reexamination Certificate
2008-01-01
2008-01-01
Bataille, Pierre-Michel (Department: 2186)
Electrical computers and digital processing systems: memory
Storage accessing and control
Memory configuring
C711S162000, C707S793000
Reexamination Certificate
active
10698182
ABSTRACT:
An embodiment of a method of selecting a heuristic class for data placement in a distributed storage system begins by forming a general integer program which models the data placement and forming a specific integer program which models a heuristic class for the data placement. The general and specific integer programs each comprising an objective of minimizing a replication cost. The method continues with solving the general integer program which provides a general lower bound for the replication cost and solving the specific integer program which provides a specific lower bound for the replication cost. The method concludes with selecting the heuristic class if a difference between the general lower bound and the specific lower bound is within an allowable amount.
REFERENCES:
patent: 6240414 (2001-05-01), Beizer et al.
patent: 6374227 (2002-04-01), Ye
patent: 7107596 (2006-09-01), Brown et al.
patent: 2002/0177989 (2002-11-01), Alvarez et al.
patent: 2002/0184555 (2002-12-01), Wong et al.
Mahmood, A. and H. U. Khan and H. A. Fatmi, Adaptive File Allocation in Distributed Computer Systems, Nov. 2, 1993, King's College London, University of London, 354-361.
Poonawala, Mustafa, “Reusable Strategies for Testing Safety-Critical Systems”, University of Minnesota, Sep. 1999, 136-150.
Lo “Heuristics algorithms for task assignment in distributed systems” 1988 IEEE, pp. 1384-1397.
Gehlsen et al. “A Framework for Distributed Simulation Optimization”, 2001, pp. 508-514.
Sugih Jamin, Cheng Jin, Anthony R. Kurc, Danny Raz and Yuval Shavitt, Constrained Mirror Placement on the Internet, INFOCOM, 2001.
Magnus Karlsson and Christos Karamanolis, Bounds on the Replication Cost for QoS, Technical Report HPL-2003-156, Hewlett-Packard Company, Palo Alto, CA, Jul. 24, 2003. <http://www.hpl.hp.com/techreports/2003/HPL-2003-156.pdf>.
Lili Qiu, Venkata N. Padmananabhan and Geoffrey M. Voelker, On the Placement of Web Server Replicas, INFOCOM, 2001.
Raj Tewari and Nabil R. Adam, Distributed File Allocation with Consistency Constraints, 1992.
Arun Venkataramani, Phoebe Weidmann, and Mike Dahlin, Bandwidth Constrained Placement in a WAN, 2001.
Alec Wolman, Geoffrey M. Voelker, Nitin Sharm, Neal Cardwell, Anna Karlin, and Henry M. Levy, On the Scale and Performance of Cooperative Web Proxy Caching, Proceedings of the 17th ACM Symposium on Operating Systems Principles, Kiawah Island, SC, pp. 16-31, ACM Press, New York, NY, 1999.
Kamal Jain, Mohammad Mahdian, Evangelos Markakis, Amin Saberi, and Vijay V. Vazirani, Greedy Facility Location Algorithms Analyzed Using Dual Fitting With Factor-Revealing LP, ArXiv, Cornell University, Ithica, NY, Jul. 9, 2002. < http://arxiv.org/PS—cache/cs/pdf/0207/0207028.pdf>.
P. Krishnan, Danny Raz, and Yuval Shavitt, The Cache Location Problem, IEEE/ACM Transactions on Networking, vol. 8, No. 5, pp. 568-582, ACM Press, New York, NY, Oct. 2000.
Magnus Karlsson, Christos Karamanolis, and Mallik Mahalingam, A Framework for Evaluating Replica Placement Algorithms, Technical Report, HPL-2002-219, Hewlett-Packard Company, Palo Alto, CA, Aug. 16, 2002. < http://www.hpl.hp.com/techreports/2002/HPL-2002-219.pdf>.
Magnus Karlsson, and Mallik Mahalingam, Do We Need Replica Placement Algorithms in Content Delivery Networks?, Technical Report HPL-2002-220, Hewlett-Packard Company, Palo Alto, CA, Aug. 16, 2002. < http://www.hpl.hp.com/techreports/2002/HPL-2002-220.pdf>.
Sridhar Rajagopalan, and Vijay V. Vazirani, Primal-dual RNC Approximation of Covering Integer Programs, 1999.
Haifeng Yu, and Amin Vahdat, Minimal Replication Cost for Availability, Jul. 2002.
Samy Mahmoud and J. S. Riordon, Optimal Allocation of Resources in Distributed Information Networks, ACM Transactions on Database Systems, vol. 1, No. 1, pp. 66-78, ACM Press, New York, NY, Mar. 1976.
Mark S. Daskin and Susan H. Owen, Partial Covering P-Center and Partial Covering Set Covering Models, Presentation, International Symposium on Location Decisions (ISOLDE VIII), Portugal, Jun. 23-29, 1999.
Susan Hesse Owen and Mark S. Daskin, Strategic Facility Location: A Review, vol. 111, Issue 3, pp. 423-447, European Journal of Operational Research, Elsevier Science B.V., Amsterdam, Netherlands, 1998.
Law rence W. Dowdy, Derrell V. Foster, Comparative Models of the File Assignment Problem, ACM Computing Surveys (CSUR), vol. 14, No. 2, pp. 287-313, ACM Press, New York, NY, Jun. 1982.
Pierre Chardaire, Facility Location Optimization and Cooperative Games, Ph.D. Thesis, pp. 46-62, Chapter 3 and pp. 175-184, Bibliography, School of Information Systems, University of East-Anglia, Norwich UK, 1998.
Magnus Karlsson and Christos Karamanolis, U.S. Appl. No. 10/698,263, Oct. 30, 2003.
Christos Karamanolis, and Magnus Karlsson, U.S. Appl. No. 10/698,264, Oct. 30, 2003.
Magnus Karlsson and Christos Karamanolis, U.S. Appl. No. 10/698,265, Oct. 30, 2003.
Karamanolis Christos
Karlsson Magnus
Bataille Pierre-Michel
Hewlett--Packard Development Company, L.P.
LandOfFree
Method of selecting heuristic class for data placement does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method of selecting heuristic class for data placement, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method of selecting heuristic class for data placement will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3954840