Sciweavers

2714 search results - page 311 / 543
» Approximation Schemes for Scheduling
Sort
View
AIPS
2003
15 years 5 months ago
Optimal Rectangle Packing: Initial Results
Given a set of rectangles with fixed orientations, we want to find an enclosing rectangle of minimum area that contains them all with no overlap. Many simple scheduling tasks ca...
Richard E. Korf
ISCAPDCS
2004
15 years 5 months ago
FG: A Framework Generator for Hiding Latency in Parallel Programs Running on Clusters
FG is a programming environment for asynchronous programs that run on clusters and fit into a pipeline framework. It enables the programmer to write a series of synchronous functi...
Thomas H. Cormen, Elena Riccio Davidson
IM
2003
15 years 5 months ago
Performance Management for Cluster Based Web Services
: We present an architecture and prototype implementation of a performance management system for cluster-based web services. The system supports multiple classes of web services tr...
Ronald M. Levy, Jay Nagarajarao, Giovanni Pacifici...
127
Voted
ISCA
2008
IEEE
136views Hardware» more  ISCA 2008»
15 years 4 months ago
A Randomized Queueless Algorithm for Breadth-First Search
First Come First Served is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems [28, 11], scheduling web ...
K. Subramani, Kamesh Madduri
116
Voted
CN
2002
88views more  CN 2002»
15 years 3 months ago
Rate allocation and buffer management for differentiated services
A novel algorithm for buffer management and rate allocation is presented for providing loss and delay differentiation for traffic classes at a network router. The algorithm, calle...
Jörg Liebeherr, Nicolas Christin