<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">David G. Sullivan</style></author><author><style face="normal" font="default" size="100%">Margo Seltzer</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Addendum to the paper &quot;Isolation with Flexibility: A Resource Management Framework for Central Servers&quot;</style></title><secondary-title><style face="normal" font="default" size="100%">Unpublished addendum</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">scheduling</style></keyword><keyword><style  face="normal" font="default" size="100%">vino</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2000</style></year><pub-dates><date><style  face="normal" font="default" size="100%">June 2000</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.eecs.harvard.edu/syrah/papers/usenix-00-addendum/</style></url></web-urls></urls><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt; 
As discussed in our 2000 USENIX paper, lottery scheduling's currency abstraction imposes lower limits on the resource allocations that clients of a system can receive.  In our USENIX paper, we proposed one method for overcoming these lower limits.  In this addendum to the paper, we discuss a limitation of our original solution to the lower-limits problem, and we propose an alternate solution that overcomes the shortcomings of the original solution.
&lt;/p&gt;</style></abstract></record></records></xml>