Data transmission optimizer, including programmable symbol code point sorting feature

• US 4,937,739 A
• Filed: 07/27/1988
• Issued: 06/26/1990
• Est. Priority Date: 07/27/1988
• Status: Expired due to Term

• Current Assignee: BMC Software Incorporated (KKR & Co., Inc.)
• Original Assignee: BMC Software Incorporated (KKR & Co., Inc.)
• Inventors: Ernst, Theodore R., Harper, Thomas A.
• Primary Examiner(s): Anderson, Lawrence E.
• Application Number:
  US07/224,895
• Time in Patent Office: 699 Days
• Field of Search: 364/200, 364/900, 364/521
• US Class Current: 712/300
• CPC Class Codes: G06F 16/258 Data format conversion from or to a database
• CPC Class Codes: G06F 3/1415 with means for detecting differences between the image stored in the host and the images displayed on the displays
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching

Abstract

A mapping-type data signal optimizer performs a code-point sorting function to optimize downloading of programmed symbols. A present-state list of values of programmed symbols already downloaded to a peripheral device is sorted, and a similar intended-state list of programmed symbols intended to be downloaded is likewise sorted. A search is performed to detect any commonalities that might exist between the present-state and intended-state programmed-symbol values, even under differing programmed-symbol designators. When such a commonality is detected, the intended- state designator is altered to be equal to the present-state designator; thus, that particular programmed symbol value need not be redownloaded.

Claims

1. A method for optimizing a process of downloading a plurality of programmable symbols, each having a binary value, to respective slots in a symbol buffer of a peripheral unit, each said slot identified by a unique address designator, said method comprising the steps of:

(a) generating a present-state map of the contents of said slots and an updated-state map of said contents as are expected to exist after said downloading, each said map being logically divided into slots corresponding to the said slots in the peripheral unit;

(b) searching said present-state map and said updated-state map for a particular binary value that is assigned to a slot having a first address designator in said present-state map and that is likewise assigned to a slot having a second address designator, different from the first address designator, in the updated-state map;

(c) replacing said second address designator in said the updated-state map with said first address designator; and

(d) performing a process of downloading programmable symbols that does no include downloading of said particular binary value.