Relevant bibliographies by topics / Topologie en hypercube

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Topologie en hypercube'

Author: Grafiati
Published: 4 June 2021
Last updated: 11 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Topologie en hypercube.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Topologie en hypercube"

1

ZIAVRAS, SOTIRIOS G., and MICHALIS A. SIDERAS. "FACILITATING HIGH-PERFORMANCE IMAGE ANALYSIS ON REDUCED HYPERCUBE (RH) PARALLEL COMPUTERS." International Journal of Pattern Recognition and Artificial Intelligence 09, no. 04 (August 1995): 679–98. http://dx.doi.org/10.1142/s0218001495000262.

Full text
Abstract:
The direct binary hypercube interconnection network has been very popular for the design of parallel computers, because it provides a low diameter and can emulate efficiently the majority of the topologies frequently employed in the development of algorithms. The last fifteen years have seen major efforts to develop image analysis algorithms for hypercube-based parallel computers. The results of these efforts have culminated in a large number of publications included in prestigious scholarly journals and conference proceedings. Nevertheless, the aforementioned powerful properties of the hypercube come at the cost of high VLSI complexity due to the increase in the number of communication ports and channels per PE (processing element) with an increase in the total number of PE’s. The high VLSI complexity of hypercube systems is undoubtedly their dominant drawback; it results in the construction of systems that contain either a large number of primitive PE’s or a small number of powerful PE’s. Therefore, low-dimensional k-ary n-cubes with lower VSLI complexity have recently drawn the attention of many designers of parallel computers. Alternative solutions reduce the hypercube’s VLSI complexity without jeopardizing its performance. Such an effort by Ziavras has resulted in the introduction of reduced hypercubes (RH’s). Taking advantage of existing high-performance routing techniques, such as wormhole routing, an RH is obtained by a uniform reduction in the number of edges for each hypercube node. An RH can also be viewed as several connected copies of the well-known cube-connected-cycles network. The objective here is to prove that parallel computers comprising RH interconnection networks are definitely good choices for all levels of image analysis. Since the exact requirements of high-level image analysis are difficult to identify, but it is believed that versatile interconnection networks, such as the hypercube, are suitable for relevant tasks, we investigate the problem of emulating hypercubes on RH’s. The ring (or linear array), the torus (or mesh), and the binary tree are the most frequently used topologies for the development of algorithms in low-level and intermediate-level image analysis. Thus, to prove the viability of the RH for the two lower levels of image analysis, we introduce techniques for embedding the aforementioned three topologies into RH’s. The results prove the suitability of RH’s for all levels of image analysis.
APA, Harvard, Vancouver, ISO, and other styles
2

Das, Sajal K., Sabine Öhring, and Amit K. Banerjee. "Embeddings into Hyper Petersen Networks: Yet Another Hypercube-Like Interconnection Topology." VLSI Design 2, no. 4 (January 1, 1995): 335–51. http://dx.doi.org/10.1155/1995/95759.

Full text
Abstract:
A new hypercube-like topology, called the hyper Petersen (HP) network, is proposed and analyzed, which is constructed from the well-known cartesian product of the binary hypercube and the Petersen graph of ten nodes.This topology is an attractive candidate for multiprocessor interconnection having such desirable properties as regularity, high symmetry and connectivity, and logarithmic diameter. For example, an n-dimensional hyper Petersen network, HPn, with N=1.25 * 2n nodes is a regular graph of degree and node-connectivity n and diameter n–1 , whereas an (n–1)-dimensional binary hypercube, Qn−1 , with the same diameter covers only 2n−1 nodes, each of degree (n–1). Thus the HP topology accommodates 2.5 times extra nodes than Qn−1 at the cost of increasing the node-degree by one. With the same degree and connectivity of n, the diameter of the HPn network is one less than that of Qn, yet having 1.25 times larger number of nodes.Efficient routing and broadcasting schemes are presented, and node-disjoint paths in HPn, are computed even under faulty conditions. The versatility of the hyper Petersen networks is emphasized by embedding rings, meshes, hypercubes and several tree-related topologies into it. Contrary to the hypercubes, rings of odd lengths, and a complete binary tree of height n–1 permit subgraph embeddings in HPn.
APA, Harvard, Vancouver, ISO, and other styles
3

BOSSARD, ANTOINE. "ON THE DECYCLING PROBLEM IN HIERARCHICAL HYPERCUBES." Journal of Interconnection Networks 14, no. 02 (June 2013): 1350006. http://dx.doi.org/10.1142/s0219265913500060.

Full text
Abstract:
Due to the huge number of CPU nodes involved in modern supercomputers, efficient CPU connection is challenging, and legacy simple network topologies such as hypercubes are no more suitable for physical reasons. The hierarchical hypercube (HHC) has been designed as a topology for interconnection network of massively parallel systems. An HHC is effectively able to link many nodes while retaining a low degree and a small diameter compared to a hypercube of the same size. In this paper, we address a fundamental problem inside an HHC, the decycling problem, which consists of finding a set of nodes as small as possible such that excluding these nodes from the network ensures a cycle-free topology. This problem has many important applications such as lock-free resource allocation and concurrent access. So, we propose in this paper an efficient algorithm finding in an HHC a decycling set of competitively small size.
APA, Harvard, Vancouver, ISO, and other styles
4

PANAGIOTOU, KONSTANTINOS, XAVIER PÉREZ-GIMÉNEZ, THOMAS SAUERWALD, and HE SUN. "Randomized Rumour Spreading: The Effect of the Network Topology." Combinatorics, Probability and Computing 24, no. 2 (May 6, 2014): 457–79. http://dx.doi.org/10.1017/s0963548314000194.

Full text
Abstract:
We consider the popular and well-studied push model, which is used to spread information in a given network with n vertices. Initially, some vertex owns a rumour and passes it to one of its neighbours, which is chosen randomly. In each of the succeeding rounds, every vertex that knows the rumour informs a random neighbour. It has been shown on various network topologies that this algorithm succeeds in spreading the rumour within O(log n) rounds. However, many studies are quite coarse and involve huge constants that do not allow for a direct comparison between different network topologies. In this paper, we analyse the push model on several important families of graphs, and obtain tight runtime estimates. We first show that, for any almost-regular graph on n vertices with small spectral expansion, rumour spreading completes after log2n + log n+o(log n) rounds with high probability. This is the first result that exhibits a general graph class for which rumour spreading is essentially as fast as on complete graphs. Moreover, for the random graph G(n,p) with p=c log n/n, where c > 1, we determine the runtime of rumour spreading to be log2n + γ (c)log n with high probability, where γ(c) = clog(c/(c−1)). In particular, this shows that the assumption of almost regularity in our first result is necessary. Finally, for a hypercube on n=2d vertices, the runtime is with high probability at least (1+β) ⋅ (log2n + log n), where β > 0. This reveals that the push model on hypercubes is slower than on complete graphs, and thus shows that the assumption of small spectral expansion in our first result is also necessary. In addition, our results combined with the upper bound of O(log n) for the hypercube (see [11]) imply that the push model is faster on hypercubes than on a random graph G(n, clog n/n), where c is sufficiently close to 1.
APA, Harvard, Vancouver, ISO, and other styles
5

REHIDA, P., and I. KOMISAROV. "COMPARISON OF PLANNING RESULTS USING BUBBLE SCHEDULING AND ALLOCATION (BSA) ALGORITHM FOR DIFFERENT TOPOLOGIES." HERALD OF KHMELNYTSKYI NATIONAL UNIVERSITY 295, no. 2 (May 2021): 89–96. http://dx.doi.org/10.31891/2307-5732-2021-295-2-89-96.

Full text
Abstract:
In this article, the bubble scheduling and allocation algorithm is considered for different types of topologies: grid, hypercube, de Bruijn topology, extended de Bruijn topology based on ternary code. Static planning algorithms are analyzed; the results are presented in the form of a comparative table on the criteria of complexity, the need to find a critical path, the presence of a table of routing and efficiency. The study of the method of planning calculations is carried out based on the problem of finding the roots of systems of linear and nonlinear equations using Cramer’s and Newton’s methods. The corresponding graphs of tier-parallel form are synthesized for these methods. The principles of synthesis for 4 types of topologies are shown. The synthesis of the grid, hypercube, and de Bruijn graph is considered in the classical form. The synthesis of the extended de Bruijn topology is a synthesis of de Bruijn topology [1, 2] using a ternary code. That is, with the same number of processors, the number of connections increases. Experimental studies of the scheduling of the obtained graphs in the synthesized topologies using the method of bubble scheduling and allocation are conducted; the results of scheduling are presented for these topologies. The best results were shown by extended de Bruijn topology based on ternary code due to the increased degree of units, which is especially noticeable for Newton’s method where there are much more data transfers than in Cramer’s method. The topology of a hypercube and de Bruijn topology demonstrated just about same results but hypercube topology did a little better. In addition to this, having a smaller diameter and cost, the hypercube is the most optimal topology and still used today. However, when constructing fail-safe topological organizations, it is better to use topologies based on ternary code, such as the topology based on the extended de Bruijn graph.
APA, Harvard, Vancouver, ISO, and other styles
6

Sabino, Alan U., Miguel F. S. Vasconcelos, Yuefan Deng, and Alexandre F. Ramos. "Symmetry-guided design of topologies for supercomputer networks." International Journal of Modern Physics C 29, no. 07 (July 2018): 1850048. http://dx.doi.org/10.1142/s0129183118500481.

Full text
Abstract:
A family of graphs optimized as the topologies for interconnection networks is proposed. The needs of such topologies with minimal diameters and minimal mean path lengths are met by special constructions of the weight vectors in a representation of the symplectic algebra. Such design of topologies can conveniently reconstruct the mesh and hypercube, widely used as network topologies, as well as many other classes of graphs potentially suitable for network topologies.
APA, Harvard, Vancouver, ISO, and other styles
7

Alahmadi, Adel, Husain Alhazmi, Shakir Ali, Michel Deza, Mathieu Dutour Sikirić, and Patrick Solé. "Hypercube emulation of interconnection networks topologies." Mathematical Methods in the Applied Sciences 39, no. 16 (January 4, 2016): 4856–65. http://dx.doi.org/10.1002/mma.3820.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Heun, V. "Efficient Embeddings into Hypercube-like Topologies." Computer Journal 46, no. 6 (June 1, 2003): 632–44. http://dx.doi.org/10.1093/comjnl/46.6.632.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Tzeng, Nian-Feng. "Analysis of a variant hypercube topology." ACM SIGARCH Computer Architecture News 18, no. 3b (September 1990): 60–70. http://dx.doi.org/10.1145/255129.255140.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Loutskii, Heorhii, Artem Volokyta, Pavlo Rehida, and Olexandr Goncharenko. "USING EXCESS CODE TO DESIGN FAULT-TOLERANT TOPOLOGIES." TECHNICAL SCIENCES AND TECHNOLOGIES, no. 1 (15) (2019): 134–44. http://dx.doi.org/10.25140/2411-5363-2019-1(15)-134-144.

Full text
Abstract:
and in modernizing an already existing one. Particular attention is paid to it when building multicomputer systems or clusters. The most interesting ways to increase fault tolerance is to use the topological structure of the system to bypass the malfunction and use one or another element of the system to replace the faulty. Of course, this requires the development of a specific topology. The article deals with the development of fault-tolerant versions of popular topologies, such as quasiquantum and hypercube, based on the excess code 0/1 /-1. Target setting. An important part of any multicomputer system or cluster is its topological structure. This structure defines the routing of messages in the system, speed of message transmission, and level of fault-tolerance of a system. The article proposes a method for increasing fault-tolerance based on the use of excess code. Actual scientific researches and issues analysis. Synthesis of topologies such as the hypercube or the de Bruin topology is well studied and described now, there are papers consider methods for increasing the fault-tolerance that based on usage of additional nodes that duplicate current nodes. Other papers consider using a tree-based routing to improve fault-tolerance of the system. Uninvestigated parts of general matters defining. Now the possibilities of using excess code 0/1/-1 for creating new fault-tolerant topologies based on existing synthesis methods are unconsidered. The research objective. The task is to describe the synthesis of fault tolerant topologies, the consideration of the possibilities of using their features and the analysis of the main characteristics in comparison with each other and with classic versions based on binary code. The statement of basic materials. The synthesis of hypercube and de Bruin topology is described on the basis of the usual binary code and the redundant code 0/1 / -1, the possibilities of using redundancy are considered, first of all, to increase the fault-tolerance, a comparative analysis of all of these topologies is carried out. Conclusions. The analysis of characteristics is performed, the main advantages and disadvantages of the proposed topological structures are highlighted, suggestions for their improvement are made.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Topologie en hypercube"

1

Araujo, João Paulo de. "A communication-efficient causal broadcast publish/subscribe system." Electronic Thesis or Diss., Sorbonne université, 2019. http://www.theses.fr/2019SORUS081.

Full text
Abstract:
La Publication/Abonnement (Publish/Subscribe, Pub/Sub) est un paradigme qui permet aux nœuds d'un système distribué de diffuser des informations de manière asynchrone. Cette thèse s'intéresse aux systèmes de Pub/Sub basés sur des sujets (topic-based), en adressant les problèmes de performances et de contention existant dans plusieurs approches reposant sur des arbres. Les solutions proposées utilisent la construction d'arbres couvrants regroupant les abonnés et dont les racines sont les émetteurs. Les arbres associés à différentes sources sont organisés différemment. La première contribution de la thèse propose un protocole de diffusion causal agrégeant des messages et dans lequel aucun temporisateur n'est nécessaire. Le protocole regroupe les messages en un seul message sans utiliser des temporisateurs en tirant parti du délai de livraison supplémentaire imposé à un nœud lorsque les messages sont reçus en dehors de l'ordre causal ainsi que des intersections existantes entre des arbres couvrants. La deuxième contribution est un système de Pub/Sub par sujet, VCube-PS, qui assure l'ordre de traitement causal des messages publiés sur un même sujet et gère efficacement la publication de messages sur des sujets très populaires ("hot topics"). Les résultats des simulations confirment que le protocole d'agrégation causale proposé réduit le trafic réseau ainsi que des latences de livraison, en limitant la contention de messages. Comparé à une approche utilisant un seul arbre par sujet, VCube-PS repartit mieux la charge lors de publications massives sur des "hot topic"
The Publish/Subscribe (Pub/Sub) paradigm enables nodes of a distributed system to disseminate information asynchronously. This thesis investigates how to provide a communication-efficient topic-based Pub/Sub system by addressing the problems of traffic overhead and message contention, present in several tree-based solutions. The proposed contributions build distributed spanning trees on top of a hypercube-like topology, such that the source of each message is the root of its own dynamically built spanning tree. Trees rooted at different nodes are differently organized. Initially, it is proposed a causal broadcast protocol which reduces network traffic by aggregating messages without the use of timers. It exploits the causal relation between messages and path intersections between different trees. Different from existing timer-based approaches, it does not increase delivery latency. The second contribution is a topic-based Pub/Sub system, VCube-PS, which ensures causal delivery order for messages published to the same topic and efficiently supports publication of messages to "hot topics'', i.e., topics with high publication rates. Simulation results confirm that the proposed causal aggregation protocol reduces network traffic as well as delivery latencies since there is less message contention. Compared to an approach that uses one single tree per topic, VCube-PS performs better when there is a high publication rate per topic since it provides load balancing of publication
APA, Harvard, Vancouver, ISO, and other styles
2

Carnes, Tim Alan. "Permutation Routing in the Hypercube and Grid Topologies." Scholarship @ Claremont, 2005. https://scholarship.claremont.edu/hmc_theses/168.

Full text
Abstract:
The problem of edge disjoint path routing arises from applications in distributed memory parallel computing. We examine this problem in both the directed hypercube and two-dimensional grid topologies. Complexity results are obtained for these problems where the routing must consist entirely of shortest length paths. Additionally, approximation algorithms are presented for the case when the routing request is of a special form known as a permutation. Permutations simply require that no vertex in the graph may be used more than once as either a source or target for a routing request. Szymanski conjectured that permutations are always routable in the directed hypercube, and this remains an open problem.
APA, Harvard, Vancouver, ISO, and other styles
3

Khan, Aman Ullah. "Parallel computation of fast Fourier transforms." Thesis, Cardiff University, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.340239.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Beaudou, Laurent. "Autour de problèmes de plongements de graphes." Phd thesis, Université Joseph Fourier (Grenoble), 2009. http://tel.archives-ouvertes.fr/tel-00401226.

Full text
Abstract:
Cette thèse s'articule autour de la notion de plongement de graphe. Un plongement de graphe consiste à envoyer les sommets d'un graphe dans une autre structure par une application qui conserve certaines propriétés à déterminer. Nous pouvons distinguer deux grandes familles de plongements. D'une part les plongements purement combinatoires qui envoient les éléments d'un graphe G dans un autre graphe H. La propriété la plus naturelle à conserver est la notion d'adjacence entre les sommets. Nous nous intéressons à la conservation d'une propriété supplémentaire : la distance entre les sommets. Nous caractérisons plusieurs familles de graphes se plongeant de cette façon dans les hypercubes ou les graphes de Hamming. Les plongements topologiques visent à représenter un graphe G sur une surface quelconque. Les sommets sont envoyés vers des points d'une surface et les arêtes vers des courbes continues entre ces points. Comment représenter un graphe afin de minimiser le nombre de croisements d'arêtes ? Nous nous posons ces questions à travers l'étude de la planarité et des nombres de croisements de certains graphes.
APA, Harvard, Vancouver, ISO, and other styles
5

Woolley, Brian G. "Novelty-Assisted Interactive Evolution of Control Behaviors." Doctoral diss., University of Central Florida, 2012. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/5579.

Full text
Abstract:
The field of evolutionary computation is inspired by the achievements of natural evolution, in which there is no final objective. Yet the pursuit of objectives is ubiquitous in simulated evolution because evolutionary algorithms that can consistently achieve established benchmarks are lauded as successful, thus reinforcing this paradigm. A significant problem is that such objective approaches assume that intermediate stepping stones will increasingly resemble the final objective when in fact they often do not. The consequence is that while solutions may exist, searching for such objectives may not discover them. This problem with objectives is demonstrated through an experiment in this dissertation that compares how images discovered serendipitously during interactive evolution in an online system called Picbreeder cannot be rediscovered when they become the final objective of the very same algorithm that originally evolved them. This negative result demonstrates that pursuing an objective limits evolution by selecting offspring only based on the final objective. Furthermore, even when high fitness is achieved, the experimental results suggest that the resulting solutions are typically brittle, piecewise representations that only perform well by exploiting idiosyncratic features in the target. In response to this problem, the dissertation next highlights the importance of leveraging human insight during search as an alternative to articulating explicit objectives. In particular, a new approach called novelty-assisted interactive evolutionary computation (NA-IEC) combines human intuition with a method called novelty search for the first time to facilitate the serendipitous discovery of agent behaviors. In this approach, the human user directs evolution by selecting what is interesting from the on-screen population of behaviors. However, unlike in typical IEC, the user can then request that the next generation be filled with novel descendants, as opposed to only the direct descendants of typical IEC. The result of such an approach, unconstrained by a priori objectives, is that it traverses key stepping stones that ultimately accumulate meaningful domain knowledge. To establishes this new evolutionary approach based on the serendipitous discovery of key stepping stones during evolution, this dissertation consists of four key contributions: (1) The first contribution establishes the deleterious effects of a priori objectives on evolution. The second (2) introduces the NA-IEC approach as an alternative to traditional objective-based approaches. The third (3) is a proof-of-concept that demonstrates how combining human insight with novelty search finds solutions significantly faster and at lower genomic complexities than fully-automated processes, including pure novelty search, suggesting an important role for human users in the search for solutions. Finally, (4) the NA-IEC approach is applied in a challenge domain wherein leveraging human intuition and domain knowledge accelerates the evolution of solutions for the nontrivial octopus-arm control task. The culmination of these contributions demonstrates the importance of incorporating human insights into simulated evolution as a means to discovering better solutions more rapidly than traditional approaches.
ID: 031001574; System requirements: World Wide Web browser and PDF reader.; Mode of access: World Wide Web.; Adviser: Kenneth O. Stanley.; Title from PDF title page (viewed August 26, 2013).; Thesis (Ph.D.)--University of Central Florida, 2012.; Includes bibliographical references (p. 129-138).
Ph.D.
Doctorate
Electrical Engineering and Computing
Engineering and Computer Science
Computer Engineering
APA, Harvard, Vancouver, ISO, and other styles
6

李稼桐. "Research on Hypercube topology with Zigbee routing technique." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/68550284312576916490.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Lien, Hsiou-Mien, and 連秀婂. "A Study on Generalization of Hypercube Network Topology." Thesis, 1995. http://ndltd.ncl.edu.tw/handle/00032483563392835072.

Full text
Abstract:
博士
國立交通大學
資訊科學學系
83
In this dissertation, we propose three new classes of interconnection network topologies for parallel and distributed processing. The Super Generalized Hypercube is based on the Generalized Hypercube and the Supercube systems. Given the number of nodes N and the desired diameter k, a topology can be constructed. Another class of interconnection networks is to give the construction of a network with small node degree for a given number of nodes N and a given diameter k. The class of networks, denoted by D\sub{R}(k,N), is a new network topology based on regular digraphs (directed graphs). Digraphs can be easily fit into the fiber network because of the unidirectional nature of optical fiber. As well as it is easy to propose a simple routing on D\sub{R}(k,N) networks due to the regularity and cyclical symmetry of the proposed network topology. We also present an optimal broadcasting algorithm in D\sub{R}(k,N) networks. The primary emphasis of the D\sub{R}(k,N) network is on the construction of a regular directed network for arbitrary number of ndoes with a given diameter, while hypercubes are defined only for 2\sup{n}-node systems. Supercube is a generalization of Hypercube topology, which allows arbitrary sizes of systems and maintains some topological properties such as diameter and connectivity of the corresponding hypercube. Hence we consider the architecture on enhancing the system performance of the Supercube network topology. The Folded Supercube is motivated by the Folded Hypercube networks. Like Folded Hypercubes, some extra connections are added to reduce the diameter of a supercube.
APA, Harvard, Vancouver, ISO, and other styles
8

Cheng, Shou-Yi, and 鄭守益. "Varital Hypercube - A New Interconnection Network Topology for Large Scale Multicomputer." Thesis, 1994. http://ndltd.ncl.edu.tw/handle/18522657193972076364.

Full text
Abstract:
碩士
國立交通大學
資訊科學學系
82
This thesis proposes a new interconnection network topology, called varietal hypercube, for large scale multicomputer systems. An n-dimensional varietal hypercube is constructed by two (n-1)-dimensional varietal hypercubes in a way similar to that for the hypercube except for some minor modifications. The resulting network has the same number of nodes and links as the hypercube, and has most of the desirable properties of the hypercube including recursive structure, partionability, strong connectivity, and the ability to embed other architectures such as ring and mesh. The diameter of the n- dimensional varietal hypercube is 2n/3, i.e., about two two third of the diameter of the hypercube. The average distance of the varietal hypercube is also smaller than that of the hypercube. This implies the interprocessor communication will be more efficient than that in hypercube. Optimal routing and broadcasting algorithms which guarantee the shortest path communication in steps are also developed. Comparisons withr other variations of the hypercube, such as twisted cube, folded hypercube, and crossed cube, are also included.
APA, Harvard, Vancouver, ISO, and other styles
9

Yang, Shun-Kuang, and 楊舜光. "A Study of Vertex-Fault-Tolerant Cycles Embedding in Conditionally Faulty Folded Hypercube Network Topologies." Thesis, 2018. http://ndltd.ncl.edu.tw/handle/3g3g97.

Full text
Abstract:
碩士
稻江科技暨管理學院
動畫遊戲設計學系碩士班
106
Design of interconnection networks is an important integral part of the parallel processing or distributed system. Cycles, which are one of the most fundamental networks for parallel and distributed computation, are suitable for designing simple algorithms with low communication costs. Cycles can also be used as control/data flow structures for distributed computation in arbitrary networks. Many efficient algorithms were originally designed based on cycles for solving a variety of algebraic problems, graph problems or some parallel applications. A network is said to be conditionally faulty if its every vertex has at least g fault-free neighbors, where g>=1. In this thesis, we define that a network is g-conditionally faulty if its every vertex has at least g fault-free neighbors. Then, under the 4-conditionally faulty, we consider the fault-tolerant various cycles embedding properties in folded hypercubes FQ_n. Let FF_v denotes the set of faulty vertices in FQ_n. It has been shown the following two properties as that: Property 1: FQ_n-FF_v contains a fault-free cycle of every even length from 4 to 2^n-2|FF_v| if |FF_v|<=2n-5, where n>=3; Property 2: FQ_n-FF_v contains a fault-free cycle of every odd length from n+1 to 2^n-2|FF_v|-1 if |FF_v|<=2n-5, where n>=4 and n is even.
APA, Harvard, Vancouver, ISO, and other styles
10

Chang, Shuo-Feng, and 張碩峰. "1-Vertex-Fault-Tolerant Bipanconnectivity and Panconnectivity of Folded Hypercubes Network Topology." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/50535229809267760987.

Full text
Abstract:
碩士
稻江科技暨管理學院
數位內容設計與管理學系研究所
101
In this thesis, we analysis a hypercube variant structure, the folded hypercube, which is basically a standard hypercube with some extra links between its nodes. Let x and y be any two distinct fault-free vertices, f be a faulty vertex in an n-dimensional folded hypercube . Then, we show the following two results which respective obtain the bipanconnected and the -panconnected properties of , as follows: Property 1(Bipanconnectivity):If , contains a fault-free x-y path of every length l such that and , where denotes the distance between x and y in . Property 2( -panconnectivity):If is even, contains a fault-free x-y path of every length l such that . According to the above two results, we know that the lengths of fault-free paths obtained of are worst case optimal.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Topologie en hypercube"

1

Figueira, Silvia M., and Vijay Janapa Reddi. "Topology-Based Hypercube Structures for Global Communication in Heterogeneous Networks." In Euro-Par 2005 Parallel Processing, 994–1004. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11549468_109.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Duato, José, and M. P. Malumbres. "Optimal topology for distributed shared-memory multiprocessors: Hypercubes again?" In Lecture Notes in Computer Science, 205–12. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61626-8_26.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Roig, Pedro Juan, Salvador Alcaraz, Katja Gilly, and Carlos Juiz. "Modelling a Folded N-Hypercube Topology for Migration in Fog Computing." In Lecture Notes in Electrical Engineering, 519–35. Singapore: Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-33-6987-0_42.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Roig, Pedro Juan, Salvador Alcaraz, Katja Gilly, and Carlos Juiz. "Modelling a Plain N-Hypercube Topology for Migration in Fog Computing." In Lecture Notes in Electrical Engineering, 595–608. Singapore: Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-33-6987-0_47.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Calimeri, Francesco, Aldo Marzullo, Claudio Stamile, and Giorgio Terracina. "Blood Vessel Segmentation in Retinal Fundus Images Using Hypercube NeuroEvolution of Augmenting Topologies (HyperNEAT)." In Quantifying and Processing Biomedical and Behavioral Signals, 173–83. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-95095-2_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Drchal, Jan, and Miroslav Šnorek. "Genetic Programming of Augmenting Topologies for Hypercube-Based Indirect Encoding of Artificial Neural Networks." In Advances in Intelligent Systems and Computing, 63–72. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-32922-7_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Liebeherr, Jörg, and Tyler K. Beam. "HyperCast: A Protocol for Maintaining Multicast Group Members in a Logical Hypercube Topology." In Lecture Notes in Computer Science, 72–89. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/978-3-540-46703-8_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

"Event-Driven Analysis of Hypercube-Like Topology." In Logic Design of NanoICS, 279–324. CRC Press, 2017. http://dx.doi.org/10.1201/9781420038293-14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

"Event-Driven Analysis of Hypercube-Like Topology." In Nano- and Microscience, Engineering, Technology and Medicine, 255–99. CRC Press, 2004. http://dx.doi.org/10.1201/9781420038293.ch8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Glowczewski, Barbara. "A Topological Approach to Australian Cosmology and Social Organisation." In Indigenising Anthropology with Guattari and Deleuze, 202–22. Edinburgh University Press, 2019. http://dx.doi.org/10.3366/edinburgh/9781474450300.003.0007.

Full text
Abstract:
Aboriginal kinship has stimulated many mathematicians. In the 1980’s, Glowczewski showed that there is a non euclidian ‘topologic’ that is common to what Indigenous Australians call their “Law”: a non hierarchical system of classificatory ritual kinship, a projection of the mythical travels of totemic ancestors (the Dreamings) into the landscape and a system of ritual obligations taboos. In other words, the social valorisation of heterogeneity recognises irreducible singularities shared by humans, non humans and the land as a condition for a commons that in no way homogenises society into a hierarchical order. The topological figure of the hypercube was used here to illustrate some complex Aboriginal relational rules that exclude the centralisation of power both in social organisation and in the totemic cosmology. To translate Indigenous spatio-temporal concepts Glowczewski was partly inspired by science fiction, that speculates about the 4th dimension. When shown the hypercube as a tool to account for the kinship logic of their Dreamings, the Warlpiri elders thought it was a ‘good game’! First published in 1989.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Topologie en hypercube"

1

Tzeng, Nian-Feng. "Analysis of a variant hypercube topology." In the 4th international conference. New York, New York, USA: ACM Press, 1990. http://dx.doi.org/10.1145/77726.255140.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Bahi, J., R. Couturier, and F. Vernier. "Broken edges and dimension exchange algorithms on hypercube topology." In Proceedings Eleventh Euromicro Conference on Parallel, Distributed and Network-Based Processing. IEEE, 2003. http://dx.doi.org/10.1109/empdp.2003.1183579.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Rodrigues, Luiz A. "Fault-tolerant broadcast algorithms for the virtual hypercube topology." In 2013 43rd Annual IEEE/IFIP Conference on Dependable Systems and Networks Workshop (DSN-W). IEEE, 2013. http://dx.doi.org/10.1109/dsnw.2013.6615520.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Patel, Jiten, and Seung-Kyum Choi. "Design of Mesostructured Materials Under Uncertainty." In ASME 2008 Conference on Smart Materials, Adaptive Structures and Intelligent Systems. ASMEDC, 2008. http://dx.doi.org/10.1115/smasis2008-590.

Full text
Abstract:
Uncertainties in material properties, geometry, manufacturing processes, and operational environments are clearly critical at all scales (nano-, micro-, meso-, and macro-scale). Specifically, reliabilty analysis in mesostructured materials can be driven by these uncertainties. The concept of mesostructured materials is motivated by the desire to put material only where it is needed for a specific application. This research develops a reliability-based synthesis method to design mesostructures under uncertainty, which have superior structural compliant performance per weight than parts with bulk material or foams. The efficiency of the proposed framework is achieved with the combination of topology optimization and stochastic approximation which utilizes stochastic local regression and Latin Hypercube Sampling. The effectiveness of the proposed framework was demonstrated using a ground structure topology optimization approach.
APA, Harvard, Vancouver, ISO, and other styles
5

Gharib, Mohammed, Zeynab Barzegar, and Jafar Habibi. "A Novel Method for Supporting Locality in Peer-to-Peer Overlays Using Hypercube Topology." In 2010 International Conference on Intelligent Systems, Modelling and Simulation (ISMS). IEEE, 2010. http://dx.doi.org/10.1109/isms.2010.76.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Striki, Maria, Kyriakos Manousakis, and John S. Baras. "New Algorithm for the Design of Topology Aware Hypercube in Multi-hop Ad Hoc Networks." In 2009 Eighth International Conference on Networks. IEEE, 2009. http://dx.doi.org/10.1109/icn.2009.52.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Damaj, Samer, Thierry Goubier, Frederic Blanc, and Bernard Pottier. "A Heuristic (delta, D) Digraph to Interpolate between Hypercube and de Bruijn Topologies for Future On-Chip Interconnection Networks." In 2009 International Conference on Parallel Processing Workshops (ICPPW). IEEE, 2009. http://dx.doi.org/10.1109/icppw.2009.26.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Amiripour, M., and H. Abachi. "Average Routing Distance Analysis and Comparison of Master-Slave Super-Super-Hypercube 4-Cube Topology with different Message Passing Architectures." In 6th IEEE/ACIS International Conference on Computer and Information Science (ICIS 2007). IEEE, 2007. http://dx.doi.org/10.1109/icis.2007.67.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Topologie en hypercube' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography