Reexamining the parallelization schemes for standard full tableau simplex method on distributed memory environments

dc.contributor.author	Μάμαλης, Βασίλης	el
dc.contributor.author	Πάντζιου, Γραμματή Ε.	el
dc.contributor.author	Δημητρόπουλος, Γεώργιος	el
dc.contributor.author	Κρεμμύδας, Δημήτριος	el
dc.date.accessioned	2015-05-25T22:00:51Z
dc.date.issued	2015-05-26
dc.identifier.uri	http://hdl.handle.net/11400/11159
dc.rights	Αναφορά Δημιουργού-Μη Εμπορική Χρήση-Όχι Παράγωγα Έργα 3.0 Ηνωμένες Πολιτείες	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/us/	*
dc.source	http://www.actapress.com/PaperInfo.aspx?PaperID=451549&reason=500	en
dc.subject	Γραμμικός Προγραμματισμός
dc.subject	Απλοί αλγόριθμοι
dc.subject	Παράλληλη επεξεργασία
dc.subject	συμπλέγματα λίνουξ
dc.subject	Linear programming
dc.subject	Simplex Algorithm
dc.subject	Parallel processing (Electronic computers)
dc.subject	MPI Linux Clusters
dc.title	Reexamining the parallelization schemes for standard full tableau simplex method on distributed memory environments	en
heal.type	conferenceItem
heal.classification	Πληροφορική
heal.classification	Μηχανική υπολογιστών
heal.classification	Computer science
heal.classification	Computer engineering
heal.classificationURI	N/A-Πληροφορική
heal.classificationURI	N/A-Μηχανική υπολογιστών
heal.classificationURI	http://skos.um.es/unescothes/C00750
heal.classificationURI	http://id.loc.gov/authorities/subjects/sh85029495
heal.keywordURI	http://id.loc.gov/authorities/subjects/sh00006385
heal.keywordURI	http://id.loc.gov/authorities/subjects/sh85097826
heal.identifier.secondary	DOI: 10.2316/P.2011.719-028
heal.dateAvailable	10000-01-01
heal.language	en
heal.access	forever
heal.recordProvider	Τεχνολογικό Εκπαιδευτικό Ίδρυμα Αθήνας. Σχολή Τεχνολογικών Εφαρμογών. Τμήμα Μηχανικών Πληροφορικής Τ.Ε.	el
heal.publicationDate	2011-02-15
heal.bibliographicCitation	Mamalis, B., Pantziou, G., Dimitropoulos, G. and Kremmydas, D. (2011) Reexamining The Parallelization Schemes For Standard Full Tableau Simplex Method on Distributed Memory Environments. Proceeding of the IASTED International Conference on Parallel and Distributed Computing and Networks (PDCN’2011). Innsbruck, Austria	en
heal.abstract	The simplex method has been successfully used in solving linear programming problems for many years. Parallel approaches have also extensively been studied due to the intensive computatios required (especially for the solution of large in size linear problems). In this paper we present a highly scaleable parallel implementation framework of the standard full tableau simplex method on a highly parallel (distributed memory) environment. Specifically, we have designed and implemented a column distribution scheme (similar to the one presented in [24]) as well as a row distribution scheme (similar to the one presented in [3]) and we have entirely tested our implementations over a considerably powerful parallel environment (a linux-cluster of eight powerful Xeon processors connected via a high speed Myrinet network interface). We then compare our approaches (a) among each other for variable number of problem size (number of rows and columns) and (b) to the corresponding ones of [3] and [24] which are two of the most recent and valuable corresponding efforts. In most cases the column distribution scheme performs quite/much better than the row distribution scheme. Moreover, both schemes (even the row distribution scheme over large scale problems) lead to particularly high speed-up and efficiency values, that are considerably better in all cases than the ones achieved by the corresponding implementations of [3] and [24].	en
heal.fullTextAvailability	false
heal.conferenceName	Proceeding of the IASTED International Conference on Parallel and Distributed Computing and Networks (PDCN’2011)	en
heal.conferenceItemType	short paper