Title :
A perfect speedup parallel algorithm for the assignment problem on complete weighted bipartite graphs
Author :
Osiakwan, Constantine N K ; Akl, Selim G.
Author_Institution :
Dept. of Comput. & Inf. Sci., Queen´´s Univ., Kingston, Ont., Canada
Abstract :
The authors present an adaptive parallel algorithm for the assignment problem on complete weighted bipartite graphs, where the edge weights can be real valued and negative. The algorithm is designed using the exclusive-read, exclusive-write parallel random-access machine (EREW PRAM) model of parallel computation. For a complete weighted bipartite graph of n vertices, the algorithm runs in O(n3 /p+n2p) time using p processors. The authors obtain a perfect speedup, with respect to the O(n3) Hungarian method, for p⩽√η, where η is the cardinality of the larger partite set
Keywords :
parallel algorithms; random-access storage; Hungarian method; assignment problem; cardinality; complete weighted bipartite graphs; parallel random-access machine; perfect speedup parallel algorithm; Algorithm design and analysis; Bipartite graph; Computational modeling; Concurrent computing; Councils; Information science; Parallel algorithms; Phase change random access memory; Polynomials; Read-write memory;
Conference_Titel :
Databases, Parallel Architectures and Their Applications,. PARBASE-90, International Conference on
Conference_Location :
Miami Beach, FL
Print_ISBN :
0-8186-2035-8
DOI :
10.1109/PARBSE.1990.77154
