160 search results - page 3 / 32 » A General Buffer Scheme for the Windows Scheduling Problem |
MICRO
2003
IEEE
15 years 2 months ago
2003
IEEE
Large instruction window processors achieve high performance by exposing large amounts of instruction level parallelism. However, accessing large hardware structures typically req...
VLDB
1989
ACM
15 years 1 months ago
1989
ACM
- In this paper, we addressthe problem of priority scheduling in a databasemanagement system. We start by investigating the architectural consequences of adding priority to a DBMS....
80
Voted
STOC
2007
ACM
15 years 9 months ago
2007
ACM
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
91
Voted
ESA
2001
Springer
15 years 2 months ago
2001
Springer
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems. We illustrate the technique on two diff...
WCNC
2008
IEEE
15 years 3 months ago
2008
IEEE
Abstract—We tackle the problem of providing minimum datarate guarantees for different classes-of-service in an OFDMAbased network, while obtaining a high system throughput. Our a...