An approximate analysis of the shortest queue policy on soft real-time scheduling.

The join the shortest queue (JSQ) policy is studied in the context of soft real-time scheduling. An approximate analysis of the JSQ is developed and presented in this paper. The result obtained from the approximate analysis is compared against the simulation one, that shows the approximate analysis...

תיאור מלא

מידע ביבליוגרפי
הוצא לאור ב:	Sigmetrics :performance evaluation review. 28, 3 (2000).
מחבר ראשי:	Zhu, Weiping
פורמט:	Article
שפה:	English
נושאים:	Theory of Computation. Analysis of algorithms and problem complexity. Nonnumerical algorithms and problems. Sequencing and scheduling. Computer systems organization. Special purpose and application based systems. Real time and embedded systems. Performance. Queueing theory. Mathematics of computing. Probability and statistics. Computing methodologies. Artificial intelligence. Problem solving, control methods and search. Scheduling. Design. Measurement. Theory.