Decomposing linear programs for parallel solution

Simple item page
buir.contributor.authorAykanat, Cevdet
dc.citation.epage482en_US
dc.citation.spage473en_US
dc.contributor.authorPınar, Alien_US
dc.contributor.authorÇatalyürek Ümit V.en_US
dc.contributor.authorAykanat, Cevdeten_US
dc.contributor.authorPınar, Mustafaen_US
dc.coverage.spatialLyngby, Denmark
dc.date.accessioned2016-02-08T12:00:53Z
dc.date.available2016-02-08T12:00:53Z
dc.date.issued1995-08en_US
dc.departmentDepartment of Computer Engineeringen_US
dc.descriptionDate of Conference: 21-24 August,1995
dc.descriptionConference name: Second International Workshop on Applied Parallel Computing Computations in Physics, Chemistry and Engineering Science, PARA '95
dc.description.abstractCoarse grain parallelism inherent in the solution of Linear Programming (LP) problems with block angular constraint matrices has been exploited in recent research works. However, these approaches suffer from unscalability and load imbalance since they exploit only the existing block angular structure of the LP constraint matrix. In this paper, we consider decomposing LP constraint matrices to obtain block angular structures with specified number of blocks for scalable parallelization. We propose hypergraph models to represent LP constraint matrices for decomposition. In these models, the decomposition problem reduces to the well-known hypergraph partitioning problem. A Kernighan-Lin based multiway hypergraph partitioning heuristic is implemented for experimenting with the performance of the proposed hypergraph models on the decomposition of the LP problems selected from NETLIB suite. Initial results are promising and justify further research on other hypergraph partitioning heuristics for decomposing large LP problems. © Springer-Verlag Berlin Heidelberg 1996.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T12:00:53Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 1996en
dc.identifier.doi10.1007/3-540-60902-4_50
dc.identifier.issn0302-9743
dc.identifier.urihttp://hdl.handle.net/11693/27751
dc.language.isoEnglishen_US
dc.publisherSpringeren_US
dc.relation.isversionofhttps://doi.org/10.1007/3-540-60902-4_50
dc.source.titleSecond International Workshop on Applied Parallel Computing Computations in Physics, Chemistry and Engineering Science, PARA '95en_US
dc.subjectLinear programmingen_US
dc.subjectAngular constrainten_US
dc.subjectBlock-angular structureen_US
dc.subjectDecomposition problemsen_US
dc.subjectHypergraph partitioningen_US
dc.subjectNumber of blocksen_US
dc.subjectParallel solutionsen_US
dc.subjectParallelizationsen_US
dc.subjectRecent researchesen_US
dc.subjectMatrix algebraen_US
dc.titleDecomposing linear programs for parallel solutionen_US
dc.typeConference Paperen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Decomposing linear programs for parallel solution.pdf
Size:
202.03 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Scholarly Publications - Computer Engineering