Analyzing priority queues with 3 classes using tree-like processes

Author： Houdt B.   Blondia C.  

Publisher： Springer Publishing Company

ISSN： 0257-0130

Source： Queueing Systems, Vol.54, Iss.2, 2006-10, pp. : 99-109

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

P-Bandwidth Priority Queues on Reconfigurable Tree of Meshes

By Bertossi A.A.   Mei A.  

Journal of Parallel and Distributed Computing, Vol. 40, Iss. 2, 1997-02 ,pp. : 248-255

Academic Press

Access to resources Recommend Favorite

Analytical solutions for tree‐like structure modelling using subdivision surfaces

By  

COMPUTER ANIMATION AND VIRTUAL WORLDS (PREV: JNL OF VISUALISATION & COMPUTER ANIMATION), Vol. 26, Iss. 1, 2015-01 ,pp. : 29-42

John Wiley & Sons Inc

Access to resources Recommend Favorite

Splicing on tree-like structures

By Sakakibara Y.   Ferretti C.  

Theoretical Computer Science, Vol. 210, Iss. 2, 1999-01 ,pp. : 227-243

Elsevier

Access to resources Recommend Favorite

Bounded capacity priority queues

By Atkinson M.D.   Tulley D.  

Theoretical Computer Science, Vol. 182, Iss. 1, 1997-08 ,pp. : 145-157

Elsevier

Access to resources Recommend Favorite

Priority queues with binary priorities

By Kalorkoti K.   Tulley D.H.  

Theoretical Computer Science, Vol. 262, Iss. 1, 2001-07 ,pp. : 133-144

Elsevier

Access to resources Recommend Favorite