00000cab a22000003a 4500 UP-99796217608823603 Buklod 20231007234831.0 m |o d | ta 090511s xx d | ||r ||||| || DENGII eng Zhu, Weiping An approximate analysis of the shortest queue policy on soft real-time scheduling. pp. 3-10 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 is highly accurate. Thus, the approximate analysis can be applied to the development of soft real-time systems. 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. Queueing theory. Computing methodologies. Artificial intelligence. Problem solving, control methods and search. Scheduling. Design. Measurement. Performance. Theory. Sigmetrics :performance evaluation review. 28, 3 (2000). FO UPD DENG-II Article