Sciweavers

171 search results - page 6 / 35
» The Power of Swap Deals in Distributed Resource Allocation
Sort
View
TCS
2008
13 years 7 months ago
The complexity of deciding reachability properties of distributed negotiation schemes
Distributed negotiation schemes offer one approach to agreeing an allocation of resources among a set of individual agents. Such schemes attempt to agree a distribution via a sequ...
Paul E. Dunne, Yann Chevaleyre
ICC
2009
IEEE
186views Communications» more  ICC 2009»
14 years 2 months ago
Power Allocations for Adaptive Distributed MIMO Multi-Hop Networks
—Distributed MIMO multi-hop relaying is one of the most promising technologies that permits cost-effective improvement of coverage, data rate and end-to-end (e2e) user experience...
Yidong Lang, Dirk Wübben, Karl-Dirk Kammeyer
HPDC
1998
IEEE
13 years 12 months ago
Matchmaking: Distributed Resource Management for High Throughput Computing
Conventional resource management systems use a system model to describe resources and a centralized scheduler to control their allocation. We argue that this paradigm does not ada...
Rajesh Raman, Miron Livny, Marvin H. Solomon
ICDCS
2003
IEEE
14 years 26 days ago
Dynamic Module Replacement in Distributed Protocols
Dynamic module replacement — the ability to hot swap a component’s implementation at runtime — is fundamental to supporting evolutionary change in long-lived and highlyavail...
Nigamanth Sridhar, Scott M. Pike, Bruce W. Weide
INFOCOM
2007
IEEE
14 years 1 months ago
Exploiting Hidden Convexity For Flexible And Robust Resource Allocation In Cellular Networks
— A systematic approach to solve seemingly nonconvex resource allocation problems in wireless cellular networks is studied in this paper. By revealing and exploiting the hidden c...
Chee-Wei Tan, Daniel Pérez Palomar, Mung Ch...