Sciweavers

473 search results - page 32 / 95
» Early-release fair scheduling
Sort
View
PODC
2006
ACM
14 years 2 months ago
Grouped distributed queues: distributed queue, proportional share multiprocessor scheduling
We present Grouped Distributed Queues (GDQ), the first proportional share scheduler for multiprocessor systems that scales well with a large number of processors and processes. G...
Bogdan Caprita, Jason Nieh, Clifford Stein
INFOCOM
2002
IEEE
14 years 1 months ago
BSFQ: Bin Sort Fair Queueing
—Existing packet schedulers that provide fair sharing of an output link can be divided into two classes: sorted priority and frame-based. Sorted priority methods provide excellen...
Shun Yan Cheung, Corneliu S. Pencea
IPPS
2007
IEEE
14 years 3 months ago
Max-Min Fair Bandwidth Allocation Algorithms for Packet Switches
With the rapid development of broadband applications, the capability of networks to provide quality of service (QoS) has become an important issue. Fair scheduling algorithms are ...
Deng Pan, Yuanyuan Yang
ICC
2007
IEEE
14 years 3 months ago
Satisfying Elastic Short Term Fairness in High Throughput Wireless Communication Systems with Multimedia Services
Abstract—In this paper we study the problem of providing shortterm access time fairness in wireless communication systems with multimedia services, while still maintaining high s...
Timotheos Kastrinogiannis, Symeon Papavassiliou
ISCA
2011
IEEE
240views Hardware» more  ISCA 2011»
13 years 20 days ago
Virtualizing performance asymmetric multi-core systems
Performance-asymmetric multi-cores consist of heterogeneous cores, which support the same ISA, but have different computing capabilities. To maximize the throughput of asymmetric...
Youngjin Kwon, Changdae Kim, Seungryoul Maeng, Jae...