Sciweavers

517 search results - page 41 / 104
» Approximation Algorithms for Scheduling with Reservations
Sort
View
HIPC
2007
Springer
15 years 1 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
IWQOS
2001
Springer
15 years 2 months ago
JoBS: Joint Buffer Management and Scheduling for Differentiated Services
A novel algorithm for buffer management and packet scheduling is presented for providing loss and delay differentiation for traffic classes at a network router. The algorithm, cal...
Jörg Liebeherr, Nicolas Christin
CLUSTER
2009
IEEE
15 years 1 months ago
Analytical modeling and optimization for affinity based thread scheduling on multicore systems
Abstract--This paper proposes an analytical model to estimate the cost of running an affinity-based thread schedule on multicore systems. The model consists of three submodels to e...
Fengguang Song, Shirley Moore, Jack Dongarra
APPROX
2008
Springer
107views Algorithms» more  APPROX 2008»
14 years 12 months ago
A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined in
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
Shashi Mittal, Andreas S. Schulz
BROADNETS
2005
IEEE
15 years 3 months ago
Bandwidth guaranteed multicast scheduling for virtual output queued packet switches
Multicast enables efficient data transmission from one source to multiple destinations, and has been playing an important role in Internet multimedia applications. Although sever...
Deng Pan, Yuanyuan Yang