Learning based approach for optimal clustering of distributed program's call flow graph

DOI10.1007/978-90-481-9112-3_35MaRDI QIDQ4930230zbMATH OpenOpenAlexFDO

Authors Yousef Abofathi, Bager Zarei, Saeed Parsa

Publication date 28 September 2010

Published in Innovations in Computing Sciences and Software Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-90-481-9112-3_35

zbMATH Keywords

clusteringconcurrencylearning automatacall flow graphdistributed code

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45)

Recommendations

• On using learning automata for fast graph partitioning
• Graph partitioning using learning automata
• Deterministic learning automata solutions to the equipartitioning problem
• Clustering the wireless ad hoc networks: a distributed learning automata approach
• An efficient clustering algorithm for partitioning parallel programs

This page was built for publication: Learning based approach for optimal clustering of distributed program's call flow graph

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