Filters








41,847 Hits in 4.4 sec

Source Code Partitioning in Program Optimization

Murat Bolat, Kirk Kelsey, Xiaoming Li, Guang R. Gao
2011 2011 IEEE 17th International Conference on Parallel and Distributed Systems  
Our results show we can improve the compiling time in all tested real world benchmarks.  ...  Partitioning of program functions by analyzing profiling output shows dramatic decrease in compilation time of programs.  ...  (Graph Partitioning). 4) Create translation units for each graph cluster (Source Creation).  ... 
doi:10.1109/icpads.2011.125 dblp:conf/icpads/BolatKLG11 fatcat:ngr5mhlwzjf4zjfp7mltwdr6mu

Fast consensus clustering in complex networks

Aditya Tandon, Aiiad Albeshri, Vijey Thayananthan, Wadee Alhalabi, Santo Fortunato
2019 Physical review. E  
Algorithms for community detection are usually stochastic, leading to different partitions for different choices of random seeds.  ...  Consensus clustering has proven to be an effective technique to derive more stable and accurate partitions than the ones obtained by the direct application of the algorithm.  ...  Figure 3 . 3 Performance of fast consensus clustering on LFR benchmark graphs with 1,000 (left) and 10,000 (right) nodes.  ... 
doi:10.1103/physreve.99.042301 fatcat:3og3col4k5duvmy2yfxxzrdxle

A CASE STUDY ON CLUSTER BASED POWER-AWARE MAPPING STRATEGY FOR 2D NoC

Salini S, Aravindhan A, Lakshminarayanan G
2017 ICTACT Journal on Microelectronics  
Based on these studies, we propose Fidducia-Mattheyses (FM) algorithm for multi clustering to optimize power consumption and communication cost for different benchmarks of NoC.  ...  To overcome this limitation, cluster based mapping using KL algorithm has been introduced and it acts poorly at partitioning cut degree.  ...  ACKNOWLEDGEMENT The authors would like to thank Facility for Advanced Computing Testing and Simulation of Electronic Circuit (FACTS ElCi) for providing the lab facility for our research work.  ... 
doi:10.21917/ijme.2017.0055 fatcat:syo6jvfi6jhbfmz646za4i7kpu

Cluster Based Application Mapping Strategy for 2D NoC

A. Aravindhan, S. Salini, G. Lakshminarayanan
2016 Procedia Technology - Elsevier  
Based on these studies, we propose modified cluster mapping technique using tailor made algorithm for MPEG4 benchmark and Depth First Search (DFS) for PIP benchmark to optimize the communication cost based  ...  Experimental results show a 3.8% communication cost reduction for MPEG4 and 3.0% communication cost reduction for PIP benchmark.  ...  The stopping criteria for partitioning are decided by Eq. (13). Graph clustering.  ... 
doi:10.1016/j.protcy.2016.08.138 fatcat:falsdckgrrb3pp2fe2olfysice

Fast Detection of Size-Constrained Communities in Large Networks [chapter]

Marek Ciglan, Kjetil Nørvåg
2010 Lecture Notes in Computer Science  
Extensive evaluation of the algorithm on synthetic benchmark graphs for community detection showed that the proposed approach is very competitive with state-of-the-art methods, outperforming other approaches  ...  The algorithm is able to detect small-sized clusters independently of the network size.  ...  This task is useful for example for partition of the graph data for distributed graph database.  ... 
doi:10.1007/978-3-642-17616-6_10 fatcat:avxipr6ebfesxcbavso5nuidre

Improving the performance of algorithms to find communities in networks

Richard K. Darst, Zohar Nussinov, Santo Fortunato
2014 Physical Review E  
The number of clusters can be inferred from the spectra of the recently introduced non-backtracking and flow matrices, even in benchmark graphs with realistic community structure.  ...  Not surprisingly, knowing some features of the unknown partition could help its identification, yielding an improvement of the performance of the method.  ...  ACKNOWLEDGEMENTS We thank Paolo De Los Rios, Lucio Floretta, Chris Moore, Lenka Zdeborova and Pan Zhang for useful exchanges. R. K. D. and S.  ... 
doi:10.1103/physreve.89.032809 pmid:24730901 fatcat:qjj5ylkr7zcwhiooaghq2hzdz4

Time-sliced quantum circuit partitioning for modular architectures

Jonathan M. Baker, Casey Duckering, Alexander Hoover, Frederic T. Chong
2020 Proceedings of the 17th ACM International Conference on Computing Frontiers  
We exploit this clustering and the statically-known control flow of quantum programs to create tractable partitioning heuristics which map quantum circuits to modular physical machines one time slice at  ...  Specifically, we create optimized mappings for each time slice, accounting for the cost to move data from the previous time slice and using a tunable lookahead scheme to reduce the cost to move to future  ...  the graph are the partitions and the edges indicate a qubit moving from partition i to partition j.  ... 
doi:10.1145/3387902.3392617 dblp:conf/cf/BakerDHC20 fatcat:r3qsenlhgrfd5goye6bgm7eipm

Comparison of communities detection algorithms for multiplex

Chuan Wen Loe, Henrik Jeldtoft Jensen
2015 Physica A: Statistical Mechanics and its Applications  
This paper is a literature review of existing communities detection algorithms for multiplex and a comparative analysis of them.  ...  Multiplex is a set of graphs on the same vertex set, i.e. {G(V,E_1),...,G(V,E_m)}. It is a generalized graph to model multiple relationships with parallel edges between vertices.  ...  Hence it is not ideal to use as a benchmark graph for Communities Detection Algorithms.  ... 
doi:10.1016/j.physa.2015.02.089 fatcat:fgb4cz25tzfu5bt6jcchqsvuwa

Finding Statistically Significant Communities in Networks

Andrea Lancichinetti, Filippo Radicchi, José J. Ramasco, Santo Fortunato, Eshel Ben-Jacob
2011 PLoS ONE  
Despite the large variety of methods proposed to detect communities in graphs, there is a big need for multi-purpose techniques, able to handle different types of datasets and the subtleties of community  ...  Our method has a comparable performance as the best existing algorithms on artificial benchmark graphs. Several applications on real networks are shown as well.  ...  Acknowledgments We thank Paolo Bajardi, Steve Gregory and Martin Rosvall for useful suggestions. Author Contributions  ... 
doi:10.1371/journal.pone.0018961 pmid:21559480 pmcid:PMC3084717 fatcat:ppih2suqvzb7pb4xlnpu7wgq6m

WGB: Towards a Universal Graph Benchmark [chapter]

Khaled Ammar, M. Tamer Özsu
2014 Lecture Notes in Computer Science  
Our aim is to close this gap by introducing Waterloo Graph Benchmark (WGB), a benchmark for graph processing systems that offers an efficient generator that creates dynamic graphs with properties similar  ...  Graph data are of growing importance in many recent applications. There are many systems proposed in the last decade for graph processing and analysis.  ...  This research was partially supported by a fellowship from IBM Centre for Advanced Studies (CAS), Toronto.  ... 
doi:10.1007/978-3-319-10596-3_6 fatcat:meji5npkx5g4rpcfsrppgatzb4

Enhancing the performance of autoscheduling in Distributed Shared Memory multiprocessors [chapter]

Dimitrios S. Nikolopoulos, Eleftherios D. Polychronopoulos, Theodore S. Papatheodorou
1998 Lecture Notes in Computer Science  
Our technique partitions the application Hierarchical Task Graph and maps the derived partitions to clusters of processors in the DSM architecture.  ...  Autoscheduling is then applied separately for each partition to enhance data locality and reduce communication costs.  ...  Acknowledgements We would like to thank Constantine Polychronopoulos for his support and valuable comments, the European Center for Parallelism in Barcelona (CEPBA) for providing us access to their Origin2000  ... 
doi:10.1007/bfb0057892 fatcat:sdudtgqxeje3jhwt56fxhzipwq

Community detection algorithms: A comparative analysis

Andrea Lancichinetti, Santo Fortunato
2009 Physical Review E  
The methods are also tested against the benchmark by Girvan and Newman and on random graphs.  ...  Here we test several methods against a recently introduced class of benchmark graphs, with heterogeneous distributions of degree and community size.  ...  Ronhovde, and M. Rosvall for kindly providing their code. We are also grateful to V. Latora, T. Nepusz, A. Pluchino, A. Rapisarda, M. Sales-Pardo, and C. Wiggins for useful suggestions.  ... 
doi:10.1103/physreve.80.056117 pmid:20365053 fatcat:sqaavmkmlndjthzu2nt3xngikq

Consensus clustering in complex networks

Andrea Lancichinetti, Santo Fortunato
2012 Scientific Reports  
Here we show that consensus clustering can be combined with any existing method in a self-consistent way, enhancing considerably both the stability and the accuracy of the resulting partitions.  ...  Consensus clustering is used in data analysis to generate stable results out of a set of partitions delivered by stochastic methods.  ...  L and S. F devised the study; A. L. performed the experiments, analyzed the data and prepared the figures; S. F. wrote the paper.  ... 
doi:10.1038/srep00336 pmid:22468223 pmcid:PMC3313482 fatcat:tu27paanobh5hoxos3xqpse5pu

Towards Semantic Big Graph Analytics for Cross-Domain Knowledge Discovery [article]

Feichen Shen
2019 arXiv   pre-print
In this research, we present a big graph analytics framework aims at addressing this issue by providing semantic methods to facilitate the management of big graph data from close domains in order to discover  ...  Big linked data and knowledge bases come from different domains such as life sciences, publications, media, social web, and so on.  ...  Related Work In this section, we present previous work in graph schema partition and analytics.  ... 
arXiv:1902.07688v1 fatcat:ewzffpt56ve6bldzcunibnikyy

Structure and attributes community detection

Haithum Elhadi, Gady Agam
2013 Proceedings of the 7th Workshop on Social Network Mining and Analysis - SNAKDD '13  
In recent years due to the rise of social, biological, and other rich content graphs, several new graph clustering methods using structure and node's attributes have been introduced.  ...  The Selection method uses the graph structure ambiguity to switch between structure and attribute clustering methods.  ...  Acknowledgment The authors would like to thank Yiping Ke, Hong Cheng, and Juan David Cruz Gomez, for providing the code for their clustering methods, and Naila Mahdi for valuable suggestions and discussions  ... 
doi:10.1145/2501025.2501034 dblp:conf/kdd/ElhadiA13 fatcat:zpykpum7h5h7pkiqzy5dwnehpi
« Previous Showing results 1 — 15 out of 41,847 results