|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| Sarah Tasneem, Lester Lipsky, Reda Ammar, Howard Sholl, "Using Residual Times to Meet Deadlines in M/G/C Queues," Network Computing and Applications, IEEE International Symposium on, pp. 128-138, Fourth IEEE International Symposium on Network Computing and Applications, 2005. | |||
| BibTex | x | ||
| @article{ 10.1109/NCA.2005.53, author = {Sarah Tasneem and Lester Lipsky and Reda Ammar and Howard Sholl}, title = {Using Residual Times to Meet Deadlines in M/G/C Queues}, journal ={Network Computing and Applications, IEEE International Symposium on}, volume = {0}, year = {2005}, isbn = {0-7695-2326-9}, pages = {128-138}, doi = {http://doi.ieeecomputersociety.org/10.1109/NCA.2005.53}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Network Computing and Applications, IEEE International Symposium on TI - Using Residual Times to Meet Deadlines in M/G/C Queues SN - 0-7695-2326-9 SP128 EP138 A1 - Sarah Tasneem, A1 - Lester Lipsky, A1 - Reda Ammar, A1 - Howard Sholl, PY - 2005 KW - null VL - 0 JA - Network Computing and Applications, IEEE International Symposium on ER - | |||
In systems where job service demands are only known probabilistically, there is very little to distinguish between jobs. Therefore, no universal optimum scheduling strategy or algorithm exists. If the distribution of job times is known, then the residual time (expected time remaining for a job), based on the service it has already received, can be calculated. In a detailed discrete event simulation, we have explored the use of this function for increasing the probability that a job will meet its deadline. We have tested many different distributions with a wide range of 2 s and shape, four of which are reported here. We compare with RR and FCFS, and find that in all distributions studied our algorithm performs best. We also studied the use of two slow servers versus one fast server, and have found that they provide comparable performance, and in a few cases the double server system does better.