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

Data processing apparatus with fixed address space

Assignee: International Business Machines Corp
•
Filing: 1987-09-16
•
Granted: 1988-11-22
•
Expires: 2007-09-16
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A CPU initializes pluggable adapters with built-in identity and conditional ROS and complies a Hardware First Level Interrupt Handler (HFLIH) table of identity against status register address and a Software First Level Interrupt Handler (HFLIH) table of identity against on-board system function. It stores the tables with a control module in enabled memory on the keyboard adapter. Conditional ROS is enabled on a given adapter receiving a broadcast of its own identity. Adapter interrupts are ORed. HFLIH is stepped through by the control module to access adapter status sequentially, servicing each adapter in turn from its ROS, using its broadcast identity. The enabled adapter appears as a single entity to the central processor and occupies a single window in the address space which is common to all of the adapters but used by only one at a time. System functions are accessed via HFLIH.

Inventors

  • 👤 Ronald S. Harter
  • 👤 Jeffrey S. Lucash
  • 👤 Robert J. Major

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-26 08:19
CPC Classifications
G; G06; G06F; G06F12/00; G06F12/02; G06F12/06; G06F12/0646; G06F12/0653; G06F12/0661

Claims Analysis

Total Claims: 10
Claim 1
Independent Claim 172 words
In a system comprising a processor, memory addressing means defining a finite memory address space, and an indefinite plurality of memory containing modules connectable into said address space, the improvement comprising: each of said modules having an identification indicium which is different from that of any of the other of said plurality of modules, each of said modules having memory address decoding means responsive to addresses in one common segment of said address space, each of said modules having an identifier register writable by said processor, and each of said modules having comparison means sensitive to the contents of its said identifier register and operative upon a predetermined relationship of the contents of said register to the indicium of the module to enable said memory on that module to respond to said addresses in said one common segment so long as that module is enabled and to the exclusion of the others of said modules, whereby said modules effectively occupy said segment of said address space selectively and one at a time.
Claim 2
Dependent Claim 172 words
In a system comprising a processor, memory addressing means defining a finite memory address space, and an indefinite plurality of memory containing modules connectable into said address space, the improvement comprising: each of said modules having an identification indicium which is different from that of any of the other of said plurality of modules, each of said modules having memory address decoding means responsive to addresses in one common segment of said address space, each of said modules having an identifier register writable by said processor, and each of said modules having comparison means sensitive to the contents of its said identifier register and operative upon a predetermined relationship of the contents of said register to the indicium of the module to enable said memory on that module to respond to said addresses in said one common segment so long as that module is enabled and to the exclusion of the others of said modules, whereby said modules effectively occupy said segment of said address space selectively and one at a time.
Claim 3
Dependent Claim 38 words
A system in accordance with claim 1, further comprising means defining a table identifying those said modules acutally connected into said system and the location, outside said address space, defining the current status of each said connected module.
Claim 4
Dependent Claim 67 words
A system in accordance with claim 2, further including means utilizing said table to examine the status of the devices listed in the table for a given status and to broadcast to said identifier registers an indicator value having said predetermined relationship to the said identification indicium of devices having said status, one at a time, whereby the thus selected devices are enabled one at a time.
Claim 5
Dependent Claim 320 words
Data processing apparatus having a central processor connected to a plurality of ports to any or all of which may be attached a selection from a group of compatible devices, each incorporating means signifying its individual identity in terms distinguishing it from each of the others of said devices, some of the devices of the group including memory and a status register, requests for service from attached devices being ORed to the central processor, the central processor being arranged on power up and system reset to initialize and determine the function and location of the currently attached devices, the central processor including a memory accessing facility for accessing memory in terms of a fixed size address space and a register accessing facility for accessing individual registers in attached devices using register addresses which are independent of the memory address space, characterized in that (a) the initializing facility includes means for generating a (first) list associating the individual identity of each attached device including memory with the register address of the status register of that device; (b) the central processor is arranged to respond to a request for service by accessing the list and by indexing through the list, examining the status of each listed device in turn to determine if the currently examined device requested service and, if so, broadcasting the identity of that device followed by one or more memory addresses; and (c) each device having memory also including means for comparing each brodcast identity with the identity of the device and, on detecting equality, to latch the associated memory enabled to the exclusion of all of the others of said devices until the first detected inequality, and in that (d) the enabled device appears as a single entity to the central processor and occupies a single window in the address space which is common to all of said devices but used by them only one at a time.
Claim 6
Dependent Claim 320 words
Data processing apparatus having a central processor connected to a plurality of ports to any or all of which may be attached a selection from a group of compatible devices, each incorporating means signifying its individual identity in terms distinguishing it from each of the others of said devices, some of the devices of the group including memory and a status register, requests for service from attached devices being ORed to the central processor, the central processor being arranged on power up and system reset to initialize and determine the function and location of the currently attached devices, the central processor including a memory accessing facility for accessing memory in terms of a fixed size address space and a register accessing facility for accessing individual registers in attached devices using register addresses which are independent of the memory address space, characterized in that (a) the initializing facility includes means for generating a (first) list associating the individual identity of each attached device including memory with the register address of the status register of that device; (b) the central processor is arranged to respond to a request for service by accessing the list and by indexing through the list, examining the status of each listed device in turn to determine if the currently examined device requested service and, if so, broadcasting the identity of that device followed by one or more memory addresses; and (c) each device having memory also including means for comparing each brodcast identity with the identity of the device and, on detecting equality, to latch the associated memory enabled to the exclusion of all of the others of said devices until the first detected inequality, and in that (d) the enabled device appears as a single entity to the central processor and occupies a single window in the address space which is common to all of said devices but used by them only one at a time.
Claim 7
Dependent Claim 96 words
Apparatus as claimed in claim 4 wherein some of the devices of the group which include memory have stored therein, independent of powering up and system reset, routines defining system functions which are identifiable in terms of system function, the initializing facility including means for generating a second list associating each device providing system function with the individual identity of the providing device, the central processing unit obtaining any one of the listed system functions by accessing the second list by system function and broadcasting the associated device identity followed by one or more memory addresses.
Claim 8
Dependent Claim 31 words
Apparatus as claimed in claim 4 or claim 5 wherein the initializing facility is arranged to retain the generated list or lists in writable memory on one of the attached devices.
Claim 9
Independent Claim 210 words
A system comprising a processor, addressing means defining a finite memory address space, and a plurality of modules connectable into one common segment of said address space for access by said processor, each of said modules having address decoding means responsive to address in said common segment of said address space, at least one of said addresses being decodable by said decoding means of more then one of said modules, each of said modules having an identification indicium which is different from that of any of the other of said plurality of modules said decoding means of which is responsive to a same address, each of said modules having an identifier register writable by said processor for receiving identifier data broadcast to all of said plurality of modules by said processor, and each of said modules having comparison means sensitive to the contents of its said identifier register and operative upon and during a predetermined relationship of the contents of said register to the indicium of the module to enable that module to respond to a predetermined set of addresses comprising said one common segment so long as that module is enabled and to the exclusion of all other modules of said plurality of modules having a different identification indicium.
Claim 10
Independent Claim 210 words
A system comprising a processor, addressing means defining a finite memory address space, and a plurality of modules connectable into one common segment of said address space for access by said processor, each of said modules having address decoding means responsive to address in said common segment of said address space, at least one of said addresses being decodable by said decoding means of more then one of said modules, each of said modules having an identification indicium which is different from that of any of the other of said plurality of modules said decoding means of which is responsive to a same address, each of said modules having an identifier register writable by said processor for receiving identifier data broadcast to all of said plurality of modules by said processor, and each of said modules having comparison means sensitive to the contents of its said identifier register and operative upon and during a predetermined relationship of the contents of said register to the indicium of the module to enable that module to respond to a predetermined set of addresses comprising said one common segment so long as that module is enabled and to the exclusion of all other modules of said plurality of modules having a different identification indicium.

References Cited (Backward Citations)

US4268901A Cited
US4027108A Cited
US4253144A Cited
US4373181A Cited
US4356475A Cited
US4562535A Cited
US4626634A Cited
US4713834A Cited
US4563736A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1991-11-22 1992-05-23 1992-11-22 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1995-11-22 1996-05-23 1996-11-22 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1999-11-22 2000-05-23 2000-11-22 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag