Optimal replication of series-parallel graphs for computation-intensive applications

DOI10.1006/JPDC.1995.1094MaRDI QIDQ1898178zbMATH OpenOpenAlexFDO

Authors Sheng-Tzong Cheng, Ashok K. Agrawala

Publication date 24 September 1995

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1903/579

zbMATH Keywords

replication problemSP graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• An algorithm for the multiprocessor assignment problem
• Complexity results for throughput and latency optimization of replicated and data-parallel workflows
• Efficient algorithms for the reliabilities of replicated \(n\)-parallel-task graphs
• scientific article; zbMATH DE number 553908
• Placement Des Taches D’Un Programme A Structure Arborescente Sur Un Reseau De Processeurs: Synthese De Resultats Recents

Cited in

(1)

• scientific article; zbMATH DE number 1919446 (Why is no real title available?)

This page was built for publication: Optimal replication of series-parallel graphs for computation-intensive applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1898178)