Sciweavers

173 search results - page 9 / 35
» Round Robin Classification
Sort
View
INFOCOM
2000
IEEE
14 years 9 days ago
Comparisons of Packet Scheduling Algorithms for Fair Service Among Connections on the Internet
Abstract—We investigate the performance of TCP under three representatives of packet scheduling algorithms at the router. Our main focus is to investigate how fair service can be...
Go Hasegawa, Takahiro Matsuo, Masayuki Murata, Hid...
SIGCSE
2002
ACM
172views Education» more  SIGCSE 2002»
13 years 7 months ago
Simulation of load balancing algorithms: a comparative study
This article introduces a new load balancing algorithm, called diffusive load balancing, and compares its performance with three other load balancing algorithms: static, round rob...
Milan E. Soklic
CORR
2006
Springer
91views Education» more  CORR 2006»
13 years 8 months ago
Complexity of Data Flow Analysis for Non-Separable Frameworks
The complexity of round robin iterative data flow analysis has been traditionally defined as 1+d where d is the depth of a control flow graph. However, this bound is restricted to ...
Bageshri Karkare, Uday P. Khedker
ISCC
2009
IEEE
163views Communications» more  ISCC 2009»
14 years 2 months ago
Distributed parallel scheduling algorithms for high-speed virtual output queuing switches
Abstract—This paper presents a novel scalable switching architecture for input queued switches with its proper arbitration algorithms. In contrast to traditional switching archit...
Lotfi Mhamdi, Mounir Hamdi
VLSID
2006
IEEE
143views VLSI» more  VLSID 2006»
14 years 1 months ago
Frame Based Fair Multiprocessor Scheduler: A Fast Fair Algorithm for Real-Time Embedded Systems
This paper presents Frame Based Fair Multiprocessor Scheduler (FBFMS) which provides accurate real-time proportional fair scheduling for a set of dynamic tasks on a symmetric mult...
Arnab Sarkar, P. P. Chakrabarti, Rajeev Kumar