(EN)Each synchronous flow (h=1, 2, , N¿s?) is associated to a respective synchronous capacity value (H¿h?) indicative of the maximum amount of time for which a synchronous flow can be served before relinquishing the token. Each asynchronous flow (I=1, 2, , N¿A?) is, on the other hand, associated to a respective indicative value of the delay to be recovered so that the respective queue has the right to be served and to another value indicating the instant in which the server visited the respective queue in the pervious cycle. Each queue associated to a synchronous flow (h) is therefore served for a maximum amount of time that is equal to the aforesaid synchronous capacity value, while each queue associated to an asynchronous flow (i) is only served if the server's visit takes place with anticipation with respect to the expected instant. This anticipation is determined as the difference between the expected rotation time, needed by the server (10) to complete a visit cycle (T) of the queues associated to the aforesaid flows (h, i), and the time that has passed since the server's previous visit (10) and the delay accumulated. This difference, if positive, defines the maximum service time for the asynchronous queue. If the queue is empty when the server visits it, the server (10) moves on to the next queue even before the relative maximum service time has passed.

PROCEDURE AND SYSTEM FOR SCHEDULING A SHARED RESOURCE BETWEEN MULTIPLE INFORMATION PACKET FLOWS

MINGOZZI, ENZO;STEA, GIOVANNI
2000

Abstract

(EN)Each synchronous flow (h=1, 2, , N¿s?) is associated to a respective synchronous capacity value (H¿h?) indicative of the maximum amount of time for which a synchronous flow can be served before relinquishing the token. Each asynchronous flow (I=1, 2, , N¿A?) is, on the other hand, associated to a respective indicative value of the delay to be recovered so that the respective queue has the right to be served and to another value indicating the instant in which the server visited the respective queue in the pervious cycle. Each queue associated to a synchronous flow (h) is therefore served for a maximum amount of time that is equal to the aforesaid synchronous capacity value, while each queue associated to an asynchronous flow (i) is only served if the server's visit takes place with anticipation with respect to the expected instant. This anticipation is determined as the difference between the expected rotation time, needed by the server (10) to complete a visit cycle (T) of the queues associated to the aforesaid flows (h, i), and the time that has passed since the server's previous visit (10) and the delay accumulated. This difference, if positive, defines the maximum service time for the asynchronous queue. If the queue is empty when the server visits it, the server (10) moves on to the next queue even before the relative maximum service time has passed.
File in questo prodotto:
File Dimensione Formato  
US7349331B2-2008-03-25.pdf

accesso aperto

Descrizione: US7349331 (B2) (2008-03-25)
Tipologia: Versione finale editoriale
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 421.57 kB
Formato Adobe PDF
421.57 kB Adobe PDF Visualizza/Apri
KR100826272B1-2008-04-30.pdf

accesso aperto

Descrizione: KR100826272 (B1) (2008-04-30)
Tipologia: Versione finale editoriale
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 379.42 kB
Formato Adobe PDF
379.42 kB Adobe PDF Visualizza/Apri
JP3878553B2-2007-02-07.pdf

accesso aperto

Descrizione: JP3878553 (B2) (2007-02-07)
Tipologia: Versione finale editoriale
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 338.59 kB
Formato Adobe PDF
338.59 kB Adobe PDF Visualizza/Apri
EP1329065B1-2013-03-20.pdf

accesso aperto

Descrizione: EP1329065 (B1) (2013-03-20)
Tipologia: Versione finale editoriale
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 555.97 kB
Formato Adobe PDF
555.97 kB Adobe PDF Visualizza/Apri
CA2429015C-2010-12-21.pdf

accesso aperto

Descrizione: CA2429015 (C) (2010-12-21)
Tipologia: Versione finale editoriale
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 686.3 kB
Formato Adobe PDF
686.3 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11568/205597
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact