CA2329419A1 - Method and apparatus for providing error correction - Google Patents
Method and apparatus for providing error correction Download PDFInfo
- Publication number
- CA2329419A1 CA2329419A1 CA002329419A CA2329419A CA2329419A1 CA 2329419 A1 CA2329419 A1 CA 2329419A1 CA 002329419 A CA002329419 A CA 002329419A CA 2329419 A CA2329419 A CA 2329419A CA 2329419 A1 CA2329419 A1 CA 2329419A1
- Authority
- CA
- Canada
- Prior art keywords
- data
- computer
- command
- sequence
- missing
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/14—Digital output to display device ; Cooperation and interconnection of the display device with other functional units
- G06F3/1454—Digital output to display device ; Cooperation and interconnection of the display device with other functional units involving copying of the display data of a local workstation or window to a remote workstation or window so that an actual copy of the data is displayed simultaneously on two or more displays, e.g. teledisplay
- G06F3/1462—Digital output to display device ; Cooperation and interconnection of the display device with other functional units involving copying of the display data of a local workstation or window to a remote workstation or window so that an actual copy of the data is displayed simultaneously on two or more displays, e.g. teledisplay with means for detecting differences between the image stored in the host and the images displayed on the remote displays
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/28—Error detection; Error correction; Monitoring by checking the correct order of processing
Abstract
The invention is directed to an error correction scheme used in a computer system where data is provided from a service to a terminal. The data is dynamically changing, and the user is interested more in a final or current state of the data than in intermediate states. Data is provided in a stream of blocks with sequential "sequence" numbers associated with each block. The invention assumes that the data provider transmits data blocks in order of sequence. The terminal tracks the sequence numbers of incoming blocks. When the terminal finds that one or more blocks have been skipped or are missing, the terminal sends a request to the central source for update data. Unlike prior art systems, which request that the missing block or blocks be re-sent, the present invention requests that the information contained in the missing command be provided, for example the current data at the display area associated with the missing block. The central source maintains the current data state of all display areas, and so sends a data block containing the requested data. In the meantime, the terminal continues to receive and display all received data blocks without waiting for the update request to be filled. This differs from many prior art schemes where display is halted until replacement data is received.
Description
METHOD AND APPARATUS
FOR PROVIDING ERROR CORRECTION
BACKGROUND OF THE INVENTION
1. FIELD OF THE INVENTION
This invention relates to the field of error correction in computer systems.
Portions of the disclosure of this patent document contain material that is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure as it appears in the Patent and Trademark Office file or records, but otherwise reserves all copyright rights whatsoever. Sun, Sun Microsystems, the Sun logo, Java, JavaBeans, HotJava and all Java-based trademarks and logos axe trademarks or registered trademarks of Sun Microsystems, Inc. in the United States and other countries.
2. BACKGROUND ART
In a computer system data is typically generated by a data source and provided to a data consumer, or terminal. In some computer systems, the data consumer is only interested in a final or current state of some data rather than the intermediate steps traversed to reach the final, or current state.
One such consumer of data is a display means for display of information to a user.
Sometimes portions of data can be lost or dropped when moving from the source to the display, resulting in an error condition. It is necessary to correct the error condition so that correct data can be displayed. Existing schemes for error correction interrupt and delay the display of data, inhibiting performance of the computer system.
In some systems, a data source causes the display of data to be effected by sending a series of commands to a display generator (in the present application, the display generator is referred to as the terminal). Each command in the series has an associated sequence number and the sequence numbers are in numerical sequence with no gaps in the numbering. When the terminal receives the commands, one of the things the terminal does is to examine the sequence numbers of each command to see if it is the expected next sequence number. If the terminal receives a command that has an out of order sequence number, there is an assumption that the commands whose sequence numbers are between the sequence number of the last received command and the sequence number of the out of order command are missing. In a typical prior art scheme, the terminal stops generating display data until the missing commands are provided.
An example of the operation of one prior art scheme is illustrated in Figure 2. Figure 2 consists of a 4 x 4 grid of pixels. This is a subset of the entire display area used for purposes of example. The grid consists of columns A, B, C, and D, and rows 1, 2, 3, and 4. Pixel locations are thus identified by their column and row number, e.g. pixel B-2 is the second pixel in the second row, pixel C-4 is the third pixel in the fourth row, and so on.
Consider the situation where the display area is all one color, and it is desired to change the display to a second color. In Figure 2 at time T0, all of the pixels are one color, as shown by the "R" in each grid box. A series of commands are received from a source that is writing to that particular display area. The description assumes one command for each pixel for purposes of the example, but in reality, a single command could initiate the drawing of multiple pixels. The commands in the example of Figure 2 are to change each pixel to the color blue. At time T1, assume that the terminal has received commands with the following sequence numbers, C-1, C-2, C-3, C-4, C-5, C-7, C-8, C-9, C-10, C-11, C-12, C-13, C-14, C-15, and C-16. In other words, command sequence number C-6 is missing.
In the prior art, the commands of the correctly received commands C-1 through C-5 are executed so the display appears as is shown at time Tl.
However, when the next command sequence number C-7 appears, the prior art system stops to request that the missing command be re-sent by the source.
Even though the subsequent commands C-7 through C-16 are available, the prior art system does not execute the commands, so that the display remains only partially updated. The display thus remains at time T2 the same as at time T1. Finally, at time T3, the terminal has received the missing block C-6 and executes the commands for C-6 and previously received commands C-7 through C-16 so that the display new displays all blue pixels as at time T3 of Figure 2.
In operation, the error correction scheme of the example of Figure 2 causes noticeable delays and hesitation in the display of data. To a user, it appears as if the computer is slow or temporarily inoperative. Such an experience is undesirable.
Another example of how the prior art error correction scheme causes unnecessary delay is illustrated in Figure 3. In this example, the pixels are being changed from red to blue to green. At time T0, all of the pixels are red.
The terminal then receives commands to change the pixels to blue, followed WO 99!54802 PCT/US99l08b46 by commands to change the pixels to green. As in the example of Figure 2, command sequence number C-6 is missing, so that at time T1, the display has only changed the first row of pixels from red to blue, and the first pixel on the second row. The remaining pixels remain red. Again the terminal requests the missing data sequence block. Meanwhile, commands C-17 through C-32 have been received with commands to turn the pixels from blue to green.
However, because the terminal is still waiting for the missing command block, the display remains at time T2 as it did at time Tl.
When the missing block is received, the terminal continues to execute the commands in order, so that at time T3, all pixels are changed to blue pixels. Finally, at time T4, the terminal has executed commands C-17 through C-32 and has changed the pixels from blue to green. A disadvantage of the "stop and waif" system of the prior art is that updating the display comes to a halt while the terminal requests data from the source. To a user, it can appear that the display has "frozen" or that there is a buffering of response to user commands. This limits the user experience and prevents it from being a substantially instantaneous interaction.
SUMMARY OF THE INVENTION
The invention is directed to an error correction scheme used in a computer system where data is provided from a central source to a terminal.
FOR PROVIDING ERROR CORRECTION
BACKGROUND OF THE INVENTION
1. FIELD OF THE INVENTION
This invention relates to the field of error correction in computer systems.
Portions of the disclosure of this patent document contain material that is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure as it appears in the Patent and Trademark Office file or records, but otherwise reserves all copyright rights whatsoever. Sun, Sun Microsystems, the Sun logo, Java, JavaBeans, HotJava and all Java-based trademarks and logos axe trademarks or registered trademarks of Sun Microsystems, Inc. in the United States and other countries.
2. BACKGROUND ART
In a computer system data is typically generated by a data source and provided to a data consumer, or terminal. In some computer systems, the data consumer is only interested in a final or current state of some data rather than the intermediate steps traversed to reach the final, or current state.
One such consumer of data is a display means for display of information to a user.
Sometimes portions of data can be lost or dropped when moving from the source to the display, resulting in an error condition. It is necessary to correct the error condition so that correct data can be displayed. Existing schemes for error correction interrupt and delay the display of data, inhibiting performance of the computer system.
In some systems, a data source causes the display of data to be effected by sending a series of commands to a display generator (in the present application, the display generator is referred to as the terminal). Each command in the series has an associated sequence number and the sequence numbers are in numerical sequence with no gaps in the numbering. When the terminal receives the commands, one of the things the terminal does is to examine the sequence numbers of each command to see if it is the expected next sequence number. If the terminal receives a command that has an out of order sequence number, there is an assumption that the commands whose sequence numbers are between the sequence number of the last received command and the sequence number of the out of order command are missing. In a typical prior art scheme, the terminal stops generating display data until the missing commands are provided.
An example of the operation of one prior art scheme is illustrated in Figure 2. Figure 2 consists of a 4 x 4 grid of pixels. This is a subset of the entire display area used for purposes of example. The grid consists of columns A, B, C, and D, and rows 1, 2, 3, and 4. Pixel locations are thus identified by their column and row number, e.g. pixel B-2 is the second pixel in the second row, pixel C-4 is the third pixel in the fourth row, and so on.
Consider the situation where the display area is all one color, and it is desired to change the display to a second color. In Figure 2 at time T0, all of the pixels are one color, as shown by the "R" in each grid box. A series of commands are received from a source that is writing to that particular display area. The description assumes one command for each pixel for purposes of the example, but in reality, a single command could initiate the drawing of multiple pixels. The commands in the example of Figure 2 are to change each pixel to the color blue. At time T1, assume that the terminal has received commands with the following sequence numbers, C-1, C-2, C-3, C-4, C-5, C-7, C-8, C-9, C-10, C-11, C-12, C-13, C-14, C-15, and C-16. In other words, command sequence number C-6 is missing.
In the prior art, the commands of the correctly received commands C-1 through C-5 are executed so the display appears as is shown at time Tl.
However, when the next command sequence number C-7 appears, the prior art system stops to request that the missing command be re-sent by the source.
Even though the subsequent commands C-7 through C-16 are available, the prior art system does not execute the commands, so that the display remains only partially updated. The display thus remains at time T2 the same as at time T1. Finally, at time T3, the terminal has received the missing block C-6 and executes the commands for C-6 and previously received commands C-7 through C-16 so that the display new displays all blue pixels as at time T3 of Figure 2.
In operation, the error correction scheme of the example of Figure 2 causes noticeable delays and hesitation in the display of data. To a user, it appears as if the computer is slow or temporarily inoperative. Such an experience is undesirable.
Another example of how the prior art error correction scheme causes unnecessary delay is illustrated in Figure 3. In this example, the pixels are being changed from red to blue to green. At time T0, all of the pixels are red.
The terminal then receives commands to change the pixels to blue, followed WO 99!54802 PCT/US99l08b46 by commands to change the pixels to green. As in the example of Figure 2, command sequence number C-6 is missing, so that at time T1, the display has only changed the first row of pixels from red to blue, and the first pixel on the second row. The remaining pixels remain red. Again the terminal requests the missing data sequence block. Meanwhile, commands C-17 through C-32 have been received with commands to turn the pixels from blue to green.
However, because the terminal is still waiting for the missing command block, the display remains at time T2 as it did at time Tl.
When the missing block is received, the terminal continues to execute the commands in order, so that at time T3, all pixels are changed to blue pixels. Finally, at time T4, the terminal has executed commands C-17 through C-32 and has changed the pixels from blue to green. A disadvantage of the "stop and waif" system of the prior art is that updating the display comes to a halt while the terminal requests data from the source. To a user, it can appear that the display has "frozen" or that there is a buffering of response to user commands. This limits the user experience and prevents it from being a substantially instantaneous interaction.
SUMMARY OF THE INVENTION
The invention is directed to an error correction scheme used in a computer system where data is provided from a central source to a terminal.
5 The data is dynamically changing, and the user is interested more in a final or current state of the data than in intermediate states. Data is provided in a stream of blocks with sequential "sequence'.' numbers associated with each block. The invention assumes that the data provider transmits data blocks in order of sequence. The terminal tracks the sequence numbers of incoming blocks. When the terminal finds that one or more blocks have been skipped or are missing, the terminal sends a request to the central source for update data. Unlike prior art systems, which request that the missing block or blocks be re-sent, the present invention requests that the information contained in the missing command be provided, for example the current data at the display area associated with the missing block. The central source maintains the current data state of all display areas, and so sends a data block containing the requested data. In the meantime, the terminal continues to receive and display all received data blocks without waiting for the update request to be filled. This differs from many prior art schemes where display is halted until replacement data is received.
BRIEF DESCRIPTION OF THE DRAWINGS
Figure 1 is a block diagram of an example computer system that can be used with the present invention.
Figure 2 illustrates one example of prior art correction and display of data.
Figure 3 illustrates another example of prior art correction and display of data.
Figure 4 illustrates an example of the correction and display of data using the present invention.
Figure 5 illustrates another example of the correction and display of data using the present invention.
Figure 6 is a block diagram of a computer system that can be used with the present invention.
Figure 7 is a flow diagram illustrating the operation of a terminal of the present invention.
Figure 8 is a flow diagram illustrating the operation of a service of the present invention.
Figure 9 is a block diagram of an HID device.
Figure 1 is a block diagram of an example computer system that can be used with the present invention.
Figure 2 illustrates one example of prior art correction and display of data.
Figure 3 illustrates another example of prior art correction and display of data.
Figure 4 illustrates an example of the correction and display of data using the present invention.
Figure 5 illustrates another example of the correction and display of data using the present invention.
Figure 6 is a block diagram of a computer system that can be used with the present invention.
Figure 7 is a flow diagram illustrating the operation of a terminal of the present invention.
Figure 8 is a flow diagram illustrating the operation of a service of the present invention.
Figure 9 is a block diagram of an HID device.
DETAILED DESCRIPTION OF THE INVENTION
The invention is a method and apparatus for providing error correction. In the following description, numerous specific details are set forth to provide a more thorough description of embodiments of the invention. It will be apparent, however, to one skilled in the art, that the invention may be practiced without these specific details. In other instances, well known features have not been described in detail so as not to obscure the invention.
The invention is applied to a computer system consisting of one or more data sources, referred to herein as data services, communicating data to one or more terminals. For purposes of this invention, the interaction between a single service and a single terminal will be used as an example.
Although the present invention is described in terms of a display terminal, it will be apparent to one skilled in the art that the invention may be applied in other situations where only the final or current state is desired at the data consumer.
The service in the invention sends commands to the terminal to cause display data to be produced on the terminal display. These commands may consist of display data and display address locations, or any other suitable data to cause a terminal to draw display data. In the invention, these commands are sent to the terminal as a series of data blocks. Using well known techniques, each data block that a service sends has an associated sequence number. The system constrains the service to send the blocks in correct order, that is, so that the numbers of the transmitted blocks are in sequential order.
The invention is a method and apparatus for providing error correction. In the following description, numerous specific details are set forth to provide a more thorough description of embodiments of the invention. It will be apparent, however, to one skilled in the art, that the invention may be practiced without these specific details. In other instances, well known features have not been described in detail so as not to obscure the invention.
The invention is applied to a computer system consisting of one or more data sources, referred to herein as data services, communicating data to one or more terminals. For purposes of this invention, the interaction between a single service and a single terminal will be used as an example.
Although the present invention is described in terms of a display terminal, it will be apparent to one skilled in the art that the invention may be applied in other situations where only the final or current state is desired at the data consumer.
The service in the invention sends commands to the terminal to cause display data to be produced on the terminal display. These commands may consist of display data and display address locations, or any other suitable data to cause a terminal to draw display data. In the invention, these commands are sent to the terminal as a series of data blocks. Using well known techniques, each data block that a service sends has an associated sequence number. The system constrains the service to send the blocks in correct order, that is, so that the numbers of the transmitted blocks are in sequential order.
The terminal receives data blocks and follows the commands contained therein to generate a display. Each data block contains one or more commands that instruct the terminal to draw at an associated location on the terminal display. At the same time, the service maintains a "true" copy of the display in memory. (This may be a virtual buffer or an actual physical buffer). The true copy is a current display image and is updated at the service end so that it corresponds to any instructions being transmitted to the terminal. That is, the true copy should be identical to the image displayed at the terminal, assuming all of the commands from the service to the terminal have been correctly received and executed at the terminal.
The terminal tracks the sequence numbers of incoming data. When a gap appears in the sequence, the terminal sends a request for the current data associated with the display location of that sequence block to the service.
The terminal also keeps a "checklist" of the sequence block that was unavailable.
When the service sends a new block of data that represents the current state of the display area whose sequence block had been missing, the service informs the terminal that the terminal is now up to date at that location. In some cases, the service may already have provided the current data for the display location in a subsequent block but prior to receiving the notice of the missing sequence block. In that case, the service informs the terminal that the terminal has already received the current display data.
When the terminal has received the current display data associated with a display area of a missing sequence block, or when the terminal has been informed that it has already received the current data, it can update its checklist and remove the reference to that display area. The terminal periodically checks its checklist and sends repeat requests for entries for which the terminal has not received current display data.
The terminal tracks the sequence numbers of incoming data. When a gap appears in the sequence, the terminal sends a request for the current data associated with the display location of that sequence block to the service.
The terminal also keeps a "checklist" of the sequence block that was unavailable.
When the service sends a new block of data that represents the current state of the display area whose sequence block had been missing, the service informs the terminal that the terminal is now up to date at that location. In some cases, the service may already have provided the current data for the display location in a subsequent block but prior to receiving the notice of the missing sequence block. In that case, the service informs the terminal that the terminal has already received the current display data.
When the terminal has received the current display data associated with a display area of a missing sequence block, or when the terminal has been informed that it has already received the current data, it can update its checklist and remove the reference to that display area. The terminal periodically checks its checklist and sends repeat requests for entries for which the terminal has not received current display data.
In the present invention, it should be noted that the request for error correction is not a request to re-send the sequence block of data that was not received. Rather, the request for error correction is to send the data that should be currently displayed at the display location associated with the missing sequence block.
The present invention operates on an assumption that it is preferable to continue to update a display quickly, even though some data may be temporarily incorrect, than to intermittently update a display with completely correct data. The invention has particular application in situations where display data is dynamic, but a current state or final state is considered of greater interest than any intermediate states. In addition, the invention assumes that small errors are likely to be undetected or undetectable by a human user of a terminal. An error in one or a few pixels is not likely to be noticed by a human user, as long as the majority of the display is performing as expected. The invention also works in any system where a user is interested in the most recent snapshot of state and which the recipient user will not return, that is, a system that is read only. For example, stock quote services are read only services where the current state information is of most interest. The system provides a scheme where the most recent information is sent when there is an error.
The operation of the present invention can be seen by reference to Figures 4 and 5. These present two cases of operation similar to those presented in the example of Figures 2 and 3. In the first case of Figure 4, all of the pixels in a region are changed from red to blue, but one command block is lost. In the second case of Figure 5, all of the pixels in a region are changed from red to blue to green, but a command for changing one pixel from red to blue is lost.
Referring first to Figure 4, at time TO all of the pixels are red. The terminal then receives commands C-1 through C-5 to change the pixels of the first row and the first pixel of the second row to blue. Command C-6 is missing. The terminal notes in a status area that command C-6 is missing 5 and sends a request for the current data corresponding to the display area associated with command C-6. However, the terminal continues executing subsequently received commands C-7 through C-16. As a result the display appears as at time Tl, with all of the pixels changed to blue except at location B2. A single pixel is a relatively small area for the human eye to detect, so 10 that the user may not even notice that a part of the display has not been updated. In many cases, the missing data may be in an area that is not uniform, making it even more difficult to notice that a small region has not been updated. Because of this, the user is provided with continuous updates (although not necessarily complete) sufficient to provide a satisfactory experience.
When the service receives the request from the terminal, the service checks its true copy of the display area associated with the missing sequence block. In this case the service determines that the pixel has been changed from red to blue so the service sends a command to the terminal to change that pixel to blue. The terminal executes the command so that the display appears as at time T2, with all pixels now blue.
Another illustrative example is that of Figure 5. This example perhaps more closely approximates typical display update problems when the display is more dynamic. At time TO all pixels are red. The terminal then receives commands C-1 through C-5 and changes the appropriate pixels to blue. Again the terminal detects an out of sequence command when it receives command C-7, so the terminal sends a request for correction for command C-6.
The present invention operates on an assumption that it is preferable to continue to update a display quickly, even though some data may be temporarily incorrect, than to intermittently update a display with completely correct data. The invention has particular application in situations where display data is dynamic, but a current state or final state is considered of greater interest than any intermediate states. In addition, the invention assumes that small errors are likely to be undetected or undetectable by a human user of a terminal. An error in one or a few pixels is not likely to be noticed by a human user, as long as the majority of the display is performing as expected. The invention also works in any system where a user is interested in the most recent snapshot of state and which the recipient user will not return, that is, a system that is read only. For example, stock quote services are read only services where the current state information is of most interest. The system provides a scheme where the most recent information is sent when there is an error.
The operation of the present invention can be seen by reference to Figures 4 and 5. These present two cases of operation similar to those presented in the example of Figures 2 and 3. In the first case of Figure 4, all of the pixels in a region are changed from red to blue, but one command block is lost. In the second case of Figure 5, all of the pixels in a region are changed from red to blue to green, but a command for changing one pixel from red to blue is lost.
Referring first to Figure 4, at time TO all of the pixels are red. The terminal then receives commands C-1 through C-5 to change the pixels of the first row and the first pixel of the second row to blue. Command C-6 is missing. The terminal notes in a status area that command C-6 is missing 5 and sends a request for the current data corresponding to the display area associated with command C-6. However, the terminal continues executing subsequently received commands C-7 through C-16. As a result the display appears as at time Tl, with all of the pixels changed to blue except at location B2. A single pixel is a relatively small area for the human eye to detect, so 10 that the user may not even notice that a part of the display has not been updated. In many cases, the missing data may be in an area that is not uniform, making it even more difficult to notice that a small region has not been updated. Because of this, the user is provided with continuous updates (although not necessarily complete) sufficient to provide a satisfactory experience.
When the service receives the request from the terminal, the service checks its true copy of the display area associated with the missing sequence block. In this case the service determines that the pixel has been changed from red to blue so the service sends a command to the terminal to change that pixel to blue. The terminal executes the command so that the display appears as at time T2, with all pixels now blue.
Another illustrative example is that of Figure 5. This example perhaps more closely approximates typical display update problems when the display is more dynamic. At time TO all pixels are red. The terminal then receives commands C-1 through C-5 and changes the appropriate pixels to blue. Again the terminal detects an out of sequence command when it receives command C-7, so the terminal sends a request for correction for command C-6.
However, the terminal continues executing commands C-7 through C-16, changing the remainder of the second row of pixels, and all of the third and fourth rows of pixels from red to blue so that the display appears as at time T1. Meanwhile, before the service has responded to the request for correction, commands C-17 through C-32 have been forwarded to the terminal, with commands to change the pixels to green. Even while waiting for the response to the request for correction, the terminal continues to execute all "in sequence" commands and changes all pixels to green. After execution of those commands, the display appears as at time T2 of Figure 5.
Thus, using the present scheme, the display is accurate even though there has as yet been no response to the request for correction. When the service receives the request for correction, the service informs the terminal that the terminal has already received the current data for that location.
(Alternatively, the service can re-send the current data for that display location). The terminal then removes the request from its checklist.
A flow diagram of the operation of the error correction scheme of the present invention is illustrated in Figure 7. At step 701 the terminal receives a command. At decision block 702 the argument "Correct sequence?" is made. If the argument is false, meaning the sequence number of the received command was not the next expected sequence number, the terminal proceeds to step 703. At step 703 the terminal sends a request for correction to the service. At step 704 the terminal adds an entry to a checklist for the missing command. The terminal then returns to step 701 to await the next command, incrementing a count of the sequence number so it can compare the next received command to its expected sequence number.
If the argument at decision block 702 is true, meaning that the command has the expected next sequence number, the terminal proceeds to WO 99/54802 PCTlUS99/08646 step 705 and executes the command. After execution of the command, the terminal proceeds to decision block 706. At decision block 706 the argument "Does command clear checklist entry?" is made. This is to determine if the command was in response to an earlier request for correction. If the argument is false, the terminal proceeds to decision block 708. If the argument is true, the terminal clears the appropriate entry from the checklist at step 707. In one embodiment, the invention clears all checklist entries up to a particular sequence number. The service informs the terminal that all errors up to that sequence number have been, or will be, repaired.
At decision block 708 the argument "Time to status checklist entry?" is made. This test is to determine if any of the entries in the checklist are old enough that a status check should be made. If the argument at decision block 708 is false, the terminal returns to step 701. If the argument is true, the terminal sends a status request for the appropriate checklist entry or entries to the service at step 709 and returns to step 701. It should be noted that the activity of steps 708 and 709 can be a separate interrupt driven or periodic process.
A flow diagram of the operation of a service in the present invention is illustrated in Figure 8. Two processes are described in Figure 8, a command assembly process, and an error correction process. At step 801, the service assembles a command to be transmitted to a terminal. At step 802, the sequence number is incremented and associated with the command. At step 803 the command and sequence number are transmitted to the terminal. At step 804, the local true copy of the display that is maintained by the service is updated. This true copy may be maintained in a physical buffer, a virtual buffer, or in mass storage.
Thus, using the present scheme, the display is accurate even though there has as yet been no response to the request for correction. When the service receives the request for correction, the service informs the terminal that the terminal has already received the current data for that location.
(Alternatively, the service can re-send the current data for that display location). The terminal then removes the request from its checklist.
A flow diagram of the operation of the error correction scheme of the present invention is illustrated in Figure 7. At step 701 the terminal receives a command. At decision block 702 the argument "Correct sequence?" is made. If the argument is false, meaning the sequence number of the received command was not the next expected sequence number, the terminal proceeds to step 703. At step 703 the terminal sends a request for correction to the service. At step 704 the terminal adds an entry to a checklist for the missing command. The terminal then returns to step 701 to await the next command, incrementing a count of the sequence number so it can compare the next received command to its expected sequence number.
If the argument at decision block 702 is true, meaning that the command has the expected next sequence number, the terminal proceeds to WO 99/54802 PCTlUS99/08646 step 705 and executes the command. After execution of the command, the terminal proceeds to decision block 706. At decision block 706 the argument "Does command clear checklist entry?" is made. This is to determine if the command was in response to an earlier request for correction. If the argument is false, the terminal proceeds to decision block 708. If the argument is true, the terminal clears the appropriate entry from the checklist at step 707. In one embodiment, the invention clears all checklist entries up to a particular sequence number. The service informs the terminal that all errors up to that sequence number have been, or will be, repaired.
At decision block 708 the argument "Time to status checklist entry?" is made. This test is to determine if any of the entries in the checklist are old enough that a status check should be made. If the argument at decision block 708 is false, the terminal returns to step 701. If the argument is true, the terminal sends a status request for the appropriate checklist entry or entries to the service at step 709 and returns to step 701. It should be noted that the activity of steps 708 and 709 can be a separate interrupt driven or periodic process.
A flow diagram of the operation of a service in the present invention is illustrated in Figure 8. Two processes are described in Figure 8, a command assembly process, and an error correction process. At step 801, the service assembles a command to be transmitted to a terminal. At step 802, the sequence number is incremented and associated with the command. At step 803 the command and sequence number are transmitted to the terminal. At step 804, the local true copy of the display that is maintained by the service is updated. This true copy may be maintained in a physical buffer, a virtual buffer, or in mass storage.
Steps 805 through 808 describe the process for dealing with error correction requests from a terminal. At step 805 the service receives a correction request from a terminal. The correction request identifies a missing sequence number or numbers. At step 806, the service determines the display region or regions that would have been affected by the missing command or commands. At step 807 the service retrieves the current data at those display regions from the true copy of the display. At step 808 service assembles a command for the requesting terminal with the current data and proceeds to step 802.
The present invention also has application in situations other than when new data is being provided by the service. For example, the terminal may be asked to copy data from one display area and paste it to another display area. Should the data to be copied be dropped or unavailable, the terminal can request the data from the service. (Note that in this "stateless"
copy situation, the terminal is not asking for the replacement of data associated with a missing sequence number command.) Embodiment of Computer Execution Environment (Hardware) An embodiment of the invention can be implemented as computer software in the form of computer readable code executed on a general purpose computer such as computer 100 illustrated in Figure 1, or in the form of bytecode class files executable within a JavaTM runtime environment running on such a computer. A keyboard 110 and mouse 111 are coupled to a bi-directional system bus 118. The keyboard and mouse are for introducing user input to the computer system and communicating that user input to processor 113. Other suitable input devices may be used in addition to, or in place of, the mouse 111 and keyboard 110. I/O (input/output) unit 119 coupled to bi-directional system bus 118 represents such I/O elements as a printer, A/V (audio/video) I/O, etc.
Computer 100 includes a video memory 114, main memory 115 and optionally, mass storage 112, all coupled to bi-directional system bus 118 along with keyboard 110, mouse 111 and processor 113. The mass storage 112, if used, may include both fixed and removable media, such as magnetic, optical or magnetic optical storage systems or any other available mass storage technology. Bus 118 may contain, for example, thirty-two address lines for addressing video memory 114 or main memory 115. The system bus 118 also includes, for example, a 32-bit data bus for transferring data between and among the components, such as processor 113, main memory 115, video memory 114 and mass storage 112. Alternatively, multiplex data/address lines may be used instead of separate data and address lines.
In one embodiment of the invention, the processor 113 is a microprocessor manufactured by Motorola, such as the 680X0 processor or a microprocessor manufactured by Intel, such as the 80X86, or Pentium processor, or a SPARCTM microprocessor from Sun MicrosystemsTM, Inc.
However, any other suitable microprocessor or microcomputer may be utilized. Main memory 115 is comprised of dynamic random access memory (DRAM). Video memory 114 is a dual-ported video random access memory.
One port of the video memory 114 is coupled to video amplifier 116. The video amplifier 116 is used to drive the cathode ray tube (CRT) raster monitor 117. Alternatively, the video memory may be used to drive a flat panel or liquid crystal display (LCD) or any other suitable data presentation device.
Video amplifier 116 is well known in the art and may be implemented by any suitable apparatus. This circuitry converts pixel data stored in video memory 114 to a raster signal suitable for use by monitor 117. Monitor 117 is a type of monitor suitable for displaying graphic images.
5 Computer 100 may also include a communication interface 120 coupled to bus 118. Communication interface 120 provides a two-way data communication coupling via a network link 121 to a local network 122. For example, if communication interface 120 is an integrated services digital network (ISDN) card or a modem, communication interface 120 provides a 10 data communication connection to the corresponding type of telephone line, which comprises part of network link 121. If communication interface 120 is a local area network (LAN) card, communication interface 120 provides a data communication connection via network link.121 to a compatible LAN.
Wireless links, modems or cable modems are also possible. In any such 15 implementation, communication interface 120 sends and receives electrical, electromagnetic or optical signals which carry digital data streams representing various types of information.
Network link 121 typically provides data communication through one or more networks to other data devices. For example, network link 121 may provide a connection through local network 122 to local server computer 123 or to data equipment operated by an Internet Service Provider (ISP) 124. ISP
124 in turn provides data communication services through the world wide packet data communication network now commonly referred to as the "Internet" 125. Local network 122 and Internet 125 both use electrical, electromagnetic or optical signals which carry digital data streams. The signals through the various networks and the signals on network Iink 121 and through communication interface 120, which carry the digital data to and WO 99/54802 PC'T/US99/08646 from computer 100, are exemplary forms of carrier waves transporting the information.
Computer 100 can send messages and receive data, including program code, through the network(s), network link 121, and communication interface 120. In the Internet example, remote server computer 126 might transmit a requested code for an application program through Internet 125, ISP 124, local network 122 and communication interface 120. In accord with the invention, one such downloaded application is the apparatus for error correction described herein.
The received code may be executed by processor 113 as it is received, and/or stored in mass storage 112, or other non-volatile storage for later execution. In this manner, computer 100 may obtain application code in the form of a carrier wave.
Application code may be embodied in any form of computer program product. A computer program product comprises a medium configured to store or transport computer readable code, or in which computer readable code may be embedded. Some examples of computer program products are CD-ROM disks, ROM cards, floppy disks, magnetic tapes, computer hard drives, servers on a network, and carrier waves.
Human Interface Device Computer System The invention also has application to a computer systems where the data to be displayed is provided through a network. The network can be a local area network, a wide area network, the Internet, world wide web, or any other suitable network configuration. One embodiment of the invention is used in computer system configuration referred to herein as a human interface device computer system.
In this system the functionality of the system is partitioned between a display and input device, and data sources or services. The display and input device is a human interface device (HID). The partitioning of this system is such that state and computation functions have been removed from the HID
and reside on data sources or services. In one embodiment of the invention, one or more services communicate with one or more HIDs through some interconnect fabric, such as a network. An example of such a system is illustrated in Figure 6. Referring to Figure 6, the system consists of computational service providers 600 communicating data through interconnect fabric 601 to HIDs 602.
C',~mputatio al Service Prwid rs - In the HID system, the computational power and state maintenance is found in the service providers, or services. The services are not tied to a specific computer, but may be distributed over one or more traditional desktop systems such as described in connection with Figure 1, or with traditional servers. One computer may have one or more services, or a service may be implemented by one or more computers. The service provides computation, state, and data to the HIDs and the service is under the control of a common authority or manager. In Figure 6, the services are found on computers 610, 611, 612, 613, and 614.
Examples of services include X11/Unix services, archived or live audio and video services, Windows NT service, )avaT"' program execution service, WO 99/54802 PCTlUS99/08646 and others. A service herein is a process that provides output data and responds to user requests and input.
Interconnection Fabric - In the invention, the interconnection fabric is any of multiple suitable communication paths for carrying data between the services and the HIDs. In one embodiment the interconnect fabric is a local area network implemented as an Ethernet network. Any other local network may also be utilized. The invention also contemplates the use of wide area networks, the Internet, the world wide web, and others. The interconnect fabric may be implemented with a physical medium such as a wire or fiber optic cable, or it may be implemented in a wireless environment.
HIDs - The HID is the means by which users access the computational services provided by the services. Figure 6 illustrates HIDs 621, 622, and 623.
A HID consists of a collection of one or more interface devices, including display 626, a keyboard 624, mouse 625, and audio speakers 627. The HID
includes the electronics need to interface these devices to the interconnection fabric and to transmit to and receive data from the services.
A block diagram of the HID is illustrated in Figure 9. The components of the HID are coupled internally to a PCI bus 912. A network control block 902 communicates to the interconnect fabric, such as an ethernet, through line 914. An audio codec 903 receives audio data on interface 916 and is coupled to block 902. USB data communication is provided on lines 913 to USB controller 901.
An embedded processor 904 rnay be, for example, a Sparc2ep with coupled flash memory 905 and DRAM 906. The USB controller 901, network controller 902 and embedded processor 904 are all coupled to the PCI bus 912.
Also coupled to the PCI 912 is the video controller 909. The video controller 909 may be for example, and ATI RagePro+ frame buffer controller that provides SVGA output on line 915. NTSC data is provided in and out of the video controller through video decoder 910 and video encoder 911 respectively. A smartcard interface 908 may also be coupled to the video controller 909.
The computer systems described above are for purposes of example only. An embodiment of the invention may be implemented in any type of computer system or programming or processing environment.
Thus a method and apparatus for error correction has been described.
The present invention also has application in situations other than when new data is being provided by the service. For example, the terminal may be asked to copy data from one display area and paste it to another display area. Should the data to be copied be dropped or unavailable, the terminal can request the data from the service. (Note that in this "stateless"
copy situation, the terminal is not asking for the replacement of data associated with a missing sequence number command.) Embodiment of Computer Execution Environment (Hardware) An embodiment of the invention can be implemented as computer software in the form of computer readable code executed on a general purpose computer such as computer 100 illustrated in Figure 1, or in the form of bytecode class files executable within a JavaTM runtime environment running on such a computer. A keyboard 110 and mouse 111 are coupled to a bi-directional system bus 118. The keyboard and mouse are for introducing user input to the computer system and communicating that user input to processor 113. Other suitable input devices may be used in addition to, or in place of, the mouse 111 and keyboard 110. I/O (input/output) unit 119 coupled to bi-directional system bus 118 represents such I/O elements as a printer, A/V (audio/video) I/O, etc.
Computer 100 includes a video memory 114, main memory 115 and optionally, mass storage 112, all coupled to bi-directional system bus 118 along with keyboard 110, mouse 111 and processor 113. The mass storage 112, if used, may include both fixed and removable media, such as magnetic, optical or magnetic optical storage systems or any other available mass storage technology. Bus 118 may contain, for example, thirty-two address lines for addressing video memory 114 or main memory 115. The system bus 118 also includes, for example, a 32-bit data bus for transferring data between and among the components, such as processor 113, main memory 115, video memory 114 and mass storage 112. Alternatively, multiplex data/address lines may be used instead of separate data and address lines.
In one embodiment of the invention, the processor 113 is a microprocessor manufactured by Motorola, such as the 680X0 processor or a microprocessor manufactured by Intel, such as the 80X86, or Pentium processor, or a SPARCTM microprocessor from Sun MicrosystemsTM, Inc.
However, any other suitable microprocessor or microcomputer may be utilized. Main memory 115 is comprised of dynamic random access memory (DRAM). Video memory 114 is a dual-ported video random access memory.
One port of the video memory 114 is coupled to video amplifier 116. The video amplifier 116 is used to drive the cathode ray tube (CRT) raster monitor 117. Alternatively, the video memory may be used to drive a flat panel or liquid crystal display (LCD) or any other suitable data presentation device.
Video amplifier 116 is well known in the art and may be implemented by any suitable apparatus. This circuitry converts pixel data stored in video memory 114 to a raster signal suitable for use by monitor 117. Monitor 117 is a type of monitor suitable for displaying graphic images.
5 Computer 100 may also include a communication interface 120 coupled to bus 118. Communication interface 120 provides a two-way data communication coupling via a network link 121 to a local network 122. For example, if communication interface 120 is an integrated services digital network (ISDN) card or a modem, communication interface 120 provides a 10 data communication connection to the corresponding type of telephone line, which comprises part of network link 121. If communication interface 120 is a local area network (LAN) card, communication interface 120 provides a data communication connection via network link.121 to a compatible LAN.
Wireless links, modems or cable modems are also possible. In any such 15 implementation, communication interface 120 sends and receives electrical, electromagnetic or optical signals which carry digital data streams representing various types of information.
Network link 121 typically provides data communication through one or more networks to other data devices. For example, network link 121 may provide a connection through local network 122 to local server computer 123 or to data equipment operated by an Internet Service Provider (ISP) 124. ISP
124 in turn provides data communication services through the world wide packet data communication network now commonly referred to as the "Internet" 125. Local network 122 and Internet 125 both use electrical, electromagnetic or optical signals which carry digital data streams. The signals through the various networks and the signals on network Iink 121 and through communication interface 120, which carry the digital data to and WO 99/54802 PC'T/US99/08646 from computer 100, are exemplary forms of carrier waves transporting the information.
Computer 100 can send messages and receive data, including program code, through the network(s), network link 121, and communication interface 120. In the Internet example, remote server computer 126 might transmit a requested code for an application program through Internet 125, ISP 124, local network 122 and communication interface 120. In accord with the invention, one such downloaded application is the apparatus for error correction described herein.
The received code may be executed by processor 113 as it is received, and/or stored in mass storage 112, or other non-volatile storage for later execution. In this manner, computer 100 may obtain application code in the form of a carrier wave.
Application code may be embodied in any form of computer program product. A computer program product comprises a medium configured to store or transport computer readable code, or in which computer readable code may be embedded. Some examples of computer program products are CD-ROM disks, ROM cards, floppy disks, magnetic tapes, computer hard drives, servers on a network, and carrier waves.
Human Interface Device Computer System The invention also has application to a computer systems where the data to be displayed is provided through a network. The network can be a local area network, a wide area network, the Internet, world wide web, or any other suitable network configuration. One embodiment of the invention is used in computer system configuration referred to herein as a human interface device computer system.
In this system the functionality of the system is partitioned between a display and input device, and data sources or services. The display and input device is a human interface device (HID). The partitioning of this system is such that state and computation functions have been removed from the HID
and reside on data sources or services. In one embodiment of the invention, one or more services communicate with one or more HIDs through some interconnect fabric, such as a network. An example of such a system is illustrated in Figure 6. Referring to Figure 6, the system consists of computational service providers 600 communicating data through interconnect fabric 601 to HIDs 602.
C',~mputatio al Service Prwid rs - In the HID system, the computational power and state maintenance is found in the service providers, or services. The services are not tied to a specific computer, but may be distributed over one or more traditional desktop systems such as described in connection with Figure 1, or with traditional servers. One computer may have one or more services, or a service may be implemented by one or more computers. The service provides computation, state, and data to the HIDs and the service is under the control of a common authority or manager. In Figure 6, the services are found on computers 610, 611, 612, 613, and 614.
Examples of services include X11/Unix services, archived or live audio and video services, Windows NT service, )avaT"' program execution service, WO 99/54802 PCTlUS99/08646 and others. A service herein is a process that provides output data and responds to user requests and input.
Interconnection Fabric - In the invention, the interconnection fabric is any of multiple suitable communication paths for carrying data between the services and the HIDs. In one embodiment the interconnect fabric is a local area network implemented as an Ethernet network. Any other local network may also be utilized. The invention also contemplates the use of wide area networks, the Internet, the world wide web, and others. The interconnect fabric may be implemented with a physical medium such as a wire or fiber optic cable, or it may be implemented in a wireless environment.
HIDs - The HID is the means by which users access the computational services provided by the services. Figure 6 illustrates HIDs 621, 622, and 623.
A HID consists of a collection of one or more interface devices, including display 626, a keyboard 624, mouse 625, and audio speakers 627. The HID
includes the electronics need to interface these devices to the interconnection fabric and to transmit to and receive data from the services.
A block diagram of the HID is illustrated in Figure 9. The components of the HID are coupled internally to a PCI bus 912. A network control block 902 communicates to the interconnect fabric, such as an ethernet, through line 914. An audio codec 903 receives audio data on interface 916 and is coupled to block 902. USB data communication is provided on lines 913 to USB controller 901.
An embedded processor 904 rnay be, for example, a Sparc2ep with coupled flash memory 905 and DRAM 906. The USB controller 901, network controller 902 and embedded processor 904 are all coupled to the PCI bus 912.
Also coupled to the PCI 912 is the video controller 909. The video controller 909 may be for example, and ATI RagePro+ frame buffer controller that provides SVGA output on line 915. NTSC data is provided in and out of the video controller through video decoder 910 and video encoder 911 respectively. A smartcard interface 908 may also be coupled to the video controller 909.
The computer systems described above are for purposes of example only. An embodiment of the invention may be implemented in any type of computer system or programming or processing environment.
Thus a method and apparatus for error correction has been described.
Claims (28)
1. A method configured to correct errors comprising [the steps of]:
obtaining a plurality of commands in a sequence, identifying a missing command, requesting data at a display location associated with said missing command.
obtaining a plurality of commands in a sequence, identifying a missing command, requesting data at a display location associated with said missing command.
2. The method of claim 1 further comprising:
adding an entry to a check-list for said missing command.
adding an entry to a check-list for said missing command.
3. The method of claim 2 further comprising:
removing an entry from said check-list when said data associated with said missing command is obtained.
removing an entry from said check-list when said data associated with said missing command is obtained.
4. The method of claim 3 further comprising:
replacing data at said display location with said data associated with said missing command.
replacing data at said display location with said data associated with said missing command.
5. The method of claim 3 further comprising:
replacing data at said display location with data obtained through the last obtained command associated with said display location.
replacing data at said display location with data obtained through the last obtained command associated with said display location.
6. The method of claim 5 further comprising:
requesting a status check for missing commands associated with entries in said check-list that are older than a threshold period.
requesting a status check for missing commands associated with entries in said check-list that are older than a threshold period.
7. The method of claim 6, wherein a command comprises a sequence number, said method further comprising:
clearing said check-list of all entries up to a particular sequence number.
clearing said check-list of all entries up to a particular sequence number.
8. The method of claim 7 further comprising:
clearing said check-list of all entries when the sequence number for a last command received is larger than a sequence number for a missing command associated with a last entry in said check-list.
clearing said check-list of all entries when the sequence number for a last command received is larger than a sequence number for a missing command associated with a last entry in said check-list.
9. The method of claim 8 wherein said check-list comprises a sequence counter and the step of identifying a missing command comprises:
identifying a command's sequence number;
comparing said sequence number with said sequence counter;
recording said sequence counter as a value for a missing command sequence, if said sequence number does not correspond to said sequence counter.
identifying a command's sequence number;
comparing said sequence number with said sequence counter;
recording said sequence counter as a value for a missing command sequence, if said sequence number does not correspond to said sequence counter.
10. The method of claim 1 wherein said obtained commands are drawing instructions and said data is display data.
11. A method configured to correct errors comprising:
obtaining a plurality of commands in a sequence;
monitoring a command obtained out of said sequence comprising:
sending a correction request for one or more missing commands, adding an entry to a check-list corresponding to said one or more missing commands;
executing a command obtained in said sequence;
clearing an entry from said check-list if said executed command corresponds to said entry.
obtaining a plurality of commands in a sequence;
monitoring a command obtained out of said sequence comprising:
sending a correction request for one or more missing commands, adding an entry to a check-list corresponding to said one or more missing commands;
executing a command obtained in said sequence;
clearing an entry from said check-list if said executed command corresponds to said entry.
12. The method of claim 11 wherein a command comprises a sequence number and the step of clearing an entry from said check-list comprises:
clearing said check-list of all entries up to a particular sequence number.
clearing said check-list of all entries up to a particular sequence number.
13. The method of claim 12 wherein said check-list comprises a sequence counter and the step of identifying a missing command comprises:
identifying a command's sequence number;
comparing said sequence number with said sequence counter;
recording said sequence counter as a value for a missing command sequence, if said sequence number does not correspond to said sequence counter.
identifying a command's sequence number;
comparing said sequence number with said sequence counter;
recording said sequence counter as a value for a missing command sequence, if said sequence number does not correspond to said sequence counter.
14. The method of claim 11 wherein said obtained commands are drawing instructions and said data is display data.
15. A computer program product comprising:
a computer usable medium having computer readable program code embodied therein configured to correct errors, said computer program product comprising:
a computer readable code configured to cause a computer to obtain a plurality of commands in a sequence;
a computer readable code configured to cause a computer to identify a missing command;
a computer readable code configured to cause a computer to request data at a display location associated with said missing command.
a computer usable medium having computer readable program code embodied therein configured to correct errors, said computer program product comprising:
a computer readable code configured to cause a computer to obtain a plurality of commands in a sequence;
a computer readable code configured to cause a computer to identify a missing command;
a computer readable code configured to cause a computer to request data at a display location associated with said missing command.
16. A computer program product of claim 15 further comprising:
a computer readable code configured to cause a computer to add an entry to a check-list for said missing command.
a computer readable code configured to cause a computer to add an entry to a check-list for said missing command.
17. A computer program product of claim 16 further comprising:
a computer readable code configured to cause a computer to remove an entry from said check-list when said data associated with said missing command is obtained.
a computer readable code configured to cause a computer to remove an entry from said check-list when said data associated with said missing command is obtained.
18. A computer program product of claim 17 further comprising:
a computer readable code configured to cause a computer to replace data at said display location with said data associated with said missing command.
a computer readable code configured to cause a computer to replace data at said display location with said data associated with said missing command.
19. A computer program product of claim 18 further comprising:
a computer readable code configured to cause a computer to replace data at said display location with data obtained through a last obtained command associated with said display location.
a computer readable code configured to cause a computer to replace data at said display location with data obtained through a last obtained command associated with said display location.
20. A computer program product of claim 19 further comprising:
a computer readable code configured to cause a computer to request a status check for missing commands associated with entries in said check-list that are older than a threshold period.
a computer readable code configured to cause a computer to request a status check for missing commands associated with entries in said check-list that are older than a threshold period.
21. A computer program product of claim 20, wherein each command comprises a sequence number, said computer program product further comprising:
a computer readable code configured to cause a computer to clear all entries in said check-list up to a particular sequence number.
a computer readable code configured to cause a computer to clear all entries in said check-list up to a particular sequence number.
22. A computer program product of claim 21 further comprising:
a computer readable code configured to cause a computer to clear said check-list of all entries when a sequence number for a last command received is larger than a sequence number for a missing command associated with a last entry in said check-list.
a computer readable code configured to cause a computer to clear said check-list of all entries when a sequence number for a last command received is larger than a sequence number for a missing command associated with a last entry in said check-list.
23. A computer program product of claim 21, wherein said check-list comprises a sequence counter, said computer program product further comprising:
a computer readable code configured to cause a computer to identify a command's sequence number;
a computer readable code configured to cause a computer to compare said sequence number with a sequence counter;
a computer readable code configured to cause a computer to record said sequence counter as a value for a missing command sequence, if said sequence number does not correspond to said sequence counter.
a computer readable code configured to cause a computer to identify a command's sequence number;
a computer readable code configured to cause a computer to compare said sequence number with a sequence counter;
a computer readable code configured to cause a computer to record said sequence counter as a value for a missing command sequence, if said sequence number does not correspond to said sequence counter.
24. A computer program product of claim 23 wherein said obtained commands are drawing instructions and said data is display data.
25. A computer program product comprising a computer usable medium having computer readable program code embodied therein configured to correct error, said computer program product comprising:
a computer readable code configured to cause a computer to obtain a plurality of commands in a sequence;
a computer readable code configured to cause a computer to monitor a command obtained out of said sequence comprising:
sending a correction request for one or more missing commands;
adding an entry to a check-list corresponding to said one or more missing commands;
a computer readable code configured to cause a computer to execute a command obtained in said sequence;
a computer readable code configured to cause a computer to clear an entry from said check-list if said executed command corresponds to said entry;
a computer readable code configured to cause a computer to obtain a plurality of commands in a sequence;
a computer readable code configured to cause a computer to monitor a command obtained out of said sequence comprising:
sending a correction request for one or more missing commands;
adding an entry to a check-list corresponding to said one or more missing commands;
a computer readable code configured to cause a computer to execute a command obtained in said sequence;
a computer readable code configured to cause a computer to clear an entry from said check-list if said executed command corresponds to said entry;
26. The computer program product of claim 25, wherein a command comprises a sequence number, said computer product further comprising a computer readable code configured to cause a computer to clear all entries of said check-list up to a particular sequence number.
27. The computer program product of claim 25, wherein said check-list comprises a sequence counter, said computer program product further comprising:
a computer readable code configured to cause a computer to identify a command's sequence number;
a computer readable code configured to cause a computer to compare said sequence number with said sequence counter;
a computer readable code configured to cause a computer to record said sequence counter as a value for a missing command sequence, if said sequence number does not correspond to said sequence counter.
a computer readable code configured to cause a computer to identify a command's sequence number;
a computer readable code configured to cause a computer to compare said sequence number with said sequence counter;
a computer readable code configured to cause a computer to record said sequence counter as a value for a missing command sequence, if said sequence number does not correspond to said sequence counter.
28. A computer program product of claim 27 wherein said obtained commands are drawing instructions and said data is display data.
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US09/063,342 | 1998-04-20 | ||
| US09/063,342 US6230296B1 (en) | 1998-04-20 | 1998-04-20 | Method and apparatus for providing error correction |
| PCT/US1999/008646 WO1999054802A2 (en) | 1998-04-20 | 1999-04-20 | Method and apparatus for providing error correction |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CA2329419A1 true CA2329419A1 (en) | 1999-10-28 |
Family
ID=22048553
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002329419A Abandoned CA2329419A1 (en) | 1998-04-20 | 1999-04-20 | Method and apparatus for providing error correction |
Country Status (8)
| Country | Link |
|---|---|
| US (1) | US6230296B1 (en) |
| EP (1) | EP1073940B1 (en) |
| JP (1) | JP3777090B2 (en) |
| AT (1) | ATE221678T1 (en) |
| AU (1) | AU751703B2 (en) |
| CA (1) | CA2329419A1 (en) |
| DE (1) | DE69902373T2 (en) |
| WO (1) | WO1999054802A2 (en) |
Families Citing this family (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6357028B1 (en) * | 1999-03-19 | 2002-03-12 | Picturetel Corporation | Error correction and concealment during data transmission |
| US6651103B1 (en) * | 1999-04-20 | 2003-11-18 | At&T Corp. | Proxy apparatus and method for streaming media information and for increasing the quality of stored media information |
| US6484212B1 (en) | 1999-04-20 | 2002-11-19 | At&T Corp. | Proxy apparatus and method for streaming media information |
| US6529525B1 (en) * | 2000-05-19 | 2003-03-04 | Motorola, Inc. | Method for supporting acknowledged transport layer protocols in GPRS/edge host application |
| JP2002116905A (en) * | 2000-10-06 | 2002-04-19 | Matsushita Electric Ind Co Ltd | Information processor |
| US7363363B2 (en) * | 2002-05-17 | 2008-04-22 | Xds, Inc. | System and method for provisioning universal stateless digital and computing services |
| US7269136B2 (en) * | 2002-08-30 | 2007-09-11 | Sun Microsystems, Inc. | Methods and apparatus for avoidance of remote display packet buffer overflow |
| US7075538B2 (en) * | 2002-08-30 | 2006-07-11 | Sun Microsystems, Inc. | Methods and apparatus for faster line drawing on remote displays |
| US20050238034A1 (en) * | 2004-04-12 | 2005-10-27 | Brian Gillespie | System and method for automatically initiating and dynamically establishing secure internet connections between a fire-walled server and a fire-walled client |
| US7971121B1 (en) * | 2004-06-18 | 2011-06-28 | Verizon Laboratories Inc. | Systems and methods for providing distributed packet loss concealment in packet switching communications networks |
| US20060212840A1 (en) * | 2005-03-16 | 2006-09-21 | Danny Kumamoto | Method and system for efficient use of secondary threads in a multiple execution path processor |
| WO2011036733A1 (en) * | 2009-09-28 | 2011-03-31 | 株式会社 東芝 | Server apparatus and screen transfer system |
Family Cites Families (34)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5694603A (en) | 1982-09-28 | 1997-12-02 | Reiffin; Martin G. | Computer memory product with preemptive multithreading software |
| US4692761A (en) * | 1985-06-21 | 1987-09-08 | Robinton Products, Inc. | Adaptive communication network and method |
| US5260742A (en) * | 1987-11-16 | 1993-11-09 | Sanyo Electric Co., Ltd. | Electrophotographic copying machine using memory card |
| JPH0658624B2 (en) | 1990-03-30 | 1994-08-03 | インターナショナル・ビシネス・マシーンズ・コーポレーション | Graphical user interface management device |
| JPH0756628B2 (en) | 1990-10-22 | 1995-06-14 | 富士ゼロックス株式会社 | Graphical user interface editing device |
| US5430836A (en) | 1991-03-01 | 1995-07-04 | Ast Research, Inc. | Application control module for common user access interface |
| US5291585A (en) | 1991-07-29 | 1994-03-01 | Dell Usa, L.P. | Computer system having system feature extension software containing a self-describing feature table for accessing I/O devices according to machine-independent format |
| US5566330A (en) | 1991-08-20 | 1996-10-15 | Powersoft Corporation | Method for forming a reusable and modifiable database interface object |
| US5461710A (en) | 1992-03-20 | 1995-10-24 | International Business Machines Corporation | Method for providing a readily distinguishable template and means of duplication thereof in a computer system graphical user interface |
| JPH0683603A (en) | 1992-04-03 | 1994-03-25 | Internatl Business Mach Corp <Ibm> | Method and system for registering batch of object class |
| US5347627A (en) | 1992-04-07 | 1994-09-13 | International Business Machines Corporation | Graphical user interface including dynamic sizing and spacing |
| US5526517A (en) | 1992-05-15 | 1996-06-11 | Lsi Logic Corporation | Concurrently operating design tools in an electronic computer aided design system |
| US5423034A (en) | 1992-06-10 | 1995-06-06 | Cohen-Levy; Leon | Network file management with user determined hierarchical file structures and means for intercepting application program open and save commands for inputting and displaying user inputted descriptions of the location and content of files |
| GB2270242A (en) | 1992-08-29 | 1994-03-02 | Ibm | A method of editing for an object oriented computer system |
| US5412772A (en) | 1992-10-13 | 1995-05-02 | Novell, Inc. | System for permitting a view of an object or a user interface to be exchanged between operating system environments |
| US5345550A (en) | 1992-12-23 | 1994-09-06 | International Business Machines Corporation | User-modifiable popup menus for object oriented behavior |
| US5384911A (en) | 1992-12-23 | 1995-01-24 | International Business Machines Corporation | Method of transferring programs from action oriented GUI paradigm to object oriented GUI paradigm |
| US5448695A (en) | 1992-12-31 | 1995-09-05 | International Business Machines Corporation | Method and apparatus for dynamic visual feedback messaging in a graphical user interface of a data processing system |
| US5436637A (en) | 1993-03-05 | 1995-07-25 | Borland International, Inc. | Graphical user interface system and methods for improved user feedback |
| JP2620576B2 (en) | 1993-04-15 | 1997-06-18 | インターナショナル・ビジネス・マシーンズ・コーポレイション | Method and system for adjusting a graphical user interface according to a font requested by a user |
| US5559942A (en) | 1993-05-10 | 1996-09-24 | Apple Computer, Inc. | Method and apparatus for providing a note for an application program |
| US5422674A (en) | 1993-12-22 | 1995-06-06 | Digital Equipment Corporation | Remote display of an image by transmitting compressed video frames representing background and overlay portions thereof |
| US5548702A (en) | 1993-12-23 | 1996-08-20 | International Business Machines Corporation | Scrolling a target window during a drag and drop operation |
| US5461399A (en) | 1993-12-23 | 1995-10-24 | International Business Machines | Method and system for enabling visually impaired computer users to graphically select displayed objects |
| EP0661634A3 (en) | 1993-12-28 | 1996-08-28 | Ibm | Tag server. |
| US5491784A (en) | 1993-12-30 | 1996-02-13 | International Business Machines Corporation | Method and apparatus for facilitating integration of software objects between workspaces in a data processing system graphical user interface |
| US5546519A (en) | 1994-02-28 | 1996-08-13 | International Business Machines Corporation | System and method for visually programming iteration |
| US5550968A (en) | 1994-04-12 | 1996-08-27 | International Business Machines Corporation | Method and system for providing access security to controls in a graphical user interface |
| US5577172A (en) * | 1994-07-01 | 1996-11-19 | Lasermaster Corporation | High-capacity protocol for packet-based networks |
| US5473745A (en) | 1994-12-14 | 1995-12-05 | International Business Machines Corporation | Exposing and hiding a title bar behind its window using a visual cue |
| US5570462A (en) | 1995-05-05 | 1996-10-29 | Apple Computer, Inc. | System and method for object placement and sizing in a dynamic display environment |
| US5664091A (en) | 1995-08-31 | 1997-09-02 | Ncr Corporation | Method and system for a voiding unnecessary retransmissions using a selective rejection data link protocol |
| US5572643A (en) | 1995-10-19 | 1996-11-05 | Judson; David H. | Web browser with dynamic display of information objects during linking |
| US5933602A (en) * | 1996-07-31 | 1999-08-03 | Novell, Inc. | System for selecting command packet and corresponding response packet from communication stream of packets by monitoring packets sent between nodes on network |
-
1998
- 1998-04-20 US US09/063,342 patent/US6230296B1/en not_active Expired - Lifetime
-
1999
- 1999-04-20 JP JP2000545086A patent/JP3777090B2/en not_active Expired - Fee Related
- 1999-04-20 DE DE69902373T patent/DE69902373T2/en not_active Expired - Fee Related
- 1999-04-20 AT AT99919917T patent/ATE221678T1/en active
- 1999-04-20 AU AU37528/99A patent/AU751703B2/en not_active Ceased
- 1999-04-20 WO PCT/US1999/008646 patent/WO1999054802A2/en active IP Right Grant
- 1999-04-20 CA CA002329419A patent/CA2329419A1/en not_active Abandoned
- 1999-04-20 EP EP99919917A patent/EP1073940B1/en not_active Expired - Lifetime
Also Published As
| Publication number | Publication date |
|---|---|
| EP1073940A2 (en) | 2001-02-07 |
| DE69902373T2 (en) | 2003-03-13 |
| ATE221678T1 (en) | 2002-08-15 |
| EP1073940B1 (en) | 2002-07-31 |
| US6230296B1 (en) | 2001-05-08 |
| WO1999054802A2 (en) | 1999-10-28 |
| JP2002512393A (en) | 2002-04-23 |
| AU3752899A (en) | 1999-11-08 |
| JP3777090B2 (en) | 2006-05-24 |
| AU751703B2 (en) | 2002-08-22 |
| WO1999054802A3 (en) | 2000-05-11 |
| DE69902373D1 (en) | 2002-09-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US6539429B2 (en) | Method and apparatus for transmitting and displaying information between a remote network and a local computer | |
| CA2406262C (en) | Method and system for content deployment and activation | |
| US7047306B2 (en) | System and method for providing internet broadcasting data based on hierarchical structure | |
| US7330824B1 (en) | Method and system for content profiling and activation | |
| EP1043865A2 (en) | Distributed settings control protocol | |
| US6230296B1 (en) | Method and apparatus for providing error correction | |
| US20090024480A1 (en) | Method And System For Publishing Online Advertisement | |
| US20040181577A1 (en) | System and method for facilitating real-time collaboration | |
| US20070185959A1 (en) | Control unit operations in a real-time collaboration server | |
| KR20080055798A (en) | Filtering obscured data from a remote client display | |
| EP1324231A3 (en) | A method and apparatus for making a hypermedium interactive | |
| WO1995008226A1 (en) | A communication network comprising a plurality of receivers with user profile dependent selection of programmes | |
| US20100312819A1 (en) | Method and system for distributing images to client systems | |
| US20050289176A1 (en) | Application sharing smoothness | |
| US20020147827A1 (en) | Method, system and computer program product for streaming of data | |
| US6559862B1 (en) | Information processing terminal and advertising system using the information processing unit | |
| EP0737930A1 (en) | Method and system for comicstrip representation of multimedia presentations | |
| CN115438285A (en) | Mobile App network optimization method and system | |
| CN112541788B (en) | Advertisement request method based on COAP protocol | |
| JP2002191038A (en) | Moving picture distribution system | |
| KR20010044953A (en) | The method and system of the Advertizing in the internet | |
| KR20000030241A (en) | Advertising Methods Using the Moving Picture on the World Wide Web | |
| Shields | Technical White Paper: Advertising on the Web | |
| US20050253838A1 (en) | Key-frame processor for computer system | |
| JP2001242979A (en) | Method to display picture image in document processed by computer in split, in combination and in substitute |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| FZDE | Discontinued |