Method for identifying and communicating with a plurality of slaves in a master-slave system

• US 20020049822A1
• Filed: 05/02/2001
• Published: 04/25/2002
• Est. Priority Date: 10/25/2000
• Status: Active Grant

• Current Assignee: Georg Fischer Signet, LLC (Georg Fischer AG)
• Original Assignee: George Fischer Signet, Inc.
• Inventors: Zhou, Albert Hai, Yates, Ronald John, Burkhardt, Gert H., Trommler, Craig Stephen
• Granted Patent: US 6,854,053 B2
• Time in Patent Office: Days
• US Class Current: 709/208
• CPC Class Codes: G06F 15/17 using an input/output type connection, e.g. channel, I/O port

Abstract

A method of identifying a plurality of slave processors using a master processor is provided which includes assigning a unique identification code to each of the plurality of slave processors, and transmitting an attention command from the master processor to the plurality of slave processors. The master processor then transmits a request for the slaves'"'"' unique identification code to the plurality of slave processors. The master processor then determines whether one of the plurality of slave processors unique identification code matches the classification characters. If there are no matches, a last added classification character is incremented by 1. If only one matches, the master processor identifies the one of the plurality of slave processors, and removes a last added classification character. Otherwise, if more than one matches, the master processor adds a new classification character, and sets a last added classification character to a minimum identification code character value.

Claims

1. A method of identifying a plurality of slave processors using a master processor, comprising:

assigning a unique identification code to each of the plurality of slave processors;

transmitting a first attention command from the master processor to the plurality of slave processors;

transmitting a request for data from the master processor to the plurality of slave processors, the request for data includes a second attention command, a request slave identity command, and one or more classification characters;

determining whether one of the plurality of slave processors unique identification code matches the classification characters;

if no matches,

incrementing a last added classification character,

if only one matches,

identifying one of the plurality of slave processors, and

removing a last added classification character;

if more than one matches,

adding a new classification character, and

setting the new classification character to a minimum identification code character value; and

repeating the steps subsequent to the transmitting the first attention command until the plurality of slave processors have been identified.

2. A method as defined in claim 1, further comprising storing the identification code in a memory that is part of each of the plurality of slave processors.

3. A method as defined in claim 1, further comprising transmitting a reset command from the master processor to the plurality of slave processors to reset each of the plurality of slave processors.

4. A method as defined in claim 3, wherein the reset command is transmitted immediately after the first attention command is transmitted to the plurality of slave processors.

5. A method as defined in claim 1, wherein the request slave identity command instructs each of the plurality of slave processors to transmit its identification code to the master processor.

6. A method as defined in claim 1, further comprising requesting measurement information from one of the plurality of slave processors by transmitting a question command and the unique identification code to the plurality of slave processors.

7. A method as defined in claim 1, wherein the unique identification code is a plurality of characters.

8. A method as defined in claim 1, further comprising requesting measurement information from one of the plurality of slave processors by transmitting a question command and the unique identification code to one of the plurality of slave processors.

9. A method as defined in claim 1, wherein one of the plurality of slave processors responds to the master processor by transmitting a range value to calibrate the master processor.

10. A method as defined in claim 1, further comprising setting a counter to represent a total number of classification characters.

11. A method of assigning a short address to a plurality of slave processors using a master processor, comprising:

assigning a unique identification code to each of the plurality of slave processors;

transmitting a first attention command from the master processor to the plurality of slave processors;

transmitting a request for data from the master processor to the plurality of slave processors, the request for data includes a second attention command, a request slave identity command, and one or more classification characters;

determining whether one of the plurality of slave processors unique identification code matches the classification characters;

if no matches,

incrementing a last added classification character,

if only one matches,

assigning a short address to the one of the plurality of slave processors, and

removing a last added classification character;

if more than one matches,

adding a new classification character, and

setting the new classification character to a minimum identification code character value; and

repeating the steps subsequent to the transmitting the first attention command until the plurality of slave processors have been assigned a short address.

12. A method as defined in claim 11, further comprising storing the identification code in a memory that is part of each of the plurality of slave processors.

13. A method as defined in claim 11, further comprising transmitting a reset command from the master processor to the plurality of slave processors to reset each of the plurality of slave processors.

14. A method as defined in claim 13, wherein the reset command is transmitted immediately after the first attention command is transmitted to the plurality of slave processors.

15. A method as defined in claim 11, wherein the request slave identity command instructs each of the plurality of slave processors to transmit its identification code to the master processor.

16. A method as defined in claim 11, further comprising requesting measurement information from one of the plurality of slave processors by transmitting a question command and the short address to the plurality of slave processors.

17. A method as defined in claim 11, wherein the short address is a single printable character.

18. A method as defied in claim 11, further comprising requesting measurement information from one of the plurality of slave processors by transmitting a question command and the identification code of one of the plurality of slave processors.

19. A method as defined in claim 11, wherein one of the plurality of slave processors responds to the master processor by transmitting a range value to calibrate the master processor.

20. A method as defined in claim 11, wherein assigning the short address to the one of the plurality of slave processors includes converting the short address to a printable character.

21. A method as defined in claim 11, wherein the short address is a printable character.