An Experimental Study of k-splittable Scheduling for DNS-based Traffic 
Allocation

Agarwal, Amit; Agarwal, Tarun; Chopra, Sumit; Feldmann, Anja; Kammenhuber, Nils; Krysta, Piotr; Vöcking, Berthold; Kosch, Harald; Böszörményi, László; Hellwagner, Hermann

Item

ITEM ACTIONSEXPORT

Add to Basket

Please note that a newer version of this item is available:
https://pure.mpg.de/pubman/item/item_1329970_5

DetailsSummary

Released

Conference Paper

An Experimental Study of k-splittable Scheduling for DNS-based Traffic Allocation

MPS-Authors

/persons/resource/persons44853

Krysta, Piotr
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45673

Vöcking, Berthold
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Agarwal, A., Agarwal, T., Chopra, S., Feldmann, A., Kammenhuber, N., Krysta, P., et al. (2003). An Experimental Study of k-splittable Scheduling for DNS-based Traffic Allocation. In H. Kosch, L. Böszörményi, & H. Hellwagner (Eds.), Euro-Par 2003 Parallel Processing (pp. 230-235). Berlin, Germany: Springer.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-2C23-F

Abstract

There is no abstract available