JPH02277120A - Queue control system for printer output - Google Patents

Abstract

PURPOSE:To prevent the omission of data for the printer output by providing a multi-process executing means, etc., and adding again the data which are dicarded during the overflow of the printer queue to the printer queue when the overflow is restored. CONSTITUTION:In a data process 7, the reception data obtained by a multi- process program 1 is written into a disk 3 and also added to a printer queue 5 to increase the number of queues by one while the index 9 of the disk 3 is controlled. In a printer output process 8, the output data equivalent to one item is taken out of the queue 5 and outputted to a printer 6. Thus the number of queues is decreased by one. When an overflow occurs, the reception data 2 is not added to the queue 5 and dicarded in an overflow state in the process 7. Then the dicarded data is read out of the disk 3 via the process 7 and added again to the queue 5 when the number of queues is decreased less than the fixed value. When all data are read, these data are added again to the queue 5 with no intervention of the disk 3. Thus the omission of data can be avoided.

Description

Detailed Description of the Invention (Field of Industrial Application) The present invention relates to a method for transmitting and receiving data with other systems and simultaneously outputting the received data to a 5F disk and outputting it to a printer. Concerning a queue management method that avoids this.

(Prior art) Conventionally, the processing speed of printer output is very slow, so in programs where the data area used for printer output is limited, output data is stacked in queues and the number of queues exceeds the maximum number. In this case, data was discarded until the queue was reduced to a certain number by printer output.

(Problem #1 to be solved by the invention) In the conventional printer output method described above, if there is a possibility that the received data will not be output on the printer, the user needs to check the printed data. If data is missing, it is necessary to use another function to read the data from the disk and output it on the printer, input a command, and output the data on the printer again.

In addition, despite the limitations of semiconductor memory, if data is always read from the disk and output to the printer without stacking it in a queue, data loss will not occur.
Disk processing time is longer than semiconductor memory, so
The disadvantage is that the processing speed is slow.

An object of the present invention is to eliminate the above-mentioned drawbacks and avoid data dropout by reading the data discarded during queue overflow from the disk and reloading it into the queue after the overflow has been recovered. The purpose of the present invention is to provide a queue management method for printer output.

(Means for Solving the Problems) A queue management system for printer output according to the present invention is configured to include a disk, a printer, and multi-processing execution means.

A disk is used to write data received by a system that transmits and receives data to and from other systems.

The printer is for outputting the data received above when written to the disk.

In order to limit the data area for output to the printer, the multi-processing execution means stores output data to the printer as a queue, and when the number of queues exceeds the maximum number, discards the data until it decreases to a certain number. After the queue is reduced to a certain number, the discarded data is read from the disk and reloaded onto the queue, and when all the data has been read, it is loaded onto the queue again from memory.

(Implementation row) Next, the present invention will be explained with reference to the drawings.

FIG. 1 is a block diagram illustrating an example of a printer output queue type MflJ according to the present invention.

In FIG. 1, 1 is a multi-processing program, 2 is received data, 5 is a disk, 4 is a data area for printer output, 5 is a printer queue, 6 is a printer, 7 is data processing, 8 is printer output processing, 9 is It is an index.

In the data processing Tl 7, data received from the multi-processing program 1 button is transferred to the disk 5 while managing the index 9 inside the disk 3. It's crowded. At the same time, data is injected into the printer queue 5, increasing the number of queues by one. In the printer output process 8, one piece of output data is taken out from the printer queue 5 and output to the printer 6.

After outputting the data to the printer 6, the number of queues decreases by one. Since the processing speed of printer output processing 8 is slower than that of data processing 7, the number of queues may overflow beyond the maximum limit. --Discard when piled up in 5. If the number of queues is less than a certain number (9), the data processor 7 reads out the discarded data from the disk 3 and rearranges it into the printer queue 5.

After reading all the data, it is loaded onto the queue again without going through the disk 3.

FIG. 2 and FIG. 8 are a flowchart and an explanatory diagram showing the flow of the operation of the implementation column shown in FIG. @1 and its transition, respectively.

When the data received in step S1 is loaded into the printer queue 5, it is determined in step S2 whether the number of queues does not exceed 100. If the number of queues does not exceed 100, the data is loaded into the printer queue 5 in step S3, but if the number exceeds 100, the index 9 of the data in the disk 3 is saved in step S4, and the data is stored in the printer queue 5 in step S5.
The data will be discarded. After that, in step 86, the state is over! Let it be a river.

When receiving data, if it is determined in step S7 that the queue is over, it is checked in step S8 whether the number of queues has decreased by 50 or less. If the queue has not decreased to 50 or less, the output data to the printer 6 is discarded in step S9, but if it has decreased, the overloaded state is canceled and the reading state is changed to step S10. Become.

When an overflow occurs, the saved index 9 is used to read 10 pieces of discarded data from step St IK, and the data is loaded into the printer queue 5 in step S12.

Each time data is received, the operation of reading the data from the disk 3 and loading it into the printer queue 5 is repeated, and if it is determined in step S13 that all the data on the disk 3 has been loaded into the printer queue 5, step In step S14, the reading status is canceled.

After that, the normal state returns and the received data is transferred to disk 3.
Load KmF and load it into printer queue 5 at the same time.

(Effects of the Invention) As explained above, the present invention makes it possible to avoid data omissions in printer output by reloading the data discarded during printer queue overflow into the printer queue after the overflow is restored. This has the effect that the user does not need to print it out again.

Furthermore, after the overflow has been restored and all data has been read from the disk, the system switches to the semiconductor memory again and outputs the data to the printer, which has the effect of improving processing speed.

[Brief explanation of drawings]

FIG. 1 shows an example of the printer output queue management method according to the present invention. FIG. 2 is a block diagram showing an IU reli. Figures Pg2 and 3 are the implementation f shown in Figure 1, respectively.
FIG. 2 is a flowchart and an explanatory diagram showing the flow of operation of i and its transition. 111...Multi-processing program 2, Φ-received data 3, e-disk 4, data area for printer output 5, printer queue 6, printer 7...-data processing 8, printer output processing 9...Index patent author, NEC Corporation representative, patent attorney Inoro Jusai, 1 figure, 2 figures

Claims (1)

[Claims] A disk for writing data received by a system that transmits and receives data with other systems, a printer for outputting the received data when written to the disk, and a printer for the printer. In order to limit the data area for output, output data to the printer is stacked as a queue, and when the number of queues exceeds the maximum number, the data is discarded until the number decreases to a certain number, and when the queue is and a multi-processing execution means for reading the discarded data from the disk and reloading it on the queue after the number has been reduced, and loading the discarded data on the queue again from the memory after reading all the data. A printer output queue management method characterized by: