ACM Home Page
Please provide us with feedback. Feedback
Capacity Bounds for Multiresource Queues
Full text PdfPdf (1.10 MB)
Source Journal of the ACM (JACM) archive
Volume 24 ,  Issue 4  (October 1977) table of contents
Pages: 646 - 663  
Year of Publication: 1977
ISSN:0004-5411
Author
Kenneth J. Omahen  ECRM, Inc., 205 Burlington Road, Bedford, MA and Purdue University, West Lafayette, Indiana
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 21,   Citation Count: 5
Additional Information:

references   cited by   index terms  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/322033.322043
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
 
2
K~wr~Y, J G., A~D S~ELL, J L Fmae Markov Chains. Van Nostrand, Princeton, N.J, 1960
 
3
Lrrr~E, J.D.C. A proof of the queuemg formula L = XW. Oper. Res 9 (1961), 383-387.
 
4
MA~ATn~, V P Priority queuemg systems with simultaneous server reqmrements. Ph D Th., Oper Res., Cornell U, Ithaca, N.Y, May 1972.
 
5
MAXWELL, W.L On the generahty of the equation L = hW. Oper Res 18 (1970), 172-174
 
6
MAHEN, K.J Analytic models of multiple resource systems Ph D Th, Committee on inform Scz, U of Chicago, Chicago, Ill, June 1973.
 
7
MAHEN, K J, AND MAgArHF, V.P A queuemg model for a mult~processor system with partitioned memory Tech Rep. CSD-TR 132, Dept Comptr. Sc~, Purdue U, W. Lafayette, Ind., Jan. 1975.