Abstract
Purchase PDF (681 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (1)
Purchase PDF (505 K)
doi:10.1016/0164-1212(92)90020-K 
Copyright © 1992 Published by Elsevier Science Inc.
Performance analysis of the priority queues for the load-building algorithms
Available online 10 June 2003.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
This article analyzes system performance with short and long build queues for the Make and load-building algorithms. The analysis uses the amount of CPU time needed for all the algorithms. The analysis also uses relative job priority in short and long queues. The results show that average response time improves significantly (≤ 99.8%) if one file in an application is compiled. In this case, the jobs can be submitted to a short queue or executed in foreground. This will reduce the developer wait time, decrease use of system resources, and will allow for more frequent job submission. If 50% of the files are compiled, the performance improvement is smaller (49.8%). If all the files are compiled, performance can decrease by 0.2%. In this case, the jobs must be submitted to the same queue to which they are submitted by using the Make algorithm.
