Titlebook: Algorithms - ESA‘99; 7th Annual European Jaroslav Nešetřil Conference proceedings 1999 Springer-Verlag Berlin Heidelberg 1999 Approximizat

Diluge

Multipacket Routing on 2-D Meshes and Its Application to Fault-Tolerant Routing,ps with high probability using queues of constant size. The previous bound is 0:5. + .(.) but needs the queue-size of .(.). An important merit of this algorithm is to give us improved bounds by applying several schemes of faultymesh routing. For example, the scheme by [.], originally .(. log .) time

巡回

infinite

On-Line Load Balancing in a Hierarchical Server Topology,b requests a specific server meeting its needs but the system is free to assign it either to that server or to any other server higher in the hierarchy. Each job carries a certain load, which it imparts to the server to which it is assigned. The goal is to minimize the maximum total load on a server

mortgage

财产

拍下盗公款

Hiatal-Hernia

floodgate

insurrection

Off-Line Temporary Tasks Assignment,an arrival time, a departure time and some weight. Each job should be assigned to one machine. The load on a machine at a certain time is the sum of the weights of jobs assigned to it at that time. The objective is to find an assignment that minimizes the maximum load over machines and time..We pres

步兵

,Load Balancing Using Bisectors — A Tight Average-Case Analysis, processed in parallel (with reasonable overhead due to additional communication). In practice it is often easier to repeatedly bisect jobs, i.e., split one job into exactly two subjobs, than to generate . subjobs at once. In order to balance the load among the . machines, we want to minimize the si