51 search results - page 6 / 11 » Parallel Algorithms for Priority Queue Operations |
109
Voted
PPOPP
2009
ACM
16 years 2 months ago
2009
ACM
Fairness is an essential requirement of any operating system scheduler. Unfortunately, existing fair scheduling algorithms are either inaccurate or inefficient and non-scalable fo...
132
click to vote
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
A number of solutions have been proposed for the problem of mutual exclusion in distributed systems. Some of these approaches have since been extended to a prioritized environment...
148
click to vote
HIPC
2007
Springer
15 years 6 months ago
2007
Springer
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
144
click to vote
HPCA
2012
IEEE
13 years 10 months ago
2012
IEEE
Conventional out-of-order processors that use a unified physical register file allocate and reclaim registers explicitly using a free list that operates as a circular queue. We ...
120
click to vote
ICPADS
2007
IEEE
15 years 8 months ago
2007
IEEE
This paper proposes a new priority scheduling algorithm to maximise site revenue of session-based multi-tier Internet services in a multicluster environment. This research is part...