Sequential and distributed algorithms for fast graph partitioning

Simple item page
dc.contributor.authorKhan, Md. Shahadatullahen_US
dc.date.accessioned2024-08-14T18:31:46Z
dc.date.available2024-08-14T18:31:46Z
dc.date.copyright1994en_US
dc.date.issued1994
dc.degree.departmentDepartment of Electrical and Computer Engineering
dc.degree.levelMaster of Applied Science M.A.Sc.en
dc.description.abstractIn this thesis, we deal with the following k-way graph partitioning (GP) problem: given an undirected weighted graph G = (V, E), partition the nodes of G into k parts of almost equal size such that the partition-cost (sum of the weights on edges with nodes in different parts) is minimized. We propose some simple and fast algorithms for this problem for both sequential and distributed computing environments. We give three main algorithms for graph partitioning: direct algorithm AUC­TION; and iterative algorithms GREEDYPASS and GREEDYCYCLE. In the al­gorithm AUCTION, we introduce the idea of using auction and biddings for the GP problem. This is an inherently distributed algorithm. To the depth of our knowledge this is the first distributed algorithm for this problem. The algo­rithm GREEDYPASS is a greedy iterative algorithm. In each iteration we send a node from the current part to another part in order to get maximum decrease in partition-cost, and iteration can continue taking the destination as the next current part. Our third algorithm GREEDYCYCLE is another greedy algorithm where we introduce the idea of cyclic node passing among parts during the it­erative improvement stage. In every iteration: at first the parts compute their node passing interests, and then the algorithm finds and processes the cycles of node passing interests. Cyclic node passing is a k-way generalization of the 2-way node exchange found in the Kernighan-Lin approach. We present sequential algorithms for AUCTION, GREEDY PASS and GREEDY­CYCLE, distributed algorithms for AUCTION and GREEDYCYCLE, and some of their combinations. We have implemented the sequential algorithms in the Unix environment, and the distributed algorithms in the PYM environment. We com­pared the experimental performances with Lee's algorithm, and the results show that our algorithms are extremely fast and they produce reasonable quality of solutions.en
dc.format.extent109 pages
dc.identifier.urihttps://hdl.handle.net/1828/18466
dc.rightsAvailable to the World Wide Weben_US
dc.titleSequential and distributed algorithms for fast graph partitioningen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
KHAN_Md_Shahadatullah_MSC_1994_676603.pdf
Size:
26.41 MB
Format:
Adobe Portable Document Format
Download

Collections

Electronic Theses and Dissertations (ETD)
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.