Online balancing two independent criteria

Simple item page
dc.citation.epage254en_US
dc.citation.spage244en_US
dc.contributor.authorTse, Savio S.H.en_US
dc.coverage.spatialShanghai, China
dc.date.accessioned2016-02-08T11:35:00Z
dc.date.available2016-02-08T11:35:00Z
dc.date.issued2008-10en_US
dc.departmentDepartment of Computer Engineeringen_US
dc.descriptionConference name: IFIP International Conference on Network and Parallel Computing NPC 2008: Network and Parallel Computing
dc.descriptionDate of Conference: 18-20 October, 2008
dc.description.abstractWe study the online bicriteria load balancing problem in this paper. We choose a system of distributed homogeneous file servers located in a cluster as the scenario and propose two online approximate algorithms for balancing their loads and required storage spaces. We first revisit the best existing solution for document placement, and rewrite it in our first algorithm by imposing some flexibilities. The second algorithm bounds the load and storage space of each server by less than three times of their trivial lower bounds, respectively; and more importantly, for each server, the value of at least one parameter is far from its worst case. The time complexities for both algorithm are O(logM). © 2008 Springer Berlin Heidelberg.en_US
dc.identifier.doi10.1007/978-3-540-88140-7_22en_US
dc.identifier.urihttp://hdl.handle.net/11693/26761
dc.language.isoEnglishen_US
dc.publisherSpringer
dc.relation.isversionofhttps://doi.org/10.1007/978-3-540-88140-7_22en_US
dc.source.titleIFIP International Conference on Network and Parallel Computing NPC 2008: Network and Parallel Computingen_US
dc.subjectApproximateen_US
dc.subjectDistributed file serveren_US
dc.subjectDocument placementen_US
dc.subjectLoad balancingen_US
dc.subjectOnline algorithmen_US
dc.subjectControl theoryen_US
dc.subjectParallel algorithmsen_US
dc.subjectParallel processing systemsen_US
dc.subjectSecurity of dataen_US
dc.subjectAlgorithmsen_US
dc.subjectClustering algorithmsen_US
dc.subjectNetwork managementen_US
dc.subjectResource allocationen_US
dc.subjectSchedulingen_US
dc.subjectScheduling algorithmsen_US
dc.subjectDistributeden_US
dc.subjectLoad balancingen_US
dc.subjectServersen_US
dc.subjectOn-line algorithmsen_US
dc.titleOnline balancing two independent criteriaen_US
dc.typeConference Paperen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Online balancing two independent criteria.pdf
Size:
456.94 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download
Collections
Department of Computer Engineering