Guo et al., 2024 - Google Patents
Embedding hierarchical cubic networks into k-rooted complete binary trees for minimum wirelengthGuo et al., 2024
View PDF- Document ID
- 12657241047277949894
- Author
- Guo R
- Wang Y
- Fan J
- Fan W
- Publication year
- Publication venue
- International Journal of Foundations of Computer Science
External Links
Snippet
In recent years, the growth of data has promoted the development of parallel and distributed systems. Graph embedding is of great importance in improving parallel and distributed system performance. The quality of an embedding can be measured by many important …
- 238000004891 communication 0 abstract description 15
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
- G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a programme unit and a register, e.g. for a simultaneous processing of several programmes
- G06F15/163—Interprocessor communication
- G06F15/173—Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star, snowflake
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
- G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
- G06F17/30958—Graphs; Linked lists
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
- G06F17/30386—Retrieval requests
- G06F17/30424—Query processing
- G06F17/30533—Other types of queries
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
- G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
- G06F17/30961—Trees
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
- G06F9/46—Multiprogramming arrangements
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
- G06F15/76—Architectures of general purpose stored programme computers
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/50—Computer-aided design
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Error detection; Error correction; Monitoring responding to the occurence of a fault, e.g. fault tolerance
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N99/00—Subject matter not provided for in other groups of this subclass
- G06N99/005—Learning machines, i.e. computer in which a programme is changed according to experience gained by the machine itself during a complete run
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computer systems based on biological models
- G06N3/12—Computer systems based on biological models using genetic models
- G06N3/126—Genetic algorithms, i.e. information processing using digital simulations of the genetic system
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N5/00—Computer systems utilising knowledge based models
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US8943011B2 (en) | Methods and systems for using map-reduce for large-scale analysis of graph-based data | |
CN114330730B (en) | Quantum circuit block compiling method, device, equipment, storage medium and product | |
Guo et al. | Embedding hierarchical cubic networks into k-rooted complete binary trees for minimum wirelength | |
Fan et al. | Efficient unicast in bijective connection networks with the restricted faulty node set | |
CN111400555B (en) | Graph data query task processing method and device, computer equipment and storage medium | |
Georgiou et al. | Cooperative task-oriented computing: Algorithms and complexity | |
Lai et al. | The two-equal-disjoint path cover problem of matching composition network | |
Arockiaraj et al. | Node set optimization problem for complete Josephus cubes | |
Reji et al. | Embedding Knödel graph into cube-like architectures: dilation optimization and wirelength analysis | |
Zhou et al. | Cycles embedding in exchanged crossed cube | |
Shantrinal et al. | An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength | |
Zhang et al. | An efficient heuristic algorithm for solving connected vertex cover problem | |
Bhuiyan et al. | A parallel algorithm for generating a random graph with a prescribed degree sequence | |
Liu et al. | Characterization of the congestion lemma on layout computation | |
HoseinyFarahabady et al. | The grid-pyramid: A generalized pyramid network | |
Li et al. | Hierarchical dual-net: A flexible interconnection network and its routing algorithm | |
Rushdi et al. | The eigenvectors of the transition matrix as predictors of the dynamics of a synchronous Boolean network | |
Lai et al. | Exploiting and evaluating MapReduce for large-scale graph mining | |
Akl et al. | Introduction to parallel computation | |
Saurabh | Improving the Performance of Moore-Penrose pseudo-inverse for a Graph’s Laplacian Using GPU | |
Hsieh et al. | Cycle embedding on twisted cubes | |
Bass et al. | Hamilton Decompositions and (n/2)-Factorizations of Hypercubes | |
Afiya et al. | Embedding (K 9–C 9) n into 2-CAT and triangular snake graph | |
Lê et al. | A Message-Passing Based Algorithm for k-Terminal Reliability | |
Şener | Generating landmark labels for short distance queries in a distributed setting |