Sciweavers

132 search results - page 8 / 27
» Multi-phase Algorithms for Throughput Maximization for Real-...
Sort
View
SIGMETRICS
2006
ACM
156views Hardware» more  SIGMETRICS 2006»
14 years 1 months ago
Maximizing throughput in wireless networks via gossiping
A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed...
Eytan Modiano, Devavrat Shah, Gil Zussman
EURONGI
2006
Springer
13 years 11 months ago
Job Scheduling for Maximal Throughput in Autonomic Computing Systems
Abstract. Autonomic computing networks manage multiple tasks over a distributed network of resources. In this paper, we view an autonomic computing system as a network of queues, w...
Kevin Ross, Nicholas Bambos
SRDS
2006
IEEE
14 years 1 months ago
Recovering from Distributable Thread Failures with Assured Timeliness in Real-Time Distributed Systems
We consider the problem of recovering from failures of distributable threads with assured timeliness. When a node hosting a portion of a distributable thread fails, it causes orph...
Edward Curley, Jonathan Stephen Anderson, Binoy Ra...
MOBICOM
2006
ACM
14 years 1 months ago
Enabling distributed throughput maximization in wireless mesh networks: a partitioning approach
This paper considers the interaction between channel assignment and distributed scheduling in multi-channel multiradio Wireless Mesh Networks (WMNs). Recently, a number of distrib...
Andrew Brzezinski, Gil Zussman, Eytan Modiano
MOBIHOC
2009
ACM
14 years 8 months ago
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
Mathieu Leconte, Jian Ni, Rayadurgam Srikant