or
Coordinated concurrent printing of print jobs



Bookmark and Share
PDF+Word+Text
Download of US
Patent 6872015
Electronic File
History (Wrapper)
PDF Download
Bulk Download
of 50+ Related
Patent PDFs
$59.95
$39.95
Document Number
US Patent 6872015
Issued Date
March 29, 2005
Link
Map
Abstract
A method, apparatus and program for distributed printing of digital print files in a network system including a print service and a plurality of printers adapted for interactive printing are provided. An interactive printing involves printing a print file only upon selection thereof and entering a print command through the local user interface of the printer. In a first step of the method, the print service receives a print file, stores it and distributes information on the stored print file to a plurality of the printers. In a second step, a print process for the print file is started, locally or remotely, in one of the printers and, while this print process is active, a print process for the same print file is started locally in one or more of the other printers. During the printing, the print service controls the printers to print together the required number of copies.
Tags:
Description:
Amusing 0%
Clever 0%
Complex 0%
Efficient 0%
Historic 0%
Important 0%
Innovative 0%
Interesting 0%
Practical 0%
Simple 0%
Number of Claims:
21
Comments:
no comments yet
Owner
Published
March 29, 2005
Application Number
10/649,867
Filed
August 28, 2003
US Classification
400/61   358/1.15 358/1.9 400/62
Int'l Classification
B41J   11/44   (20060101)   B41J   5/30   (20060101)   B41J   29/38   (20060101)   G06F   3/12   (20060101)  
Examiner
Priority Data
Aug 28, 2002 [EP] 02078843
USPTO Field of Search
400/61   400/62   400/70   400/76   358/1.1   358/1.13   358/1.9  
Related Patents
7590464 - System and method for on-line planning utilizing multiple planning queues - Owned by Palo Alto Research Center Incorporated (Palo Alto, CA)

Features described herein relate to concurrently processing multiple batches of job requests for one or more machines and/or components thereof, using a plurality of job planning queues. Each batch of job requests is allocated to a planning queue, and each planning queue comprises an unplanned subqueue that stores unplanned jobs, an unsent subqueue that stores planned jobs waiting to be executed, and a sent subqueue that stores planned jobs that have been output to the machine(s) for execution. A job planner and related components determine which unsent subqueue has the fewest planned jobs at a given point in time, and selects an unplanned job from the unplanned subqueue in the same planning queue as the identified unsent subqueue. The planner then generates a plan for the selected job and inserts the planned job into the unsent subqueue for eventual output to the machine(s) for execution. In this manner, the unsent subqueues for each planning queue are maintained with substantially equal numbers of planned jobs ready for execution, which improves throughput by ensuring that all machines and/or associated components are kept busy.

Claims
Description
About| FAQs| Terms & Disclaimer| Link to Us| Contact Us