1257 search results - page 40 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
99
Voted
INFOCOM
2008
IEEE
15 years 6 months ago
2008
IEEE
—In a wireless network with node exclusive spectrum sharing, two popular schedules are maximum weight matching (MWM) schedule and maximum size matching (MSM) schedule. The former...
116
click to vote
TSP
2010
14 years 6 months ago
2010
Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...
STOC
2001
ACM
16 years 1 days ago
2001
ACM
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
122
click to vote
ICPP
2005
IEEE
15 years 5 months ago
2005
IEEE
Consider a heterogeneous cluster system, consisting of processors with varying processing capabilities and network links with varying bandwidths. Given a DAG application to be sch...
106
click to vote
HPDC
2008
IEEE
14 years 12 months ago
2008
IEEE
This paper describes the study conducted to design and evaluate a two-level on-line scheduler to dynamically schedule a stream of sequential and multi-threaded batch jobs on large...