← Back to Patent Explorer
US3701109A Expired / Lapsed US ⏱️ 0.0 years remaining

Priority access system

Assignee: AT&T Inc
•
Filing: 1970-11-09
•
Granted: 1972-10-24
•
Expires: 1990-11-09
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Methods and apparatus are described which provide for granting access to a computer or other system to a plurality of users having different priorities. Each user is assigned to a priority group within which all users receive sequential access. Priority groups as a whole are granted access in accordance with their usage requirement and associated relative priorities. Each group is assured access for at least a minimum period within a longer reference period.

Inventors

  • 👤 Theodore Richmond Peters

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-23 02:46
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/46; G06F9/48; G06F9/4806; G06F9/4812; G06F9/4825; G06F13/00; G06F13/14; G06F13/36

Claims Analysis

Total Claims: 18
Claim 1
Independent Claim 77 words
A selEction circuit for connecting each of N inputs, N > OR = 2, to a single output at least once during a predetermined reference time interval comprising first means for selecting at least once during said reference interval each of a plurality of predetermined groups of said inputs, said plurality of groups comprising all of said N inputs, and second means for connecting each input in a selected group to said output in a predetermined manner.
Claim 2
Dependent Claim 77 words
A selEction circuit for connecting each of N inputs, N > OR = 2, to a single output at least once during a predetermined reference time interval comprising first means for selecting at least once during said reference interval each of a plurality of predetermined groups of said inputs, said plurality of groups comprising all of said N inputs, and second means for connecting each input in a selected group to said output in a predetermined manner.
Claim 3
Dependent Claim 14 words
connecting each input in a selected group to said output in a predetermined manner.
Claim 4
Dependent Claim 14 words
connecting each input in a selected group to said output in a predetermined manner.
Claim 5
Dependent Claim 77 words
The circuit of claim 1 wherein said groups are mutually exclusive, said inputs being included in respective groups in accordance with a desired priority structure, inputs in a given group each having the same priority, and wherein said first means comprises means for selecting a particular group a predetermined number of times during said reference interval, which number is uniquely associated with said particular group and is determined by the relative priority associated with said particular group.
Claim 6
Dependent Claim 86 words
The circuit of claim 1 wherein the totality of inputs in the ith group (i 1,2,3, . . . , m) is determined to require ni connections to said output during said reference interval, each of said connections continuing for not more than a period of time indicated by ti and wherein said means for selecting a particular group comprises means for selecting the ith group a number of times given approximately by (niti)/(niti)min, (niti)min being the minimum value of niti over all values of i.
Claim 7
Dependent Claim 45 words
The circuit of claim 2 wherein said means for selecting a particular group comprises a first counter for indicating the group currently selected, and a second counter for indicating the number of times during said reference interval that said currently selected group has been selected.
Claim 8
Dependent Claim 48 words
The circuit of claim 4 further comprising means for generating a first advance signal whenever each input in said currently selected group has been connected to said output, and means for applying said first advance signal to said second counter to increase the count of said second counter.
Claim 9
Dependent Claim 71 words
The circuit of claim 4 further comprising means for generating a second advance signal whenever said second counter indicates that said particular group has been selected said predetermined number of times, means for applying said second advance signal to said first counter to increase the count of said second counter, and means for applying said second advance signal to said second counter to reset said second counter to an initialized state.
Claim 10
Dependent Claim 23 words
The circuit of claim 1 wherein said second means comprises means for sequentially selecting each input in a selected group to said output.
Claim 11
Dependent Claim 23 words
The circuit of claim 6 wherein said second means comprises means for sequentially selecting each input in a selected group to said output.
Claim 12
Dependent Claim 118 words
The circuit of claim 8 wherein said means for sequentially selecting comprises a memory having a plurality of locations for storing in groups of successive locations information identifying the inputs associated with corresponding groups of inputs, said memory also storing information indicating which input in each group of inputs is the last input in that group to be connected to said output, means for accessing said information in said memory under the control of applied selection signals, a third counter for generating selection signals indicating the memory location containing the information identifying a current input to be connected to said output, and means responsive to information accessed from said memory for connecting said current input to said output.
Claim 13
Dependent Claim 90 words
The circuit of claim 9 further comprising means for generating a first signal whenever it is determined that said current input has completed its required period of connection to said output, means for generating a second signal whenever the period of connectioN for said current input to said output is equal to or greater than the value ti, where said current input is included in the ith group of inputs, and means for advancing the count of said third counter in response to either of said first or second signals.
Claim 14
Independent Claim 30 words
A method for connecting each of N inputs, N > or = 2, to a signal output at least once during predetermined a reference time interval comprising the steps of
Claim 15
Independent Claim 30 words
A method for connecting each of N inputs, N > or = 2, to a signal output at least once during predetermined a reference time interval comprising the steps of
Claim 16
Dependent Claim 75 words
The method of claim 11 wherein said groups are mutually exclusive, said inputs being included in respective groups in accordance with a desired priority structure, inputs in a given group each having the same priority, and wherein said step (1) comprises selecting a particular group a predetermined number of times during said reference interval, which number is uniquely associated with said particular group and is determined by the relative priority associated with said particular group.
Claim 17
Dependent Claim 81 words
The method of claim 11 wherein the totality of inputs in the ith group (i 1,2,3,. . . ,m) is determined to require ni connections to said output during said reference interval, each of said connections continuing for not more than a period of time indicated by ti and wherein said selecting of a particular group comprises selecting the ith group a number of times given approximately by (niti)/(niti)min, (niti)min being the minimum value of niti over all values of i.
Claim 18
Dependent Claim 21 words
The method of claim 11 wherein said step (2) comprises sequentially selecting each input in a selected group to said output.

References Cited (Backward Citations)

US3303476A Cited
US3331055A Cited
US3413612A Cited
US3425037A Cited
US3513445A Cited
US3500329A Cited
US3456244A Cited
US3508206A Cited
US3543242A Cited
US3534339A Cited
US3553656A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1975-10-24 1976-04-24 1976-10-24 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1979-10-24 1980-04-24 1980-10-24 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1983-10-24 1984-04-24 1984-10-24 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag