(EN)Each synchronous flow (i=1, 2, ..., N¿s?) is associated to a respective synchronous capacity value (H¿i?) that is related the period of time for which a synchronous flow can be serviced before the server moves on. This value can be selected either according to a local allocation criteria or according to a global allocation criteria. Each asynchronous flow (i=1, 2, ..., N¿A?) s is associated to a respective first value indicating the delay to be made up so that the respective queue has the right to be serviced and to another value indicating the instant in which the server visited the respective queue in the previous cycle. Each queue associated to a synchronous flow (h) is then serviced for a period of time that is related to be aforesaid synchronous capacity value, while each queue associated to an asynchronous flow (i) is serviced only if the server's visit occurs before the expected moment. The server's visit (10) to the synchronous queues should preferably take place during two successive cycles in order to optimise the use of the resources available.
Scheduling a Shared Resource among Synchronous and Asynchronous Packet Flows
LENZINI, LUCIANO;MINGOZZI, ENZO;STEA, GIOVANNI
2002-01-01
Abstract
(EN)Each synchronous flow (i=1, 2, ..., N¿s?) is associated to a respective synchronous capacity value (H¿i?) that is related the period of time for which a synchronous flow can be serviced before the server moves on. This value can be selected either according to a local allocation criteria or according to a global allocation criteria. Each asynchronous flow (i=1, 2, ..., N¿A?) s is associated to a respective first value indicating the delay to be made up so that the respective queue has the right to be serviced and to another value indicating the instant in which the server visited the respective queue in the previous cycle. Each queue associated to a synchronous flow (h) is then serviced for a period of time that is related to be aforesaid synchronous capacity value, while each queue associated to an asynchronous flow (i) is serviced only if the server's visit occurs before the expected moment. The server's visit (10) to the synchronous queues should preferably take place during two successive cycles in order to optimise the use of the resources available.File | Dimensione | Formato | |
---|---|---|---|
CA2482430C-2013-10-01.pdf
accesso aperto
Descrizione: CA2482430 (C) (2013-10-01)
Tipologia:
Versione finale editoriale
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
1.13 MB
Formato
Adobe PDF
|
1.13 MB | Adobe PDF | Visualizza/Apri |
EP1495600B1-2007-01-17.pdf
accesso aperto
Descrizione: EP1495600(B1) (2007-01-17)
Tipologia:
Versione finale editoriale
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
1.44 MB
Formato
Adobe PDF
|
1.44 MB | Adobe PDF | Visualizza/Apri |
JP3973629B2-2007-09-12.pdf
accesso aperto
Descrizione: JP3973629(B2) (2007-09-12)
Tipologia:
Versione finale editoriale
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
561.34 kB
Formato
Adobe PDF
|
561.34 kB | Adobe PDF | Visualizza/Apri |
KR100908287B1-2009-07-17.pdf
accesso aperto
Descrizione: KR100908287(B1) (2009-07-17)
Tipologia:
Versione finale editoriale
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
526.03 kB
Formato
Adobe PDF
|
526.03 kB | Adobe PDF | Visualizza/Apri |
US7336610B2-2008-02-26.pdf
accesso aperto
Descrizione: US7336610(B2) (2008-02-26)
Tipologia:
Versione finale editoriale
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
692.07 kB
Formato
Adobe PDF
|
692.07 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.