One-dimensional partitioning for heterogeneous systems: theory and practice

Simple item page
buir.contributor.authorAykanat, Cevdet
dc.citation.epage1486en_US
dc.citation.issueNumber11en_US
dc.citation.spage1473en_US
dc.citation.volumeNumber68en_US
dc.contributor.authorPınar, A.en_US
dc.contributor.authorTabak, E. K.en_US
dc.contributor.authorAykanat, Cevdeten_US
dc.date.accessioned2016-02-08T10:07:26Z
dc.date.available2016-02-08T10:07:26Z
dc.date.issued2008-11en_US
dc.departmentDepartment of Computer Engineeringen_US
dc.description.abstractWe study the problem of one-dimensional partitioning of nonuniform workload arrays, with optimal load balancing for heterogeneous systems. We look at two cases: chain-on-chain partitioning, where the order of the processors is specified, and chain partitioning, where processor permutation is allowed. We present polynomial time algorithms to solve the chain-on-chain partitioning problem optimally, while we prove that the chain partitioning problem is NP-complete. Our empirical studies show that our proposed exact algorithms produce substantially better results than heuristics, while solution times remain comparable. © 2008 Elsevier Inc. All rights reserved.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T10:07:26Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2008en
dc.identifier.doi10.1016/j.jpdc.2008.07.005en_US
dc.identifier.issn0743-7315en_US
dc.identifier.urihttp://hdl.handle.net/11693/22984en_US
dc.language.isoEnglishen_US
dc.publisherAcademic Pressen_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/j.jpdc.2008.07.005en_US
dc.source.titleJournal of Parallel and Distributed Computingen_US
dc.subjectChain-on-chain partitioningen_US
dc.subjectDynamic programmingen_US
dc.subjectLoad balancingen_US
dc.subjectOne-dimensional partitioningen_US
dc.subjectParallel computingen_US
dc.subjectParametric searchen_US
dc.subjectHeuristic programmingen_US
dc.subjectNuclear propulsionen_US
dc.subjectParallel processing systemsen_US
dc.subjectPolynomial approximationen_US
dc.subjectChain partitioningen_US
dc.subjectEmpirical studiesen_US
dc.subjectExact algorithmsen_US
dc.subjectHeterogeneous systemsen_US
dc.subjectNon uniformen_US
dc.subjectNP-completeen_US
dc.subjectOptimal load balancingen_US
dc.subjectPolynomial-time algorithmsen_US
dc.subjectReal time systemsen_US
dc.titleOne-dimensional partitioning for heterogeneous systems: theory and practiceen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
One-dimensional partitioning for heterogeneous systems Theory and practice.pdf
Size:
2.8 MB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Scholarly Publications - Computer Engineering