Skip to Main Content
Performing data processing services at different priorities involves considerations not usually associated with queuing theory. Basically, this is due to the fact that a lower priority service can be performed at the same time that an input/output operation is taking place as part of a higher priority service. This overlapping of i/o operations with the execution of instructions complicates the problem of obtaining quantitative information about data processing services done on a priority basis. Yet this kind of information is highly desirable for designing efficient systems.
Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.