Sciweavers

790 search results - page 77 / 158
» Limits of Work-Stealing Scheduling
Sort
View
86
Voted
EOR
2006
83views more  EOR 2006»
15 years 20 days ago
Lower bounds and heuristic algorithms for the k
We consider the problem of partitioning a set of positive integers values into a given number of subsets, each having an associated cardinality limit, so that the maximum sum of v...
Mauro Dell'Amico, Manuel Iori, Silvano Martello, M...
114
Voted
PPOPP
2010
ACM
15 years 10 months ago
Lazy binary-splitting: a run-time adaptive work-stealing scheduler
We present Lazy Binary Splitting (LBS), a user-level scheduler of nested parallelism for shared-memory multiprocessors that builds on existing Eager Binary Splitting work-stealing...
Alexandros Tzannes, George C. Caragea, Rajeev Baru...
SOFSEM
2010
Springer
15 years 9 months ago
Regret Minimization and Job Scheduling
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
Yishay Mansour
93
Voted
PIMRC
2008
IEEE
15 years 7 months ago
An adaptive holdoff algorithm based on node state for IEEE 802.16 mesh mode with coordinated distributed scheduling
Wireless mesh networks (WMNs) are one of the key features of beyond 3G system because of their flexible and lowcost deployment. IEEE 802.16 mesh mode has recently emerged as an alt...
Bong Chan Kim, Dong Gu Kwak, Heecheol Song, Hwang ...
132
Voted
WCNC
2008
IEEE
15 years 7 months ago
Proportional Fair Scheduling: Analytical Insight under Rayleigh Fading Environment
—This paper provides analytical expressions to evaluate the performance of a random access wireless network in terms of user throughput and network throughput, subject to the con...
Erwu Liu, Kin K. Leung