Parallelizing a new algorithm for the set partition problem

Authors:
Hoang Thanh
Affiliations:
Department of Informatics, Hanoi University of Science, VNUH, 334-Nguyen Trai Rd., Thanh Xuan, Hanoi, Vietnam
Venue:
Annales UMCS, Informatica
Year:
2010

Citing 5
Cited 0

Parallel Algorithms for Relational Coarsest Partition Problems

IEEE Transactions on Parallel and Distributed Systems
Introduction to algorithms

Introduction to algorithms
The list partition problem for graphs

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Transforming sequential processes of net systems into concurrent ones

International Journal of Knowledge-based and Intelligent Engineering Systems
Parallel Dimensionality Reduction Transformation for Time-Series Data

ACIIDS '09 Proceedings of the 2009 First Asian Conference on Intelligent Information and Database Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we propose a new approach to organizing parallel computing to find a sequence of all solutions to a problem. We split the sequence into subsequences and then execute concurrently the processes to find these subsequences. We propose a new simple algorithm for the set partition problem and apply the above technique for this algorithm.