US20030223090A1 - Method and implementation for message-driven job processing - Google Patents

Method and implementation for message-driven job processing Download PDF

Info

Publication number
US20030223090A1
US20030223090A1 US10/156,443 US15644302A US2003223090A1 US 20030223090 A1 US20030223090 A1 US 20030223090A1 US 15644302 A US15644302 A US 15644302A US 2003223090 A1 US2003223090 A1 US 2003223090A1
Authority
US
United States
Prior art keywords
job
manager
message
job manager
component
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
Application number
US10/156,443
Inventor
Mustafa Seifi
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Toshiba Tec Corp
Original Assignee
Individual
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Individual filed Critical Individual
Priority to US10/156,390 priority Critical patent/US7107283B2/en
Priority to US10/156,443 priority patent/US20030223090A1/en
Assigned to TOSHIBA TEC KABUSHIKI KAISHA reassignment TOSHIBA TEC KABUSHIKI KAISHA ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: SEIFI, MUSTAFA
Priority to JP2004508014A priority patent/JP2005527910A/en
Priority to AU2003249662A priority patent/AU2003249662A1/en
Priority to PCT/US2003/016990 priority patent/WO2003100630A1/en
Priority to EP03755530A priority patent/EP1508097A4/en
Publication of US20030223090A1 publication Critical patent/US20030223090A1/en
Priority to US11/692,675 priority patent/US20070186216A1/en
Abandoned legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/48—Program initiating; Program switching, e.g. by interrupt
    • G06F9/4806—Task transfer initiation or dispatching
    • G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; 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/12—Digital output to print unit, e.g. line printer, chain printer
    • G06F3/1201—Dedicated interfaces to print systems
    • G06F3/1202—Dedicated interfaces to print systems specifically adapted to achieve a particular effect
    • G06F3/1211—Improving printing performance
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; 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/12—Digital output to print unit, e.g. line printer, chain printer
    • G06F3/1201—Dedicated interfaces to print systems
    • G06F3/1223—Dedicated interfaces to print systems specifically adapted to use a particular technique
    • G06F3/1237—Print job management
    • G06F3/126—Job scheduling, e.g. queuing, determine appropriate device
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; 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/12—Digital output to print unit, e.g. line printer, chain printer
    • G06F3/1201—Dedicated interfaces to print systems
    • G06F3/1278—Dedicated interfaces to print systems specifically adapted to adopt a particular infrastructure
    • G06F3/1285—Remote printer device, e.g. being remote from client or server
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/54—Interprogram communication
    • G06F9/546—Message passing systems or structures, e.g. queues
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
    • H04N1/00912—Arrangements for controlling a still picture apparatus or components thereof not otherwise provided for
    • H04N1/00915—Assigning priority to, or interrupting, a particular operation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
    • H04N1/00912—Arrangements for controlling a still picture apparatus or components thereof not otherwise provided for
    • H04N1/00954—Scheduling operations or managing resources
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
    • H04N1/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
    • H04N1/32502—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device in systems having a plurality of input or output devices
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
    • H04N1/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
    • H04N1/32502—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device in systems having a plurality of input or output devices
    • H04N1/32523—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device in systems having a plurality of input or output devices a plurality of output devices
    • H04N1/32529—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device in systems having a plurality of input or output devices a plurality of output devices of different type, e.g. internal and external devices
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00—Data processing: database and file management or data structures
    • Y10S707/912—Applications of a database
    • Y10S707/913—Multimedia
    • Y10S707/915—Image
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00—Data processing: database and file management or data structures
    • Y10S707/953—Organization of data
    • Y10S707/954—Relational
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00—Data processing: database and file management or data structures
    • Y10S707/953—Organization of data
    • Y10S707/959—Network
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00—Data processing: database and file management or data structures
    • Y10S707/99931—Database or file accessing
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00—Data processing: database and file management or data structures
    • Y10S707/99941—Database schema or data structure
    • Y10S707/99944—Object-oriented database structure
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00—Data processing: database and file management or data structures
    • Y10S707/99941—Database schema or data structure
    • Y10S707/99944—Object-oriented database structure
    • Y10S707/99945—Object-oriented database structure processing

Definitions

  • jobs e.g. printing jobs
  • jobs are assigned a position in the queue and a network device, e.g. a network printer, processes each of the jobs in a predetermined order.
  • a network device e.g. a network printer
  • processes each of the jobs in a predetermined order for example, the jobs can be processed in the order they have been received.
  • the jobs can be processed in accordance with priority, with high priority jobs being given preference.
  • the operation of the queue can be implemented in a number of different ways.
  • the system constantly loops through all the jobs in the queue to insure that the jobs are being processed quickly.
  • this method requires that the queue be monitored at all time, even when no jobs are awaiting processing. This approach therefore uses up lots of CPU time by monitoring the queue at all times, and therefore inefficiently manages system resources.
  • a “daemon” process can be implemented that “wakes up” in predefined time intervals and processes any jobs that are waiting in the queue. While this method puts less demand on the CPU, it suffers from the drawback that jobs may sit idle for an undesirable period of time until the daemon process wakes up to service the waiting jobs. In this way, this approach is inefficient at managing the performance of the system.
  • FIG. 1 is a block diagram showing the process flow of the job manager in accordance with the present invention.
  • the present invention includes a job manager that ensures continuous and timely attendance to the jobs in the queue.
  • a job e.g. a printing job
  • a job creation instruction message is sent to the job manager to notify that a new job has entered the queue.
  • the message can be sent and received using any type of conventional messaging system.
  • the job manager then sends processing messages to one or more components that are assigned to process the jobs in the queue for each specific client.
  • a job state change message is sent from a component to the job manager to notify the job manager when the component begins to process a given job.
  • Another job state change message is sent to the job manager from the component to notify the job manager when the component is done processing the given job.
  • Any “job create” and “job state change” message to the job manager will cause the job manager to process all the jobs in the queue. As long as components continue to process of their respective jobs and notify job manager of their progress the jobs in the queue will be processed. If the processing of a job is interrupted for any reason, e.g. if a printer runs out of paper, an “interrupt” message is sent from the component to the job manager, who then reports the interruption to a user or system administrator. All other jobs in the queue will be processed normally.
  • the job manager will receive a message from a thread within its process based on a configurable amount of time (T). This message will cause the job manager to process all the jobs in the queue if the current time (CT) minus T is greater than the last time (LT) when the job manager received a “job create” or a “state change” message.
  • CT current time
  • LT last time
  • job processing if (CT ⁇ T)>LT).

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • General Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Software Systems (AREA)
  • Human Computer Interaction (AREA)
  • Accessory Devices And Overall Control Thereof (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

A method and implementation for job managing is disclosed which enables the creating of a job in a client system and sending a job creation instruction message to a job manager to notify that a new job has entered a processing queue. At least one processing message is sent from the job manager to at least one respective component. A first job state change message is sent from the respective component to the job manager to notify the job manager when the component begins to process a given job. A second job state change message is sent to the job manager from the component to notify the job manager when the component is done processing the given job.

Description

    BACKGROUND OF THE INVENTION
  • In a network, it is common to process jobs, e.g. printing jobs, in a queue. Jobs are assigned a position in the queue and a network device, e.g. a network printer, processes each of the jobs in a predetermined order. Fort example, the jobs can be processed in the order they have been received. Also, the jobs can be processed in accordance with priority, with high priority jobs being given preference. [0001]
  • In a network, the operation of the queue can be implemented in a number of different ways. In one common previous-type method of processing jobs in a queue, the system constantly loops through all the jobs in the queue to insure that the jobs are being processed quickly. However, this method requires that the queue be monitored at all time, even when no jobs are awaiting processing. This approach therefore uses up lots of CPU time by monitoring the queue at all times, and therefore inefficiently manages system resources. [0002]
  • In another previous-type method of job processing, a “daemon” process can be implemented that “wakes up” in predefined time intervals and processes any jobs that are waiting in the queue. While this method puts less demand on the CPU, it suffers from the drawback that jobs may sit idle for an undesirable period of time until the daemon process wakes up to service the waiting jobs. In this way, this approach is inefficient at managing the performance of the system. [0003]
    • SUMMARY OF THE INVENTION
  • The difficulties and drawbacks of the previous-type approaches are resolved by the method and implementation for job managing of the present invention which enables the creation of a job in a client system and sending a job creation instruction message to a job manager to notify that a new job has entered a processing queue. At least one processing message is sent from the job manager to at least one respective component. A first job state change message is sent from the respective component to the job manager to notify the job manager when the component begins to process a given job. A second job state change message is sent to the job manager from the component to notify the job manager when the component is done processing the given job. [0004]
  • As will be realized, the invention is capable of other and different embodiments and its several details are capable of modifications in various respects, all without departing from the invention. Accordingly, the drawing and description are to be regarded as illustrative and not restrictive.[0005]
    • BRIEF DESCRIPTION OF THE DRAWINGS
  • FIG. 1 is a block diagram showing the process flow of the job manager in accordance with the present invention.[0006]
    • DETAILED DESCRIPTION OF THE INVENTION
  • The present invention includes a job manager that ensures continuous and timely attendance to the jobs in the queue. In the present method and implementation, as particularly shown in FIG. 1, a job (e.g. a printing job) is created by a client system, and a job creation instruction message is sent to the job manager to notify that a new job has entered the queue. The message can be sent and received using any type of conventional messaging system. The job manager then sends processing messages to one or more components that are assigned to process the jobs in the queue for each specific client. A job state change message is sent from a component to the job manager to notify the job manager when the component begins to process a given job. Another job state change message is sent to the job manager from the component to notify the job manager when the component is done processing the given job. [0007]
  • Any “job create” and “job state change” message to the job manager will cause the job manager to process all the jobs in the queue. As long as components continue to process of their respective jobs and notify job manager of their progress the jobs in the queue will be processed. If the processing of a job is interrupted for any reason, e.g. if a printer runs out of paper, an “interrupt” message is sent from the component to the job manager, who then reports the interruption to a user or system administrator. All other jobs in the queue will be processed normally. [0008]
  • To ensure communication continuity between the job manager and other components, the job manager will receive a message from a thread within its process based on a configurable amount of time (T). This message will cause the job manager to process all the jobs in the queue if the current time (CT) minus T is greater than the last time (LT) when the job manager received a “job create” or a “state change” message. The above condition can also be written as: job processing if ((CT−T)>LT). [0009]
  • As described hereinabove, the present invention solves many problems associated with previous type devices. However, it will be appreciated that various changes in the details, materials and arrangements of parts which have been herein described and illustrated in order to explain the nature of the invention may be made by those skilled in the area within the principle and scope of the invention will be expressed in the appended claims. [0010]

Claims (14)

I claim:
1. A method for job managing comprising:
creating a job in a client system,
sending a job creation instruction message to a job manager to notify that a new job has entered a processing queue;
sending at least one processing message from the job manager to at least one respective component;
sending a first job state change message from the respective component to the job manager to notify the job manager when the component begins to process a given job;
sending a second job state change message to the job manager from the component to notify the job manager when the component is done processing the given job.
2. The method of claim 1 wherein receipt of one of a job creation message and a job state change message by the job manager will cause the job manager to process all the jobs in the queue.
3. The method of claim 1 wherein if processing of the job is interrupted, an “interrupt” message is sent from the component to the job manager, who then reports the interruption to one of a user and a system administrator.
4. The method of claim 1 wherein, upon receipt of a message with a configurable interval of time (T), the job manager will process any jobs in the queue if the current time (CT) minus T is greater than the last time (LT) when the job manager received a “job create” or a “state change” message such that ((CT−T)>LT).
5. The method of claim 1 wherein the job is a printing job and the respective component for completing the job is a network printer.
6. The method of claim 1 wherein a respective component is assigned to process jobs in the queue for each respective client.
7. The method of claim 1 wherein the messages are sent and received using any type of conventional messaging system.
8. A job manager comprising:
an implementation for creating a job in a client system,
an implementation for sending a job creation instruction message to a job manager to notify that a new job has entered a processing queue;
an implementation for sending at least one processing message from the job manager to at least one respective component;
an implementation for sending a first job state change message from the respective component to the job manager to notify the job manager when the component begins to process a given job;
an implementation for sending a second job state change message to the job manager from the component to notify the job manager when the component is done processing the given job.
9. The job manager of claim 8 further comprising an implementation wherein receipt of one of a job creation message and a job state change message by the job manager will cause the job manager to process all the jobs in the queue.
10. The job manager of claim 8 further comprising an implementation wherein if processing of the job is interrupted, an “interrupt” message is sent from the component to the job manager, who then reports the interruption to one of a user and a system administrator.
11. The job manager of claim 8 further comprising an implementation wherein, upon receipt of a message with a configurable interval of time (T), the job manager will process any jobs in the queue if the current time (CT) minus T is greater than the last time (LT) when the job manager received a “job create” or a “state change” message such that ((CT−T)>LT).
12. The job manager of claim 8 wherein the job is a printing job and the respective component for completing the job is a network printer.
13. The job manager of claim 8 wherein a respective component is assigned to process jobs in the queue for each respective client.
14. The job manager of claim 8 wherein any type of conventional messaging system is employed for sending and receiving messages.
US10/156,443 2002-05-28 2002-05-28 Method and implementation for message-driven job processing Abandoned US20030223090A1 (en)

Priority Applications (7)

Application Number Priority Date Filing Date Title
US10/156,390 US7107283B2 (en) 2002-05-28 2002-05-28 Relational job queue
US10/156,443 US20030223090A1 (en) 2002-05-28 2002-05-28 Method and implementation for message-driven job processing
JP2004508014A JP2005527910A (en) 2002-05-28 2003-05-28 Method and implementation for message drive job processing
AU2003249662A AU2003249662A1 (en) 2002-05-28 2003-05-28 Method and implementation for message-driven job processing
PCT/US2003/016990 WO2003100630A1 (en) 2002-05-28 2003-05-28 Method and implementation for message-driven job processing
EP03755530A EP1508097A4 (en) 2002-05-28 2003-05-28 PROCESS AND IMPLEMENTATION FOR MESSAGE-CONTROLLED JOB PROCESSING
US11/692,675 US20070186216A1 (en) 2002-05-28 2007-03-28 Message driven job processing system and method

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US10/156,390 US7107283B2 (en) 2002-05-28 2002-05-28 Relational job queue
US10/156,443 US20030223090A1 (en) 2002-05-28 2002-05-28 Method and implementation for message-driven job processing

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US11/692,675 Continuation-In-Part US20070186216A1 (en) 2002-05-28 2007-03-28 Message driven job processing system and method

Publications (1)

Publication Number Publication Date
US20030223090A1 true US20030223090A1 (en) 2003-12-04

Family

ID=29586319

Family Applications (2)

Application Number Title Priority Date Filing Date
US10/156,390 Expired - Fee Related US7107283B2 (en) 2002-05-28 2002-05-28 Relational job queue
US10/156,443 Abandoned US20030223090A1 (en) 2002-05-28 2002-05-28 Method and implementation for message-driven job processing

Family Applications Before (1)

Application Number Title Priority Date Filing Date
US10/156,390 Expired - Fee Related US7107283B2 (en) 2002-05-28 2002-05-28 Relational job queue

Country Status (5)

Country Link
US (2) US7107283B2 (en)
EP (1) EP1508097A4 (en)
JP (1) JP2005527910A (en)
AU (1) AU2003249662A1 (en)
WO (1) WO2003100630A1 (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070256081A1 (en) * 2006-04-28 2007-11-01 Michael Comer System and method for management of jobs in a cluster environment
US20100121673A1 (en) * 2007-02-26 2010-05-13 Motohiko Sakaguchi Message notification method, work management device, and computer program
CN106888135A (en) * 2015-12-15 2017-06-23 阿里巴巴集团控股有限公司 The querying method and device of a kind of task status
US20210279688A1 (en) * 2018-07-23 2021-09-09 Srinivasa Rao Boddapu Ai platform with real-time analytics and social incentive referrals

Families Citing this family (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7421440B2 (en) * 2004-08-24 2008-09-02 Microsoft Corporation Method and system for importing data
US7502843B2 (en) * 2004-12-30 2009-03-10 Microsoft Corporation Server queuing system and method
US20060167971A1 (en) * 2004-12-30 2006-07-27 Sheldon Breiner System and method for collecting and disseminating human-observable data
US7359897B2 (en) * 2005-06-02 2008-04-15 Toshiba Corporation System and method for document management and retrieval
EP2079020B1 (en) * 2008-01-03 2013-03-20 Accenture Global Services Limited System amd method for automating ETL applications
US8037024B1 (en) * 2008-06-04 2011-10-11 Google Inc. Data propagation in a multi-shard database system
US8458146B2 (en) * 2008-09-11 2013-06-04 International Business Machines Corporation Accessing data remotely
US8896871B2 (en) 2013-03-13 2014-11-25 Xerox Corporation Batch confirmation of distributed scan job submission in a business processing system
EP3373149A4 (en) * 2015-11-06 2019-04-03 Nomura Research Institute, Ltd. DATA MANAGEMENT SYSTEM
US12026048B2 (en) 2022-09-16 2024-07-02 Bank Of America Corporation Early detection and avoidance of mainframe job errors
US12099399B2 (en) 2022-09-16 2024-09-24 Bank Of America Corporation Intelligent healing of mainframe job errors
US12314124B2 (en) 2023-07-12 2025-05-27 Bank Of America Corporation System and method for resolving a system alarm
US12242363B2 (en) 2023-07-12 2025-03-04 Bank Of America Corporation System and method for securing resolution of a system alarm

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5287194A (en) * 1992-11-25 1994-02-15 Xerox Corporation Distributed printing
US6474881B1 (en) * 1999-06-30 2002-11-05 Canon Kabushiki Kaisha Information processing apparatus, information processing system, print control method, and storage medium storing computer readable program
US6570670B1 (en) * 1999-11-29 2003-05-27 Xerox Corporation Method and apparatus to enable job streaming for a set of commonly shared resources
US6587735B1 (en) * 1999-05-10 2003-07-01 Canon Kabushiki Kaisha Data processing apparatus and processor selection method
US6874034B1 (en) * 2000-08-17 2005-03-29 Hewlett-Packard Development Company, L.P. Intelligent peer hybrid printing protocol

Family Cites Families (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4805107A (en) * 1987-04-15 1989-02-14 Allied-Signal Inc. Task scheduler for a fault tolerant multiple node processing system
US5414845A (en) * 1992-06-26 1995-05-09 International Business Machines Corporation Network-based computer system with improved network scheduling system
WO1995009395A1 (en) * 1993-09-27 1995-04-06 Oracle Corporation Method and apparatus for parallel processing in a database system
US6014138A (en) * 1994-01-21 2000-01-11 Inprise Corporation Development system with methods for improved visual programming with hierarchical object explorer
JP3580060B2 (en) * 1996-05-09 2004-10-20 富士ゼロックス株式会社 Print control apparatus and method
JPH1063747A (en) * 1996-08-20 1998-03-06 Fuji Xerox Co Ltd Work flow supporting system, and method therefor
US5923826A (en) * 1997-01-21 1999-07-13 Xerox Corporation Copier/printer with print queue disposed remotely thereof
DE69808633T2 (en) * 1997-07-25 2003-06-12 British Telecomm SEQUENCE CONTROL FOR A SOFTWARE SYSTEM
US6111579A (en) * 1998-03-31 2000-08-29 International Business Machines Corporation Data processor controlled display system with a tree hierarchy of elements view having virtual nodes
US6353820B1 (en) * 1999-09-29 2002-03-05 Bull Hn Information Systems Inc. Method and system for using dynamically generated code to perform index record retrieval in certain circumstances in a relational database manager
US6772031B1 (en) * 2000-05-30 2004-08-03 International Business Machines Corporation Method of, system for, and computer program product for providing a job monitor
US6604110B1 (en) * 2000-08-31 2003-08-05 Ascential Software, Inc. Automated software code generation from a metadata-based repository

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5287194A (en) * 1992-11-25 1994-02-15 Xerox Corporation Distributed printing
US6587735B1 (en) * 1999-05-10 2003-07-01 Canon Kabushiki Kaisha Data processing apparatus and processor selection method
US6474881B1 (en) * 1999-06-30 2002-11-05 Canon Kabushiki Kaisha Information processing apparatus, information processing system, print control method, and storage medium storing computer readable program
US6570670B1 (en) * 1999-11-29 2003-05-27 Xerox Corporation Method and apparatus to enable job streaming for a set of commonly shared resources
US6874034B1 (en) * 2000-08-17 2005-03-29 Hewlett-Packard Development Company, L.P. Intelligent peer hybrid printing protocol

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070256081A1 (en) * 2006-04-28 2007-11-01 Michael Comer System and method for management of jobs in a cluster environment
US7840969B2 (en) * 2006-04-28 2010-11-23 Netapp, Inc. System and method for management of jobs in a cluster environment
US20100121673A1 (en) * 2007-02-26 2010-05-13 Motohiko Sakaguchi Message notification method, work management device, and computer program
CN106888135A (en) * 2015-12-15 2017-06-23 阿里巴巴集团控股有限公司 The querying method and device of a kind of task status
US20210279688A1 (en) * 2018-07-23 2021-09-09 Srinivasa Rao Boddapu Ai platform with real-time analytics and social incentive referrals

Also Published As

Publication number Publication date
EP1508097A1 (en) 2005-02-23
US7107283B2 (en) 2006-09-12
EP1508097A4 (en) 2007-06-20
JP2005527910A (en) 2005-09-15
US20030225721A1 (en) 2003-12-04
AU2003249662A1 (en) 2003-12-12
AU2003249662A8 (en) 2003-12-12
WO2003100630A1 (en) 2003-12-04

Similar Documents

Publication Publication Date Title
US20030223090A1 (en) Method and implementation for message-driven job processing
WO2021190087A1 (en) Task execution method, device and system, and server
JP3691515B2 (en) Event distribution apparatus and method in operating system
US5875329A (en) Intelligent batching of distributed messages
US8341439B2 (en) Power management apparatus and method thereof and power control system
US9625888B2 (en) System and method of thermal control in a chassis
CN111427674A (en) Micro-service management method, device and system
US6615215B1 (en) Method for graduated load sensitive task dispatching in computing system
US8792121B2 (en) Method for controlling printing of a print job
CN113535344A (en) Network data processing method and device, server and storage medium
CN112860405A (en) Distributed job flow task management and scheduling system and method
US20030023775A1 (en) Efficient notification of multiple message completions in message passing multi-node data processing systems
US8589605B2 (en) Inbound message rate limit based on maximum queue times
US11354161B2 (en) Controlling memory utilization by a topic in a publish-subscribe environment
US11340828B2 (en) Restoring messages to a memory utilized by a topic in a publish-subscribe environment
US20070150563A1 (en) Method and system for providing efficient object-based network management
US11016807B2 (en) Intermediary system for data streams
CN115102912B (en) Method, device and system for distributing and controlling speed of network group message
US7757235B2 (en) Trigger support for a bi-directional broker
JPH10326207A (en) WWW server session maintenance management system
JP3601895B2 (en) Multiprocessor system
JPH0628273A (en) Input telegraphic message distribution system
JPH0744482A (en) Server state management system
CN109344039A (en) A host intelligent monitoring method and device
JPH10283241A (en) Maintenance system for monitor system

Legal Events

Date Code Title Description
AS Assignment

Owner name: TOSHIBA TEC KABUSHIKI KAISHA, JAPAN

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:SEIFI, MUSTAFA;REEL/FRAME:013123/0665

Effective date: 20020516

STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION