Resource sharing with sliding constraints

Details Resource sharing with sliding constraints Resource sharing with sliding constraints

2007-05-22

2007-05-22

Thomson, William (Department: 2194)

Electrical computers and digital processing systems: virtual mac

Task management or control

Process scheduling

C718S102000, C718S103000, C718S105000, C709S226000

Reexamination Certificate

active

09933994

ABSTRACT:
The resource sharing system according to the present invention dynamically adjusts the priorities at which requests from applications in different request classes (or classes of service) for a shared resource, are processed. The dynamic priority of a request class is based in part on the average resource allocation to requests in this request class, and in part on settings for the minimum and maximum allocations to the request class. The average resource allocation is the proportion of time the shared resource has been assigned to requests of this class relative to other classes. The dynamic adjustment of priorities uses “sliding constraints” whereby the priorities are caused to “slide” with the average resource allocation, and the priority imposes a constraint on when the requests of a resource class can be satisfied: namely, when there are no other requests from higher-priority request classes waiting for the resource.

REFERENCES:
patent: 5381546 (1995-01-01), Servi et al.
patent: 5381564 (1995-01-01), Carroll
patent: 5504894 (1996-04-01), Ferguson et al.
patent: 5884037 (1999-03-01), Aras et al.
patent: 6067457 (2000-05-01), Erickson et al.
patent: 6788692 (2004-09-01), Boudreau et al.
patent: 0194533 (1986-09-01), None
patent: 2353915 (2001-03-01), None
Barbuceanu et al., “Integrating Communicative Action, Conversations and Decision Theory to Coordinate Agents”, Enterprise Integration Laboratory, University of Toronto, Canada, pp. 49-58.
Bird, “Toward a Taxonomy of Multi-Agent Systems”, Albers School of Business and Economics, Seattle , Washington, 1993, pp. 689-704.
Corkill, “Blackboard Systems”, AI Expert, Sep. 1991, pp. 41-47.
Khasnabish, “Integrated Bandwidth and Congestion Management in ATM Networks Using a Simple Learning Algorithm and a Bucket Bank”, Bell-Northern Research Ltd., Ontario, Canada, 1993, pp. 388-396.
Nii, “Blackboard Systems: The Blackboard Model of Problem Solving and the Evolution of Blackboard Architectures”, Knowledge Systems Laboratory, Stanford University, California, The AI Magazine, Summer 1986, pp. 38-53.
Pan et al., “An Intelligent Agent Framework for Enterprise Integration”, IEEE Transactions on Systems, Man, and Cybernetics, vol. 21, No. 6, Nov./Dec. 1991, pp. 1391-1408.
Pang, “Elevator Scheduling System Using Blackboard Architecture”, IEE Proceedings-D vol. 138, No. 4, Jul. 1991, pp. 337-346.
Sandholm et al., “Issues in Automated Negotiation and Electronic Commerce: Extending the Contract Net Framework”, University of Massachusetts at Amherst, Computer Science Department, Massachusetts, ICMAS-95, pp. 328-335.
Waldspurger, et al., “Spawn: A Distributed Computational Economy”, IEEE Transactions on Software Engineering, vol. 18, No. 2, Feb. 1992, pp. 103-117.
Wellman, “A Computational Market Model for Distributed Configuration Design”, University of Michigan, AI Laboratory, Ann Arbor, Michigan, pp. 401-407.

Affiliated with

Also associated with

Rating

Resource sharing with sliding constraints does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Resource sharing with sliding constraints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Resource sharing with sliding constraints will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3729904