Browse Prior Art Database

Queued Submission of Work

IP.com Disclosure Number: IPCOM000034619D
Original Publication Date: 1989-Mar-01
Included in the Prior Art Database: 2005-Jan-27
Document File: 1 page(s) / 12K

Publishing Venue

IBM

Related People

Decker, SR: AUTHOR

Abstract

The facility defined in this article is important to users of Intelligent Workstations because it allows work to be performed automatically on either the Host or the PC. The idea of queuing work for later execution is not in itself new; however, allowing individual users to queue work that can be performed both on the Intelligent Work- station and the Host is unique to the Professional Work Manager (PWM) product. Activities are PWM procedures that comprise commands that can simulate a user's computer interactions. Variables used by parameters associated with commands (derived from an input panel) can be saved with the Activity and will be used when the Activity executes. Activities can be stored in a queue, and the queue can be released at a specified date and time.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 80% of the total text.

Page 1 of 1

Queued Submission of Work

The facility defined in this article is important to users of Intelligent Workstations because it allows work to be performed automatically on either the Host or the PC. The idea of queuing work for later execution is not in itself new; however, allowing individual users to queue work that can be performed both on the Intelligent Work- station and the Host is unique to the Professional Work Manager (PWM) product. Activities are PWM procedures that comprise commands that can simulate a user's computer interactions. Variables used by parameters associated with commands (derived from an input panel) can be saved with the Activity and will be used when the Activity executes. Activities can be stored in a queue, and the queue can be released at a specified date and time. The queue facility of PWM allows the user to set the order in which Activities execute by defining contingencies that must be met before an Activity executes. This lets the user make the order of Activity execution dependent upon the successful completion of another Activity. If one Activity fails, an Activity dependent on it will be skipped. (An Activity is successful if it completes execution and a special variable called Abort$ was not invoked to indicate an unsuccessful operation.) The user may override the queue to submit an Activity directly, or delete any item on the queue. The date and time for release can be set or "held", which indicates that no execution is to be i...