ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Mean delay optimization for the M/G/1 queue with pareto type service times
Full text PdfPdf (105 KB)
Source
Joint International Conference on Measurement and Modeling of Computer Systems archive
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems table of contents
San Diego, California, USA
POSTER SESSION: Poster session table of contents
Pages: 383 - 384  
Year of Publication: 2007
ISBN:978-1-59593-639-4
Also published in ...
Authors
Samuli Aalto  TKK Helsinki University of Technology
Urtzi Ayesta  LAAS-CNRS
Sponsors
SIGMETRICS: ACM Special Interest Group on Measurement and Evaluation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 165,   Citation Count: 1
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1254882.1254941
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
S. Aalto and U. Ayesta. On the nonoptimality of the foreground-background discipline for IMRL service times. Journal of Applied Probability, 43:523--534, 2006.
 
2
J. Gittins. Multi-armed Bandit Allocation Indices. Wiley, Chichester, 1989.
 
3
L. Kleinrock. Queueing Systems, Volume II: Computer Applications. Wiley, New York, 1976.
 
4
R. Righter and J. Shanthikumar. Scheduling multiclass single server queueing systems to stochastically maximize the number of successful departures. Probability in the Engineering and Informational Sciences, 3:323--333, 1989.
 
5
R. Righter, J. Shanthikumar, and G. Yamazaki. On extremal service disciplines in single-stage queueing system. Journal of Applied Probability, 27:409--416, 1990.
 
6
S. F. Yashkov, Processor-sharing queues: some progress in analysis, Queueing Systems: Theory and Applications, v.2 n.1, p.1-17, June 1987  [doi>10.1007/BF01182931]
 
7
S. Yashkov. Mathematical problems in the theory of shared-processor systems. Journal of Mathematical Sciences, 58:101--147, 1992.

CITED BY
 
Misja Nuyens , Adam Wierman, The Foreground-Background queue: A survey, Performance Evaluation, v.65 n.3-4, p.286-307, March, 2008

INDEX TERMS

Primary Classification:
  G. Mathematics of Computing
  G.3 PROBABILITY AND STATISTICS
      Subjects: Queueing theory

Additional Classification:
  C. Computer Systems Organization
  C.4 PERFORMANCE OF SYSTEMS
      Subjects: Performance attributes

  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Sequencing and scheduling


General Terms:
Performance


Keywords:
M/G/1, gittins index, mean delay, pareto distribution, scheduling

Collaborative Colleagues:
Samuli Aalto: colleagues
Urtzi Ayesta: colleagues
This Article has also been published in:

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2008 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player