Sciweavers

13 search results - page 2 / 3
» A Round Robin Scheduling Policy for Ada
Sort
View
ICPADS
2007
IEEE
13 years 12 months ago
On the relative value of local scheduling versus routing in parallel server systems
We consider a system with a dispatcher and several identical servers in parallel. Task processing times are known upon arrival. We first study the impact of the local scheduling ...
Rong Wu, Douglas G. Down
IWMM
2007
Springer
146views Hardware» more  IWMM 2007»
13 years 11 months ago
Allocation-phase aware thread scheduling policies to improve garbage collection performance
Past studies have shown that objects are created and then die in phases. Thus, one way to sustain good garbage collection efficiency is to have a large enough heap to allow many ...
Feng Xian, Witawas Srisa-an, Hong Jiang
SIGMETRICS
2008
ACM
118views Hardware» more  SIGMETRICS 2008»
13 years 5 months ago
Finding the optimal quantum size: Sensitivity analysis of the M/G/1 round-robin queue
We consider the round robin (RR) scheduling policy where the server processes each job in its buffer for at most a fixed quantum, q, in a round-robin fashion. The processor sharin...
Varun Gupta
CN
2004
138views more  CN 2004»
13 years 5 months ago
Performance evaluation of prioritized scheduling with buffer management for differentiated services architectures
Differentiated services (DiffServ) is an architecture for the Internet in which various applications are supported using a simple classification scheme. Packets entering the DiffS...
Ahmed E. Kamal, Hossam S. Hassanein
DSN
2008
IEEE
14 years 4 hour ago
Scheduling algorithms for unpredictably heterogeneous CMP architectures
In future large-scale multi-core microprocessors, hard errors and process variations will create dynamic heterogeneity, causing performance and power characteristics to differ amo...
Jonathan A. Winter, David H. Albonesi