Dynamically managing computer resources based on valuations...

Data processing: database and file management or data structures – Database and file access – Query optimization

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C705S500000, C709S226000, C718S100000, C718S108000

Reexamination Certificate

active

07941427

ABSTRACT:
A computer-implemented method, system and computer product including a scheduling manager residing in memory; whereby the scheduling manager dynamically manages access of additional computer resources to be applied to work items of a program based on their valuations relative to the processing costs thereof.

REFERENCES:
patent: 5963911 (1999-10-01), Walker et al.
patent: 6321373 (2001-11-01), Ekanadham et al.
patent: 6725227 (2004-04-01), Li
patent: 6757897 (2004-06-01), Shi et al.
patent: 6957431 (2005-10-01), Bollella et al.
patent: 7003475 (2006-02-01), Friedland et al.
patent: 7020619 (2006-03-01), Thompson
patent: 7188174 (2007-03-01), Rolia et al.
patent: 7386465 (2008-06-01), Friedland et al.
patent: 2002/0002578 (2002-01-01), Yamashita
patent: 2002/0065864 (2002-05-01), Hartsell et al.
patent: 2002/0091612 (2002-07-01), Greene et al.
patent: 2002/0120486 (2002-08-01), Thompson
patent: 2002/0138542 (2002-09-01), Bollella et al.
patent: 2003/0158884 (2003-08-01), Alford, Jr.
patent: 2003/0225644 (2003-12-01), Casati et al.
patent: 2004/0093254 (2004-05-01), Hirata et al.
patent: 2004/0205206 (2004-10-01), Naik et al.
patent: 2004/0221038 (2004-11-01), Clarke et al.
patent: 2005/0015504 (2005-01-01), Dorne et al.
patent: 2005/0114274 (2005-05-01), Dube et al.
patent: 2005/0198636 (2005-09-01), Barsness et al.
Buyya et al. “A Deadline and Budget Constrained Cost time Optimisation Algorithm for Scheduling task Farming Applications on Global Grids”, School of computer Science and Software Engineerring, Monash University, Caulfield Campus, Melbourne, Australia, 2002. (http://www.csse.monash.edu.au/˜davida/papers/pdpta02.pdf).
Dettinger et al., U.S. Appl. No. 10/083,075, filed Feb. 26, 2002, “Improved Application Portability and Extensibility Through Database Schema and Query Abstraction”.
Dettinger et al., U.S. Appl. No. 10/403,366, filed Mar. 31, 2003, “Modification of a Data Repository Based on an Abstract Data Representation”.
Dettinger et al., U.S. Appl. No. 10/403,960, filed Mar. 31, 2003, “Sequenced Modification of Multiple Entities Based on an Abstract Data Representation”.
Dettinger et al., U.S. Appl. No. 10/132,228, filed Apr. 25, 2002, “Dynamic End User Specific Customization of an Application's Physical Data Layer Through a Data Repository Abstraction Layer”.
Dettinger et al., U.S. Appl. No. 10/131,984, filed Apr. 25, 2002, “Remote Data Access and Integration of Distributed Data Sources Through Data Schema and Query Abstraction”.
Dettinger et al., U.S. Appl. No. 10/403,356, filed Mar. 31, 2003, “Dealing With Composite Data Through Data Model Entities”.
Chase, Jeffrey S. et al., “Managing Energy and Server Resources in Hosting Centers”, ACM SIGOPS Operating Systems Review, Dec. 2001, 14 pgs., vol. 35, Issue 5, ACM Press, New York, NY, USA.
R. Buyya, “Economic-based Distributed Resource Management and Scheduling for Grid Computing”, (Ph.D. Thesis, Monash University, Apr. 2002, pp. 1-178.

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

Dynamically managing computer resources based on valuations... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Dynamically managing computer resources based on valuations..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamically managing computer resources based on valuations... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2624645

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