Patent US3603935A successfully refreshed from Google Patents.
← Back to Patent Explorer
US3603935A Expired / Lapsed US ⏱️ 0.0 years remaining

Memory port priority access system with inhibition of low priority lock-out

Assignee: Xerox Corp
•
Filing: 1969-05-12
•
Granted: 1971-09-07
•
Expires: 1989-05-12
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A control system for handling overlapping requests for communication between a plurality of processors and a memory or a memory bank is disclosed causing requests, after acceptance, to be serviced on a predetermined priority basis but preventing acceptance of new requests until all requests pending at the respective previous acceptance phase have been honored.

Inventors

  • 👤 Ralph C Moore

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-23 06:32
CPC Classifications
G; G06; G06F; G06F13/00; G06F13/14; G06F13/16; G06F13/18

Claims Analysis

Total Claims: 4
Claim 1
Independent Claim 298 words
Apparatus for handling multiple memory requests for access to a memory bank, the request originating in a plurality of different processors and at random times in relation to each other, the requests identifying the need for data communication between the respective processor and the memory bank, each request signal accompanied by addressing signals, the processor including at least one central processing unit and one input/output processor requesting memory access independently from each other, comprising: timing means providing timing signals on a cyclically repetitive basis and in synchronism with memory access cycles; first means including a plurality of storage devices respectively associated with the processors of the plurality and connected for receiving memory request signals and storing same; gating means connected to the timing means and operatively connected to pass the request signals respectively to the storage devices of the first means, concurrently and in synchronism with a timing signal representative of an instant close to the end of a memory cycle; first circuit means connected for enabling the gating means when none of the plurality of storage devices has no longer stored a request signal; second circuit means connected for processing the memory access requests as identified by request signals stored in the storage device of the plurality in predetermined priority, one memory cycle per request, and including circuit means connected to the storage devices to erase a stored request signal identifying a request that is processed in a memory cycle, during that memory cycle, prior to the particular instant within that cycle; and third circuit means connected additionally to the gating means for rendering storage of a request dependent upon the presence of the particular memory location in the bank as identified by the addressing signals and to which access is requested by the respective request signal.
Claim 2
Dependent Claim 298 words
Apparatus for handling multiple memory requests for access to a memory bank, the request originating in a plurality of different processors and at random times in relation to each other, the requests identifying the need for data communication between the respective processor and the memory bank, each request signal accompanied by addressing signals, the processor including at least one central processing unit and one input/output processor requesting memory access independently from each other, comprising: timing means providing timing signals on a cyclically repetitive basis and in synchronism with memory access cycles; first means including a plurality of storage devices respectively associated with the processors of the plurality and connected for receiving memory request signals and storing same; gating means connected to the timing means and operatively connected to pass the request signals respectively to the storage devices of the first means, concurrently and in synchronism with a timing signal representative of an instant close to the end of a memory cycle; first circuit means connected for enabling the gating means when none of the plurality of storage devices has no longer stored a request signal; second circuit means connected for processing the memory access requests as identified by request signals stored in the storage device of the plurality in predetermined priority, one memory cycle per request, and including circuit means connected to the storage devices to erase a stored request signal identifying a request that is processed in a memory cycle, during that memory cycle, prior to the particular instant within that cycle; and third circuit means connected additionally to the gating means for rendering storage of a request dependent upon the presence of the particular memory location in the bank as identified by the addressing signals and to which access is requested by the respective request signal.
Claim 3
Dependent Claim 239 words
In a data-processing system, having a plurality of memory banks and a plurality of processors, and a connecting busses between each bank and each of the processor, for passing data between each processor and any of the banks and for providing access request and addressing signals from each of the processors to all of the banks, each memory bank having a port through which pass data, addressing signals and access request signals, the improvement comprising: first means providing signals in response to an addressing signal when received from any of the processors representing whether or not the location having the address is in the memory bank having the port; second means individually connected to the processors Of the plurality for individually receiving access request signals as issued by the processors in random time relation; third means connected to the first and second means for storing the request signals individually only when the first means provides a signal in representation of presence of the location in the bank as identified by the addressing signals accompanying a request signal to be stored; fourth means connected to process the stored request signals in a predetermined order of priority including means to erase storage of a request signal when the access request identified by that signal is services; and fifth means operating the third means in timed response when all stored request signals have been erased for obtaining storage of new request signals.
Claim 4
Dependent Claim 239 words
In a data-processing system, having a plurality of memory banks and a plurality of processors, and a connecting busses between each bank and each of the processor, for passing data between each processor and any of the banks and for providing access request and addressing signals from each of the processors to all of the banks, each memory bank having a port through which pass data, addressing signals and access request signals, the improvement comprising: first means providing signals in response to an addressing signal when received from any of the processors representing whether or not the location having the address is in the memory bank having the port; second means individually connected to the processors Of the plurality for individually receiving access request signals as issued by the processors in random time relation; third means connected to the first and second means for storing the request signals individually only when the first means provides a signal in representation of presence of the location in the bank as identified by the addressing signals accompanying a request signal to be stored; fourth means connected to process the stored request signals in a predetermined order of priority including means to erase storage of a request signal when the access request identified by that signal is services; and fifth means operating the third means in timed response when all stored request signals have been erased for obtaining storage of new request signals.

References Cited (Backward Citations)

US3239819A Cited
US3200380A Cited
US3331055A Cited
US3333252A Cited
US3399384A Cited
US3483522A Cited
US3413613A Cited
US3482264A Cited
US3482265A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1974-09-06 1975-03-08 1975-09-07 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1978-09-06 1979-03-08 1979-09-07 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1982-09-06 1983-03-08 1983-09-07 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag