Graph Partitioners
Edit Page
Report
Scan day: 09 February 2014 UTC
20
Virus safety - good
Description: Three algorithms written in NESL for finding separators of graphs, in order to compare the quality of the cuts.
The goals of a graph partitioner, also called mesh partitioner, is to separate the vertices of a graph into almost equal-sized components such that the number of edges between components is minimized. Finding good graph partitions has been the focus of much recent research because it can be used to reduce the communication among processors in a parallel machine. In particular if the graph represents the communication structure of a set of entities, then the graph partitioner can be used to allocate the entities to processors such that communication is reduced. Graph partitioners also have many other uses.
Size: 612 chars
Contact Information
Email: —
Phone&Fax: —
Address: —
Extended: —
WEBSITE Info
| Page title: | Graph Partitioners |
| Keywords: | |
| Description: | |
| IP-address: | 128.2.217.13 |
WHOIS Info
| NS | Name Servers: NSAUTH1.NET.CMU.EDU 128.2.1.8 NSAUTH2.NET.CMU.EDU 128.237.148.168 |
| WHOIS | |
| Date | activated: 24-Apr-1985 last updated: 16-Sep-2010 expires: 31-Jul-2014 |