Sciweavers

1520 search results - page 11 / 304
» The Ring Loading Problem
Sort
View
OSDI
2008
ACM
14 years 7 months ago
Everest: Scaling Down Peak Loads Through I/O Off-Loading
Bursts in data center workloads are a real problem for storage subsystems. Data volumes can experience peak I/O request rates that are over an order of magnitude higher than avera...
Dushyanth Narayanan, Austin Donnelly, Eno Thereska...
JPDC
2007
81views more  JPDC 2007»
13 years 7 months ago
Improved scheduling in rings
We study the problem of scheduling unit size jobs on n processors connected by a ring. We show a distributed algorithm for this problem with an approximation ratio of 3 2 + √ 2....
Dekel Tsur
CORR
2010
Springer
57views Education» more  CORR 2010»
13 years 4 months ago
Balancing congestion for unsplittable routing on a bidirected ring
Given a bidirected ring with capacities and a demand graph, we present an approximate solution to the problem of nding the minimum such that there exists a feasible routing of the...
Johanna Becker, Zsolt Csizmadia, Alexandre Laugier...
MP
2006
88views more  MP 2006»
13 years 7 months ago
Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut
Abstract. We consider the network design problem which consists in determining at minimum cost a 2-edge connected network such that the shortest cycle (a "ring") to which...
Bernard Fortz, Ali Ridha Mahjoub, S. Thomas McCorm...
IPPS
1999
IEEE
13 years 11 months ago
Parallel Load Balancing for Problems with Good Bisectors
Parallel load balancing is studied for problems with certain bisection properties. A class of problems has bisectors if every problem p of weight wp in the class can be subdivided...
Stefan Bischof, Ralf Ebner, Thomas Erlebach