Browse Prior Art Database

Algorithm for Identifying Concentrator Resources

IP.com Disclosure Number: IPCOM000077322D
Original Publication Date: 1972-Jul-01
Included in the Prior Art Database: 2005-Feb-25
Document File: 3 page(s) / 71K

Publishing Venue

IBM

Related People

Scott, R: AUTHOR

Abstract

This described is a system for assigning ID numbers to the resources of a system of concentrator units, and also describes a scheme for determining which resource is associated with a particular ID number. The concentrators of a system will be considered as local ones connected directly to a CPU, first level remotes connected to a local and second level remotes connected to a first level remote.

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 53% of the total text.

Page 1 of 3

Algorithm for Identifying Concentrator Resources

This described is a system for assigning ID numbers to the resources of a system of concentrator units, and also describes a scheme for determining which resource is associated with a particular ID number. The concentrators of a system will be considered as local ones connected directly to a CPU, first level remotes connected to a local and second level remotes connected to a first level remote.

The scheme for assigning ID numbers to the resources is as follows:

A number "b" is selected to be equal to or greater than the largest concentrator number obtained by summing for each first level remote, the number identifying the trunk line out of the local concentrator with the product of the whole number of first level remotes and the number of second level remotes on the first level remote being considered. Preferably, b will be selected as the next higher power of two to reduce division operations to register shift operations.

Then, resources attached directly to the local concentrator will be given ID numbers Which are multiples (including the zero multiple) of b, i.e. ID=b(n) where n+0, 1. 2---.

Resources attached directly to the first level multiples are given ID numbers equal to the b multiples above, plus the number of the trunk line connecting its first level remote to the local concentrator, i. e. ID=b(n)+TL (Trunk Line Number).

Resources connected to second level concentrators are given ID's equal to the TL for its first level concentrator, plus the product of the number of first level concentrators (FL) times the number of the branch line (BL) connecting its second level remote to its first level remote or ID=b(n)+TL+(FL)(BL).

In the diagram, a CPU 1 is connected over a line 2 to a local concentrator 3. Local 3 is connected via trunk lines I, II---VII to first level remotes 4, 5, 6, 7, 8, 9 and 10, respectively. Each first level remote is shown as controlling three second level remotes numbered 11 to 31 by three branch lines 4(1), 4(2), 4(3), etc. to 10(3). Each second level remote 11 to 31 is shown as having a plurality, usually three or four, of extension lines to separate system resources. In accordance with the numbering scheme set out, there are 21 second level remotes, seven first level remotes and one local concentrator for a total of 29 units so B is selected as the next higher power of 2 or 32. Therefore, the services connected directly to local concentrator 3 will be given ID's accordingly to the formula ID=32(n)+0 or 0, 32, 64, etc. The services connected directly to the first level remotes will have ID's of the sequences 32(n)+TL or ID's of 1, 33, 65, etc. for the services on the first level concentrator on tru...