Sciweavers

1429 search results - page 150 / 286
» The Complexity of the Approximation of the Bandwidth Problem
Sort
View
ISPAN
2005
IEEE
14 years 2 months ago
A Scalable Method for Predicting Network Performance in Heterogeneous Clusters
An important requirement for the effective scheduling of parallel applications on large heterogeneous clusters is a current view of system resource availability. Maintaining such ...
Dimitrios Katramatos, Steve J. Chapin
CCGRID
2007
IEEE
14 years 1 months ago
STORM: An Approach to Database Storage Management in Clustered Storage Environments
Database storage management in clustered storage environments is a manual, time-consuming, and error-prone task. Such management involves regular movement of database objects acro...
Kaushik Dutta, Raju Rangaswami
ICDIM
2007
IEEE
13 years 11 months ago
Predicting durability in DHTs using Markov chains
We consider the problem of data durability in lowbandwidth large-scale distributed storage systems. Given the limited bandwidth between replicas, these systems suffer from long re...
Fabio Picconi, Bruno Baynat, Pierre Sens
NETWORKING
2000
13 years 10 months ago
Fairness and Aggregation: A Primal Decomposition Study
Abstract. We examine the fair allocation of capacity to a large population of best-effort connections in a typical multiple access communication system supporting some bandwidth on...
André Girard, Catherine Rosenberg, Mohammed...
MP
2008
135views more  MP 2008»
13 years 9 months ago
A path to the Arrow-Debreu competitive market equilibrium
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
Yinyu Ye