System and method for caching results

Electrical computers and digital processing systems: memory – Storage accessing and control – Hierarchical memories

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C711S148000, C711S170000, C709S213000, C709S217000

Reexamination Certificate

active

06895472

ABSTRACT:
In certain aspects, the invention features a system and method for caching results, including receiving a job for computation by a distributed computing system having one or more node computing devices in communication with a cache, processing, on one of the node computing devices, the job to create an intermediate result for storage in the cache, wherein the intermediate result includes data wherein a time required to obtain the data by computation or retrieval from a data storage external to the distributed computer system is at least marginally greater than that of retrieving the intermediate result from the cache. In accordance with such aspects, the system and method further includes storing the intermediate result in the cache, and accessing the cache by presenting a lookup function to the cache, wherein the lookup function includes a key and a compute function configured to produce the intermediate result.

REFERENCES:
patent: 6067633 (2000-05-01), Robbins et al.
patent: 6088758 (2000-07-01), Kaufman et al.
patent: 6128709 (2000-10-01), Autechaud et al.
patent: 6202125 (2001-03-01), Patterson et al.
patent: 6345294 (2002-02-01), O'Toole et al.
patent: 6400726 (2002-06-01), Piret et al.
patent: 20020004917 (2002-01-01), Malcolm et al.
patent: 20020052956 (2002-05-01), Seibold et al.
patent: 20020062376 (2002-05-01), Isoyama
patent: 20020078299 (2002-06-01), Chiou et al.
patent: 20020143945 (2002-10-01), Shahabuddin et al.
patent: 20020174316 (2002-11-01), Dale et al.
patent: 20020184446 (2002-12-01), Kagan et al.
patent: 20030041280 (2003-02-01), Malcolm et al.
New Architect Magazine; Lyman, J.; “Girding for the Grid, Distributed Computing's Big Break”; Apr. 2002.
Foster, I.; “1.1 Parallelism and Computing”; 1995.
Foster, I.; “1.2 A Parallel Machine Model”; 1995.
Foster, I.; “1.3 A Parallel Programming Model”; 1995.
Foster, I.; “1.4 Parallel Algorithm Examples”; 1995.
Foster, I.; “1.5 Summary”; 1995.
Foster, I.; “2 Designing Parallel Algorithms”; 1995.
Foster, I.; “2.1 Methodical Design”; 1995.
www.IDevResource.com, EJB Transactions and JTS; Raj, G.; “Transactions, 2PC and JTS”; Jan. 2000.
www.IDevResource.com, Raj, G.; “EJB Servers”; Jan. 2000.
www.IDevResource.com, Raj, G.; “EJB Containers”; Jan. 2000.
www.IDevResource.com, Raj, Gopalan Suresh; “EJB Components”, Jan. 2000.
www.IDevResource.com, Raj, G.; “EJB Session Beans”; Jan. 2000.
www.IDevResource.com, Raj, G.; “EJB Entity Beans ”; Jan. 2000.
www.IDevResource.com, Raj, G.; “EJB Components at the Server”; Jan. 2000.
www.IDevResource.com, Raj, G.; “Enterprise Java Beans”; Jan. 2000.
Technology Review; Waldrop, M., “Grid Computing”; May 2002.
IEEE; Foster, I., et al; “Grid Services for Distributed System Integration”; Jun. 2002.
Intl J. Supercomputer Applications; Foster, I., et al., “The Anatomy of a Grid, Enabling Scalable Virtual Organizations”; 2001.
Chervenak, A., et al., “The Data Grid: Towards an Architecture for the Distributed Management and Analysis of Large Scientific Datasets”.
The Grid: Blueprint for a Future Computing Infrastructure, Foster, I., et al., “Computational Grids”, 1998.
IEEE, Chervenak, A., et al.; “Giggle: A Framework for Constructing Scalable Replica Location Services”; 2002.
Allcock, B., et al.; “Data Management and Transfer in High Performance Computational Grid Environments”.
Stockiner, H., et al.; “File and Object Replication in Data Grids”.
Ripeanu, M., et al.; “A Decentralized, Adaptive Replica Location Mechanism”.
Vazhukudai, S., et al.; “Using Disk Throughput Data in Predictions of End-to-End Grid Data Transfers”.
GridForum Draft; Allcock, W., et al.; “GridFTP: Protocol Extensions to FTP for the Grid”; Apr. 2002.
GridFTP Update; “GridFTP Update Jan. 2002”; 2002.
Ranganathan, K., et al.; “Decoupling Computation and Data Scheduling in Distributed Data-Intensive Applications”.
Ranganathan, K., et al.; “Improving Data Availability through Dynamic Model-Driven Repliction in Large Peer-to-Peer Communities”.
Foster, I., et al.; “Chimera: A Virtual Data System for Representing, Querying, and Automating Data Derivation”.
IEEE; Annis, J., et al.; “Applying Chimera Virtual Data Concepts to Cluster Finding in the Sloan Sky Survey”; 2002.
Ranganathan, K., et al.; “Identifying Dynamic Replication Strategies for High Performance Data Grid”.
Iamnitchi, A., et al., “Locating Data in (Small-World?) Peer-to-Peer Scientific Collaborations”.
Vazhukudai, S., et al.; “Predicting the Performance of Wide Area Data Transfers”.
Allcock, W., et al.; “Globus Toolkit Support for Distributed Data-Intensive Science”.
Lee, J., et al.; “Applied Techniques for High Bandwidth Data Transfers Across Wide Area Networks”.
Ranganathan, K., et al.; “Design and Evaluation of Dynamic Replication Strategies for a High-Performance Data Grid”.
Proc. 10th Intl Symp. on High Performance Distributed Computer; Stockinger, H., et al.; “File and Object Replication in Data Grids”; 2001.
Vazhkudai, S., et al.; “Replica Selection in the Globus Data Grid”.
Allcock, W., et al.; “Secure, Efficient Data Transport and Replica Management for High-Performance Data-Intensive Computer”.
Allcock, W.; “Protocols and Services for Distributed Data-Intensive Science”.
Bresnahan, J., et al.; “Communication Services for Advanced Network Applications”.
Keahey, K., et al.; “Fine-Grain Authorization Policies in the GRID; Design and Implementation”.
JSSPP; Czajkowski, K., et al.; “SNAP: A Protocol for Negotiating Service Level Agreements and Coordinating Research Management Data in Distributed Systems”; 2002.
Kennedy, K., et al.; “Toward a Framework for Preparing and Executing Adaptive Grid Programs”.
Liu, C., et al.; “Design and Evaluation of a Resource Selection Framework for Grid Applications”.
Iamnitchi, A., et al.; “On Fully Decentralized Resource Discovery in Grid Environments”.
Frey, J., et al.; “Condor-G: A Computation Management Agent for Multi-Institutional Grids”.
Proc. of the 10th IEEE Symp. on High Performance Distributed Computing; Czajkowski, K., et al.; “Practical Resource Management for Grid-based Visual Exploration”; 2001.
Proc. of the 10th IEEE Symp. on High Performance Distributed Computing; Sander, V. et al.; “End-to-End Provision of Policy Information for Network Qos”; Aug. 2001.
Iamnitchi, A.; “A Problem Specific Fault-Tolerance Mechanism for Asynchronous, Distributed Systems”.
Proc. of the Eighth International Workshop on Quality of Service; Foster, I., et al.; “A Quality of Service Architecture that Combines Resource Reservation and Application Adaption”; Jun. 2000.
Sander, V., et al.; “A Differentiated Service Implementation for High-Performance TCP Flows”.
Smith, W., et al.; “Scheduling with Advanced Reservations”.
Smith, W., et al.; “Using Run-Time Predictions to Estimate Queue Wait Times and Improve Scheduler Performance”.
Czajkowski, K., et al.; “Resource Co-Allocation in Computational Grids”.
Foster, I., et al.; “End-To-End Quality of Service for High-End Applications”.
Hoo, G., et al.; “QoS and Middleware: Bandwidth Reservation System Design”.
Lee, C., et al.; “A Network Performance Tool for Grid Environments”.
Foster, I., et al., “A Distributed Resource Management Architecture that Supports Advance Reservations and Co-Allocation”.
Proc. 10th IEEE International Symposium on High Performan

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

System and method for caching results does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with System and method for caching results, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for caching results will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3457926

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