Parallel algorithms for decomposed linear programs

Technical Report

Pubblico Deposited

Citeable URL: https://ir.library.oregonstate.edu/concern/technical_reports/m613n5898

Descriptions

Attribute Name	Values
Creator	Wu, Youfeng Lewis, Ted G.
Abstract	New parallel algorithms for solving the decomposed linear programs are developed. Direct parallelization of the sequential algorithm results in very limited performance improvement using multiple processors. By redesigning the algorithm, we achieved more than 2*P times performance improvement over the sequential algorithm, where P is the number of processors used in parallel computation. Furthermore, a particular variation of the sequential algorithm runs more than 2 times faster than the original sequential algorithm. The new parallel algorithm linearly speedups the new sequential algorithm.
Resource Type	Technical Report
Date Issued	1988-11
Academic Affiliation	Computer Science
Series	Technical report (Oregon State University. Department of Computer Science)
Dichiarazione dei diritti	In Copyright
Publisher	Oregon State University. Department of Computer Science
Language	English [eng]

Thumbnail	Titolo	Data caricata	Visibilità	Azioni
	Wu_Youfeng_88_70_05.pdf	2023-01-26	Pubblico	Scaricare