Dynamic user management for timed shared computer systems

Details Dynamic user management for timed shared computer systems Dynamic user management for timed shared computer systems

1998-01-15

2002-01-01

Banankhah, Majid A. (Department: 2151)

Electrical computers and digital processing systems: multicomput

Computer-to-computer data routing

Least weight routing

C709S241000

Reexamination Certificate

active

06336127

ABSTRACT:

BACKGROUND OF THE INVENTION
This invention relates to dynamic user management for time shared computer systems.
INTRODUCTION TO THE INVENTION
In a time shared computer system, each user can get pro-rated computer resources over some interval of time. These resources are various classes of memory and disk storage and, in multi-processor systems, a share of one or more processors. These resources are limited, however, and not all users can be active or even contained in memory at any given time. The problem addressed in this invention is how to allocate the computer resources at any given time for the set of users.
SUMMARY OF THE INVENTION
We note that currently, each user has a priority and is given a fixed slice of computer time in which he can do his processing, and then has an inactive period of time during which other users are active. The frequency of user activation is determined by the given user's priority. There is no optimal discipline for replacement of one or more users in memory by a newly activated user.
We have now discovered a novel method for allocating computer resources specifically, dealing in particular with the task of determining which set of users are to be contained in memory at any given time in order to maximize the performance of the time-shared computer system.
The novel method is suitable for determining a set of users which are to be contained in a main memory at a given time, the method comprising the steps of:
(i) tracing for each active user a usage of computer resources;
(ii) evaluating for each inactive user an expected usage of computer resources;
(iii) identifying a set of users to be resident in main memory at a given time; and
(iv) employing a user measure based upon the usage of computer resources based upon input from steps (i)-(iii), for determining a dynamic user replacement plan for maintaining a set of users in main memory at a given time.


REFERENCES:
patent: 4914570 (1990-04-01), Peacock
patent: 5603029 (1997-02-01), Aman et al.
patent: 5668995 (1997-09-01), Bhat
patent: 5694602 (1997-12-01), Smith
patent: 5784616 (1998-07-01), Horvitz
patent: 5790862 (1998-08-01), Tanaka et al.
patent: 5845318 (1998-12-01), Rose et al.
patent: 5889989 (1999-03-01), Robertazzi et al.
patent: 96-66427 (1998-09-01), None
Jerome Kurtzberg, “On approximation methods for the assignment problem” ACM 9(4) 419-439. Oct. 1962.*
Sinnwell et al, “a cost-model-based online method for distributed caching”, IEEE, Apr. 1997.*
Emile Haddad, Dynamic optimization of load distribution in heterogeneous systems' IEEE digital library 1994.*
Deckro et al; “Cost based allocation of resources in project planning”, IEEE digital library, pp. 278-283, 1991.

Affiliated with

Also associated with

Rating

Dynamic user management for timed shared computer systems does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Dynamic user management for timed shared computer systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic user management for timed shared computer systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2823504