Sciweavers

17 search results - page 1 / 4
» Simple and Fair Scheduling Algorithm for Combined Input-Cros...
Sort
View
ICC
2007
IEEE
13 years 11 months ago
Simple and Fair Scheduling Algorithm for Combined Input-Crosspoint-Queued Switch
— In this paper, we propose a fair and simple high-performance scheduling algorithm for Combined Input-Crosspoint-Queued Switches, which is called Tracking Fair Quota Allocation ...
Nan Hua, Peng Wang, Depeng Jin, Lieguang Zeng, Bin...
INFOCOM
2008
IEEE
13 years 11 months ago
Fair Scheduling through Packet Election
—In this paper, we consider the problem of designing scheduling algorithm for input queued switch that is both fair as well as throughput optimal. The significant body of litera...
Srikanth Jagabathula, Vishal Doshi, Devavrat Shah
WIOPT
2006
IEEE
13 years 10 months ago
Fairness and throughput guarantees with maximal scheduling in multi-hop wireless networks
Abstract— We investigate the fairness and throughput properties of a simple distributed scheduling policy, maximal scheduling, in the context of a general ad-hoc wireless network...
Saswati Sarkar, Prasanna Chaporkar, Koushik Kar
CN
2006
99views more  CN 2006»
13 years 4 months ago
High-performance switching based on buffered crossbar fabrics
As buffer-less crossbar scheduling algorithms reach their practical limitations due to higher port numbers and data rates, internally buffered crossbar (IBC) switches have gained ...
Lotfi Mhamdi, Mounir Hamdi, Christopher Kachris, S...
IPPS
2003
IEEE
13 years 9 months ago
The Case for Fair Multiprocessor Scheduling
Partitioning and global scheduling are two approaches for scheduling real-time tasks on multiprocessors. Though partitioning is sub-optimal, it has traditionally been preferred; t...
Anand Srinivasan, Philip Holman, James H. Anderson...