Sciweavers

1259 search results - page 118 / 252
» The load rebalancing problem
Sort
View
SWAT
1992
Springer
111views Algorithms» more  SWAT 1992»
14 years 1 months ago
Retrieval of scattered information by EREW, CREW and CRCW PRAMs
The k-compaction problem arises when k out of n cells in an array are non-empty and the contents of these cells must be moved to the first k locations in the array. Parallel algori...
Faith E. Fich, Miroslaw Kowaluk, Krzysztof Lorys, ...
BTW
2009
Springer
118views Database» more  BTW 2009»
14 years 11 days ago
Multi-Objective Scheduling for Real-Time Data Warehouses
: The issue of write-read contention is one of the most prevalent problems when deploying real-time data warehouses. With increasing load, updates are increasingly delayed and prev...
Maik Thiele, Andreas Bader, Wolfgang Lehner
JSAC
2008
98views more  JSAC 2008»
13 years 9 months ago
Randomized consensus algorithms over large scale networks
Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...
Fabio Fagnani, Sandro Zampieri
JPDC
2007
84views more  JPDC 2007»
13 years 9 months ago
Distributed average consensus with least-mean-square deviation
We consider a stochastic model for distributed average consensus, which arises in applications such as load balancing for parallel processors, distributed coordination of mobile a...
Lin Xiao, Stephen P. Boyd, Seung-Jean Kim
INFORMATICALT
2010
88views more  INFORMATICALT 2010»
13 years 7 months ago
Inapproximability Results for Wavelength Assignment in WDM Optical Networks
We address the issue of inapproximability of the wavelength assignment problem in wavelength division multiplexing (WDM) optical networks. We prove that in an n-node WDM optical ne...
Keqin Li