34,524 Hits in 6.6 sec

The topological structure of asynchronous computability

Maurice Herlihy, Nir Shavit
1999 Journal of the ACM  
We characterize computability in terms of the topological properties of these complexes.  ...  Preliminary versions of these results appeared as HERLIHY, M. P., AND SHAVIT, N. 1993. The asynchronous computability theorem for t-resilient tasks. In  ...  We wish to thank the many people whose comments have helped to improve this paper over the past six years: Yehuda Afek, Hagit Attiya, Elizabeth Borowsky, Faith Fich, Gunnar Hoest, Alan Fekete, Eli Gafni  ... 
doi:10.1145/331524.331529 fatcat:pbwotdegvrfhbn6orn3q5j5lhm

Modeling Slicer and Control Algorithm for Distributed Computation in Metrized Weaker Topological Spaces

Susmit Bagchi
2017 International Journal of Control and Automation  
The control of computation of such hybrid geo-distributed systems is difficult in the presence of randomly varying network delays and unpredictable occurrence of partitions in network topology.  ...  This paper proposes the model of observable distributed computation in weaker topological spaces having monotone and metrizability properties.  ...  The algebraic topological models impose a set of very rigid and fixed geometric structures, whereas a more flexible structure would benefit the modeling of asynchronous distributed systems exposing finer  ... 
doi:10.14257/ijca.2017.10.12.19 fatcat:6pvqb4u5xnglxeafeka5b4ja2y

Modeling and Analyzing Distributed Computation in Monotone Spaces with Structural Map

Susmit Bagchi
2016 International Journal of Software Engineering and Its Applications  
In higher-dimensions, the simplex structures of topological spaces as well as homology are employed to model and analyze distributed asynchronous computations.  ...  Distributed computation follows the models of discrete structures in combinatorial forms.  ...  The structural forms of algebraic topology can be equally applied to the synchronous as well as asynchronous distributed computing systems [7, 17] .  ... 
doi:10.14257/ijseia.2016.10.4.10 fatcat:qxqzm3uttzhjlbklgwr4lt2tkq

Running Particle Swarm Optimization on Graphic Processing Units [chapter]

Carmelo Bastos-Filho, Marcos Oliveira, Debora Nascimento
2011 Search Algorithms and Applications  
Acknowledgments The authors would like to thank FACEPE, CNPq, UPE and POLI (Escola Politécnica de Pernambuco).  ...  The dichotomic behaviour of the global and ring topologies suggests to consider structures to balance the previous approaches. Some other topologies were recently proposed.  ...  This structure is commonly used to represent neighborhoods in the Evolutionary Computation and Cellular Automata communities (Mendes et al. (2004) ).  ... 
doi:10.5772/14694 fatcat:zlpvvvrepnf4jadbvobswmxjem

Computational modeling of consistent observation of asynchronous distributed computation on N–manifold

Susmit Bagchi, Qiang Shawn Cheng
2018 Cogent Engineering  
The discrete geometric simulations of computational structures on 3-manifold offer different analytical insights.  ...  This paper proposes a computational model of consistent observation of asynchronous distributed computation on N-manifold.  ...  The main contributions of this paper are as follows. • Construction of a formal model of observation of asynchronous distributed computing on N-manifold structure • Integrating filtering method to generate  ... 
doi:10.1080/23311916.2018.1528029 fatcat:2nsbvlidcncrxncazvgwagfp7q

Formal analysis of control and termination of distributed computation in weaker spaces

Susmit Bagchi
2018 Cogent Engineering  
The modeling and analysis of distributed computation can be performed by using combinatorial topology by forming simplexes, which imposes a set of relatively rigid geometric structures.  ...  The proposed model enhances structural flexibility in metrized monotone spaces. The metrizability of the space and convergence property of the computation are analyzed.  ...  Citation information Cite this article as: Formal analysis of control and termination of distributed computation in weaker spaces, Susmit Bagchi, Cogent Engineering (2018), 5: 1475033.  ... 
doi:10.1080/23311916.2018.1475033 fatcat:a37gr7vyozhpldu77js7tupdx4

Convergence Analysis of Asynchronous Consensus in Discrete-time Multi-agent Systems with Fixed Topology [article]

Kooktae Lee, Raktim Bhattacharya
2016 arXiv   pre-print
The validity of the proposed result is verified with simulations.  ...  The convergence in this context implies the asynchronous consensus value converges to the synchronous one and is unique.  ...  Theorem 3.1: Consider the dynamics of the asynchronous model (3) for a multi-agent system with fixed topology.  ... 
arXiv:1606.04156v1 fatcat:bcn53tgfxngr5fcpthr56rfhva

Distributed Evolutionary Algorithms Inspired by Membranes in Solving Continuous Optimization Problems [chapter]

Daniela Zaharie, Gabriel Ciobanu
2006 Lecture Notes in Computer Science  
Moreover, analyzing the similarities and differences between the evolutionary operators and the evolution rules in membrane systems, between membrane structures and communication topologies, and between  ...  In this paper we present a new strategy to apply the operators in evolutionary algorithms. This strategy is inspired from the way the evolution rules are used in membrane systems.  ...  Communication Topologies and Membrane Structures The communication topology describes the connections between subpopulations.  ... 
doi:10.1007/11963516_34 fatcat:glounrteabgohky4oin63ykm6u

Selection Intensity in Cellular Evolutionary Algorithms for Regular Lattices

M. Giacobini, M. Tomassini, A.G.B. Tettamanzi, E. Alba
2005 IEEE Transactions on Evolutionary Computation  
The dependence of the models on the neighborhood radius is studied for both topologies. We also derive results for 2-D lattices with variable grid axes ratio.  ...  In this paper, we present quantitative models for the selection pressure of cellular evolutionary algorithms on regular one-and two-dimensional (2-D) lattices.  ...  Ring Structure For this study the cEA structure has a ring topology of size 1024 with neighborhood of radius 1.  ... 
doi:10.1109/tevc.2005.850298 fatcat:omifly5uhjh3lgwssxy2vtypkq

Increasing Interconnection Network Connectivity for Reducing Operator Complexity in Asynchronous Vision Systems [chapter]

Valentin Gies, Thierry M. Bernard
2005 Lecture Notes in Computer Science  
Due to the restriction of SIMD mode to local operations in VLSI massively parallel vision chips, using programmable connections and asynchronous communications are key ingredients to support regional computations  ...  Examples and results will be presented on the examples of the regional sum algorithm computed over a 4-connectivity squared mesh connected with a 6-connectivity interconnection network, and the regional  ...  Network Topology for Regional Sum Computation over a 4-Connectivity Region Asynchronous dedicated operators used for sum computation are expensive mostly because they 4 inputs.  ... 
doi:10.1007/978-3-540-31965-8_1 fatcat:r3gjrllqyfgxnnq5cmv6yk2cla

A topology based approach to coordinated multicast operations [chapter]

Jörg Nolte
1998 Lecture Notes in Computer Science  
Multicast groups are described as reusable application-speci c topology classes that coordinate both the spreading of multicast messages and the collection reduction of the computed results.  ...  Multicasts are a powerful means to implement coordinated operations on distributed data-sets as well as synchronized reductions of multiple computed results.  ...  the relations between an individual sheep and a structured group of sheepFig. 2.  ... 
doi:10.1007/3-540-64359-1_689 fatcat:kir6zbghvnhmborut4equbntae

Power comparison of an asynchronous and synchronous network on chip router

Pooria M. Yaghini, Ashkan Eghbal, S. A. Asghari, H. Pedram
2009 2009 14th International CSI Computer Conference  
Based on the comparison the power consumption of buffer and switch components are almost same due to their similar structure.  ...  On the other hand, the transition counting of routing unit in asynchronous NoC router is nearly 73% of synchronous one.  ...  An Asynchronous Design Structure of NoC router Figure-1 indicates the architecture of the asynchronous NoC router which is applied in this experiment.  ... 
doi:10.1109/csicc.2009.5349422 fatcat:yq5c4xbognbzndvv3vge6cuqsm

Asynchronous Hierarchical Federated Learning [article]

Xing Wang, Yijun Wang
2022 arXiv   pre-print
In this paper, we address these issues by proposing asynchronous hierarchical federated learning, in which the central server uses either the network topology or some clustering algorithm to assign clusters  ...  We evaluate the proposed algorithm on CIFAR-10 image classification task, the experimental results demonstrate the effectiveness of asynchronous hierarchical federated learning.  ...  In addition, we blur the concept of network topological edges to form clusters as well as the hierarchical structures.  ... 
arXiv:2206.00054v1 fatcat:otif2b4bubefjjgkp5ygtmkngy

DSP, a Plug-and-Play Process-Based Distributed Algorithm Simulation Platform

Yifan Wang, Qianchuan Zhao, Hu Yan, Wen Yang, Basilio B. Fraguela
2022 Scientific Programming  
DSP consists of computer processes, and each process simulates an individual distributed node.  ...  It supports the testing of applications in various fields. Small-scale experiments can be done with a single personal computer, while large-scale experiments can be carried out through cloud servers.  ...  In this part, the structure of DSP is illustrated. DSP has a completely distributed framework comprised of computer processes.  ... 
doi:10.1155/2022/3886729 fatcat:27msidgacjaibionyu3b5awhse

SCALPsim. a tool for modeling asynchronous Self-Organizing 3-D NoC architectures

Diego Barrientos, Claudio Sousa, Andres Upegui, Bernard Girau
2020 2020 27th IEEE International Conference on Electronics, Circuits and Systems (ICECS)  
The ComputingCore modules implement the application layer of the system. 2) Asynchronism: The asynchronism of the different computing elements of a multi-FPGA system is a strong constraint for the simulator  ...  The advantage of this approach is the separation of multiple computing resources, possibly asynchronous, with a simple architecture and a low usage of resources.  ... 
doi:10.1109/icecs49266.2020.9294833 fatcat:ostigmby3ndndfgveajynru2ku
« Previous Showing results 1 — 15 out of 34,524 results