A Model for Task Repartioning under Data Replication

Authors Cevdet Aykanat, Erkan Okuyan, B. Barla Cambazoglu

Thumbnail PDF


  • Filesize: 94 kB
  • 3 pages

Document Identifiers

Author Details

Cevdet Aykanat
Erkan Okuyan
B. Barla Cambazoglu

Cite AsGet BibTex

Cevdet Aykanat, Erkan Okuyan, and B. Barla Cambazoglu. A Model for Task Repartioning under Data Replication. In Combinatorial Scientific Computing. Dagstuhl Seminar Proceedings, Volume 9061, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)


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.
  • Task repartitioning
  • data replication
  • hypergraph partitioning with fixed vertices
  • assignment flow network


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail