METHOD OF PREDICTING QUEUING TIME AND EXECUTION TIME AND QUEUING DEVICE

PROBLEM TO BE SOLVED: To predict a computer whose execution time up to execution end is shortest in the case of charging a job to a network constituted of plural computers of different sorts. SOLUTION: A computer having one or more jobs in executing finds out a time value (1st time value) required u...

Full description

Saved in:
Bibliographic Details
Main Authors TATEYAMA MASAYOSHI, IMAI MASANORI
Format Patent
LanguageEnglish
Published 03.08.2001
Edition7
Subjects
CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
Online AccessGet full text

Cover

More Information
Summary:PROBLEM TO BE SOLVED: To predict a computer whose execution time up to execution end is shortest in the case of charging a job to a network constituted of plural computers of different sorts. SOLUTION: A computer having one or more jobs in executing finds out a time value (1st time value) required up to the end of the job (or jobs) by utilizing the value of necessary throughput and the value of computer throughput. Also as to a job to be newly charged, the computer finds out execution time (2nd time value) by utilizing the value of necessary throughput and the value of computer throughput. Each computer calculates the sum of the 1st time value and the 2nd time value and the computer having the smallest sum is adopted as a computer to which a job is to be charged.
Bibliography:Application Number: JP20000015755