Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Development of routing algorithms in networks-on-chip based on two-dimensional optimal circulant topologies.

ABSTRACT: This work is devoted to the study of application of new topologies in the design of networks-on-chip (NoCs). It is proposed to use two-dimensional optimal circulant topologies for NoC design, and it is developed an optimized routing algorithm with the decreased memory usage. The proposed routing algorithm was compared with Table routing, Clockwise routing, and Adaptive routing algorithms, previously developed for ring circulant topologies, and specialized routing algorithm for multiplicative circulants. The results of synthesis of routers implementing proposed routing algorithms are presented. The cost of ALM and register resources for the implementation of communication subsystems in NoCs with circulant topologies is estimated.

SUBMITTER: Romanov AY

PROVIDER: S-EPMC6962702 | biostudies-literature | 2020 Jan

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Development of routing algorithms in networks-on-chip based on two-dimensional optimal circulant topologies.

Romanov Aleksandr Yu AY Lezhnev Evgeny V EV Glukhikh Aleksandr Yu AY Amerikanov Aleksandr A AA

Heliyon 20200115 1

This work is devoted to the study of application of new topologies in the design of networks-on-chip (NoCs). It is proposed to use two-dimensional optimal circulant topologies for NoC design, and it is developed an optimized routing algorithm with the decreased memory usage. The proposed routing algorithm was compared with Table routing, Clockwise routing, and Adaptive routing algorithms, previously developed for ring circulant topologies, and specialized routing algorithm for multiplicative cir ...[more]

PMID: 31956712

Similar Datasets

Development of routing algorithms in networks-on-chip based on ring circulant topologies.

Project description:This work is devoted to the study of communication subsystem of networks-on-chip (NoCs) development with an emphasis on their topologies. The main characteristics of NoC topologies and the routing problem in NoCs with various topologies are considered. It is proposed to use two-dimensional circulant topologies for NoC design, since they have significantly better characteristics than most common mesh and torus topologies, and, in contrast to many other approaches to improving topologies, have a regular structure. The emphasis is on using ring circulants which although in some cases have somewhat worse characteristics than the optimal circulants, compensate by one-length first generatrix in such graphs that greatly facilitate routing in them. The paper considers three different approaches to routing in NoCs with ring circulant topology: Table routing, Clockwise routing, and Adaptive routing. The algorithms of routing are proposed, the results of synthesis of routers, based on them, are presented, and the cost of chip resources for the implementation of such communication subsystems in NoCs is estimated.

| S-EPMC6475896 | biostudies-literature

Wireless optimization for sensor networks using IoT-based clustering and routing algorithms.

Project description:Wireless sensor networks (WSN) are among the most prominent current technologies. Its popularity has skyrocketed because of its capacity to operate in difficult situations. The WSN market encompasses various industries, including building automation, security networks, healthcare systems, logistics, and military operations. Therefore, increasing the energy efficiency of these networks is of utmost importance. Hierarchical topology, which typically uses a clustering methodology, is one of the most well-known methods for WSN energy optimization. To achieve energy efficiency in WSN, hierarchical topology low-energy adaptive clustering hierarchy (LEACH) was first introduced, and this served as the foundation. However, conventional LEACH has several limitations, which have led to extensive research into improving LEACH's efficacy in its current form. The use of particular algorithms and strategies to enhance the functionality of the conventional LEACH protocol forms the basis of ongoing efforts. Utilizing this enhanced LEACH, performance in terms of throughput and network life may be enhanced by concentrating on elements such as cluster head formation and transmission energy consumption. The enhanced LEACH algorithm demonstrates significant improvements in both throughput and network lifetime compared with conventional LEACH. Through rigorous experimentation, it was found that the enhanced algorithm increases the throughput by 25% on average, which is attributed to its dynamic clustering and optimized routing strategies. Furthermore, the network lifetime is extended by approximately 30%, primarily because of enhanced energy efficiency through adaptive clustering and transmission power control.

| S-EPMC11232628 | biostudies-literature

Optimal routing to cerebellum-like structures.

Project description:The vast expansion from mossy fibers to cerebellar granule cells (GrC) produces a neural representation that supports functions including associative and internal model learning. This motif is shared by other cerebellum-like structures and has inspired numerous theoretical models. Less attention has been paid to structures immediately presynaptic to GrC layers, whose architecture can be described as a 'bottleneck' and whose function is not understood. We therefore develop a theory of cerebellum-like structures in conjunction with their afferent pathways that predicts the role of the pontine relay to cerebellum and the glomerular organization of the insect antennal lobe. We highlight a new computational distinction between clustered and distributed neuronal representations that is reflected in the anatomy of these two brain structures. Our theory also reconciles recent observations of correlated GrC activity with theories of nonlinear mixing. More generally, it shows that structured compression followed by random expansion is an efficient architecture for flexible computation.

| S-EPMC10506727 | biostudies-literature

Transport in two-dimensional paper networks.

Project description:Two-dimensional paper networks (2DPNs) hold great potential for transcending the capabilities and performance of today's paper-based analytical devices. Specifically, 2DPNs enable sophisticated multi-step chemical processing sequences for sample pretreatment and analysis at a cost and ease-of-use that make them appropriate for use in settings with low resources. A quantitative understanding of flow in paper networks is essential to realizing the potential of these networks. In this report, we provide a framework for understanding flow in simple 2DPNs using experiments, analytical expressions, and computational simulations.

| S-EPMC3228841 | biostudies-literature

Two-qubit quantum gate and entanglement protected by circulant symmetry.

Project description:We propose a method for the realization of the two-qubit quantum Fourier transform (QFT) using a Hamiltonian which possesses the circulant symmetry. Importantly, the eigenvectors of the circulant matrices are the Fourier modes and do not depend on the magnitude of the Hamiltonian elements as long as the circulant symmetry is preserved. The QFT implementation relies on the adiabatic transition from each of the spin product states to the respective quantum Fourier superposition states. We show that in ion traps one can obtain a Hamiltonian with the circulant symmetry by tuning the spin-spin interaction between the trapped ions. We present numerical results which demonstrate that very high fidelity can be obtained with realistic experimental resources. We also describe how the gate can be accelerated by using a "shortcut-to-adiabaticity" field.

| S-EPMC7081313 | biostudies-literature

Entanglement-Gradient Routing for Quantum Networks.

Project description:We define the entanglement-gradient routing scheme for quantum repeater networks. The routing framework fuses the fundamentals of swarm intelligence and quantum Shannon theory. Swarm intelligence provides nature-inspired solutions for problem solving. Motivated by models of social insect behavior, the routing is performed using parallel threads to determine the shortest path via the entanglement gradient coefficient, which describes the feasibility of the entangled links and paths of the network. The routing metrics are derived from the characteristics of entanglement transmission and relevant measures of entanglement distribution in quantum networks. The method allows a moderate complexity decentralized routing in quantum repeater networks. The results can be applied in experimental quantum networking, future quantum Internet, and long-distance quantum communications.

| S-EPMC5660278 | biostudies-literature

Greedy routing optimisation in hyperbolic networks.

Project description:Finding the optimal embedding of networks into low-dimensional hyperbolic spaces is a challenge that received considerable interest in recent years, with several different approaches proposed in the literature. In general, these methods take advantage of the exponentially growing volume of the hyperbolic space as a function of the radius from the origin, allowing a (roughly) uniform spatial distribution of the nodes even for scale-free small-world networks, where the connection probability between pairs decays with hyperbolic distance. One of the motivations behind hyperbolic embedding is that optimal placement of the nodes in a hyperbolic space is widely thought to enable efficient navigation on top of the network. According to that, one of the measures that can be used to quantify the quality of different embeddings is given by the fraction of successful greedy paths following a simple navigation protocol based on the hyperbolic coordinates. In the present work, we develop an optimisation scheme for this score in the native disk representation of the hyperbolic space. This optimisation algorithm can be either used as an embedding method alone, or it can be applied to improve this score for embeddings obtained from other methods. According to our tests on synthetic and real networks, the proposed optimisation can considerably enhance the success rate of greedy paths in several cases, improving the given embedding from the point of view of navigability.

| S-EPMC10754836 | biostudies-literature

Multicommodity routing optimization for engineering networks.

Project description:Optimizing passengers routes is crucial to design efficient transportation networks. Recent results show that optimal transport provides an efficient alternative to standard optimization methods. However, it is not yet clear if this formalism has empirical validity on engineering networks. We address this issue by considering different response functions-quantities determining the interaction between passengers-in the dynamics implementing the optimal transport formulation. Particularly, we couple passengers' fluxes by taking their sum or the sum of their squares. The first choice naturally reflects edges occupancy in transportation networks, however the second guarantees convergence to an optimal configuration of flows. Both modeling choices are applied to the Paris metro. We measure the extent of traffic bottlenecks and infrastructure resilience to node removal, showing that the two settings are equivalent in the congested transport regime, but different in the branched one. In the latter, the two formulations differ on how fluxes are distributed, with one function favoring routes consolidation, thus potentially being prone to generate traffic overload. Additionally, we compare our method to Dijkstra's algorithm to show its capacity to efficiently recover shortest-path-like graphs. Finally, we observe that optimal transport networks lie in the Pareto front drawn by the energy dissipated by passengers, and the cost to build the infrastructure.

| S-EPMC9076927 | biostudies-literature

Dynamic information routing in complex networks.

Project description:Flexible information routing fundamentally underlies the function of many biological and artificial networks. Yet, how such systems may specifically communicate and dynamically route information is not well understood. Here we identify a generic mechanism to route information on top of collective dynamical reference states in complex networks. Switching between collective dynamics induces flexible reorganization of information sharing and routing patterns, as quantified by delayed mutual information and transfer entropy measures between activities of a network's units. We demonstrate the power of this mechanism specifically for oscillatory dynamics and analyse how individual unit properties, the network topology and external inputs co-act to systematically organize information routing. For multi-scale, modular architectures, we resolve routing patterns at all levels. Interestingly, local interventions within one sub-network may remotely determine nonlocal network-wide communication. These results help understanding and designing information routing patterns across systems where collective dynamics co-occurs with a communication function.

| S-EPMC4832059 | biostudies-literature

Optimal Experimental Design Based on Two-Dimensional Likelihood Profiles.

Project description:Dynamic behavior of biological systems is commonly represented by non-linear models such as ordinary differential equations. A frequently encountered task in such systems is the estimation of model parameters based on measurement of biochemical compounds. Non-linear models require special techniques to estimate the uncertainty of the obtained model parameters and predictions, e.g. by exploiting the concept of the profile likelihood. Model parameters with significant uncertainty associated with their estimates hinder the interpretation of model results. Informing these model parameters by optimal experimental design minimizes the additional amount of data and therefore resources required in experiments. However, existing techniques of experimental design either require prior parameter distributions in Bayesian approaches or do not adequately deal with the non-linearity of the system in frequentist approaches. For identification of optimal experimental designs, we propose a two-dimensional profile likelihood approach, providing a design criterion which meaningfully represents the expected parameter uncertainty after measuring data for a specified experimental condition. The described approach is implemented into the open source toolbox Data2Dynamics in Matlab. The applicability of the method is demonstrated on an established systems biology model. For this demonstration, available data has been censored to simulate a setting in which parameters are not yet well determined. After determining the optimal experimental condition from the censored ones, a realistic evaluation was possible by re-introducing the censored data point corresponding to the optimal experimental condition. This provided a validation that our method is feasible in real-world applications. The approach applies to, but is not limited to, models in systems biology.

| S-EPMC8906444 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data