Takayuki Osogami
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Takayuki Osogami has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Mor Harchol-Balter
Computer Science Department, Carnegie Mellon University, Pittsburgh, USA
2 shared publications Adam Wierman
Carnegie Mellon University, Pittsburgh, PA
1 shared publication- Adam Wierman
Carnegie Mellon University
1 shared publication - Alan Scheller-Wolf
Tepper School of Business, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213
1 shared publication
Latest Publications
- 1 December 2005
- Published by Springer Nature in Queueing Systems
- Vol. 51 (3-4) , 331-360
Multi-Server Queueing Systems with Multiple Priority Classes
- 1 December 2005
- Published by Springer Nature in Queueing Systems
- Vol. 51 (3-4) , 331-360
Multi-Server Queueing Systems with Multiple Priority Classes
- Open Access
- 6 June 2005
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 33 (1) , 205-216
Nearly insensitive bounds on SMART scheduling
We define the class of SMART scheduling policies. These are policies that bias towards jobs with small remaining service times, jobs with small original sizes, or both, with the motivation of minimizing mean response time and/or mean slowdown. Examples of SMART policies include PSJF, SRPT, and hybrid policies such as RS (which biases according to the product of the remaining size and the original size of a job).For many policies in the SMART class, the mean response time and mean slowdown are not known or have complex representations involving multiple nested integrals, making evaluation difficult. In this work, we prove three main results. First, for all policies in the SMART class, we prove simple upper and lower bounds on mean response time. Second, we show that all policies in the SMART class, surprisingly, have very similar mean response times. Third, we show that the response times of SMART policies are largely insensitive to the variability of the job size distribution. In particular, we focus on the SRPT and PSJF policies and prove insensitive bounds in these cases.
- 6 June 2005
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 33 (1) , 205-216
Open AccessNearly insensitive bounds on SMART scheduling
We define the class of SMART scheduling policies. These are policies that bias towards jobs with small remaining service times, jobs with small original sizes, or both, with the motivation of minimizing mean response time and/or mean slowdown. Examples of SMART policies include PSJF, SRPT, and hybrid policies such as RS (which biases according to the product of the remaining size and the original size of a job).For many policies in the SMART class, the mean response time and mean slowdown are not known or have complex representations involving multiple nested integrals, making evaluation difficult. In this work, we prove three main results. First, for all policies in the SMART class, we prove simple upper and lower bounds on mean response time. Second, we show that all policies in the SMART class, surprisingly, have very similar mean response times. Third, we show that the response times of SMART policies are largely insensitive to the variability of the job size distribution. In particular, we focus on the SRPT and PSJF policies and prove insensitive bounds in these cases.