Data-level parallel linear-quadratic penalty algorithm for multicommodity network flows
Pinar Mustafa, C.
Zenios Stavros, A.
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/25934
ACM Transactions on Mathematical Software
- Research Paper 
ACM, New York, NY, United States
We describe the development of a data-level, massively parallel software system for the solution of multicommodity network flow problems. Using a smooth linear-quadratic penalty (LQP) algorithm we transform the multicommodity network flow problem into a sequence of independent min-cost network flow subproblems. The solution of these problems is coordinated via a simple, dense, nonlinear master program to obtain a solution that is feasible within some user-specified tolerance to the original multicommodity network flow problem. Particular emphasis is placed on the mapping of both the subproblem and master problem data to the processing elements of a massively parallel computer, the Connection Machine CM-2. As a result of this design we can solve large and sparse optimization problems on current SIMD massively parallel architectures. Details of the implementation are reported, together with summary computational results with a set of test problems drawn from a Military Airlift Command application.
Showing items related by title, author, creator and subject.
Model-driven approach for supporting the mapping of parallel algorithms to parallel computing platforms Arkin, E.; Tekinerdogan, B.; Imre, K.M. (2013)The trend from single processor to parallel computer architectures has increased the importance of parallel computing. To support parallel computing it is important to map parallel algorithms to a computing platform that ...
Arkin, E.; Tekinerdogan, B. (CEUR-WS, 2013)One of the important problems in parallel computing is the mapping of the parallel algorithm to the parallel computing platform. Hereby, for each parallel node the corresponding code for the parallel nodes must be implemented. ...
Schneider, S.; Hirzel, M.; Gedik, B.G.; Wu, K.-L. (2012)Streaming applications transform possibly infinite streams of data and often have both high throughput and low latency requirements. They are comprised of operator graphs that produce and consume data tuples. The streaming ...