N. Young, "The k-server dual and loose competitiveness for paging," Algorithmica, vol. 11, pp. 525--541, 1994.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....much smaller if RFUOP 1 is always kept on the chip. But always keeping larger configurations on the chip is not a good solution, because they may have a very low reload frequency. Instead, both size and frequency factors should be considered in the algorithm. Therefore, we use a variable credit [Young94] to determine the victim configuration, as shown in the following penalty oriented algorithm: 1. If a demanded configuration is currently on the chip, set its credit equal to its size. Otherwise: 1.1. While there is not enough room to load the required RFUOP: 1.1.1. For all configurations on ....

N. E. Young. "The k-server dual and loose competitiveness for paging", Algorithmica, 11(6), 535-541, June 1994.

....much smaller if RFUOP 1 is always kept on the chip. But always keeping larger configurations on the chip is not a good solution, because they may have a very low reload frequency. Instead, both size and frequency factors should be considered in the algorithm. Therefore, we use a variable credit [Young94] to determine the victim configuration, as shown in the following penalty oriented algorithm: 1. If a demanded configuration is currently on the chip, set its credit equal to its size. Otherwise: 1.1. While there is not enough room to load the required RFUOP: 1.1.1. For all configurations on ....

N. E. Young. "The k-server dual and loose competitiveness for paging", Algorithmica, 11(6), 535-541, June 1994.

....configuration that has the smallest latency to size ratio. Run Time Algorithms for the PRTR FPGA with Relocation Defragmentation In order to further evaluate the performance of the PRTR with Relocation Defragmentation FPGA model two realtime algorithms, a LRU algorithm and a penalty oriented [Young94] algorithm, are implemented. These two algorithms take the RFUOP sequence as the input at run time and do not need future information. LRU Algorithm for the PRTR FPGA with Relocation Defragmentation Since the PRTR with Relocation plus Defragmentation model can be viewed as a general memory ....

N. E. Young. "The k-server dual and loose competitiveness for paging", Algorithmica, 11(6), 535541, June 1994

....online algorithm is Omega Gamma m) We now summarize related results. The weakened adversary model was introduced in [6] in the context of studying paging. This model has also been used to study variants of the k server problem, a generalization of the paging problem (see for example [8]) References to other other suggested variants of competitive analysis can be found in [4] Further ancillary results on online assignment, which are not directly related to the results in this paper, can be found in [1] In [7] the average competitive ratio for the greedy algorithm in the ....

N. Young, "The k-server dual and loose competitiveness for paging," Algorithmica, 11, 525--541, 1994.

....ffl weak competitive ratio for Slacker approaches one as ffl increases. The weak adversary model, comparing an online algorithm against a less powerful but more knowledgeable adversary, has been considered before in queryresponse problems such as the k server problem and its special cases (e.g. [17, 19]) and online weighted matching [9] In each case the adversary is handicapped by having fewer servers. One can argue that the weak competitive ratio is essentially what is called the comparative ratio in [10] However, the results in [10] are really of a different flavor in that they are ....

N. Young, "The k-server dual and loose competitiveness for paging," Algorithmica, 11, 525--541, 1994.

No context found.

N. Young, "The k-server dual and loose competitiveness for paging," Algorithmica, vol. 11, pp. 525--541, 1994.

No context found.

N. Young, "The k-server dual and loose competitiveness for paging," Algorithmica, vol. 11, pp. 525--541, 1994.

No context found.

N. Young, "The k-server dual and loose competitiveness for paging," Algorithmica, vol. 11, pp. 525--541, 1994.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC