( en | de | ru )

 

Disambiguation of "Valente, Paolo"

Author of the publication

copydeleteadd this publication to your clipboard
On service guarantees of fair-queueing schedulers in real systems.

, and . Comput. Commun., (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Matias Valente

Ana Valente

Giordano Paolo

Christian Valente

Patrick Valente

 

Other publications of authors with the same name

A branch-and-bound algorithm to compute a tighter bound to tardiness for preemptive global EDF scheduler., , and . RTNS, page 128-137. ACM, (2017)SiGAMMA: server based integrated GPU arbitration mechanism for memory accesses., , , and . RTNS, page 48-57. ACM, (2017)Reducing the execution time of fair-queueing packet schedulers.. Comput. Commun., (2014)Providing Near-Optimal Fair-Queueing Guarantees at Round-Robin Amortized Cost.. ICCCN, page 1-7. IEEE, (2013)High Throughput Disk Scheduling with Fair Bandwidth Distribution., and . IEEE Trans. Computers, 59 (9): 1172-1186 (2010)Fine-Grained QoS Control via Tightly-Coupled Bandwidth Monitoring and Regulation for FPGA-based Heterogeneous SoCs., , , , , , and . DAC, page 1-6. IEEE, (2023)An Upper Bound to the Lateness of Soft Real-Time Tasks Scheduled by EDF on Multiprocessors., and . RTSS, page 311-320. IEEE Computer Society, (2005)Design and Testing of Scalable Web-Based Systems with Performance Constraints., , and . FIRB-Perf, page 15-25. IEEE Computer Society, (2005)PSPAT: Software packet scheduling at hardware speed., , , and . Comput. Commun., (2018)Exact GPS simulation with logarithmic complexity, and its application to an optimally fair scheduler.. SIGCOMM, page 269-280. ACM, (2004)