Resource sharing with sliding constraints

作者: Michael Weiss , Thomas Gray

DOI:

关键词:

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

参考文章(17)
Gerard M. Carroll, Bath and shower splash guard ,(1994)
Michael P. Wellman, A computational market model for distributed configuration design national conference on artificial intelligence. pp. 401- 407 ,(1994)
Jeffrey D. Miller, Roderick Keith Scott, Caglan Mehmet Aras, System for allocation of network resources using an autoregressive integrated moving average method ,(1996)
Charles E. Jablow, Dino Delyani, Data processing system having tunable operating system means ,(1986)
Leonidas Georgiadis, Christos N. Nikolaou, Donald F. Ferguson, Workload manager for achieving transaction class response time goals in a multiprocessing system ,(1992)
Shawn Mamros, James A. Philippou, John T. O'Hara, Bernard Farrell, J. Martin Borden, Daniel Boudreau, Kerry M. Hannigan, Network switch load balancing ,(1999)
Grantham K.H. Pang, Elevator scheduling system using blackboard architecture IEE Proceedings D Control Theory and Applications. ,vol. 138, pp. 337- 346 ,(1991) , 10.1049/IP-D.1991.0046
Shawn D. Bird, Toward a taxonomy of multi-agent systems International Journal of Human-computer Studies \/ International Journal of Man-machine Studies. ,vol. 39, pp. 689- 704 ,(1993) , 10.1006/IMMS.1993.1079