The problem of assigning information packets of different services to time slots of a radio frame is addressed. Packet sizes are divisible, and a maximum time slot to which a packet can be assigned is given. We present a polynomial-time scheduling algorithm maximizing the number of scheduled packets.
Detti, P., Agnetis, A., Ciaschetti, G. (2005). Polynomial algorithms for a two-class multiprocessor scheduling problem in mobile telecommunications systems. JOURNAL OF SCHEDULING, 8, 255-273 [10.1007/s10951-005-6814-0].
Polynomial algorithms for a two-class multiprocessor scheduling problem in mobile telecommunications systems.
DETTI, PAOLO;AGNETIS, ALESSANDRO;
2005-01-01
Abstract
The problem of assigning information packets of different services to time slots of a radio frame is addressed. Packet sizes are divisible, and a maximum time slot to which a packet can be assigned is given. We present a polynomial-time scheduling algorithm maximizing the number of scheduled packets.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
polynomial algorithms for a two-class multiprocessor scheduling problem in mobile telecommunications systems.pdf
non disponibili
Tipologia:
Post-print
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
420.54 kB
Formato
Adobe PDF
|
420.54 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
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:
https://hdl.handle.net/11365/21946
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo