Distributed Application Global States Monitoring in PEGASUS DA Applied to Parallel Graph Partitioning-Reference-Cited by-同舟云学术

Distributed Application Global States Monitoring in PEGASUS DA Applied to Parallel Graph Partitioning

Published:2020-10-13 Issue:11 Volume:33 Page:
ISSN:1532-0626
Container-title:Concurrency and Computation: Practice and Experience
language:en
Short-container-title:Concurrency Computat Pract Exper

Author:

Smyk Adam¹^ORCID,Tudruj Marek¹²

Affiliation:

1. Polish‐Japanese Academy of Information Technology Warsaw Poland

2. Institute of Computer Science Polish Academy of Sciencese Warsaw Poland

Publisher

Wiley

Subject

Computational Theory and Mathematics,Computer Networks and Communications,Computer Science Applications,Theoretical Computer Science,Software

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1002/cpe.6052

Reference30 articles.

1. KhanMS LiMS. Fast graph partitioning algorithms. Paper presented at: Proceedings of IEEE Pacific Rim Conference on Communications Computers and Signal Processing; May1995:337‐342; Victoria B.C. Canada.

2. An efficient heuristic procedure for partitioning graphs;Kerighan BW;Bell Syst Tech J,1970

3. DuttS DengW. VLSI circuit partitioning by cluster‐removal using iterative improvement techniques ICCAD '96 San Jose CA 1996: Proceedings of the IEEE International Conference on Computer‐Aided Design;1997:194‐200.

4. FiducciaCM MattheysesRM. A linear time heuristic for improving network partitions. Paper presented at: Proceedings of the 19th Design Automation Conference;1982:175‐181.

5. Some simplified NP-complete graph problems

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Taming next‐generation HPC systems: Run‐time system and algorithmic advancements;Concurrency and Computation: Practice and Experience;2020-12-25