A parallel algorithm for generalized networks |
| |
Authors: | M. D. Chang M. Engquist R. Finkel R. R. Meyer |
| |
Affiliation: | (1) Department of Computer Science and Operations Research, North Dakota State University, 58105 Fargo, ND, USA;(2) Cleveland Consultant Associates, 78731 Austin, TX, USA;(3) Department of Computer Sciences, The University of Wisconsin, 53706 Madison, WI, USA |
| |
Abstract: | This paper presents an application of parallel computing techniques to the solution of an important class of planning problems known as generalized networks. Three parallel primal simplex variants for solving generalized network problems are presented. Data structures used in a sequential generalized network code are briefly discussed and their extension to a parallel implementation of one of the primal simplex variants is given. Computational testing of the sequential and parallel codes, both written in Fortran, was done on the CRYSTAL multicomputer at the University of Wisconsin, and the computational results are presented. Maximum efficiency occurred for multiperiod generalized network problems where a speedup approximately linear in the number of processors was achieved.This research was supported in part by NSF grants DCR-8503148 and CCR-8709952 and by AFOSR grant AFOSR-86-0194. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|