Abstract: Most existing graph partitioning algorithms produce good equivalent partitions. It means that the partitioned subsets have equal number of vertexes, and meanwhile, the edge-cuts are minimal. However, in the heterogeneous computing environment, the computi

Key words: Heterogeneous computing, Unbalanced partitioning, Task graph, Distribution vector