Dr. Mohan Kumar , School of Computing , Curtin University of Technology , Australia. Abstract Clustering and allocation of tasks for parallel computation is a well researched problem. Several techniques have been proposed in the past to improve performance and reduce problem execution times. In this talk, we will present a novel approach to clustering and allocation in which clustering can be tuned to achieve maximal speedup or efficiency. Our scheme uses the computation and communication costs of task clusters and can adapt to different architectures and available number of processors.
Comparative studies indicate superior efficiency than other recently proposed clustering schemes.