Design and Evaluation of Disk Scheduling Policies for High-Demand Multimedia Servers.

@inproceedings{DBLP:conf/icde/KhanGA99,
  author    = {M. Farrukh Khan and
               Arif Ghafoor and
               Muhammad Naeem Ayyaz},
  title     = {Design and Evaluation of Disk Scheduling Policies for High-Demand
               Multimedia Servers},
  booktitle = {Proceedings of the 15th International Conference on Data Engineering,
               23-26 March 1999, Sydney, Austrialia},
  publisher = {IEEE Computer Society},
  year      = {1999},
  pages     = {592-599},
  ee        = {db/conf/icde/KhanGA99.html},
  crossref  = {DBLP:conf/icde/99},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1999 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.

ACM SIGMOD DiSC

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/DISC001 or /cdrom

ACM SIGMOD Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD1 or /dvd

Online Edition: IEEE Computer Society DL

Printed Edition

References

[1]

...

[2]

M. R. Garey, David S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman 1979, ISBN 0-7167-1044-7
BibTeX

[3]

...

[4]

B. J. Lageweg, Jan Karel Lenstra, A. H. G. Rinnooy Kan: Computer-Aided Complexity Classification of Combinatorial Problems. Commun. ACM 25(11): 817-822(1982) BibTeX

[5]

...

[6]

...