We introduce a model based on some combinatroial objects, which we call 1-histograms, to study the behaviour of devices like printers and use the combinatorial properties of these objects to study some important disributions such as the waiting time for a job and the length of the device queue. This study is based on an important relation between 1-histograms, generating functions and binary trees.
Waiting patterns for a printer / D. Merlini; R. Sprugnoli; M. C. Verri. - STAMPA. - (2001), pp. 1-13. (Intervento presentato al convegno Fun with Algorithms, Second International Conference, FUN 2001 tenutosi a Isola d'Elba, Italy nel May 29-31, 2001).
Waiting patterns for a printer
MERLINI, DONATELLA;SPRUGNOLI, RENZO;VERRI, MARIA CECILIA
2001
Abstract
We introduce a model based on some combinatroial objects, which we call 1-histograms, to study the behaviour of devices like printers and use the combinatorial properties of these objects to study some important disributions such as the waiting time for a job and the length of the device queue. This study is based on an important relation between 1-histograms, generating functions and binary trees.
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
