A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Selection, Routing, and Sorting on the Star Graph
1997
Journal of Parallel and Distributed Computing
Preserved Fulltext
Comments A b s t r a c t We consider the problems of selection, routing and sorting on an n-star graph (with n! ...
We consider the problems of selection, routing and sorting on an n-star graph (with n! nodes), an interconnection network which has been proven to possess many special properties. ...
In this paper we have addressed the problems of selection, sorting and routing on the star graph. ...
doi:10.1006/jpdc.1996.1297
fatcat:okxp4knrnzctplmhxc3tmm6kaq
Selection, routing, and sorting on the star graph
[1993] Proceedings Seventh International Parallel Processing Symposium
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We consider the problems of selection, routing and sorting on an n-star graph (with n! nodes), an interconnection network which has been proven to possess many special properties. ...
The best known previous algorithm for sorting has a run time of O(n 3 lg n) and is deterministic. To our knowledge, the problem of selection has not been considered before on the star graph. * ...
Acknowledgements The authors thank the referees for their careful reading and very helpful comments. ...
doi:10.1109/ipps.1993.262802
dblp:conf/ipps/RajasekaranW93
fatcat:gtgnmxlvhngw3nzcc3i66j5vq4
Sorting and selection on interconnection networks
[chapter]
1995
DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Interconnection Networks of interest include the mesh, the mesh with fixed and reconfigurable buses, the hypercube family, and the star graph. ...
In this paper we identify techniques that have been employed in the design of sorting and selection algorithms for various interconnection networks. ...
The Star Graph The only known selection algorithm on the star graph is due to Rajasekaran and Wei [56] . This randomized algorithm runs in time O(n 2 ) on an n!-node star graph. ...
doi:10.1090/dimacs/021/19
dblp:conf/dimacs/Rajasekaran94
fatcat:gw6blsftargqffge4p5nl3bgnm
Multicast communication in wormhole-routed star graph interconnection networks
2000
Parallel Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
In this paper, we address an efficient and deadlock-free tree-based multicast routing scheme for wormhole-routed star graph networks with hamiltonian path. ...
The star graph interconnection network has been recognized as an attractive alternative to the popular hypercube network. ...
Acknowledgements This work was supported by the National Science Council of Republic of China under Grant #NSC-91-2218-E-324-002. ...
doi:10.1016/s0167-8191(00)00058-2
fatcat:dyt46msnhzbftkdbf6l32dnhua
A Comparative Study of Star Graphs and Rotator Graphs
1994
1994 International Conference on Parallel Processing-Vol 1 (ICPP'94)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Acknowledgements We would like to thank Ramaraghavan Srinivasan for his assistance with the simulation programs and for his comments on an earlier version of this paper. ...
A comparative study of star and hypercube can be found in 7] . Star graph is one of the extensively studied interconnection networks after binary n-cubes. ...
Applications with mesh type of computations on both star graphs and directed Cayley graphs involve some additional cost. ...
doi:10.1109/icpp.1994.18
dblp:conf/icpp/PonnuswamyC94
fatcat:hktb4l5yr5ggpangfpfimo5bri
Embedding Meshes on the Star Graph
1993
Journal of Parallel and Distributed Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We develop algorithms for mapping n-dimensional meshes on a star graph of degree n with expansion 1 and dilation 3. We show that an n-degree star graph can efficiently simulate an n-dimensional mesh. ...
We are considering the problem of sorting on a rectangular mesh under the above conditions and have discovered an algorithm which is useful for sorting on the star graph. ...
Broadcasting can be performed on the star graph in at most 3( n log n -~) unit routes in a star graph Sn.
A star graph is maximally fault tolerant. ...
doi:10.1006/jpdc.1993.1098
fatcat:yor4kejht5ashitdauwxtg4q3q
Routing and Embeddings in Super Cayley Graphs
[chapter]
1999
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
We show that super Cayley graphs can embed trees, meshes, hypercubes, as well as star, bubble-sort graphs, and transposition networks with constant dilation. ...
We also show that algorithms developed for star graphs can be emulated on suitably constructed super Cayley graphs with asymptotically optimal slowdown, under several communication models. ...
Therefore, we can relate routing in the network to sorting boxes and balls in the corresponding game, where the source and destination nodes corresponds to the initial and final configurations, the routing ...
doi:10.1007/3-540-48387-x_16
fatcat:blq6mpodjngptoqvh4h3hjn5mi
A mathematical game and its applications to the design of interconnection networks
2001
International Conference on Parallel Processing, 2001.
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
Based on the insights provided by BAG, we propose several new classes of symmetric and modular networks, called super Cayley graphs, that have optimal (intercluster) diameters and average (intercluster ...
., permissible moves) gives rise to a different network, and the algorithm that solves the game gives rise to a routing algorithm in that network. ...
Therefore, we can relate routing in the network to sorting boxes and balls in the corresponding game, where the source and destination nodes corresponds to the initial and fi nal confi gurations, the routing ...
doi:10.1109/icpp.2001.952043
dblp:conf/icpp/YehV01
fatcat:pxv57c3jxncvxedaqlrawe6zyq
Assessment of the Method of Merging Landing Aircraft Streams in the Context of Fuel Consumption in the Airspace
2021
Sustainability
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
The article aims to assess the method of combining the streams of landing aircraft and estimate the impact of such an organization on the increased fuel consumption of aircraft and thus on air pollution ...
An important area is environmental protection and measures to minimize the negative impact of civil aviation activities on the environment. ...
The "selection sort" algorithm is responsible for sorting the sequence list. ML site implements unordered input list storage for sorting. Get 1st takes the first item in the list and puts it first. ...
doi:10.3390/su132212859
fatcat:weddqys7yfh4lkc2rhqanwqhwm
Provably good routing tree construction with multi-port terminals
1997
Proceedings of the 1997 international symposium on Physical design - ISPD '97
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Previous literature on VLSI routing and wiring estimation typically assumes a one-to-one correspondence between terminals and ports. ...
Our Java implementation i s a v ailable on the World Wide Web. ...
Introduction Previous works on routing often assume a one-to-one correspondence between terminals and ports. ...
doi:10.1145/267665.267697
dblp:conf/ispd/BatemanHRZ97
fatcat:rb4kqekjv5c5bfctcoc6up5ska
Fault Tolerance on Star Graphs
1997
International Journal of Foundations of Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
And the penalty is O(n2) if at most n -2 faults exist. with restriction to the forbidden faulty set. And we 1324 4321 tivity of star graphs when 2n -4 faults exist. ...
And then, 3142 2143 Figure 1: A 4-dimensional star graph, S4. 176 0-8186-7038-X/95 $4.00 8 1995 IEEE ...
The routing algorithm on faulty star graphs is proposed by Bagherradeh et al. [5] , which is based on the greedy routing algorithm combined with depth first search [ 2 , 6 ] . ...
doi:10.1142/s0129054197000112
fatcat:e7umthe7n5b4hgr6xg3jbjfzzq
Oriented Diameter of Star Graphs
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Orientations of S_n, called unidirectional star graphs and distributed routing protocols over them were studied by Day and Tripathi [Information Processing Letters (1993)] and Fujita [The First International ...
The n-star graph S_n consists of n! vertices, each labelled with a distinct permutation of [n]. Two vertices are adjacent if their labels differ exactly in the first and one other position. ...
The proposed routing algorithm There are two different ways in which one can describe and analyse a routing algorithm on a star graph. ...
arXiv:1911.10340v1
fatcat:xq6gmpjfbnazlfwvcy43jzcyoa
Path Planning in Multi-AGVs Using a Modified A-star Algorithm
2020
International journal for innovation education and research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
A collision-free path planning procedure based on a modified A-star Algorithm for multi-AGVs logistics sorting system is proposed in this paper. ...
Many researches have been conducted and new technologies are still being developed. There is wide scale research on algorithms to help in scheduling, routing and path planning. ...
We used the Manhattan Distance (MD) to estimate the cost h(n) on the sorting route. ...
doi:10.31686/ijier.vol8.iss5.2342
fatcat:wrxwn4pdanhodk4xf6n7vfg5ba
Page 3369 of Mathematical Reviews Vol. , Issue 2001E
[page]
2001
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
star graphs. ...
The specific problems we are concerned with are routing, sorting, PRAM emulation, and selection. ...
Page 6798 of Mathematical Reviews Vol. , Issue 2002I
[page]
2002
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
With the help of these lemmas and theorems the authors address the problem of selecting paths for routing in order to provide a bandwidth allocation that is as fair as possible. ...
The fundamental result of De Marco et al. characterises the routing paths by two Steiner trees of the network, one Steiner tree on the nodes S U{r} and the other Steiner tree on the nodes {r}UD for some ...
« Previous
Showing results 1 — 15 out of 12,828 results