5580 search results - page 372 / 1116 » Randomized priority algorithms |
216
Voted
HCW
2000
IEEE
15 years 11 months ago
2000
IEEE
Recently, we presented two very low-cost approaches to compile-time list scheduling where the tasks’ priorities are computed statically or dynamically, respectively. For homogen...
164
click to vote
LCN
1994
IEEE
15 years 11 months ago
1994
IEEE
In this paper we explore the packet starvation effect (PSE) that occurs in Ethernet controllers due to the unfairness of the CSMA/CD algorithm. The PSE causes some packets to expe...
169
click to vote
AAAI
1998
15 years 8 months ago
1998
We describe a general approach to optimization which we term Squeaky Wheel" Optimization SWO. In SWO, a greedy algorithm is used to construct a solution which is then analyze...
195
click to vote
JPDC
2007
15 years 7 months ago
2007
Achieving high performance for concurrent applications on modern multiprocessors remains challenging. Many programmers avoid locking to improve performance, while others replace l...
206
click to vote
IPPS
2005
IEEE
16 years 26 days ago
2005
IEEE
— In the oblivious path selection problem, each packet in the network independently chooses a path, which is an important property if the routing algorithm is to be independent o...