Sciweavers

1673 search results - page 155 / 335
» Generalized Elastic Scheduling
Sort
View
PPOPP
2010
ACM
16 years 3 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
16 years 3 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
ICCCN
2007
IEEE
16 years 21 days ago
Packet Scheduling with Buffer Management for Fair Bandwidth Sharing and Delay Differentiation
Abstract— Packet delay and bandwidth are two important metrics for measuring quality of service (QoS) of Internet services. Traditionally, packet delay differentiation and fair b...
Dennis Ippoliti, Xiaobo Zhou, Liqiang Zhang
SIGECOM
2004
ACM
96views ECommerce» more  SIGECOM 2004»
15 years 11 months ago
A stochastic programming approach to scheduling in TAC SCM
In this paper, we combine two approaches to handling uncertainty: we use techniques for finding optimal solutions in the expected sense to solve combinatorial optimization proble...
Michael Benisch, Amy R. Greenwald, Victor Narodits...
ICALP
2004
Springer
15 years 11 months ago
Online Scheduling with Bounded Migration
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
Peter Sanders, Naveen Sivadasan, Martin Skutella