2026-07-23T04:53:03Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:2090 2024-03-06T11:08:34Z ddc:004 open_access

A Model for Task Repartioning under Data Replication Aykanat, Cevdet Okuyan, Erkan Cambazoglu, B. Barla Task repartitioning data replication hypergraph partitioning with fixed vertices assignment flow network We propose a two-phase model for solving the problem of task repartitioning under data replication with memory constraints. The hypergraph-partitioning-based model proposed for the first phase aims to minimize the total message volume that will be incurred due to the replication/migration of input data while maintaining balance on computational and receive-volume loads of processors. The network-flow-based model proposed for the second phase aims to minimize the maximum message volume handled by processors via utilizing the flexibility in assigning send-communication tasks to processors, which is introduced by data replication. The validity of our proposed model is verified on parallelization of a direct volume rendering algorithm. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Cevdet Aykanat and Erkan Okuyan and B. Barla Cambazoglu 2009 Is Part Of Dagstuhl Seminar Proceedings, Volume 9061, Combinatorial Scientific Computing (2009) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.09061.2 urn:nbn:de:0030-drops-20903 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.2 eng https://creativecommons.org/licenses/by/4.0/legalcode