• JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
 
  Bookmark and Share
 
 
Master's Dissertation
DOI
10.11606/D.55.2002.tde-10062004-210839
Document
Author
Full name
Sidney Carlos Ferrari
E-mail
Institute/School/College
Knowledge Area
Date of Defense
Published
São Carlos, 2002
Supervisor
Committee
Salles, Maria Creusa Bretas (President)
Magalhaes, Marcos Nascimento
Morabito Neto, Reinaldo
Title in Portuguese
"Filas paralelas com servidores heterogêneos e jockeying probabilístico"
Keywords in Portuguese
fila mais curta
filas paralelas
jockeying probabilístico
servidores exponenciais heterogêneos
teoria das filas
Abstract in Portuguese
Utilizou-se neste trabalho um sistema de filas contendo três servidores exponenciais, heterogêneos, operando em paralelo. Trocas entre filas são permitidas após o usuário analisar dois aspectos: a diferença entre o tamanho das filas envolvidas na troca e o grau de vizinhança entre elas. O jockeying não é obrigatório, podendo os usuários optar por ele com uma probabilidade de ocorrência de acordo com os aspectos citados. Como resultado deste estudo foi obtida uma equação geral que representa o sistema. O sistema M/(M/1)3 com jockeying probabilístico tem uma ociosidade bem menor que o tradiconal M/Mi/3, alimentado por fila única. Outras características foram analisadas.
Title in English
Parallel queues with heterogeneous servers and probabilistics jockeying
Keywords in English
exponential heteregeneous servers
parallel queues
probabilistic jockeying
shortest queues
Theory of queues
Abstract in English
We consider a parallel queueing system with three exponential heterogeneous servers where is allowed jockey among queues with no obligation and the customers may choose for it with an occurrence probability after they have been analyzed two aspects: the difference between involved lines lenght in jockeying and the neighborhood degree among them. The effect of this study is a general equation which represents the system. The M/(M/1)3 system with probabilistc jockeying has a smaller idleness than the traditional M/Mi/3 fed from a single queue. We also analysed other characteristics.
 
WARNING - Viewing this document is conditioned on your acceptance of the following terms of use:
This document is only for private use for research and teaching activities. Reproduction for commercial use is forbidden. This rights cover the whole data about this document as well as its contents. Any uses or copies of this document in whole or in part must include the author's name.
01PaginasPrefaciais.pdf (100.15 Kbytes)
02Resumo.pdf (51.73 Kbytes)
03Introducao.pdf (146.99 Kbytes)
04AsTrocasEntreFilas.pdf (323.71 Kbytes)
06Comparacoes.pdf (393.11 Kbytes)
08Anexo1.pdf (1.13 Mbytes)
09Anexo2.pdf (90.15 Kbytes)
10Referencias.pdf (111.74 Kbytes)
Publishing Date
2004-07-29
 
WARNING: Learn what derived works are clicking here.
All rights of the thesis/dissertation are from the authors
Centro de Informática de São Carlos
Digital Library of Theses and Dissertations of USP. Copyright © 2001-2020. All rights reserved.