Information processing system, information processing method, and program product

Abstract

An information processing system, an information processing method, and a program product are disclosed. The information processing system includes a processor. When print data is obtained, the processor determines whether print data that has started a RIP process in advance is data in a form that is independent for each page. When the print data that has started the RIP process in advance is not data in the form that is independent for each page, the processor allocates execution of a RIP process of the print data that is obtained to a part of a plurality of RIP processing units that share and perform the RIP process of the print data that has started the RIP process in advance in parallel, and allocates continuation of the RIP process of the print data that has started the RIP process in advance to the remaining part of the plurality of RIP processing units.

Description

Technical Field

[0001] The present invention relates to an information processing system, information processing method, and program product. Background Technology

[0002] Japanese Patent Application Publication No. 2005-349768 discloses a printing apparatus that interprets a print job from a communicatively external information processing device and prints based on the interpreted data. The apparatus is characterized by comprising: an identification unit that identifies a queue-jumping instruction for a print job from the information processing device; a queue-jumping unit that, upon identification of the queue-jumping instruction, suspends printing processing of preceding print jobs other than the current print job and executes printing processing of the print job with the queue-jumping instruction; and a recovery unit that, after the queue-jumping unit has performed printing processing, resumes printing of the preceding print job. The recovery unit has the following function: for the already interpreted data of the preceding print job, based on the data size, skips the interpretation of pages that have received an end-page command, and only interprets the remaining data.

[0003] Japanese Patent Application Publication No. 6-103005 discloses a printer control device comprising: a first storage unit that sequentially stores document data expressed using a page-independent page description language; a production unit that produces a page sequence of document data read sequentially from the first storage unit; and an expansion unit that expands the document data into image data based on the page sequence produced by the production unit. The printer control device is characterized by further comprising: a second storage unit that stores pause status information including processed page information; and a control unit that, when a print request is requested to be inserted, pauses processing on a page-by-page basis, stores the pause status information in the second storage unit, changes the read order of the inserted document data to the beginning, and controls the production unit and the expansion unit to produce the page sequence of the inserted document data and expand the image data. After this processing is completed, the production unit and the expansion unit are controlled based on the pause status information stored in the second storage unit, thereby restarting the printing processing of the paused document data.

[0004] Japanese Patent Application Publication No. 2012-11602 discloses an image forming apparatus capable of performing queue-jumping printing processing. This queue-jumping printing processing, based on a queue-jumping printing instruction, begins processing a queue-jumping job that has received the instruction midway through processing a queue-jumping job that is currently being processed. The image forming apparatus is characterized by comprising: a generation unit that performs RIP processing on a print job consisting of at least one page to generate image data; a printing unit that performs printing processing based on the image data generated by the generation unit; and a control unit that, upon completion of the RIP processing performed by the generation unit on the pages included in the queue-jumping job, controls the printing unit to pause printing processing of the queue-jumping job and begin printing processing of the queue-jumping job. Summary of the Invention

[0005] Sometimes, RIP processing of previously printed data that has already started is paused to perform RIP processing of pre-printed data. In cases where the previously printed data is not in a page-by-page format and therefore cannot be randomly accessed, in order to restart RIP processing once paused, prescribed processing needs to be performed on the pages from the beginning of the previously printed data up to the point where RIP processing resumes.

[0006] In situations where multiple RIP processing units share and process the preceding print data in parallel, when the RIP processing of the preceding print data is paused and restarted, each RIP processing unit also needs to perform specified processing for the page from the beginning of the preceding print data to the page where the RIP processing has restarted.

[0007] Performing RIP processing for pre-printed data while RIP processing for pre-printed data is in progress can sometimes lead to a decrease in productivity until the RIP processing for pre-printed data is completed.

[0008] Therefore, the object of the present invention is to suppress the decrease in productivity caused by performing RIP processing for skip-line printing data while RIP processing for prior printing data is in progress, compared to pausing RIP processing for prior printing data and performing RIP processing for skip-line printing data.

[0009] According to a first aspect of the present invention, an information processing system is provided, comprising a processor, wherein, upon acquiring pre-printed data, the processor determines whether the pre-printed data for which RIP processing has already begun is data in a page-independent format; if the pre-printed data is not data in the page-independent format, the processor distributes the execution of RIP processing of the pre-printed data to a portion of a plurality of RIP processing units that have shared and performed RIP processing of the pre-printed data in parallel, and distributes the continued RIP processing of the pre-printed data to the remaining portion of the plurality of RIP processing units.

[0010] According to a second aspect of the present invention, in the information processing system involved in the first aspect, the processor displays a screen that receives a setting value related to the number of RIP processing units that execute RIP processing to be assigned the queue-jumping print data, and determines the number of RIP processing units that execute RIP processing to be assigned the queue-jumping print data among the plurality of RIP processing units by referring to the setting value.

[0011] According to a third aspect of the present invention, in the information processing system involved in the first aspect, the processor displays a screen that accepts input of the priority of queue printing, and determines the number of RIP processing units that execute the RIP processing to which the queue printing data is assigned based on the priority.

[0012] According to a fourth aspect of the present invention, in the information processing system involved in the first aspect, the processor determines a lower limit of the number of RIP processing units that continue the RIP processing of the pre-printed data, so that the predicted number of pages processed by RIP on the pre-printed data per unit time is not less than the predicted number of pages printed on the pre-printed data per unit time, and determines the number of RIP processing units that execute the RIP processing of the pre-printed data.

[0013] According to a fifth aspect of the present invention, in the information processing system involved in any of the second to fourth aspects, when the number of pages of the queued print data is less than the number of the plurality of RIP processing units, the processor determines the number of RIP processing units that execute the RIP processing of the queued print data to be less than the number of pages of the queued print data.

[0014] According to a sixth aspect of the present invention, in the information processing system involved in any of the first to fifth aspects, when the RIP processing of the queue-jumping print data is completed, the processor assigns the continued RIP processing of the preceding print data to the RIP processing mechanism that was assigned the execution of the RIP processing of the queue-jumping print data.

[0015] According to a seventh aspect of the present invention, a program product is provided, comprising a program for causing a computer to perform processing, wherein the processing comprises: upon obtaining pre-printed data, determining whether the pre-printed data for which RIP processing has already begun is data in a page-independent format; if the pre-printed data is not the page-independent format, allocating the execution of RIP processing of the pre-printed data to a portion of a plurality of RIP processing units that have shared and performed RIP processing of the pre-printed data in parallel, and allocating the continued RIP processing of the pre-printed data to the remaining portion of the plurality of RIP processing units.

[0016] According to an eighth aspect of the present invention, an information processing method is provided, wherein, when queue-jumping printing data is obtained, it is determined whether the preceding printing data that has started RIP processing is data in a form that is independent for each page; if the preceding printing data is not data in the form that is independent for each page, the execution of RIP processing of the queue-jumping printing data is distributed to a portion of a plurality of RIP processing units that have shared and performed RIP processing of the preceding printing data in parallel, and the continued distribution of RIP processing of the preceding printing data is distributed to the remaining portion of the plurality of RIP processing units.

[0017] (Effect)

[0018] According to the first, seventh, and eighth schemes, compared with the case of pausing the RIP processing of the preceding print data and performing the RIP processing of the queued print data, the decrease in productivity caused by performing the RIP processing of the queued print data while the RIP processing of the preceding print data is in progress can be suppressed.

[0019] According to the second scheme, the RIP processing of the queued print data can be performed by a number of RIP processing units corresponding to the accepted set value.

[0020] According to the third scheme, the RIP processing of the queue printing data can be performed by a number of RIP processing units corresponding to the priority of the queue printing that can be intuitively input.

[0021] According to the fourth scheme, when RIP processing and printing processing of print data are performed through a series of steps, intermittent printing can be suppressed.

[0022] According to the fifth scheme, the execution of RIP processing for queued print data can be assigned to a number of RIP processing units up to the number of pages of the queued print data.

[0023] According to the sixth scheme, compared to the case where the RIP processing of the preceding print data is not further allocated to the RIP processing unit that has been assigned to execute the RIP processing of the queued print data, the RIP processing of the preceding print data can be shared by more RIP processing units after the RIP processing of the queued print data is completed. Attached Figure Description

[0024] Figure 1 An example illustrating the general structure of the printing system 100;

[0025] Figure 2 An example of the hardware structure of the information processing system 110 according to the first embodiment;

[0026] Figure 3 An example illustrating the functional structure of the information processing system 110 according to the first embodiment;

[0027] Figure 4 This is a diagram illustrating an example of the information processing flow executed by the information processing system 110 according to the first embodiment;

[0028] Figure 5 This is an example of the screen display when accepting a set value;

[0029] Figure 6 This is a diagram illustrating an example of an information processing system 110 that allocates RIP processing of queue-jumping and pre-printing data to the RIP processing unit;

[0030] Figure 7 This is an example of a screen display indicating the priority of input;

[0031] Figure 8 This is a diagram illustrating an example of the information processing flow executed by the information processing system 110 according to the second embodiment;

[0032] Figure 9 This is a diagram illustrating an example of the information processing flow executed by the information processing system 110 according to the third embodiment;

[0033] Figure 10 This is a diagram illustrating, as a comparative example, an information processing system 1010 that pauses the RIP processing of the preceding printed data and performs the RIP processing of the interrupted printed data. Detailed Implementation

[0034] Hereinafter, an example of an embodiment of the technology of the present invention will be described with reference to the accompanying drawings. Furthermore, in each drawing, the same or equivalent constituent elements and parts are labeled with the same reference numerals. Additionally, the dimensions of the drawings are sometimes exaggerated for ease of explanation and sometimes differ from the actual proportions.

[0035] First, the general structure of the printing system will be explained. Here, refer to... Figure 1 .

[0036] Figure 1 This is an example of a schematic structure of a printing system 100. The printing system 100 includes an information processing system 110 and a printing mechanism 120. Figure 1 The following scenario is illustrated: In printing system 100, printing data 111 is acquired by information processing system 110, and RIP processing completed data 112 is output from information processing system 110 to printing mechanism 120. Additionally, in... Figure 1 The following scenario is illustrated: In printing system 100, printing is performed by printing mechanism 120 on data 112 processed using RIP, and printed matter 121 is output from printing mechanism 120. Additionally, in... Figure 1 The diagram illustrates a scenario where, in information processing system 110, multiple RIP processing units 130 share and perform RIP processing on the printed data 111 in parallel. Although not shown, a spool can also be configured in information processing system 110 to store the RIP-processed data 112.

[0037] Here, RIP (Raster Image Processor) processing refers to converting print data into raster data in order to process it into a form that can be used for printing.

[0038] Print data RIP processing can be divided into page-parallel RIP and job-parallel RIP. Page-parallel RIP improves the throughput of a single job by having multiple RIP processors handle multiple pages within a job. Job-parallel RIP improves the average throughput of a large number of jobs by simultaneously processing multiple jobs. This manual describes the use of page-parallel RIP.

[0039] When Figure 1 As shown, during RIP processing, especially when processing large amounts of print data such as invoices, other jobs requiring expedited printing may cut in line. This will be explained later. Figure 10 As shown, the following processing was performed in the previous page-parallel RIP method: when a request for pre-queue printing is generated, the RIP processing of the print job that has already started is paused, and the RIP processing of the pre-queue job is performed.

[0040] Here, the print data contains both page-independent and page-not-independent formats. Page-independent data includes, for example, PDF (Portable Document Format) files or PCL (Printer Command Language) files. Resources embedded in the desired print page or job within this page-independent data can be accessed randomly. Page-not-independent data includes, for example, PostScript files. When processing page-not-independent data, processing must proceed sequentially from the beginning of the data to the desired page.

[0041] If the data is in a page-by-page format, even if RIP processing is paused due to pre-printing, it can resume from the next page. Conversely, with non-page-by-page data, random access is not possible. Therefore, if the process is paused and restarted due to pre-printing, it's necessary to re-execute the prescribed processing from the beginning of the printed data. For printed data that has already undergone RIP processing, sometimes RIP processing is repeated, and sometimes simplified processing is performed. In either case, it's processing that arises from pausing RIP processing. Processing resulting from pausing RIP processing includes, for example, interpreting resources (e.g., formatting or fonts) described at the beginning of the job, expanding data, specifying page ranges, or scanning for jumping to a specified page. Sometimes such processing takes a significant amount of time, leading to decreased productivity.

[0042] Furthermore, the information processing system 110 is described as being composed of a single device, but it may also be composed of multiple devices.

[0043] [First Implementation]

[0044] Next, the hardware structure of the information processing system 110 according to the first embodiment will be described. Here, refer to... Figure 2 .

[0045] Figure 2 This illustrates an example of the hardware structure of the information processing system 110 according to the first embodiment. The information processing system 110 includes a CPU 201, a ROM (Read Only Memory) 202, a RAM (Random Access Memory) 203, a storage device 204, a communication interface 205, and a user interface 206. These structures are connected via a bus 207 to communicate with each other.

[0046] CPU 201 executes various programs and controls various structures. ROM 202 stores various programs and data. RAM 203 serves as a temporary storage area for programs or data. Storage device 204 is composed of HDD (Hard Disk Drive) or SSD (Solid State Drive) and stores various programs, including the operating system, and various data.

[0047] In the information processing system 110 of this embodiment, an information processing program is stored in the ROM 202 or the storage device 204. The CPU 201 reads the information processing program from the ROM 202 or the storage device 204 and executes it using the RAM 203 as the working area, performing control of each structure and various arithmetic operations according to the information processing program.

[0048] Communication interface 205 is an interface for communication between information processing system 110 and other devices. User interface 206 is an input / output interface for information processing system 110 to exchange information with a user. User interface 206 may include a touch panel, keyboard, or mouse as an input device, and may include a display or speaker as an output device. User interface 206 may be a specific example of a display that shows a screen that accepts input of "settings" or "priorities" as described later.

[0049] Next, the functional structure of the information processing system of the first embodiment will be described. Here, refer to... Figure 3 .

[0050] Figure 3 This illustrates an example of the functional structure of the information processing system 110 according to the first embodiment. The information processing system 110 has a determination unit 301, an allocation unit 302, and a display unit 303 as its functional structure.

[0051] When the determination unit 301 obtains the pre-printed data that has started RIP processing, it determines whether the pre-printed data is in the form of independent data for each page.

[0052] When the preceding print data is not in a form where each page is independent, the allocation unit 302 distributes the execution of RIP processing for the intercalating print data to a portion of the multiple RIP processing units that share and perform RIP processing on the preceding print data in parallel, and further distributes the RIP processing of the preceding print data to the remaining portion of the multiple RIP processing units. The concept of allocation here may include allocating the page range to each RIP processing unit.

[0053] Furthermore, once the RIP processing for the pre-printed data is completed, the allocation unit 302 will continue to allocate the RIP processing of the pre-printed data to the RIP processing unit that was assigned the pre-printed data RIP processing.

[0054] Display unit 303 displays the following screen: accepts settings related to the number of RIP processing units executing RIP processing that are assigned to skip printing data, or input of the priority of skip printing.

[0055] Next, the information processing flow executed by the information processing system of the first embodiment will be described. Here, refer to... Figure 4 .

[0056] Figure 4 This diagram illustrates an example of the information processing flow executed by the information processing system 110 of the first embodiment. This flow is executed by the CPU 201 reading the information processing program from the ROM 202 or storage device 204 and expanding it into the RAM 203 for execution.

[0057] In step S401, CPU201, acting as distribution unit 302, controls multiple RIP processing mechanisms to enable them to share and execute RIP processing of print data in parallel.

[0058] Here, the print data is a print job. For example, such as... Figure 1 As shown, print data acquired in job units is processed using page-parallel RIP. Print data that has undergone RIP processing can be stored in a spooler before printing, or it can be printed sequentially without going through a spooler. Furthermore, the "preceding print data for which RIP processing has already begun" mentioned in the following steps refers to print data for which RIP processing began in step S401.

[0059] Next, in step S402, CPU 201, acting as the determination unit 301, determines whether queue-jumping printing data has been obtained. It can also be determined whether there is a request for queue-jumping printing. If queue-jumping printing data is obtained, it is desirable not only to prioritize printing but also to prioritize pre-printing processing, i.e., RIP processing.

[0060] If it is not determined that queue-jumping printing data has been obtained, CPU 201 will proceed to step S411. If it is determined that queue-jumping printing data has been obtained, CPU 201 will proceed to step S403.

[0061] In step S403, CPU 201, acting as determination unit 301, determines whether the previously printed data that has started RIP processing is in a format where each page is independent. Whether the data is in a format where each page is independent can be determined by analyzing the printed data. If the data is not in a format where each page is independent, the prescribed processing needs to be performed again in each RIP processing unit when pausing and restarting RIP processing from a specific page. Therefore, processing branches based on whether the previously printed data is in a format where each page is independent.

[0062] If it is determined that the preceding print data is not in a format independent for each page, CPU 201 will proceed to step S404. If it is determined that the preceding print data is in a format independent for each page, CPU 201 will proceed to step S408.

[0063] In step S404, CPU 201, acting as allocation unit 302, refers to a setting value. The setting value is a value related to the number of RIP processing units executing the RIP processing of the allocated queue-interrupted print data. The setting value can be a preset value or a value input by the user. For example, the setting value can be as described later... Figure 5 The screen shown displays the values ​​entered by the user. Alternatively, the set values ​​can also satisfy the upper or lower limits determined in the second embodiment described later.

[0064] Next, in step S405, CPU 201, acting as allocation unit 302, allocates the execution of RIP processing for the queued print data to a portion of the multiple RIP processing units that are sharing and parallelizing the RIP processing of the preceding print data. CPU 201, acting as allocation unit 302, further allocates the RIP processing of the preceding print data to the remaining portion of the multiple RIP processing units. Specifically, CPU 201, acting as allocation unit 302, can determine the number of RIP processing units assigned to execute the RIP processing for the queued print data based on the setting value referenced in step S404. For example, as described later... Figure 6 As shown, the RIP processing of the preceding printed data 601 can be further distributed to one of the four RIP processing units 631 to 634, while the execution of the RIP processing of the interrupted printed data 602 can be distributed to the three RIP processing units 632 to 634.

[0065] During the RIP processing of queued print data, the number of RIP processing units that perform RIP processing of prior print data is reduced. Therefore, the RIP processing performance related to prior print data is lower compared to the case where queued print data is not RIP processed in a queued manner. However, during and after the RIP processing of queued print data, some RIP processing units continue RIP processing of prior print data. Moreover, in the RIP processing units that are assigned to continue RIP processing of prior print data, the required processing in cases where prior print data RIP processing is paused and restarted is not required. In this way, it is possible to suppress the decrease in productivity until the RIP processing of prior print data is completed while performing RIP processing of queued print data. It can be considered that the decrease in productivity here refers to the longer time required for RIP processing of prior print data compared to the case where queued print data is not queued and is not RIP processed.

[0066] Next, in step S406, CPU201, acting as the allocation unit 302, determines whether the RIP processing of the interrupted printing data is complete.

[0067] Until the RIP processing for the data that was determined to be inserted into the queue is completed, CPU 201 continues as follows: controlling the RIP processing mechanism to perform RIP processing in the manner assigned in step S405. If the RIP processing for the data that was determined to be inserted into the queue is completed, CPU 201 will advance the processing to step S407.

[0068] In step S407, CPU 201, acting as allocation unit 302, allocates the continued processing of RIP data for prior printing to the RIP processing mechanism that has been allocated the processing of RIP data for queued printing. For example, as described later... Figure 6 The RIP processing mechanisms 632-634 are controlled to distribute the RIP processing to restore the preceding printed data 601.

[0069] In RIP processing units that are assigned to process RIP data that has been queued, a pre-defined process is required to restart the RIP processing of the preceding data. However, compared to pausing and restarting the RIP processing of the preceding data in all RIP processing units, the decrease in productivity until the RIP processing of the preceding data is completed can be suppressed.

[0070] Furthermore, compared to the case where the RIP processing unit assigned to perform RIP processing of queued print data does not restart the RIP processing of the preceding print data, the number of RIP processing units that share the RIP processing of the preceding print data increases. Therefore, it is possible to suppress the decrease in productivity until the RIP processing of the preceding print data is completed. When the processing in step S407 is completed, the CPU 201 advances the processing to step S411.

[0071] In step S408, CPU201, acting as allocation unit 302, controls the RIP processing mechanism that has performed RIP processing on the preceding print data, causing it to pause the RIP processing of the preceding print data and take over the RIP processing of the intercalating print data. If the preceding print data is in the form of independent pages, the prescribed processing described above will not occur when pausing and restarting, thus allowing priority to be given to RIP processing of the intercalating print data.

[0072] In step S409, CPU201, acting as the allocation unit 302, determines whether the RIP processing of the inter-queue print data is complete.

[0073] The CPU 201 continues processing in step S408 until the RIP processing for the pre-printed data is completed. If the RIP processing for the pre-printed data is completed, the CPU 201 will advance the processing to step S410.

[0074] In step S410, CPU 201, acting as the allocation unit 302, controls the RIP processing mechanism that has performed the RIP processing of the pre-printed data, so that it performs RIP processing on the unprocessed portion of the previously printed data. When the processing in step S410 is completed, CPU 201 advances the processing to step S411.

[0075] In step S411, CPU201, acting as a determination unit 301, determines whether the RIP processing of the previously printed data is complete.

[0076] If the RIP process for the preceding printed data is not determined to be complete, CPU 201 returns the processing to step S402. If the RIP process for the preceding printed data is determined to be complete, CPU 201 terminates the processing.

[0077] Next, the screen display when the user accepts the settings will be explained. Here, refer to... Figure 5 .

[0078] Figure 5 This is an example of the screen display when accepting set values. Figure 5The screen shown is displayed by CPU 201 as display unit 303, and is an example of a screen for accepting setting values ​​as input. The setting values ​​are related to the number of RIP processing units that are assigned to perform RIP processing for queue-jumping print data. The priority given to handling queue-jumping print requests during RIP processing sometimes depends on factors such as the delivery date of the printed materials or the relationship between the ordering and receiving parties. Therefore, by accepting setting values ​​from the user, the execution of RIP processing for queue-jumping print data can be assigned to a number of RIP processing units, taking into account various circumstances.

[0079] exist Figure 5 The screen shown displays a dialog box 500 labeled "Input of Queue Cut-off Setting". Dialog box 500 may be a subscreen displayed, for example, at the time the user inputs the instruction to cut off the queue for printing. Dialog box 500 displays a statement such as "Total Parallelism: 12". Parallelism indicates the number of RIP processing units that share the print data. The higher the parallelism for a given print data, the higher the RIP performance associated with that print data. RIP performance can be considered as the number of pages that can be processed per unit of time. "Total Parallelism: 12" indicates that the total number of RIP processing units that share and execute the print data RIP processing in parallel is 12.

[0080] Additionally, dialog box 500 displays a statement such as "Queue Printing RIP Parallelism:" and an input box 501 side-by-side. "Queue Printing RIP Parallelism:" indicates the number of RIP processing units executing the RIP process assigned to queue printing data. In this example, "10" is entered in input box 501. The value entered in this input box 501 is an example of a value accepted as a setting related to the number of RIP processing units executing the RIP process assigned to queue printing data.

[0081] In passing Figure 5 If the displayed screen accepts the set value, CPU 201 can refer to that set value in step S404. As the allocation unit 302, CPU 201 can determine, in step S405, 10 out of the 12 RIP processing units as the number of RIP processing units executing the RIP processing to allocate queued print data. Thus, CPU 201 can determine the set value itself as the number of RIP processing units executing the RIP processing to allocate queued print data among the multiple RIP processing units.

[0082] Next, the allocation process for distributing RIP processing of queue-jumping and pre-printing data to the RIP processing unit will be explained. Here, refer to... Figure 6 .

[0083] Figure 6This diagram illustrates an example of an information processing system 110 that allocates RIP processing of queue-jumping and pre-running data to the RIP processing unit. Figure 6 The diagram shows one of the four RIP processing units 631-634 in the information processing system 110, RIP processing unit 631 and three RIP processing units 632-634. RIP processing unit 631 is assigned to continue the RIP processing of the preceding print data 601, while the three RIP processing units 632-634 are assigned to execute the RIP processing of the queued print data 602. In this allocation in step S405, RIP processing units 632-634 share the workload of the queued print data 602 and perform RIP processing in parallel until the RIP processing of the queued print data 602 is completed. Furthermore, printed materials using the RIP-processed queued print data 602 can be discharged to a different tray than printed materials using the RIP-processed preceding print data 601.

[0084] When the RIP processing of the queue-printed data 602 is completed, in step S407, the RIP processing mechanisms 632-634 resume the sharing of the RIP processing of the preceding printed data 601.

[0085] In the above embodiment, the CPU 201, acting as the display unit 303, displays a screen indicating the acceptance of a setting value, and the allocation unit 302 determines the number of RIP processing units executing the RIP processing of the allocated queue-jumping print data based on the setting value. However, as a variation, the CPU 201, acting as the display unit 303, may display a screen indicating the acceptance of the priority for queue-jumping print, and the allocation unit 302 may determine the number of RIP processing units executing the RIP processing of the allocated queue-jumping print data based on the priority. Here, refer to... Figure 7 .

[0086] Figure 7 This is an example of a screen display indicating the priority of input. Figure 7 The screen shown is an example of the CPU 201 receiving priority input for queue printing as the display unit 303. Figure 7 The screen shown displays a dialog box 700 labeled "Input of Queue Jump Setting Value". Dialog box 700 may be a subscreen displayed, for example, at the time the user inputs the instruction to jump the print queue. Dialog box 700 displays a statement such as "Total Parallelism: 12". "Total Parallelism: 12" indicates that the total number of RIP processing units that share and execute the RIP processing of print data in parallel is 12.

[0087] Additionally, dialog box 700 displays a message such as "Queue Printing Priority Setting:", input box 701, and a "%" message side-by-side. "Queue Printing Priority Setting:" indicates the proportion of RIP processing units that are assigned queue printing data among multiple RIP processing units. In this example, "80" is entered in the input box. The value entered in this input box is an example of a value accepted as the priority for queue printing.

[0088] In passing Figure 7 When the screen receiving priority is as shown, CPU 201, acting as allocation unit 302, can determine approximately 80% of the 12 RIP processing units as the number of RIP processing units to be allocated for queue-jumping print data execution. Here, "10" is an example of the number of RIP processing units to be allocated for queue-jumping print data execution, determined according to priority.

[0089] Thus, CPU 201, acting as allocation unit 302, can determine the proportion of multiple RIP processing units corresponding to their priorities as the number of RIP processing units to execute the RIP processing for the allocated queue-printing data. In this example, the proportion input is accepted as the priority input, but the priority input can be any input representing a priority. For example, the priority input can also be an input that can be selected from priorities "low," "medium," and "high." Alternatively, for example, the priority input can also be an input that, after accepting the specification of the proportion corresponding to each of the priorities "low," "medium," and "high," can be selected from priorities "low," "medium," and "high."

[0090] Priority can be entered intuitively compared to setting values ​​that are specific numerical inputs.

[0091] [Second Implementation]

[0092] In the first embodiment, the CPU 201 determines the number of RIP processing units to execute the RIP processing of the pre-allocated print data by referring to a set value. In the second embodiment, a lower limit for the number of RIP processing units to continue the RIP processing of the pre-allocated print data is determined by considering the predicted number of pages processed by RIP on the pre-allocated print data per unit time and the predicted number of pages printed on the pre-allocated print data per unit time. Furthermore, an example of the hardware structure of the information processing system in the second embodiment is the same as that in the first embodiment; therefore, further description is omitted.

[0093] Sometimes, instead of temporarily storing the completed RIP data in a spooler, preceding print data is printed through a series of processes. In this case, as a result of allocating the RIP processing of the queued print data to a portion of the RIP processing mechanism, the performance of the preceding print data's RIP processing is insufficient relative to the printing performance, and printing may be interrupted. This phenomenon of intermittent printing is called intermittent printing, which may lead to a decrease in productivity. In the second embodiment, in order to suppress intermittent printing, a lower limit is determined for the number of RIP processing mechanisms that continue processing the preceding print data's RIP processing.

[0094] The information processing flow executed by the information processing system of the second embodiment will be described. Here, refer to... Figure 8 .

[0095] Figure 8 This diagram illustrates an example of the information processing flow executed by the information processing system 110 of the second embodiment. This flow is executed by the CPU 201 reading the information processing program from the ROM 202 or the storage device 204 and expanding it into the RAM 203 for execution. Furthermore, regarding the first embodiment… Figure 4 The same steps in the process are labeled as follows: Figure 4 The same symbols in the process, only applicable to those... Figure 4 The different steps in the process and their order before and after will be explained, while other identical steps will be omitted from the explanation.

[0096] This process and Figure 4 The process differs in the following two aspects: Step S801 exists between steps S401 and S402; replacing the... Figure 4 The step S404 shown in the figure has step S802.

[0097] In step S401, after CPU 201 controls the RIP processing mechanism to begin RIP processing of the preceding print data, in step S801, the allocation unit 302 acquires statistical data related to the number of pages of preceding print data processed by RIP within a unit of time. For example, the following data can be acquired: the number of pages of preceding print data that have completed RIP processing within the entire RIP processing mechanism up to the point where inter-queue print data is generated; and the time elapsed since the start of RIP processing.

[0098] In step S802, CPU 201, acting as allocation unit 302, determines a lower limit for the number of RIP processing units that will continue processing the allocated pre-printed data, ensuring that the predicted number of pages processed by RIP on the pre-printed data per unit time is not lower than the predicted number of pages printed on the pre-printed data per unit time. The predicted number of pages processed by RIP on the pre-printed data per unit time can be a predicted value calculated based on the statistical data obtained in step S801. The predicted number of pages printed on the pre-printed data per unit time can be a pre-calculated value. For example, the predicted number of pages printed on the pre-printed data per unit time can be a value based on the performance data of the printing unit.

[0099] It is known that when RIP processing is performed on large amounts of print data, such as invoices, involving tens of thousands of pages, the page processing performance per page of the RIP processing unit becomes a constant. Furthermore, it is known that in page-parallel RIP, the overall RIP performance based on multiple RIP processing units is roughly proportional to the number of RIP processing units. Therefore, from the perspective of preventing intermittent printing, the number of RIP processing units, Ns, that should be allocated to processing the preceding print data can be expressed as Ns > Pp / Pr, where the RIP performance Pr (unit: [page / min]) of the RIP processing unit and the printing performance Pp (unit: [page / min]) of the printing unit are used.

[0100] For example, CPU 201 can determine the minimum integer value of Ns that satisfies Ns > Pp / Pr as the lower limit of the number of continuing RIP processing units for RIP processing that has been allocated prior print data. Specifically, when the RIP performance Pr of the RIP processing unit is 80 pages / min and the print performance Pp of the printing unit is 384 pages / min, Ns becomes 384 / 80. That is, Ns becomes 4.8. In this case, CPU 201 can determine the minimum integer value of Ns that satisfies Ns > 4.8 as the lower limit of the number of continuing RIP processing units for RIP processing that has been allocated prior print data.

[0101] In addition, CPU201, as the allocation unit 302, can also determine the upper limit of the number of RIP processing units that execute the RIP processing of the allocated queued print data, so that the predicted number of pages for RIP processing of the preceding print data per unit time is not lower than the predicted number of pages for printing the preceding print data per unit time.

[0102] For example, CPU 201 can also calculate the maximum number of RIP processing units that can execute RIP processing for the purpose of assigning queued printing data, by subtracting the smallest integer value of Ns that satisfies Ns > Pp / Pr from the total number of RIP processing units. Specifically, if the total number of RIP processing units is 12 and the smallest integer value of Ns that satisfies Ns > Pp / Pr is 5, it can also perform the calculation of 12 minus 5 and use the result of 7 as the maximum number of RIP processing units that can execute RIP processing for the purpose of assigning queued printing data.

[0103] [Third Implementation]

[0104] In the third embodiment, the following situation will be explained: when the number of pages of the queued print data is less than the number of RIP processing units, the number of RIP processing units executing the RIP processing of the allocated queued print data will be determined to be less than or equal to the number of pages of the queued print data. Furthermore, an example of the hardware structure of the information processing system in the third embodiment is the same as that in the first embodiment; therefore, the description will be omitted.

[0105] Sometimes, the number of pages of pre-printed data is less than the number of RIP processing units. For example, consider a situation where the number of pages of pre-printed data is as few as two pages compared to four RIP processing units. It is deemed unnecessary to allocate pre-printed data processing to a number of RIP processing units that exceeds the number of pages in the pre-printed data. Allocating pre-printed data processing to an unnecessary number of RIP processing units reduces the number of RIP processing units assigned to pre-printed data processing, unnecessarily degrading RIP performance related to pre-printed data. From this perspective, in the third embodiment, the execution of pre-printed data processing is allocated to a number of RIP processing units that have fewer than the number of pages in the pre-printed data.

[0106] Here, in order to explain the information processing flow executed by the information processing system of the third embodiment, refer to Figure 9 .

[0107] Figure 9 This diagram illustrates an example of the information processing flow executed by the information processing system 110 of the third embodiment. This flow is executed by the CPU 201 reading the information processing program from the ROM 202 or storage device 204, expanding it into the RAM 203, and executing it. Furthermore, regarding the first embodiment… Figure 4 The same steps in the process are labeled as follows: Figure 4 The same symbols in the process, only applicable to those... Figure 4 The different steps in the process and their order are explained, while the descriptions of other identical steps are omitted. This process is similar to... Figure 4The difference in the process is that steps S901 to 903 replace steps S404 and S405.

[0108] In step S901, CPU 201, acting as allocation unit 302, determines whether the number of pages of the queued print data is less than the predetermined number of RIP processing units. The predetermined number of RIP processing units can be the total number of RIP processing units or the number of RIP processing units temporarily designated as the objects of execution of the RIP processing allocated for queued print data. The number of RIP processing units temporarily designated as the objects of execution of the RIP processing allocated for queued print data can be determined based on settings, priorities, upper limits, or lower limits as described above.

[0109] For example, in this step, CPU201, acting as allocation unit 302, can determine whether the number of pages of the queued print data is less than the number of RIP processing units that execute the RIP processing of the allocated queued print data, which is temporarily set according to the set value.

[0110] If the number of pages of data deemed to be inserted into the queue is less than the specified number for the RIP processing unit, the CPU 201 will proceed to step S902. If the number of pages of data deemed to be inserted into the queue is not less than the specified number for the RIP processing unit, the CPU 201 will proceed to step S903.

[0111] In step S902, CPU 201, acting as allocation unit 302, determines the number of RIP processing units that will execute the RIP processing of the queued print data to be numbered below the number of pages of the queued print data. That is, CPU 201, acting as allocation unit 302, allocates the execution of RIP processing of print data to RIP processing units with a number of pages below the number of pages in the queued print data, and continues to allocate the RIP processing of prior print data to the remaining number of RIP processing units. For example, if the number of pages in the queued print data is three and the predetermined number of RIP processing units is five, CPU 201 may allocate the execution of RIP processing of the queued print data to three RIP processing units instead of five.

[0112] In step S903, CPU 201, acting as allocation unit 302, allocates the execution of RIP processing for the interrupted print data to a predetermined number of RIP processing units among the multiple RIP processing units that share and perform RIP processing on the preceding print data in parallel, and further allocates the RIP processing of the preceding print data to the remaining number of RIP processing units. The predetermined number here can be a number determined based on the set value, priority, upper limit, or lower limit, etc., of the total number of RIP processing units as described above. Alternatively, the predetermined number here can also be the number of RIP processing units temporarily set as the objects of the RIP processing allocated for the interrupted print data, as described above. For example, when the number of pages of the interrupted print data is ten and the total number of RIP processing units is five, CPU 201 can allocate the execution of the interrupted print data RIP processing to two RIP processing units (as set), and further allocate the RIP processing of the preceding print data to three RIP processing units.

[0113] Next, as a comparative example with the technology of the present invention, an information processing system that suspends the RIP processing of the pre-started print data and performs the RIP processing of the pre-queue print data will be described.

[0114] Figure 10 This is a diagram illustrating, as a comparative example, an information processing system 1010 that pauses the RIP processing of the preceding printed data and performs the RIP processing of the interrupted printed data.

[0115] exist Figure 10 The following RIP processing scenario is illustrated: In the information processing system 1010, the RIP processing of the pre-printed data 1011 is stopped, and the four RIP processing units 1031 to 1034 share and perform the RIP processing of the inter-printed data 1012 in parallel. The pre-printed data 1011 is set as data in a format that is not independent for each page.

[0116] In the information processing system 1010, when four RIP processing units 1031-1034 are processing pre-printed data 1011 and receive pre-printed data 1012, the four RIP processing units 1031-1034 suspend the processing of pre-printed data 1011 and execute the processing of pre-printed data 1012. When the processing of pre-printed data 1012 is completed, the four RIP processing units 1031-1034 share the workload again and restart the processing of pre-printed data 1011. When the processing of pre-printed data 1011 restarts, each of the RIP processing units performs the prescribed processing from the first page to the desired page.

[0117] Here, refer to Figure 6In the information processing system 110, the continued processing of the RIP for the pre-printed data 601 is assigned to one of the four RIP processing units 631-634, RIP processing unit 631, while the execution of the RIP processing for the pre-printed data 602 is assigned to the three RIP processing units 632-634. In contrast, in... Figure 10 In the information processing system 1010 shown, four RIP processing units 1031 to 1034 perform RIP processing of the queue-jumping print data 1012.

[0118] Thus, during the RIP processing of the queue-printed data, Figure 6 In one example, a RIP processing unit continues to process the RIP data first, whereas in... Figure 10 In this example, there is no RIP processing mechanism to continue processing the preceding jobs. Furthermore, after the processing of the queued print data is completed, in... Figure 6 In the example, the three RIP processing units perform the prescribed processing to restart the RIP processing of the previously printed data, in contrast, in Figure 10 In this example, four RIP processing units perform the prescribed processing to restart the RIP processing of the previously printed data.

[0119] Thus, in Figure 6 In the example, with Figure 10 Compared to other examples, the RIP processing time for pre-printed data may be longer, but by using a partial RIP processing mechanism to continuously accumulate the RIP processing pages of the pre-printed data, the time required to restart the RIP processing of the pre-printed data can be shortened. Thus, according to the technology of the present invention, the decrease in productivity associated with the RIP processing of pre-printed data can be suppressed.

[0120] The above examples illustrate possible implementation methods, but the above implementation methods can also be modified into various forms or applied to various purposes.

[0121] In this embodiment, each process is executed by any computer. Alternatively, any computer may execute these processes via a processor as hardware, a program as software, or a combination thereof. In this case, the processor is configured to cooperate with the program to execute the various processes of this embodiment, and may also function as a unit or means of this embodiment. Furthermore, the execution order of the processes performed by the processor is not limited to the order described and may be appropriately varied. Any computer may also be a general-purpose computer, a computer for a specific purpose, a workstation, or other system capable of executing the processes.

[0122] A processor can be composed of one or more hardware components, and the type of hardware is not limited. For example, a processor can be composed of programmable logic devices such as CPUs (Central Processing Units), MPUs (Micro Processing Units), FPGAs (Field Programmable Gate Arrays), dedicated circuits such as ASICs (Application Specific Integrated Circuits) for performing specific processes, GPUs (Graphics Processing Units), or NPUs (Neural Processing Units). Furthermore, the hardware can also be a combination of different types of hardware. When multiple hardware components are configured to execute one or more processes of a processor, these multiple hardware components can exist in physically separate devices or in the same device. Moreover, in any embodiment, the order in which the processor performs each process is not limited to the above order and can be appropriately varied. In addition, the hardware is composed of circuits, such as those combining semiconductor elements.

[0123] Furthermore, the program can also be firmware, microcode, or other software. Additionally, the program can be, for example, a group of program modules, each of whose functions can be implemented by a processor configured to perform those functions. The program can also be program code or multiple code segments stored on one or more non-transitory computer-readable media (e.g., storage media or other storage devices). The program can also be segmented and stored on multiple non-transitory computer-readable media existing in physically separate devices. Program code or code segments can represent steps, functions, subroutines, routines, subroutines, modules, software packages, categories, or commands, data structures, or any combination of program statements. Program code or code segments can also be connected to other code segments or hardware circuits by sending and receiving information, data, arguments, parameters, or the contents of memory. Furthermore, the program of this application can also be provided as a program product.

[0124] (Postscript) ((1))

[0126] An information processing system, wherein,

[0127] Equipped with a processor

[0128] The processor

[0129] If queue-jumped print data is obtained, determine whether the preceding print data that started RIP processing is in a format where each page is independent.

[0130] In cases where the preceding print data is not in the form of independent data for each page, the execution of RIP processing for the queued print data is distributed to a portion of the multiple RIP processing units that share and perform RIP processing on the preceding print data in parallel, and the continued distribution of RIP processing for the preceding print data is distributed to the remaining portion of the multiple RIP processing units. ((2))

[0132] According to the information processing system described in (1), wherein,

[0133] The processor

[0134] A screen displays a setting related to the number of RIP processing units that accept RIP processing that is assigned the queued print data.

[0135] The number of RIP processing units that are assigned the queued print data is determined by referring to the set value. ((3)))

[0137] According to the information processing system described in (1), wherein,

[0138] The processor

[0139] The screen displays the input for accepting priority for printing in queue.

[0140] The number of RIP processing units that execute the RIP processing assigned to the queue-jumping print data is determined based on the priority. ((4))

[0142] According to the information processing system described in (1), wherein,

[0143] The processor

[0144] A lower limit is determined for the number of continuing RIP processing units assigned to the RIP processing of the pre-printed data, such that the predicted number of pages processed by RIP on the pre-printed data per unit time is not less than the predicted number of pages printed on the pre-printed data per unit time.

[0145] Determine the number of RIP processing units that perform the RIP processing to which the queued print data is assigned. ((5))

[0147] The information processing system according to any one of (2) to (4) is wherein,

[0148] The processor

[0149] If the number of pages of the queued print data is less than the number of the plurality of RIP processing units, the number of RIP processing units that execute the RIP processing to be assigned the queued print data is determined to be less than the number of pages of the queued print data. (6))

[0151] The information processing system according to any one of ((1)) to ((5)) is wherein,

[0152] The processor

[0153] Once the RIP processing of the pre-printed data is completed, the RIP processing of the preceding printed data is continued to be assigned to the RIP processing unit that was assigned the execution of the RIP processing of the pre-printed data. ((7))

[0155] A program that causes a computer to perform processing, wherein the processing is:

[0156] If queue-jumped print data is obtained, determine whether the preceding print data that started RIP processing is in a format where each page is independent.

[0157] In cases where the preceding print data is not in the form of independent data for each page, the execution of RIP processing for the queued print data is distributed to a portion of the multiple RIP processing units that share and perform RIP processing on the preceding print data in parallel, and the continued distribution of RIP processing for the preceding print data is distributed to the remaining portion of the multiple RIP processing units.

[0158] According to the information processing system ((1)) and the program ((7)), compared with pausing the RIP processing of the preceding print data and performing the RIP processing of the queued print data, it is possible to suppress the decrease in productivity caused by performing the RIP processing of the queued print data while the RIP processing of the preceding print data is in progress.

[0159] According to the information processing system ((2)), the number of RIP processing units corresponding to the accepted set value can perform the RIP processing of the queue-printed data.

[0160] According to the information processing system ((3)), the RIP processing of the queue printing data can be performed by a number of RIP processing units corresponding to the priority of the queue printing that can be intuitively input.

[0161] According to the information processing system ((4)), when the RIP processing and printing processing of print data are performed through a series of procedures, it is possible to suppress intermittent printing.

[0162] According to the information processing system ((5)), the execution of RIP processing of queued print data can be assigned to a number of RIP processing units below the number of pages of queued print data.

[0163] According to the information processing system ((6)), compared to the case where the RIP processing of the preceding print data is not further allocated to the RIP processing unit that is assigned to the execution of the RIP processing of the queued print data, the RIP processing of the preceding print data can be shared by more RIP processing units after the RIP processing of the queued print data is completed.

Claims

1. An information processing system, characterized in that, Equipped with a processor The processor If queued print data is obtained, determine whether the preceding print data that started RIP processing is in a format where each page is independent. In cases where the preceding print data is not in the form of independent data for each page, the execution of RIP processing for the queued print data is distributed to a portion of the multiple RIP processing units that share and perform RIP processing on the preceding print data in parallel, and the continued distribution of RIP processing for the preceding print data is distributed to the remaining portion of the multiple RIP processing units.

2. The information processing system according to claim 1, wherein, The processor A screen displays a setting related to the number of RIP processing units that accept RIP processing that is assigned the queued print data. The number of RIP processing units that are assigned the queued print data is determined by referring to the set value.

3. The information processing system according to claim 1, wherein, The processor The screen displays the input for accepting priority for printing in the queue. The number of RIP processing units that execute the RIP processing assigned to the queue-jumping print data is determined based on the priority.

4. The information processing system according to claim 1, wherein, The processor A lower limit is determined for the number of continuing RIP processing units assigned to the RIP processing of the pre-printed data, such that the predicted number of pages processed by RIP on the pre-printed data per unit time is not less than the predicted number of pages printed on the pre-printed data per unit time. Determine the number of RIP processing units that perform the RIP processing to which the queued print data is assigned.

5. The information processing system according to any one of claims 2 to 4, wherein, The processor If the number of pages of the queued print data is less than the number of the plurality of RIP processing units, the number of RIP processing units that execute the RIP processing to be assigned the queued print data is determined to be less than the number of pages of the queued print data.

6. The information processing system according to any one of claims 1 to 5, wherein, The processor Once the RIP processing of the pre-printed data is completed, the RIP processing of the preceding printed data is continued to be assigned to the RIP processing unit that was assigned the execution of the RIP processing of the pre-printed data.

7. A program product comprising a program that causes a computer to perform processing, characterized in that, The process is as follows: If queued print data is obtained, determine whether the preceding print data that started RIP processing is in a format where each page is independent. In cases where the preceding print data is not in the form of independent data for each page, the execution of RIP processing for the queued print data is distributed to a portion of the multiple RIP processing units that share and perform RIP processing on the preceding print data in parallel, and the continued distribution of RIP processing for the preceding print data is distributed to the remaining portion of the multiple RIP processing units.

8. An information processing method, characterized in that, If queued print data is obtained, determine whether the preceding print data that started RIP processing is in a format where each page is independent. In cases where the preceding print data is not in the form of independent data for each page, the execution of RIP processing for the queued print data is distributed to a portion of the multiple RIP processing units that share and perform RIP processing on the preceding print data in parallel, and the continued distribution of RIP processing for the preceding print data is distributed to the remaining portion of the multiple RIP processing units.

Images