Sciweavers

1502 search results - page 116 / 301
» Node weighted scheduling
Sort
View
FSTTCS
2007
Springer
16 years 13 days ago
"Rent-or-Buy" Scheduling and Cost Coloring Problems
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...
Takuro Fukunaga, Magnús M. Halldórss...
CN
2004
138views more  CN 2004»
15 years 6 months ago
Performance evaluation of prioritized scheduling with buffer management for differentiated services architectures
Differentiated services (DiffServ) is an architecture for the Internet in which various applications are supported using a simple classification scheme. Packets entering the DiffS...
Ahmed E. Kamal, Hossam S. Hassanein
SIGMETRICS
2012
ACM
251views Hardware» more  SIGMETRICS 2012»
13 years 8 months ago
Providing fairness on shared-memory multiprocessors via process scheduling
Competition for shared memory resources on multiprocessors is the most dominant cause for slowing down applications and makes their performance varies unpredictably. It exacerbate...
Di Xu, Chenggang Wu, Pen-Chung Yew, Jianjun Li, Zh...
IPPS
2007
IEEE
16 years 17 days ago
Incorporating Latency in Heterogeneous Graph Partitioning
Parallel applications based on irregular meshes make use of mesh partitioners for efficient execution. Some mesh partitioners can map a mesh to a heterogeneous computational plat...
Eric E. Aubanel, Xiaochen Wu
APPROX
2007
Springer
137views Algorithms» more  APPROX 2007»
16 years 14 days ago
A Knapsack Secretary Problem with Applications
We consider situations in which a decision-maker with a fixed budget faces a sequence of options, each with a cost and a value, and must select a subset of them online so as to ma...
Moshe Babaioff, Nicole Immorlica, David Kempe, Rob...