The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Jan. 23, 1990
Filed:
Nov. 24, 1986
Michael P Nolan, Elk Grove, IL (US);
Motorola Inc., Schaumburg, IL (US);
Abstract
A system (10) for scheduling serial message transmission on a single bus (11) having a plurality of messages to be sent stored in memory (21) with each message located between associated start and end message addresses (START, END). A message list or queue (28) of the messages to be sent is formed and stored in memory (22) wherein the list comprises message pointer blocks (27) associated with each of the messages. Each pointer block includes at least the message start and end addresses, the message unique ID code (MID), the message priority (PRI), the address of the message pointer block associated with the next message to be sent (NEXT) and the address of the message pointer block associated with the previous message to be sent (PREV). A message transmission apparatus (16, 17, 18, 19) then sequentially serially transmits the messages on the bus in accordance with the message transmission order specified in the message list. New messages are scheduled for transmission by appropriately linking a new message pointer block to the lift, and previously sent messages are rescheduled for retransmission by delinking the previous message pointer block and relinking it further down the list. The system eliminates the need for storing sent messages in buffer memory in the event a message is improperly sent and must be resent, and no movement of actual messages in memory is required to alter the message transmission sequence since this is accomplished by just appropriately relinking message pointer blocks in the list.